{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::to_printable_error (cyclomatic 885): flow_typing_errors::intermediate_error::to_printable_error has cyclomatic complexity 885 (threshold 15). Of this number, 840 points are the body\u0027s own statements and 45 belong to 6 function items inside it that branch. 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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"716fb911f04ae3ef94a03c4d06cefb673ad7f078aa96390490b4d93473096ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::dispatch::__flow_impl (cyclomatic 693): flow_typing_flow_js::flow_js::dispatch::__flow_impl has cyclomatic complexity 693 (threshold 15). Of this number, 692 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0b34e673993b11721a3cefd7b790535f564c354e0fdd239b166e601d9d2ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_debug::dump_error_message (cyclomatic 378): flow_typing_debug::dump_error_message has cyclomatic complexity 378 (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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae65521c4d39714f5153dc1de15e2a354df60de1a952aa7e2ac0aacc3bc4687b"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::friendly_message_of_msg (cyclomatic 334): ErrorMessage::friendly_message_of_msg has cyclomatic complexity 334 (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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":9925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b616341c326254621fe92aaf8867e5c443fcfc6e2ef37b7373f0421baec1c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::map_loc_of_error_message (cyclomatic 325): ErrorMessage::map_loc_of_error_message has cyclomatic complexity 325 (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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad45e61be4aab2b0e92dd7e05d526b3389f1d4c1c878366459f34f9488ffb4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"flowDefToTSDef.getTransforms (cyclomatic 320): flowDefToTSDef.getTransforms has cyclomatic complexity 320 (threshold 15). Of this number, 240 points are the body\u0027s own statements and 80 belong to 21 function items inside it that branch. 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb610466df864451ad2a541351d39f15c7da1f780f57c5f39005487a6915967"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::rec_sub_t (cyclomatic 315): flow_typing_flow_js::subtyping_kit::rec_sub_t has cyclomatic complexity 315 (threshold 15). Of this number, 313 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a9628f761d8b3b68cb68504462eef680e2624d719cd723b7a8912eadb410eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::error_code_of_message (cyclomatic 250): ErrorMessage::error_code_of_message has cyclomatic complexity 250 (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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":13031}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4025431dca0e149b6c8d990cf67d0434ec94b6b1281177427a15df50bdb3a77"}},{"ruleId":"D1","level":"warning","message":{"text":"TSDefToFlowDef.getTransforms (cyclomatic 225): TSDefToFlowDef.getTransforms has cyclomatic complexity 225 (threshold 15). Of this number, 214 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. 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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a4b612321cfd3ef623ba2c464f7b83b886e3e2b0fdacc05a330103c5af0cde"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::flow_lexer::token_base_inner (cyclomatic 217): flow_parser::flow_lexer::token_base_inner has cyclomatic complexity 217 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::flow_lexer::decode_html_entity (cyclomatic 254) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9b0318babe7a5372ffd13f078abada98e29dfecfb6cdc50cd152c172165754"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_inner (cyclomatic 199): flow_typing_statement::type_annotation::convert_inner has cyclomatic complexity 199 (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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6c2bd12629c69c53f78386a55feb13eb2e24cda8d934e9e0709f9be3febc80"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::annotation_inference::elab_t_concrete (cyclomatic 196): flow_typing_utils::annotation_inference::elab_t_concrete has cyclomatic complexity 196 (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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"08440f528dd48a8c2005267f532c5a30d0e0a4bd9b331a6c4ec9fbc4bb43a75c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseError::fmt (cyclomatic 193): ParseError::fmt has cyclomatic complexity 193 (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":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab89202e1b6a3dd88c8cdfe4d7d5b618112b3e5158d6c96b8f203a020386a2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::statement_ (cyclomatic 183): flow_typing_statement::statement::statement_ has cyclomatic complexity 183 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f56498891cc460223895df07db5dbfd7f052d5d87676d1c6c9660aca5ee87"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenKind::to_value (cyclomatic 155): TokenKind::to_value has cyclomatic complexity 155 (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":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee023c8756aba6691cf722091a5d2f69676ef9630210bc1176680fb53a79859"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::mk_class_sig (cyclomatic 144): flow_typing_statement::statement::mk_class_sig has cyclomatic complexity 144 (threshold 15). Of this number, 121 points are the body\u0027s own statements and 23 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15438}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f23997fe4b73db06152242b3550f3c32717ad849e2f6e0bba83aefd259b728"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::expression_ (cyclomatic 136): flow_typing_statement::statement::expression_ has cyclomatic complexity 136 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c52cd063f6271575eef36e53b2cf3ce6884e22e56521be8193a01b4e1a0f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl (cyclomatic 130): flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl has cyclomatic complexity 130 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (flow_typing_errors::intermediate_error::make_intermediate_error) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cabd0811372ec15dbdeb634fb181092356bbb282e9e40a3c6e9e62373fecba"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::convert_type_to_type_desc (cyclomatic 118): ErrorMessage::convert_type_to_type_desc has cyclomatic complexity 118 (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. This shape REPEATS in the file: one other method here (ErrorMessage::convert_type_to_type_desc::map_use_op) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":7021}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4e594b10a0dd39e94a5f5002ad4a61dd070e46862deda4ad9894a19f352133"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_structural (cyclomatic 118): Walker::walk_structural has cyclomatic complexity 118 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"43762b492b2c2d7e2bf199d76ab00dc187e7020b27baf373f6f74f7508fb22c2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::depends (cyclomatic 116): flow_env_builder_resolver::name_def_ordering::depends has cyclomatic complexity 116 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 90 belong to 23 function items inside it that branch. 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a457ce38255810815eff42d9d6dc8cdb4a61e6dba21becbb43aa89ab63bd49"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_debug::dump_use_t_ (cyclomatic 112): flow_typing_debug::dump_use_t_ has cyclomatic complexity 112 (threshold 15). Of this number, 110 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc5ce4e6de7136958a2fee88d53075ab846497824f4c888521863961cd0b027"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_annot (cyclomatic 108): flow_typing_utils::type_sig_merge::merge_annot has cyclomatic complexity 108 (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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e639c69fcf49bf60b47e60ed31a8734d07566003c0df3d9fac5c73d0d0b535"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::code_action_service::ast_transforms_of_error (cyclomatic 106): flow_services_code_action::code_action_service::ast_transforms_of_error has cyclomatic complexity 106 (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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fefc050b6242e8252bb4c96b9c479eb57da07b11ac5ce36ef38a3a053373b1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot (cyclomatic 106): flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot has cyclomatic complexity 106 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b740c921b2b41ea6cb2b23c13ace9f241002d88b5874948d71f0bf0a36f5091"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp::lsp_mapper::default_mapper (cyclomatic 99): flow_lsp::lsp_mapper::default_mapper has cyclomatic complexity 99 (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":"rust_port/crates/flow_lsp/src/lsp_mapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddff153d0d38ae574e42e48bd9b8cb8d267ff25d95480cee689f35941f9b439b"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::statement_list (cyclomatic 96): DefFinder::statement_list has cyclomatic complexity 96 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 14 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"0970ca7c30bb3801cda70db3fd1e306fc175f0a94520a98e33f9c5a8a734557e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::estree_translator::statement (cyclomatic 95): flow_parser::estree_translator::statement has cyclomatic complexity 95 (threshold 15). Of this number, 86 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"577866cc710f777259e6e0168f32eb59d4e4bec55d8fbc6a1cfe9ff2991cef3f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::add_interface_properties (cyclomatic 93): flow_typing_statement::type_annotation::add_interface_properties has cyclomatic complexity 93 (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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2586ca8e710567510e74cdda3557300b0ecabbf48662a8cf2e608d980fd1dc88"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::optional_chain (cyclomatic 89): flow_typing_statement::statement::optional_chain has cyclomatic complexity 89 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 16 belong to 5 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be13102e38ee54d8784436ea970904c5d73672bb0425835411fee016875e94c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common::reason::code_desc_of_expression (cyclomatic 88): flow_common::reason::code_desc_of_expression has cyclomatic complexity 88 (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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334ab3f507df74e12479ab174be6e5020db032d2a04d8506982cab0dc61fe96"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_debug::dump_t_ (cyclomatic 87): flow_typing_debug::dump_t_ has cyclomatic complexity 87 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4f52c375b02cf934e4cbce933d6677037d8862af960efe6c644d2a4ff8c7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::module_info_analyzer::visit_toplevel_statement (cyclomatic 84): flow_typing_statement::module_info_analyzer::visit_toplevel_statement has cyclomatic complexity 84 (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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b84fe36703081e42506219e02a0b6fcb355a99a1c3d08313bc39efe1742c5c7"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransforms::GenericTypeAnnotation (cyclomatic 81): getTransforms::GenericTypeAnnotation has cyclomatic complexity 81 (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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"79633135a6683c8a72fdfa96e1f56e651f4307ad856eaef3cd2cf696183ec19d"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTInner::eq (cyclomatic 77): UseTInner::eq has cyclomatic complexity 77 (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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"070de685967ec40bcf320c95689d8ed7b9967a27c8406f0bc53718bb4429bbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::members::merge_type (cyclomatic 74): flow_typing_utils::members::merge_type has cyclomatic complexity 74 (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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"187790be54d7ea2811dc4666934762d1f8962c519eeccc21be0add0468925742"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::loc_of_msg (cyclomatic 73): ErrorMessage::loc_of_msg has cyclomatic complexity 73 (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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":8938}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c0d40b6aeba984b88a7fc4a9e41701ecad4135574975f9ac493a1ab267c215"}},{"ruleId":"D1","level":"warning","message":{"text":"Annot::iter (cyclomatic 72): Annot::iter has cyclomatic complexity 72 (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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"705406b126d34f38b34949fd98514a8b94c279da5e25059c0c665fa98f4413e7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::expression (cyclomatic 71): flow_type_sig::type_sig_parse::expression has cyclomatic complexity 71 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9668bcfcc2aaedaa71b7652184e3a591d7b4767d7704a6743517c21744944caf"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::default_resolve::default_resolve_touts (cyclomatic 70): flow_typing_flow_js::default_resolve::default_resolve_touts has cyclomatic complexity 70 (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":"rust_port/crates/flow_typing_flow_js/src/default_resolve.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1c5c03a23e456a4e2665ca3636b3975e53f6df2d2bad4a2da55799580c8089"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::statement (cyclomatic 68): flow_type_sig::type_sig_parse::statement has cyclomatic complexity 68 (threshold 15). Of this number, 67 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14848}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc1f10b2ae172a81d5698029f80b0622ee06efe72f2f2a4723580e0b4601435"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::intersect_type_guard (cyclomatic 68): flow_typing_utils::predicate_kit::intersect_type_guard has cyclomatic complexity 68 (threshold 15). Most of this is not in the body itself: 8 of the 68 points are its own statements and the rest belongs to 16 function items inside it that branch (try_intersect_related, intersect_guard_members, try_intersect, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d0e2f7a811a21a58eb9b4ec60c9eb9c5f4d6c77eec847a423e992744bdf9e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::type_ctor (cyclomatic 67): flow_typing_ty_normalizer::normalizer::type_converter::type_ctor has cyclomatic complexity 67 (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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f25f3b184c0d2e1c9898b3bfe7d492ed4cd66d071180aeafa799e477213c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::maybe_special_unqualified_generic (cyclomatic 66): flow_type_sig::type_sig_parse::maybe_special_unqualified_generic has cyclomatic complexity 66 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9366}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f7857f084d990d5961cf3a232f61fcf71ea1401752eb3196e547d8957e65e8"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::class_def (cyclomatic 66): flow_type_sig::type_sig_parse::class_def has cyclomatic complexity 66 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11788}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51294ca10714acbe9714d810762f60268b295b3347bab3c0b73f51d82b0f00d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::check_polarity::check_polarity_impl (cyclomatic 66): flow_typing_utils::check_polarity::check_polarity_impl has cyclomatic complexity 66 (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":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f18d10b9bd8f9680692302e576df9185a5e7970571c722da6ad1623a41ac771"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::expression (cyclomatic 65): Writer::expression has cyclomatic complexity 65 (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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/expressions.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4ff2a5c7d472c10511d29c677688e227af875ca4d441b77dd05a0c55d5fd1d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::expression (cyclomatic 64): flow_parser_utils_output::js_layout_generator::expression has cyclomatic complexity 64 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f344b399b1fa879c0003976e6248d452a55a28a9106140d2facdca287756d0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_initialized_unsafe (cyclomatic 62): flow_lsp_server::flow_lsp::main_handle_initialized_unsafe has cyclomatic complexity 62 (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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"276bf65979c51aa52626f40fd00020d446c6bc473dc528b423391c319eed644c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::estree_translator::expression (cyclomatic 61): flow_parser::estree_translator::expression has cyclomatic complexity 61 (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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aac2ca70a45009f141fa7a2a7d396ad9b9d0db336493d6198a37d0fe684026"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::export_declaration::parse (cyclomatic 61): flow_parser::statement_parser::export_declaration::parse has cyclomatic complexity 61 (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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e0429a9832f33e400fdd7b0590e4d86a1462cf1138d705ee20e8a97c576bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::t_of_use_t (cyclomatic 61): flow_typing_flow_js::implicit_instantiation::t_of_use_t has cyclomatic complexity 61 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f883aa84e6b957f58021bce6d48910b57d68354efe9ed20c3835358b298a88ec"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::flow_obj_to_obj (cyclomatic 60): flow_typing_flow_js::subtyping_kit::flow_obj_to_obj has cyclomatic complexity 60 (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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce282477f27c5d847ba2bb538772288ba36aecb2f889adaddbe37e69a49d3ba"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::eval_helpers::eval_destructor (cyclomatic 59): flow_typing_flow_js::flow_js::eval_helpers::eval_destructor has cyclomatic complexity 59 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a863585c735f5f63d8f7b72fa335ab500eaba37f86d5a885877e353db8d9f305"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_binding (cyclomatic 58): flow_typing::env_resolution::resolve_binding has cyclomatic complexity 58 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"36090c2ca458b2b30a31264c279b263a843086af7449f6d49620e74cfb5f55ad"}},{"ruleId":"D1","level":"warning","message":{"text":"run_swebench.main (cyclomatic 58): run_swebench.main has cyclomatic complexity 58 (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":"evals/run_swebench.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81bde1dff598ae3b49144b6230f58375a46d461d924585fffd9feedb18fa824"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_def (cyclomatic 57): Walker::walk_def has cyclomatic complexity 57 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6115dc619fdb78a07dd946a2e0c4c0de110cdba327cbe2bcacdeea6b23021"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::make_intermediate_error (cyclomatic 56): flow_typing_errors::intermediate_error::make_intermediate_error has cyclomatic complexity 56 (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. This shape REPEATS in the file: one other method here (flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eb83fe152955d517db203edf2f4ac848c3f99c1bb2cce2514d2ab0fdb8ddc6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::type_default (cyclomatic 56): flow_typing_visitors::type_mapper::type_default has cyclomatic complexity 56 (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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec6861dce34cd61d2278e1451ef0625169def5af1515bef6181ceefe7f4236e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::statement (cyclomatic 55): flow_parser_utils_output::js_layout_generator::statement has cyclomatic complexity 55 (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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c0001b115deb9152348a0e1e6dc22076e743da75514408d5e39fc24fe080b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::handle_generic (cyclomatic 54): flow_typing_flow_js::flow_js::helpers::handle_generic 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7e682c3f092622652efdfb459b45ed503e2973796f15cabce3f8bab70e3f02"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::visit_match_pattern (cyclomatic 53): NameResolver::visit_match_pattern has cyclomatic complexity 53 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7d8cc1a994f2e358da9cc6c8aff0baa3197d539800bb487a8bea88dd1db0b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_hint::type_of_hint_decomposition (cyclomatic 53): flow_typing_utils::type_hint::type_of_hint_decomposition has cyclomatic complexity 53 (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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ed51030b4511b79146e96fc1a338cf8491e433fa1be06828b13c36b4d54e28"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::import_declaration (cyclomatic 51): flow_parser::statement_parser::import_declaration has cyclomatic complexity 51 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 30 belong to 10 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cec42cc375e6b66abb7f17d39504a5292a46740cf8f918d76a7585ef5ecdc1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::check_conditional (cyclomatic 51): flow_typing::merge::check_conditional has cyclomatic complexity 51 (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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b689214dff67d5d9520047e9df0ba5fdf9be0379d21780eaa047adf3af3529f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_to_union (cyclomatic 51): Walker::walk_to_union has cyclomatic complexity 51 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b61efa1534e4b1c31ba8b48b47d71d5c71bbf774b71a1e480e31fb4f1830783"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_type::type_util::mod_loc_of_virtual_use_op::mod_loc_of_root_use_op (cyclomatic 51): flow_typing_type::type_util::mod_loc_of_virtual_use_op::mod_loc_of_root_use_op has cyclomatic complexity 51 (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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ba6722afab03f5272c63d8b9149c8fb515afda6c0c2bb57aefa9f0a0952b87"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::instanceof_test (cyclomatic 51): flow_typing_utils::predicate_kit::instanceof_test has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ff248e11e924953aaffcc50ab095a56c1e04d659e5bfe158f7d6028613f638"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_ty::ty_printer::type_impl (cyclomatic 50): flow_common_ty::ty_printer::type_impl has cyclomatic complexity 50 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe7522044dfda6ae1affa259c6b5770257eaec35ea4f920419f523e75ecfb83"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::ast_utils::acceptable_statement_in_declaration_context (cyclomatic 50): flow_parser::ast_utils::acceptable_statement_in_declaration_context has cyclomatic complexity 50 (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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b0d910cc47618491b4f78f45271af8265d746bd0b5ddeb70b8356983c0fff5"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::unification_helpers::__unify_inner (cyclomatic 50): flow_typing_flow_js::flow_js::unification_helpers::__unify_inner has cyclomatic complexity 50 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c4e96dca281da226b5cdd1f677164400f68ad24bb2be35c4c4cb4f2e9b261f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::class_element (cyclomatic 49): flow_parser::object_parser::class_element has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (flow_parser::object_parser::class_element::accessor, flow_parser::object_parser::class_element::init) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d98f26cd8a1141319f4377ce1280bfd060cef5d6626dfe78d803cb9b1c0ac"}},{"ruleId":"D1","level":"warning","message":{"text":"StripFlowTypes.transformProgram (cyclomatic 49): StripFlowTypes.transformProgram has cyclomatic complexity 49 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"94429ed361cdc6f6423fd7f6ba87d6e8e7927a2443b6be3b8e2bba7b5de2a438"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_to_eval (cyclomatic 48): Walker::walk_to_eval has cyclomatic complexity 48 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26d89b4a2570c4ca66f6043537c5ababa4e6e5c36fa016ac942073e72690021"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::mk_func_sig (cyclomatic 48): flow_typing_statement::statement::mk_func_sig has cyclomatic complexity 48 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 17 belong to 5 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":20245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0530b0a831096d7bea2d77901456ecd5731023417331f02f475342cdfef2d407"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::declare_class_props (cyclomatic 47): flow_type_sig::type_sig_parse::declare_class_props has cyclomatic complexity 47 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 29 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba7af348e188f6dbfaf9964d73f52f79b0dff37c2f428fa547b243adeabaccc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::members::extract_type (cyclomatic 47): flow_typing_utils::members::extract_type has cyclomatic complexity 47 (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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f74e59a574c52ad3c4098324d8fc5f06fdedab091e12cf9301277e6b3feb85"}},{"ruleId":"D1","level":"warning","message":{"text":"transformProgram::transform (cyclomatic 47): transformProgram::transform has cyclomatic complexity 47 (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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeeace16909f40c3bdc7aa36ed6af0b6e81f6595a71799704d6bc618c40bf8a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::annot_with_loc (cyclomatic 46): flow_type_sig::type_sig_parse::annot_with_loc has cyclomatic complexity 46 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":7208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d101966900f411051e0b5bd87e506b821a653b9bb3eb2e2e7e9aa7ced01fb893"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::try_eval_concrete_type_truthyness (cyclomatic 46): flow_typing::merge::try_eval_concrete_type_truthyness has cyclomatic complexity 46 (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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"261803e19c433f4cc81241f1454c98110c1dc447292deaf8d84cf68db48403f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Substituter::type_ (cyclomatic 46): Substituter::type_ has cyclomatic complexity 46 (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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa9443560f89ac9689147d34313eeb37c9c0ecec4b10dc72b32584f77b68f7b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_type::type_util::ground_subtype (cyclomatic 46): flow_typing_type::type_util::ground_subtype has cyclomatic complexity 46 (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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea82d69ed61a38a6e927b39d0fa1320c807d3dc6c0bccc557d7cdb3325c3b3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoveNode.getRemovalParent (cyclomatic 46): RemoveNode.getRemovalParent has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 90, 100, 270). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/mutations/RemoveNode.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"69384a3debfce6f7a7c4d0578473edf0731dea05f8e71f0d9436a05ee50f3d13"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_ty::ty_debug::dump_t (cyclomatic 45): flow_common_ty::ty_debug::dump_t has cyclomatic complexity 45 (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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1723f2cce5620659bda634fca0d06d0eb565d07b5e07ec631229ce10b0749f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::class_element::init (cyclomatic 45): flow_parser::object_parser::class_element::init has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (flow_parser::object_parser::class_element, flow_parser::object_parser::class_element::accessor) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dc91e0acb69e42c71b654fe78c4fd9f5f00316f539e9c9ff6d148b13af7bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::statement (cyclomatic 45): Writer::statement has cyclomatic complexity 45 (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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"244086253b2cfacd8f040d2803037ef0002dfbcf3f14733b3a90f0968b48154b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::object_kit::run_with_env (cyclomatic 44): flow_typing_flow_js::object_kit::run_with_env has cyclomatic complexity 44 (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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecc5c255e2c23f44ef87ba112d5c737f2de1d0ab7919ea5accee6eba72e492b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_object (cyclomatic 44): flow_typing_statement::type_annotation::convert_object has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (flow_typing_statement::type_annotation::convert_object::named_property) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4401}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3a860a03428abd81cb4d88aeaa07b0c5ac75800145ff8dfcfc2b9434cedc9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::destructor_default (cyclomatic 44): flow_typing_visitors::type_mapper::destructor_default has cyclomatic complexity 44 (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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feca2d33db96ebf725969146047c4fe901a32c8a3597a69a983e5b41df1a5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::friendly::message_group_of_error::loop_ (cyclomatic 43): flow_common_errors::error_utils::friendly::message_group_of_error::loop_ has cyclomatic complexity 43 (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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c56fe0cade73292740e56b2d3b98e7276ccf4e51ff12951c01722f2bc029c9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::declare_export_declaration_body (cyclomatic 43): flow_parser::statement_parser::declare_export_declaration_body has cyclomatic complexity 43 (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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28c7bb4791957a2952a284e420043ede448bf6518b4e85d994221b77e2de7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::object_type (cyclomatic 43): flow_type_sig::type_sig_parse::object_type has cyclomatic complexity 43 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 22 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf90bf244f5990860627de15efa0e94d922378c734c0d59625d772716e7452b8"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_env::predicate_of_refinement::pred (cyclomatic 43): flow_typing_utils::type_env::predicate_of_refinement::pred has cyclomatic complexity 43 (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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ddd14487b01b732030d67e81bee5fe631d7be028059b412aa5281929f3100c"}},{"ruleId":"D1","level":"warning","message":{"text":"eliminateAbstractComponent.eliminateAbstractComponent (cyclomatic 43): eliminateAbstractComponent.eliminateAbstractComponent has cyclomatic complexity 43 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce84531778eab1bf0d0b9deff626eb2839ebc4f9bfcda3e48cb92d7ea10c1ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::compare_printable_error (cyclomatic 42): flow_common_errors::error_utils::compare_printable_error has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 10 of the 42 points are its own statements and the rest belongs to 7 function items inside it that branch (compare_friendly_message, order_of_kind, compare_lists, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8ce9e95f1dc8ebf67ab72535fd03dd455130581d9bdc0032205a01efef4f84"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_server_command_handler::command_handler::get_persistent_handler (cyclomatic 42): flow_server_command_handler::command_handler::get_persistent_handler has cyclomatic complexity 42 (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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadd8774d5766949779fe476604ec9f156418b35f9f094e17ef5256491cecced"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::name_def::expression_is_definitely_synthesizable::synthesizable (cyclomatic 41): flow_env_builder::name_def::expression_is_definitely_synthesizable::synthesizable has cyclomatic complexity 41 (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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb8f0c9925f43aea916d58c21f7dea22fbf93c3e18085912b5fe034472761d4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::object_type::property (cyclomatic 41): flow_parser::type_parser::object_type::property has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec354f505bffc4cfb9dfc0bba42c9fc9f927a09343a6703563bdcfe3e849acf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_from_eval (cyclomatic 41): Walker::walk_from_eval has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8f39ee202bae3df8729b27672ea21de66b1cef4c3f0605e26ba895e97b3c78"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::exhaustive::filter_object_by_pattern (cyclomatic 41): flow_typing_utils::exhaustive::filter_object_by_pattern has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"1363280c6d3dd7e09568c94b5aab7224f3a6bcd8755ba934847c252a4318b6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::name_def::collect_declared_namespace_members::collect_one (cyclomatic 40): flow_env_builder::name_def::collect_declared_namespace_members::collect_one 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6567814d41c8d5cfdb275e9aace809b55e139b784cd4ecec0181fc52b740cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::ty_members::members_of_ty (cyclomatic 40): flow_typing::ty_members::members_of_ty has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 6 of the 40 points are its own statements and the rest belongs to 8 function items inside it that branch (union_of_members, members_of_union, intersection_of_members, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43625c05891d02f8bc05cc2bf4f08010dc1644741a08918d0099cbbc508b3b7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::type_inference::stmt_validator (cyclomatic 40): flow_typing::type_inference::stmt_validator has cyclomatic complexity 40 (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":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9acb2d0cb885773b0e2727cd625fbab034cfc803cd94ae8ca4423a8c50db7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common::reason::code_desc_of_operation (cyclomatic 39): flow_common::reason::code_desc_of_operation has cyclomatic complexity 39 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_common::reason::string_of_desc (cyclomatic 62) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b69c3d93a946c7339c40a562955b095af43be184c4d1b8e3cfa91116930545f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::primary (cyclomatic 39): flow_parser::type_parser::primary has cyclomatic complexity 39 (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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0d21bf76a2dc72897db8f197cd92ebedf8ddd18e60c78fba92d925c77c11bf"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::type_inference::scan_for_lint_suppressions (cyclomatic 39): flow_typing::type_inference::scan_for_lint_suppressions has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 2 of the 39 points are its own statements and the rest belongs to 12 function items inside it that branch (process_comment, update_pos, parse_keyword::prefix_length, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf88e912cbcf8e021835ca14ad386dc3f9f94a7c3ef0e932df8812a0383f594"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::primary_reason_of_use_op (cyclomatic 39): flow_typing_flow_common::flow_js_utils::primary_reason_of_use_op has cyclomatic complexity 39 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d671978d4dd29eb06b3cfdfca0f868cd6cb842f30a84da100aeb831fe87598"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::resolve_with_env (cyclomatic 39): flow_typing_flow_js::slice_utils::resolve_with_env has cyclomatic complexity 39 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb6a3f4f1a11e67423ca873508ae72651f5554143da058f391467c8e022b0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::convert_types::json_of_destructor (cyclomatic 39): flow_typing_utils::convert_types::json_of_destructor has cyclomatic complexity 39 (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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5c96943634a072b05a2711434b4403e8d00d2710c3b9d37075edca0b524f6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_expression (cyclomatic 38): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_expression has cyclomatic complexity 38 (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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cdce70002ecda704620b01fe81479b9cdecfa636c7aab025520af4deaafd83"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references (cyclomatic 37): flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references has cyclomatic complexity 37 (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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acf3935a70a0a5774d25208e60bd1c48ce9ea83a9fa51cda550b53c1665f92b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::env_api::show_refinement_kind_without_locs (cyclomatic 37): flow_env_builder::env_api::show_refinement_kind_without_locs has cyclomatic complexity 37 (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":"rust_port/crates/flow_env_builder/src/env_api.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16cfa920e4fc3cea8a5ef00aaf5ee752f68dd934d47cd2d27d9ea2d4dd3c5f7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::spread2 (cyclomatic 37): flow_typing_flow_js::slice_utils::spread2 has cyclomatic complexity 37 (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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0677eeed4c7029e08a940253c3acbb3741f62bd386aa8b3b46df084b56b4baad"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::map_object (cyclomatic 37): flow_typing_flow_js::slice_utils::map_object has cyclomatic complexity 37 (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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a55c2996e3253b55597b36293e0a107d11bd2b997983d8575808d95f57cd7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::expand_members::type__ (cyclomatic 37): flow_typing_ty_normalizer::normalizer::expand_members::type__ has cyclomatic complexity 37 (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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb6aeaa45760b5df8eee4bfa6a50624262935f2a2a8fc61b5b22274aae2d54a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp::lsp_fmt::parse_lsp_request (cyclomatic 36): flow_lsp::lsp_fmt::parse_lsp_request has cyclomatic complexity 36 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_lsp::lsp_fmt::result_name_to_string (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"215d83fe1e03cbff12a226cfeeeed30ea9d94b7c4385d8e4179e7bbc57ceec41"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::assignment (cyclomatic 36): flow_type_sig::type_sig_parse::assignment has cyclomatic complexity 36 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 20 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41535a6be31e3a723196b9f3d65da2943a8e809fdf6948a379209489f71b035"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::func_sig::toplevels (cyclomatic 36): flow_typing_statement::func_sig::toplevels has cyclomatic complexity 36 (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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"364cc27c6a03b54e1d595ff5551bdd51571f3242172d778ce0fbc4a3d4c4aa1b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::exhaustive::value_union_builder::of_type_inner (cyclomatic 36): flow_typing_utils::exhaustive::value_union_builder::of_type_inner has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2934c9c220a95c1a0798ff75986645c80e1d8b1812ae8ea13d2c25f8c568a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::main_parser::check_for_duplicate_exports (cyclomatic 35): flow_parser::main_parser::check_for_duplicate_exports has cyclomatic complexity 35 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6242ec6640629f4732ee847ca2fab4beaa8cec1271397aaea7e9a700a642d0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_export::fuzzy_path::score_match::do_fuzzy_score (cyclomatic 35): flow_services_export::fuzzy_path::score_match::do_fuzzy_score has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_export/src/fuzzy_path/score_match.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"028271852f7054ac980739972106f0c58aa026c2f3fb07f538be8bae87463b08"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::detect_sketchy_null_checks::make_checks (cyclomatic 35): flow_typing::merge::detect_sketchy_null_checks::make_checks has cyclomatic complexity 35 (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. This shape REPEATS in the file: one other method here (flow_typing::merge::detect_sketchy_null_checks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43807be71bceed2864f0979e564cca03241dcbd5ed69db7e9afd45429d7547"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::error_message_kind_of_upper (cyclomatic 35): flow_typing_flow_common::flow_js_utils::error_message_kind_of_upper has cyclomatic complexity 35 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"623553137b098bfb39382fad800effb448760ffedc9b88f5be4fc872d089348b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype (cyclomatic 35): flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1fd96ca80efc7a722e81c6e67285a723dff885c9504225621461a157645cf"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::position::compute_positions (cyclomatic 34): flow_parser_wasm::position::compute_positions has cyclomatic complexity 34 (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":"rust_port/crates/flow_parser_wasm/src/position.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"574faa2fe81e4ab49c686533b11233f608db870097f7458417367f286cca890c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array (cyclomatic 34): flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array has cyclomatic complexity 34 (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. This shape REPEATS in the file: one other method here (flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"513b35fec6702d4ef98a20295ea1b4559b0a619b8f94006ffeb53506857b0e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::expression_parser::assignment_cover (cyclomatic 33): flow_parser::expression_parser::assignment_cover has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 13 of the 33 points are its own statements and the rest belongs to 6 function items inside it that branch (try_assignment_parse, try_assignment_or_arrow_function, assignment_but_not_arrow_function_cover, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::expression_parser::add_comments (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"870a9e3393451cac5c8b0533aad05ff42b7b61bbf952d7e510b685b79947882a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::parse_statement (cyclomatic 33): flow_parser::statement_parser::parse_statement has cyclomatic complexity 33 (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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5171}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e539e31d9c68a60703ec8f639af9494c3a047662c51ea848bb905e1fc7a153"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_match_pattern (cyclomatic 33): Serializer::serialize_match_pattern has cyclomatic complexity 33 (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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b549287aed59ea5f1fc1270ec3cebdaca2b243141efb021903a343e4c5dd52b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_statement (cyclomatic 33): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_statement has cyclomatic complexity 33 (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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f7a777a7c5431911ca0e6eac17c924a4fdf7b2feab80e96c1a3fc41980d98"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations (cyclomatic 33): flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations has cyclomatic complexity 33 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a8c7af7ecd4c322fd6b706b4fb418c142e33daf230f271c7846f86379fafa9"}},{"ruleId":"D1","level":"warning","message":{"text":"WholeAstVisitor::visit_function_with_id (cyclomatic 33): WholeAstVisitor::visit_function_with_id has cyclomatic complexity 33 (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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4a6594da21f65fefe14fa83707e721e28119c8e0c595a471844d860e483fc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::exhaustive::value_union_builder::lookup_prop (cyclomatic 33): flow_typing_utils::exhaustive::value_union_builder::lookup_prop has cyclomatic complexity 33 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb171dd590263365c4e4b744bc57dcfd4b13af9aabc0e5fd6eadaf51a3c40b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_value (cyclomatic 33): flow_typing_utils::type_sig_merge::merge_value 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b103b9ce8cf5849a091843cd6510050d07cec42dc2035a7104561fd1cf5b40"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::def_type_default (cyclomatic 33): flow_typing_visitors::type_mapper::def_type_default 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0f9d410a31f32574790ef17d363b4c5ec91086e904137884e5338824fa455a"}},{"ruleId":"D1","level":"warning","message":{"text":"run_swebench.run_eval (cyclomatic 33): run_swebench.run_eval 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":"evals/run_swebench.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"59650a9a57649cf27529548944eecb6fe271add564c167136cfd3a475b0d5b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_message_friendly (cyclomatic 32): flow_common_errors::error_utils::cli_output::print_message_friendly has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 6 of the 32 points are its own statements and the rest belongs to 5 function items inside it that branch (concat_words_into_lines, split_into_words, print_message_inline, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9692587ae34c9eac9d262d7d7d1ae314fabd48778976c7994e4fb4fe74b8623"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeNormalizationHardcodedFixesMapper::on_union (cyclomatic 32): TypeNormalizationHardcodedFixesMapper::on_union has cyclomatic complexity 32 (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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddbe66db4fbd95f77c22cc29facc6e9fe514d9d54ebc9678f851ac34bb349ec"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::env_resolution::resolve (cyclomatic 32): flow_typing::env_resolution::resolve has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0410355d433b31a30d0eaa4adb5ea390cfd29a4871131a606e75e63009914281"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::reposition::recurse (cyclomatic 32): flow_typing_flow_js::flow_js::helpers::reposition::recurse has cyclomatic complexity 32 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a0e7192bd60794ffd0e36cd18840c1bbdf1cccfe234b5098b39568f9fb0522"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::switch_to_match::convert_switch_inner (cyclomatic 32): flow_typing_statement::switch_to_match::convert_switch_inner has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdd2a383d6f6b07547872bf18f56d3b7a502ce2da73014919cebad185ca4d15"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::perform_type_cast_with_env (cyclomatic 32): flow_typing_utils::type_operation_utils::perform_type_cast_with_env has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd68b7ce5859a380c7a9b89f6913589829aeb5b3372317c6fbcc5eb14c69a495"}},{"ruleId":"D1","level":"warning","message":{"text":"compile_swebench.generate_grading_script (cyclomatic 32): compile_swebench.generate_grading_script has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/compile_swebench.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"30daf26fee3a5d2719effeb964fe3c3f6c366619add4d3cb30ecb01dbf6eb6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"convertClassMember (cyclomatic 32): convertClassMember has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac1b4581ad55da857d7fa1feb517c0f068bb8f55bac536cb7ed288d8fc89670"}},{"ruleId":"D1","level":"warning","message":{"text":"TyIterTy::default_on_t (cyclomatic 31): TyIterTy::default_on_t has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Ty::map_locs (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcd9d77765a575f103ebfb778b968cda54e17e76926025cbd8c4ebf5c6a01c6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::initializer (cyclomatic 31): flow_parser::object_parser::initializer has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 6 function items inside it that branch (property, parse_shorthand, parse_init, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e13d64c9abfbd31cffaed33e2b21969e0a51caedeab8232e76907e34d8a24f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::param_list_or_type (cyclomatic 31): flow_parser::type_parser::param_list_or_type has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::type_parser::add_comments (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4689a61eb317896208f7cdc58eacb5a66b26538153606c5bcd5ccc531df54e9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parsing::docblock_parser::extract_docblock::parse_attributes (cyclomatic 31): flow_parsing::docblock_parser::extract_docblock::parse_attributes 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":"rust_port/crates/flow_parsing/src/docblock_parser.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"271570d074e1f19aa946ecdcc8d3c2102abeeb112a57870d88ba20bfec2af67f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::react_kit::run_with_env (cyclomatic 31): flow_typing_flow_js::react_kit::run_with_env has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 4 function items inside it that branch (tin_to_props, create_element, config_check, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"316247c2db74f813df6b087ce26e88aada83150bffbad6df58131f911421a8bc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_object::named_property (cyclomatic 31): flow_typing_statement::type_annotation::convert_object::named_property 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. This shape REPEATS in the file: one other method here (flow_typing_statement::type_annotation::convert_object) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5ada75e189a56a8378af146bd6b3a3934dbea732a6728bb6f7aeb32383ab26"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::members::extract_members (cyclomatic 31): flow_typing_utils::members::extract_members has cyclomatic complexity 31 (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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8727cd15e9607bec861614e04a67e7a42e3e4af96eb0a2e4842e07ff623ee87"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::operators::check_strict_eq (cyclomatic 31): flow_typing_utils::type_operation_utils::operators::check_strict_eq has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 3 function items inside it that branch (strict_equatable_error, distribute_strict, not_possible_enum_after_concretization). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5885a84d662b6d14be4b2f901405d868d2f8f765380460955dcd5bc98e5bdaed"}},{"ruleId":"D1","level":"warning","message":{"text":"TyReduceTy::on_t (cyclomatic 30): TyReduceTy::on_t has cyclomatic complexity 30 (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. This is NOT this file\u0027s highest cyclomatic complexity: Ty::map_locs (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75bbf2021a97898063483c0dda68743df3a4c9dbab207284f444ebfcc76f54"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::build_ordering (cyclomatic 30): flow_env_builder_resolver::name_def_ordering::build_ordering has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"43abfbf47f34ce1ba735e827007bfc8590384028326944bdf0ff30687e2e4379"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::jsx_parser::element_with_optional_opening_less_than (cyclomatic 30): flow_parser::jsx_parser::element_with_optional_opening_less_than has cyclomatic complexity 30 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 12 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8b5d90ca24a31c0d10dc98c196f88fc28504d92b5d2be30eb30f536e8edd6f"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_class_body_element (cyclomatic 30): Serializer::serialize_class_body_element has cyclomatic complexity 30 (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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0a2ed2d1325e4b4ddec0feec858cc1926c5f50f2ca91f39ecf17bbdaba6e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Def::iter (cyclomatic 30): Def::iter has cyclomatic complexity 30 (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. This is NOT this file\u0027s highest cyclomatic complexity: Annot::map (cyclomatic 63) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"151b7115ab5dcaebd3316ba3b8167fcfe5d62e33d434b0d34e9e14becd8805c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ErrorMessage::convert_type_to_type_desc::map_use_op (cyclomatic 30): ErrorMessage::convert_type_to_type_desc::map_use_op has cyclomatic complexity 30 (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. This shape REPEATS in the file: one other method here (ErrorMessage::convert_type_to_type_desc) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_errors::error_message::util_use_op_of_msg (cyclomatic 43) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":7029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72eb588760c0fcb6cdb99eec6ff4aebae6c966cf5862b1ee3246323c7299065"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::element_converter::toplevel::singleton (cyclomatic 30): flow_typing_ty_normalizer::normalizer::element_converter::toplevel::singleton has cyclomatic complexity 30 (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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"362aaddde6ee4fd832fbd0ef5420d4d810c9d1cebb1420f2df60dec269bedf33"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowParser.parse (cyclomatic 30): FlowParser.parse has cyclomatic complexity 30 (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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0af755e8499e299178cc721b262a362a9d61d2043a02c749b12f39f70739a0"}},{"ruleId":"D1","level":"warning","message":{"text":"comments.attach (cyclomatic 30): comments.attach 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aa7d69e80788b2ad12555ddf6d3f5e5b084f473ed41809fa64586c5f9f04cc"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransforms::DeclareExportDeclaration (cyclomatic 30): getTransforms::DeclareExportDeclaration 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1ea32df11f1baa251d90fa5adff069ffc797b00605bf5d5e06c4b1dfdc209e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::match_pattern_parser::subpattern (cyclomatic 29): flow_parser::match_pattern_parser::subpattern has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30bb6fb4162b01c029480a3fa55778a07b4d3ee7cccd79e535e443b581f6d49"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_server_command_handler::command_handler::handle_ephemeral_command_for_standalone (cyclomatic 29): flow_server_command_handler::command_handler::handle_ephemeral_command_for_standalone has cyclomatic complexity 29 (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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3567}}}],"partialFingerprints":{"codehealthFindingId/v1":"903b084a3536ce2035bcab920fb0c1f426943e9bb795a3fa2a5c4d2ba3ba6f39"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_statement (cyclomatic 29): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_statement has cyclomatic complexity 29 (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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"462a09252154ceaf97d3c6b2d8733d5bcc7f439abd8a1dbea61b3256cd600fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::interface_props (cyclomatic 29): flow_type_sig::type_sig_parse::interface_props has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 12 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (interface_prop::add_named_prop, interface_prop::add_computed_prop, interface_prop). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4034fb007c22b25b156d5ed6d2b9677abb40973ac710a04c3bf65232b579052a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::class_sig::elements (cyclomatic 29): flow_typing_statement::class_sig::elements 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fa48db79dfbcdf222272d2ae2d96543c2373785f52e05b61b535f5c12741c4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::annotation_inference::elab_t (cyclomatic 29): flow_typing_utils::annotation_inference::elab_t has cyclomatic complexity 29 (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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa75509fa8725d6d488f76dd8674970884a1607df67dd0094ba6cf710594df4f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner (cyclomatic 29): flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner has cyclomatic complexity 29 (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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2f91b8a9fc88c70d0449906829d33759297eb24bb817079a04ae764d498f17"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_print_signal::string_of_signal (cyclomatic 29): flow_print_signal::string_of_signal has cyclomatic complexity 29 (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":"rust_port/crates/flow_print_signal/src/lib.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac5a5e6af7fc67f512bfde58147058662193df42d5c51dda784860fdf0b3dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common::files::make_next_files (cyclomatic 28): flow_common::files::make_next_files has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda18fb4bf131b7ec1e4f5d4aad200ac0ba55c123dd05fed177e7b13bf51ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator (cyclomatic 28): flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator 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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"6271cd2acb8106d48d3ad579695c61a0980f93f455e9d7437735c0682cb1a6f4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::hermesParse (cyclomatic 28): flow_parser_wasm::hermesParse has cyclomatic complexity 28 (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":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c789822b76acf33388d44f2fa983c382b84074e8d5702e7318039c954427653d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::serializer::decode_template_raw (cyclomatic 28): flow_parser_wasm::serializer::decode_template_raw 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4763}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7be7a1a6ac70c14809decd00eba02839a6817161f1587afd59c8e4a70dbc48"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_fun (cyclomatic 28): Walker::walk_fun 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4ff066b89a2839fa29d5e4d16c4240e064203e9c15eddd77ef6159ae173ed"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::name_def::obj_properties_synthesizable (cyclomatic 27): flow_env_builder::name_def::obj_properties_synthesizable has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (synthesizable_expression, handle_fun). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"a196ea650fa52ca7d34b4668d0156b96df6fc7e13086e2860a4c7dffcaf82147"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::flow_lexer::string_escape (cyclomatic 27): flow_parser::flow_lexer::string_escape 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::flow_lexer::decode_html_entity (cyclomatic 254) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b73d7d420ae2bebc45c94db6b00db2e746362c0f6552398c8802e78233de3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::parser_env::peek::offset_after_current_trivia (cyclomatic 27): flow_parser::parser_env::peek::offset_after_current_trivia 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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cf587ca44654d194be3280a4aab0bd3b8c6b82d9a7859f77348dad4470bcbe"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::for_loop (cyclomatic 27): flow_parser::statement_parser::for_loop has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d733b895dd9ae9e34b115edea0f821a4355b776fc0bcbcfc99e311e84f3f52fe"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchLowerer::analyze_pattern (cyclomatic 27): MatchLowerer::analyze_pattern 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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d36dd388d23db02f3773faa9e79fa3ba592aeb2fdb1406b13fb18e488029480"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::iter (cyclomatic 27): Value::iter has cyclomatic complexity 27 (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. This is NOT this file\u0027s highest cyclomatic complexity: Annot::map (cyclomatic 63) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"886e6cad7a4aca82901744357fa5f522e3220693bbef66983e2d5c39f7da1338"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_mark::mark_local_binding (cyclomatic 27): flow_type_sig::type_sig_mark::mark_local_binding has cyclomatic complexity 27 (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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebbb80791d40b01ac6c821a604b62fe5a8812c92aeb6c41f8f80135cdb03338"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::create_computed_prop (cyclomatic 27): flow_typing_statement::statement::create_computed_prop has cyclomatic complexity 27 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39705ef9950f2d14139b5a7cdb2dd15d5f3724fbf92b692469efbb67ee26892"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert (cyclomatic 27): flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3edba07ebbdb53e188616c7739f4bd0e6aa221f7499c51543a82a9df1888d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::sentinel_prop_test_generic (cyclomatic 27): flow_typing_utils::predicate_kit::sentinel_prop_test_generic has cyclomatic complexity 27 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dce1c53d978ff742c0e506445ad17d927d5dde84e2c8b2024f1c942fca7db46"}},{"ruleId":"D1","level":"warning","message":{"text":"FlowParser.detectSourceType (cyclomatic 27): FlowParser.detectSourceType has cyclomatic complexity 27 (threshold 15). Of this number, 26 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"70633de4ba11875144c0a2a1cff412226510d336aa959940843e4f27de3c20e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TyIterTy::default_on_decl (cyclomatic 26): TyIterTy::default_on_decl has cyclomatic complexity 26 (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. This shape REPEATS in the file: one other method here (TyReduceTy::on_decl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: Ty::map_locs (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7601b8c0717a774c82b888f8150ace9d9e478f2bd515c048e2e89947884ae876"}},{"ruleId":"D1","level":"warning","message":{"text":"TyReduceTy::on_decl (cyclomatic 26): TyReduceTy::on_decl has cyclomatic complexity 26 (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. This shape REPEATS in the file: one other method here (TyIterTy::default_on_decl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: Ty::map_locs (cyclomatic 35) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"4546d46c6285dda474064ecd429edad6318a1202b4b195451f3928615f3d7fde"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::visit_assignment_expression (cyclomatic 26): DefFinder::visit_assignment_expression has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeddacb0dc101e28abc84fffaa4c8f84a16d2e829fc7a6f989ce21e58288ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::env_api::writes_of_write_loc::collect (cyclomatic 26): flow_env_builder::env_api::writes_of_write_loc::collect has cyclomatic complexity 26 (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":"rust_port/crates/flow_env_builder/src/env_api.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2682f89e490b5a26ab82ca72fa725167f45f280f4c25ab38d3bf87e8fe1c2f3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::expression_parser::primary_cover (cyclomatic 26): flow_parser::expression_parser::primary_cover has cyclomatic complexity 26 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::expression_parser::add_comments (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d82286ae2036fe8073d30ef0a70238afca25c7f0a40f2454368090d96f439"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::declare (cyclomatic 26): flow_parser::statement_parser::declare has cyclomatic complexity 26 (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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc295e759d82a4aa32dd53dbe39a250bf8362cbb59040504785d3bd162f0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils::enum_validate::validate_implicit_type (cyclomatic 26): flow_parser_utils::enum_validate::validate_implicit_type has cyclomatic complexity 26 (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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9dde65b4711d50de3ea5492109437dc352531c7f11b1f0604bbbcdbad031a8"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::precedence_of_expression (cyclomatic 26): flow_parser_utils_output::js_layout_generator::precedence_of_expression has cyclomatic complexity 26 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils_output::js_layout_generator::type_ (cyclomatic 41) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace40ccd1200b1e8cbc2c043f3fb62c619f3af56d962c50807be6e61bd5e838c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::type_object_property (cyclomatic 26): flow_parser_utils_output::js_layout_generator::type_object_property has cyclomatic complexity 26 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils_output::js_layout_generator::type_ (cyclomatic 41) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9482a3857ffbc60c06379761f3895c459a95572bf5aecbce09eef4b41ee510f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_autocomplete::autocomplete_service_js::autocomplete_get_results (cyclomatic 26): flow_services_autocomplete::autocomplete_service_js::autocomplete_get_results has cyclomatic complexity 26 (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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"0583ecb4a21e845ec97753ae004ed1ed164907c1bffbb285a72273cb16314d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_inference::merge_service::sig_hash (cyclomatic 26): flow_services_inference::merge_service::sig_hash has cyclomatic complexity 26 (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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"024476881fbc351e661567c62a408c372d478649f1f5822de395c04971da6d60"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::is_number_text (cyclomatic 26): flow_typing_flow_js::template_literal_type::is_number_text has cyclomatic complexity 26 (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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d13e78d6d2631670488c93d28a6fab8c3b437b7e8c5753cbb11dd64c646ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::object_prop (cyclomatic 26): flow_typing_statement::statement::object_prop has cyclomatic complexity 26 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8f076039f8717cf6521ab7e9622c00d8181b751168b99812d5e32990de3ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::static_method_call_object (cyclomatic 26): flow_typing_statement::statement::static_method_call_object has cyclomatic complexity 26 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be25c2e952b7d58a125ce33eae1b226925a601925ba4d7f0f8f2535814e7e04"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_env::possibly_refined_write_state_of_state::loop_fn (cyclomatic 26): flow_typing_utils::type_env::possibly_refined_write_state_of_state::loop_fn has cyclomatic complexity 26 (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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3aa0a0487e9bedd936a28fead012c7e1d65f4d45c5a8d3b42b1cbdf20afa70"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::comment::comment_mutator::expand_comment (cyclomatic 25): flow_dev_tools::comment::comment_mutator::expand_comment 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":"rust_port/crates/flow_dev_tools/src/comment/comment_mutator.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6261ba1a127427069b9315aeefd0ddd38ef7131ac893a74eef257116b445f15"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::mk_env (cyclomatic 25): NameResolver::mk_env has cyclomatic complexity 25 (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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40e5d9dd9b93cf69bc438440fbdf10772c7c70927fd32d8c9c3875247d22663"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::binding_type_identifier (cyclomatic 25): NameResolver::binding_type_identifier has cyclomatic complexity 25 (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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8970}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6568b5687b78c897771ddaff8974b3731584bdd06c8719ed1a402bd6f1072f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_function_params (cyclomatic 25): flow_parser::declaration_parser::parse_function_params has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 4 function items inside it that branch (param, this_param_annotation, param_list, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34741fdb1ca9d3a3f8a23de46a06a649f7f0785a54fb070c90fde47c0917232"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::expression_parser::member_cover (cyclomatic 25): flow_parser::expression_parser::member_cover has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::expression_parser::add_comments (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88b7c7fd059f1b4469d596ba3194108dacca70553e3acc16fa974fd069e32bf"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::opaque_type_helper (cyclomatic 25): flow_parser::statement_parser::opaque_type_helper 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab1f2b2fbe6ce756a2352a327b3a060b5ccdf6c2e7720d19a9dbf384c93623e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_get_def::get_def_js::get_def::loop_fn (cyclomatic 25): flow_services_get_def::get_def_js::get_def::loop_fn has cyclomatic complexity 25 (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":"rust_port/crates/flow_services_get_def/src/get_def_js.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c445630b1437672d4827e61f3753811e12860436680c3d8b66c866a1d59f80"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::query_types::type_at_pos_type (cyclomatic 25): flow_typing::query_types::type_at_pos_type has cyclomatic complexity 25 (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":"rust_port/crates/flow_typing/src/query_types.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fac253078681071c7929ed24471085adb350c5515600cbc7138712634fb5d64"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::array_elem_check (cyclomatic 25): flow_typing_flow_common::flow_js_utils::array_elem_check 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54a373386cef67787dc70c1d7f20bdd4612b1bb6078d653a8c45d451683b72e"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_call (cyclomatic 25): Walker::walk_call has cyclomatic complexity 25 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce5ff1553f86432d20a3c7ce73ce09e880a3a59ca6f9b8e2405753b60db3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::object_rest_with_env (cyclomatic 25): flow_typing_flow_js::slice_utils::object_rest_with_env has cyclomatic complexity 25 (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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf7f3b99285e365123fbf16919fb27d1ef2aa7b4bef16e751d0ba8cab5da6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::react_rules::downstream_effects (cyclomatic 25): flow_typing_statement::react_rules::downstream_effects has cyclomatic complexity 25 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_statement::react_rules::hook_callee::recur_id (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e5af8cedf0a689590b81914d7256e4a7a9a334a771c08d9e6a0194a25db269"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::convert_types::type_to_json_uncached (cyclomatic 25): flow_typing_utils::convert_types::type_to_json_uncached has cyclomatic complexity 25 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::convert_types::def_t_to_json (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bf13c82a1fe9d89cf0c0d447e0e886104449d73f164807707c59345821469a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::has_prop (cyclomatic 25): flow_typing_utils::predicate_kit::has_prop has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 8 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (find_key, some_has_prop, try_some_has_prop, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab30377e0ca4b437fdbdf63e6b67e9cc6b3ffce27889ceac4eb50af5401bd48"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::prop_exists_test_generic (cyclomatic 25): flow_typing_utils::predicate_kit::prop_exists_test_generic 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0769b679bc7a059d949d8c0ea7c1a9434320f2fc5d0ecf213a2f3c957e17e6b6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env::assign_from_after_concretization (cyclomatic 25): flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env::assign_from_after_concretization has cyclomatic complexity 25 (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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c501d0438bd1441376d1c667daaabd3efa1d9887a7fc1bbadee574df95e8f51"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransforms::ObjectTypeAnnotation (cyclomatic 25): getTransforms::ObjectTypeAnnotation 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b66b81a8fbc3e91fc0b78f86c80a86b3405f6b01d8093d3b2a4ff6be097b120"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransformContext (cyclomatic 25): getTransformContext has cyclomatic complexity 25 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 11 belong to 30 function literals inside it that branch. 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":"packages/flow-transform/src/transform/TransformContext.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca0c9e15b77ddca835cefa21b2e99866c92d19abe5c9be7d53a2b2818cbb44b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils::flow_ast_differ::list_diff (cyclomatic 24): flow_parser_utils::flow_ast_differ::list_diff has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils::flow_ast_differ::statement (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"522e70fe86c66df512beb8977e3b773670a900dd26c36fa2925302d8aa459c93"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_export::fuzzy_path::score_match::do_score (cyclomatic 24): flow_services_export::fuzzy_path::score_match::do_score 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":"rust_port/crates/flow_services_export/src/fuzzy_path/score_match.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6b52f76c2c6e2c6042998d484487b66db5710eb29ed007b48b96f6acf243ff"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::object_literal::prop (cyclomatic 24): flow_type_sig::type_sig_parse::object_literal::prop has cyclomatic complexity 24 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea11785b28a4de4721d7a821c7fe074ff32f3eecc410459b13d8dc79c01627a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::detect_sketchy_null_checks (cyclomatic 24): flow_typing::merge::detect_sketchy_null_checks 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. This shape REPEATS in the file: one other method here (flow_typing::merge::detect_sketchy_null_checks::make_checks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab4d570b332f9f3b10a1c874cd24af8d6307b203f3264a956ecd6e49f14ecff"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::post_process_errors (cyclomatic 24): flow_typing_errors::intermediate_error::post_process_errors has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_errors::intermediate_error::annotation_inference_operation_description (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"126b0627d16e5c95bfaca6b72b7a060e0e69cd6103e6fe6f3790908e5df9e150"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::any_helpers::any_propagated (cyclomatic 24): flow_typing_flow_js::flow_js::any_helpers::any_propagated has cyclomatic complexity 24 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fece88c69e04e1e31bd11b34b53f6af93ac4cef4b5ec10b06f5e13257589dc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_visitor::type_default (cyclomatic 24): flow_typing_visitors::type_visitor::type_default has cyclomatic complexity 24 (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":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"724b866159d7e5a1796fea98c248bb2d4f1cfd42d6f2edad70d527c22d4f9177"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_cli_support::glean_runner::source_of_exports (cyclomatic 23): flow_cli_support::glean_runner::source_of_exports has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 4 function items inside it that branch (soes_of_packed, soes_of_packed_value, soes_of_packed_def, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29d51f2ddb7048ec7edf49226f3a5638199ba28061b4d16011d3dd1dc838b83"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references (cyclomatic 23): flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d0a8858e808d7e19509613eb920a13e5f1f35bfe8045ea0d6492ea905f9cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::visit_expression (cyclomatic 23): DefFinder::visit_expression has cyclomatic complexity 23 (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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd1591f174bce7fa5d6012401a95d413a787a584ab2d30f8a8d08ba49c86611"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::flow_lexer::string_quote (cyclomatic 23): flow_parser::flow_lexer::string_quote has cyclomatic complexity 23 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::flow_lexer::decode_html_entity (cyclomatic 254) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"039d19e757b921246588e3e373ce5f83c26d792dd29bbc5b37d59ca588749151"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::class_body::class_elements (cyclomatic 23): flow_parser::object_parser::class_body::class_elements 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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a017f36d8e7d69a575e36f6f6693fdf1713267761ca0279e74fd0c0922595b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::pattern_parser::parse_object (cyclomatic 23): flow_parser::pattern_parser::parse_object has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (parse_object_property, parse_object_properties, parse_property_default). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0938b78c13740235ffe9c7bace898bc35251165b5beda94d75cd9e124921abe4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::has_flow_pragma (cyclomatic 23): flow_parser_wasm::has_flow_pragma 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":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7fe550294f3c18f27e7a0778c3d5dcd33cad89c60219fc0f56521ecc000998"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::serializer::decode_escaped_raw_bytes (cyclomatic 23): flow_parser_wasm::serializer::decode_escaped_raw_bytes has cyclomatic complexity 23 (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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0466971841c4d473104aa4cd9d21e4764c50c5cddf516ae87bb1386597119b8"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::value_to_type_reference_transform::run_on_concrete_type_with_env (cyclomatic 23): flow_typing_flow_common::flow_js_utils::value_to_type_reference_transform::run_on_concrete_type_with_env has cyclomatic complexity 23 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"320c7cb465fc04da6cd6e93b0dca698cd80dfb4c18a33e85d4d1057d1ef88f92"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::type_app::singleton_poly (cyclomatic 23): flow_typing_ty_normalizer::normalizer::type_converter::type_app::singleton_poly has cyclomatic complexity 23 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_ty_normalizer::normalizer::type_converter::type_destructor_unevaluated (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2448dec97bda029aadf6e0ad2c5a8a8de870a533c18f24981ee6536ed2f70ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_filter::sentinel_refinement::filtered_loop (cyclomatic 23): flow_typing_utils::type_filter::sentinel_refinement::filtered_loop has cyclomatic complexity 23 (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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0a995adaef5e10d31fe50a2e8930fc1dd991af641f7a90646026f241aca9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailedDiagnostics.validateRendered (cyclomatic 23): DetailedDiagnostics.validateRendered has cyclomatic complexity 23 (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":"packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3bac3095f6c11f9055fdd834524e16ca331dfae7f0584e71ae5b1f4422a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"mutateESTreeASTForPrettier.mutate (cyclomatic 23): mutateESTreeASTForPrettier.mutate 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":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed7bd818488040c6c9db49ed9f45dec86a82efad79971db06325e22daa73aad"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_commands_connect::command_connect::connect_rec (cyclomatic 22): flow_commands_connect::command_connect::connect_rec 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":"rust_port/crates/flow_commands_connect/src/command_connect.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6ae2982ac64e2df00097aa45f641a55d75a1ae1d16f2539c196b2a08cb8dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::visit_object_expression (cyclomatic 22): DefFinder::visit_object_expression 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c58629acc483f83350aae210056c2827c0b24aab1b085f6feeff2c70c788b68"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::jsx_element (cyclomatic 22): DefFinder::jsx_element has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6891}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a6f9ef2ce31f52558b97fce2839dfd04de205b54bd4c50d6d0fa84fae7e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::assignment (cyclomatic 22): NameResolver::assignment has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9549}}}],"partialFingerprints":{"codehealthFindingId/v1":"91afdc981ecbd047f38dda9ea4d21ded34b53c685d7a7025583ecba75875930b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::expression_parser::call_cover (cyclomatic 22): flow_parser::expression_parser::call_cover has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::expression_parser::add_comments (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f890ecd80ff2f7021e9eb104bde0e52ab5aa387bdc2a28ff1007715476ac7b53"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::statement_parser::parse_statement_list_item (cyclomatic 22): flow_parser::statement_parser::parse_statement_list_item has cyclomatic complexity 22 (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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"958cc3fe2f87df73db98b49c918f25d14795b5418da0773791171d206979c7c1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::tuple::element (cyclomatic 22): flow_parser::type_parser::tuple::element 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::type_parser::add_comments (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e5bd6266f6bc36a65a28574b90c927797858bacf703256db9940ccbf409d72"}},{"ruleId":"D1","level":"warning","message":{"text":"Mapper::statement_fork_point (cyclomatic 22): Mapper::statement_fork_point 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":"rust_port/crates/flow_services_code_action/src/autofix_type_to_value_import.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6a7e86bce07736f8c88c232d7004ced95e8b96085d39e8bdaadf63032af52b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_expression (cyclomatic 22): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_expression has cyclomatic complexity 22 (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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7a02b4825bd98cd63ab14e653cfcad69fba10bcf1bb928dbbc233d5eee3640"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::flow_arith (cyclomatic 22): flow_typing_flow_common::flow_js_utils::flow_arith has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9213}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ffe82b613586022b4daf99f8d13a0286248a4c9cc2a18b89ea43b8c476552d"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::expand_typeapp_uncached (cyclomatic 22): Walker::expand_typeapp_uncached has cyclomatic complexity 22 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eec360456724de9923201c40739de0b4ee32b58ea569dc3a134f4982acb3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::kit::run_conditional (cyclomatic 22): flow_typing_flow_js::implicit_instantiation::kit::run_conditional has cyclomatic complexity 22 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec85cb78a6873ec8e3d85177edf2fe83daf4393f593f6e5324b6e5584af000"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::module_info_analyzer::export_specifiers (cyclomatic 22): flow_typing_statement::module_info_analyzer::export_specifiers has cyclomatic complexity 22 (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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94852eea1d313441b06d3a1a280858d08cac3020c42ac0f47cfe74ec7643a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::check_super_abstract (cyclomatic 22): flow_typing_statement::statement::check_super_abstract has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (walk_one, walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6653}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc51904fef665a9f83d010b7b4d70a7cbe89629d2e22a1f8a7ba1331b58d06b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::expand_literal_union::type__ (cyclomatic 22): flow_typing_ty_normalizer::normalizer::expand_literal_union::type__ has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_ty_normalizer::normalizer::type_converter::type_destructor_unevaluated (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eadaad2d16a05c3a1e3fc2da9031aee179a774f63da40463aca05463c65cc85"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::operators::check_eq (cyclomatic 22): flow_typing_utils::type_operation_utils::operators::check_eq has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 4 function items inside it that branch (equatable, distribute, is_always_allowed_one_side_t, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b3d7808ebc77b141f39bc621939d68a7a7d583da79f7cd9d00f743a283d57c"}},{"ruleId":"D1","level":"warning","message":{"text":"recordRunner.runner (cyclomatic 22): recordRunner.runner has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d939bcb7305f0cf6982c8785ceb9f352acf97005728f16467abca736e18ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformMatchSyntax.analyzePattern (cyclomatic 22): TransformMatchSyntax.analyzePattern has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong 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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d7e3f50bbd86b4bccf95a897239453c4e45730defed429d621afd8818b4357"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::token (cyclomatic 21): Lexer::token 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":"rust_port/crates/flow_common_semver/src/semver_lexer.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b33ec96b24e59311061aa9054da434b98feb6bbd7511d02b8bd03fd5f6e667"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::runtests::check_annotate_exports::normal_diff (cyclomatic 21): flow_dev_tools::runtests::check_annotate_exports::normal_diff 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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe897ae016375f243e2189f4f57cdc1a56a586706e3e4534c4fe2f6d1add9f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::try_connect (cyclomatic 21): flow_lsp_server::flow_lsp::try_connect 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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e6b822232b3f2998ddd31df58456f40b5ab10412c5737ade10602b862c3549"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::function_param_list_without_parens (cyclomatic 21): flow_parser::type_parser::function_param_list_without_parens has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::type_parser::add_comments (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaa1be6d84ade0aefb4f5e843ca28ea479e30e791bb1f2b8ea45813c584e309"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::type_parser::type_params (cyclomatic 21): flow_parser::type_parser::type_params has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (token_is_maybe_end_of_list, params, token_is_maybe_param). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::type_parser::add_comments (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d68cbe4eb35368def95e02e889bfdd3ca0cefb49546cf237768fe1e7279ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils::flow_ast_differ::match_pattern (cyclomatic 21): flow_parser_utils::flow_ast_differ::match_pattern 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils::flow_ast_differ::statement (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6203}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fdad5c9a488ca53024215c3faaabbb1db077c96a13556229f32a1b9e9735dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_type_object (cyclomatic 21): Serializer::serialize_type_object 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfe37e7044765841327210a628cc3cd7b24eb73b32dd7a496b591826e465637"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_declare_export_declaration (cyclomatic 21): Serializer::serialize_declare_export_declaration 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b02e7258112cde33e134bc0c2996ab3e8796d345a678fb4e4f8af3be002a929"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_inference::type_service::check_files::check_files (cyclomatic 21): flow_services_inference::type_service::check_files::check_files has cyclomatic complexity 21 (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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"77809e65195e21b1c38e5517da37ca8563212180a74e6c0fd13d84b0bffba759"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args (cyclomatic 21): flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args has cyclomatic complexity 21 (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. This shape REPEATS in the file: one other method here (flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e1efbe728499969fe4a29489163075c76d33812218090f8f7c8f0897f9a4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::pin (cyclomatic 21): flow_typing_flow_js::implicit_instantiation::walk::pin has cyclomatic complexity 21 (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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":7077}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71b03f36295571f851ee84b17add78be2f53021bc64f296016e9fae5fe667e6"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::class_sig::post_inference_check_abstract_obligations (cyclomatic 21): flow_typing_statement::class_sig::post_inference_check_abstract_obligations has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"334d989941539259996ef008d1ac00fb0417003ad8c5b78cbaafab2b10140359"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::class_sig::collect_inherited_members_both_sides (cyclomatic 21): flow_typing_statement::class_sig::collect_inherited_members_both_sides has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (walk_one, visit_static_concrete, walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e12d8b91870813307520c3e919d26c7a5e1d5d125531c189cb793d4c094d86"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::match_pattern::pattern_ (cyclomatic 21): flow_typing_statement::match_pattern::pattern_ 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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55924d8dd46bd864ce57cb3e526bf2d1ac576274fe107603c859233fd075d08"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::react_rules::is_initializing (cyclomatic 21): flow_typing_statement::react_rules::is_initializing has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (refines_safe, not_refines_safe, is_nullish). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_statement::react_rules::hook_callee::recur_id (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"6025982907e6fe99aea9df8111b4291f21b293d701b61c19d087b690f7e212d2"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::mk_enum (cyclomatic 21): flow_typing_statement::statement::mk_enum 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":21799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0007a4a5921fe89930284d71751b0e54dde60b57443c765ac50cc8048c1c3d3"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::predicate_default (cyclomatic 21): flow_typing_visitors::type_mapper::predicate_default 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da9c56a3a9a0cbd65032f7af299b39f398ab6f7e9ed87862e81737916e26666"}},{"ruleId":"D1","level":"warning","message":{"text":"use-indexed-access-type.report (cyclomatic 21): use-indexed-access-type.report has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. 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":"packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ecae444df512cafcdbbcf8dc7f2b5a7cff8ab51a6693e8fa5aae9d90ae30f3"}},{"ruleId":"D1","level":"warning","message":{"text":"comments.handleClassComments (cyclomatic 21): comments.handleClassComments 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"943dc77990e7f28a3a481bc98a353da7ef056491435c4c3328291e8b5c43930f"}},{"ruleId":"D1","level":"warning","message":{"text":"convertExport (cyclomatic 21): convertExport has cyclomatic complexity 21 (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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f89662d10a3a0f4ae70fdef7399f96fb97adc34fd13e5e0e77fff4b98d2e9ef"}},{"ruleId":"D1","level":"warning","message":{"text":"transform.VariableDeclarator (cyclomatic 21): transform.VariableDeclarator has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. 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":"packages/flow-upgrade/src/codemods/collapseObjectInitialization.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0749b7da95366c6594a9e2ca7ebe8b68cdfb4195c01bc61baf9b6f930e9e79"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_command_utils::connect_and_make_request_inner::wait_for_response (cyclomatic 20): flow_command_utils::connect_and_make_request_inner::wait_for_response 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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c220a3491e31e7af79a2f2c7f3ea1165088ac3bf34d7131c24843a97369d088"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::name_def::match_pattern::visit_pattern (cyclomatic 20): flow_env_builder::name_def::match_pattern::visit_pattern has cyclomatic complexity 20 (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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"55008491d9557db9420f81c4fa3a3a9565e81890b1e9f2956bc1b6676cd234da"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::annotation_locs (cyclomatic 20): flow_env_builder_resolver::name_def_ordering::annotation_locs has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (bind_loop). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de021ef76fc6f005eb054e7b1982041ec1d5d8e1d89318025cb5d47a834a833"}},{"ruleId":"D1","level":"warning","message":{"text":"LintSettings::of_lines (cyclomatic 20): LintSettings::of_lines has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_lint_settings/src/lint_settings.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4492eb12e1dd3428a4ebe1645b2e3e356866a1906b3bb8042c0ab5e83c3af4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::bin::parse_test262::main_impl (cyclomatic 20): flow_parser::bin::parse_test262::main_impl has cyclomatic complexity 20 (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":"rust_port/crates/flow_parser/src/bin/parse_test262.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc389cf49da720a19c72370d02b63cf0ffeae9a694b1a7af3d71cb0680547af"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_function (cyclomatic 20): flow_parser::declaration_parser::parse_function 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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5151a2824c47b16fb5a363c950daaf4ea2eb6cd2d620669f53c2df4e98392d"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::class_element (cyclomatic 20): Writer::class_element 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf84b059c3d56ea0ca7604459546c32dd2a522c6c4ee321fa7812242ac96f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::layout::print_node (cyclomatic 20): flow_parser_utils_output::layout::print_node 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":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5158dc94c6f81cb7577484105fecc9081414aaf2f7f0357ae5df32a49dff27"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_get_def::get_def_utils::def_info_of_typecheck_results (cyclomatic 20): flow_services_get_def::get_def_utils::def_info_of_typecheck_results has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"801f19258fc7e4aacc5175a9e0dd675db3cfce5cf610b012177ff3671f0d3bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_component_type_params (cyclomatic 20): flow_typing::env_resolution::resolve_component_type_params has cyclomatic complexity 20 (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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c8c7543babbbccac668b69e57d4dbb91993952e6b24ec72df68e6c4e1cb3e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::score_of_msg (cyclomatic 20): flow_typing_errors::intermediate_error::score_of_msg has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (type_category, score_categories). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_errors::intermediate_error::annotation_inference_operation_description (cyclomatic 38) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40f05c5966866d1fe89e89dabb92a9e97aee41aa26078d5081f9ebcd9d8444"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_renders (cyclomatic 20): Walker::walk_renders has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43812f1efc777c89e59cb8a325532ec6e6142d83d6ed66fa689af3e4c5ea881"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::key_markers_seen (cyclomatic 20): flow_typing_flow_js::implicit_instantiation::walk::key_markers_seen has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5958}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ea5c254a68f3913387aa53efe0a444ae8f4e0992b7dcad6b9275d830cb628"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::find_value_literal (cyclomatic 20): flow_typing_flow_js::implicit_instantiation::walk::find_value_literal has cyclomatic complexity 20 (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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":6208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8811c0d74e18b0ce87cd71b9fd2e999412855076ad4390071bd9392b459e080a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env::on_concretized_react_node_types (cyclomatic 20): flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env::on_concretized_react_node_types has cyclomatic complexity 20 (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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4248d19f582b8d4b3cf87a1bee922d7fb19ea25f8d501739a537203baa605"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::extract_strings_aux (cyclomatic 20): flow_typing_flow_js::template_literal_type::extract_strings_aux has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aeca1f1683ac06bbe30f2d8963bf6db4fde557a4d60630c3c3bca9c7c6c06f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::react_rules::check_ref_use::recur_id (cyclomatic 20): flow_typing_statement::react_rules::check_ref_use::recur_id has cyclomatic complexity 20 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_statement::react_rules::hook_callee::recur_id (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90c42b63edee16bbf3b8545d7a61efec4c5616683ed60d4cfcff8317c6a42f8"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::mk_record_sig (cyclomatic 20): flow_typing_statement::statement::mk_record_sig has cyclomatic complexity 20 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18949}}}],"partialFingerprints":{"codehealthFindingId/v1":"25567d3bdf1e8f2040ebbe87c347d2703a515483d732ea0e304c95deaf5f3822"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::call_latent_pred (cyclomatic 20): flow_typing_utils::predicate_kit::call_latent_pred 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ad567e4c6d579b0d93dc79339823d201a886ece0898c8e3764bcc09d33310"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_env::recorded_declare_namespace_member_opt (cyclomatic 20): flow_typing_utils::type_env::recorded_declare_namespace_member_opt has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch (namespace_types_at_path_prefix::namespace_types_for_root_path_element, namespace_value_member_opt::object_value_member_opt, namespace_value_member_opt, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0301dcc2855573702dfe720b139293764b72c1356a18fa23ac1352c0e131da7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_truthy (cyclomatic 20): flow_typing_utils::type_filter::not_truthy has cyclomatic complexity 20 (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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"232f8f239bcdb917ae19ede2979ba1d87f9a15dd90e36ae1b771d50e36852367"}},{"ruleId":"D1","level":"warning","message":{"text":"compile_swebench.main (cyclomatic 20): compile_swebench.main 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":"evals/compile_swebench.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b377e983ebe86429d77d639676c056da24c0230feb7fa737e6b821d84445ae8d"}},{"ruleId":"D1","level":"warning","message":{"text":"comments.getSortedChildNodes (cyclomatic 20): comments.getSortedChildNodes has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c4982c6ec974b3b2d194239fba76a79f553447d6db0dfdb8ca01b052c0b241"}},{"ruleId":"D1","level":"warning","message":{"text":"comments.handleLastFunctionArgComments (cyclomatic 20): comments.handleLastFunctionArgComments has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d120da162698155be4acd1cfadc9c95e00e64051d9e094d83e8205ce40cb68"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransforms::DeclareClass (cyclomatic 20): getTransforms::DeclareClass 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"802086a50798aef26bf01c4e4caeb68fcf6d33c5289887d10ee6b0d55abdfa05"}},{"ruleId":"D1","level":"warning","message":{"text":"convertExportDeclaration (cyclomatic 20): convertExportDeclaration 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940b004e79bea4efad823df401352d8cb3e1a7fa56ff42ecb36e635a69428c1"}},{"ruleId":"D1","level":"warning","message":{"text":"getStatementParent (cyclomatic 20): getStatementParent has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 68, assertValidStatementLocation, getAssertedIndex). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/mutations/utils/getStatementParent.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a7bae9fb4453baa0db45f36c7bdd9359d28db77fb31ce221e64de56b35a01b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::layout_references (cyclomatic 19): flow_common_errors::error_utils::cli_output::layout_references has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (add_tags, add_close_tag, update_colors). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0083319839bae2bb5515c0470879df557f1e4be9bf92e111562938b9b869d4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::runtests::check_annotate_exports::run_annotate_exports (cyclomatic 19): flow_dev_tools::runtests::check_annotate_exports::run_annotate_exports 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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffda0b274e917ec122267a9d8114d035b26d9948e7b682b1e24d31858668bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::runtests::check_exec_file_promise::split_shell_args (cyclomatic 19): flow_dev_tools::runtests::check_exec_file_promise::split_shell_args 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":"rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e9de79ae9d1482a36fb5ec5fa7f2a005c54a150d90c318a0e2118f8fc51d16"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::variable_declarator (cyclomatic 19): NameResolver::variable_declarator 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9752}}}],"partialFingerprints":{"codehealthFindingId/v1":"daecc4c86b915f4a7e6c9b7d3d549703d0e188d6d6257b3ae6eeae4cba3014b4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_unsafe (cyclomatic 19): flow_lsp_server::flow_lsp::main_handle_unsafe has cyclomatic complexity 19 (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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0743855ec57b5de078c20ebaa71cdc4e249457c6ab5788d9b6eae214876a45"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::estree_translator::match_pattern (cyclomatic 19): flow_parser::estree_translator::match_pattern has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::estree_translator::type_ (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b143eb66e78e36d750ac2109a8d4ef7f879155a2eaa37126027354aba2e7b9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::expression_parser::binary_cover (cyclomatic 19): flow_parser::expression_parser::binary_cover 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::expression_parser::add_comments (cyclomatic 40) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d4b3ae1997fc250dacbcaec8de6e1e012b2003444ccf9d7dedb3bb73067ea"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::record_body::elements (cyclomatic 19): flow_parser::object_parser::record_body::elements 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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab10adc54cd25a221a14b9fb2a1d88c854495dfe5eef41ff63179cbe4e6f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::match_pattern (cyclomatic 19): flow_parser_utils_output::js_layout_generator::match_pattern has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils_output::js_layout_generator::type_ (cyclomatic 41) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfddb0efda320194473a632c304479fc272d6848d7d58161fd5ae5d6ed66097"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::type_object (cyclomatic 19): flow_parser_utils_output::js_layout_generator::type_object has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser_utils_output::js_layout_generator::type_ (cyclomatic 41) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6468}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ef99e2155f506e36c78099dada205a0f094da840b7dddce7f83ef636824711"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::pretty_printer::print::print_node (cyclomatic 19): flow_parser_utils_output::pretty_printer::print::print_node 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":"rust_port/crates/flow_parser_utils_output/src/pretty_printer.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5133550c5788fefddd53841e5129019fa3036b2d9f71c12e00d9973d034fe"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parsing::parsing_service::reducer (cyclomatic 19): flow_parsing::parsing_service::reducer has cyclomatic complexity 19 (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":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d4db08872264b8cdf92dc325ff6d36bd1b6c352c2a5c81f60e68f8459e88e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_server_env::flow_lsp_conversions::diagnostics_of_flow_errors::error_to_lsp (cyclomatic 19): flow_server_env::flow_lsp_conversions::diagnostics_of_flow_errors::error_to_lsp has cyclomatic complexity 19 (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":"rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd496aa969120f959e097b1d052ea1ea9ca9de79eda73c8f7eac3c8b40bf480"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor_server::server_instance::start (cyclomatic 19): flow_server_monitor::flow_server_monitor_server::server_instance::start has cyclomatic complexity 19 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_server_monitor::flow_server_monitor_server::server_instance::error_type_of_code (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68750ee44bbbd368f177c2d4de5cb3fc62238c57cd326a52da2179b44e30678"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_pack::pack_local_binding (cyclomatic 19): flow_type_sig::type_sig_pack::pack_local_binding has cyclomatic complexity 19 (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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c6d7ce5c3b4787c6181b21cc24fd576bd7bfafb997de40a9a93d7183f2bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::concrete_type_eq::eq_with_env (cyclomatic 19): flow_typing_flow_common::concrete_type_eq::eq_with_env has cyclomatic complexity 19 (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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2b267bac175b4ae814de703b971a947f3fa0bf4af61b96f7a020108109065b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::propref_for_elem_t_with_env (cyclomatic 19): flow_typing_flow_common::flow_js_utils::propref_for_elem_t_with_env 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8505}}}],"partialFingerprints":{"codehealthFindingId/v1":"838751cab71c6e3f33a5311bbf03a9c3a11e3fa4b3f8a123757a867be97a51ef"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::natural_inference::literal_type_mapper_type_dispatch (cyclomatic 19): flow_typing_flow_js::natural_inference::literal_type_mapper_type_dispatch has cyclomatic complexity 19 (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":"rust_port/crates/flow_typing_flow_js/src/natural_inference.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"884610eadc8f0f94d2eacd4e94a846a1fd70fd8db0101acefe6a4dbfb91a82bc"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::renders_kit::rec_renders_to_renders (cyclomatic 19): flow_typing_flow_js::renders_kit::rec_renders_to_renders has cyclomatic complexity 19 (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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"34396615236a09698b2781b70d3e793add396a1d0affe565cff221cc54c0a249"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_return_annotation_inner (cyclomatic 19): flow_typing_statement::type_annotation::convert_return_annotation_inner 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"514d715a4c203332f7bcd15ed0666f1c1b8ca03f29a9a27a50035a8bfa3c4818"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_type::type_util::is_mixed_subtype (cyclomatic 19): flow_typing_type::type_util::is_mixed_subtype has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_type::type_util::util_use_op_of_use_t (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a019917646f866fe9c39c6ac2f98d6f8114ad0ed51fbd51becfebd948f13cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportExportVisitor::export_named_declaration (cyclomatic 19): ImportExportVisitor::export_named_declaration 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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15455aa1735db319d2bdc9ad9abcc8e3b423183019710e6a5d57f080982850b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_fun (cyclomatic 19): flow_typing_utils::type_sig_merge::merge_fun has cyclomatic complexity 19 (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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f2052be2f1de817eb1622ba17fc293b13b71e3edcd2c39d0417057294de22"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_visitor::def_type_default (cyclomatic 19): flow_typing_visitors::type_visitor::def_type_default has cyclomatic complexity 19 (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":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50d121d30b6803d5ce8110114d341de4160912dfedf9e52fadb4d46c8e867da"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformMatchSyntax.mapMatchStatement (cyclomatic 19): TransformMatchSyntax.mapMatchStatement has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 899, 891). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86ef95e4c91d6a51819fc72b800b665ba6dfbdc365d6e2bd8c962773b7a8ccc"}},{"ruleId":"D1","level":"warning","message":{"text":"getTransforms.EnumImpl (cyclomatic 19): getTransforms.EnumImpl 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"920d4f82e8d5c24ad1ec95154aa0d0c6da84bcc4bb12aabc1a3abceffe3f8085"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_cli_support::ast_command::main (cyclomatic 18): flow_cli_support::ast_command::main has cyclomatic complexity 18 (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":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"523f189ff1b9e2218f8d60f33fd2a9aab2f364f70b332536a0b2720dff6b1b76"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_cli_support::ls_command::main_impl (cyclomatic 18): flow_cli_support::ls_command::main_impl has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a27cc0948fd5e32c5aec20341f88fd65149b1c352f6eabe7a6c7bba22050745"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::comment::comment_mutator::add_comment_to_text (cyclomatic 18): flow_dev_tools::comment::comment_mutator::add_comment_to_text 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":"rust_port/crates/flow_dev_tools/src/comment/comment_mutator.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3481f13fbd1c183fe9459dfd224a9895a70b994bef4afde4b6cb95d17a67e8e0"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::mk_type_env (cyclomatic 18): NameResolver::mk_type_env has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"084b3bce6322a4c441389797c77abb863db2b2d2fb1f022a70200f1aafcc2dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::normalize_total_refinements (cyclomatic 18): NameResolver::normalize_total_refinements has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (recur, nnf). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6752}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feeed0228a851954315abf3ae86f70dea1bcf993265cc3af74141567f2a9215"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_error (cyclomatic 18): flow_lsp_server::flow_lsp::main_handle_error has cyclomatic complexity 18 (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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602c00a8c66b596f75e1f91b0b3b3c9200ae0354c7cf41945a1ce46e5658cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::object_parser::class_element::accessor (cyclomatic 18): flow_parser::object_parser::class_element::accessor has cyclomatic complexity 18 (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. This shape REPEATS in the file: 2 other methods here (flow_parser::object_parser::class_element, flow_parser::object_parser::class_element::init) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fba50e0fba87d0cf4d500c041e7a4ac04cdf63c6600b80029155b28a9482783"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::pattern (cyclomatic 18): Writer::pattern 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/patterns.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4fabca741061f200d3bba1596f02f7d23f79e150b0ada2dbb99fb27ee4fd9e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::layout::fuse_with_space (cyclomatic 18): flow_parser_utils_output::layout::fuse_with_space has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function items inside it that branch (ugly_char, helper). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4c84a4c30df6d3100e9e23cf786bd731f62b6a8efbca0334b4168cae4a5ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::layout::fits (cyclomatic 18): flow_parser_utils_output::layout::fits has cyclomatic complexity 18 (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":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfb2464a1438a915d0bfad5089e042dd6a997a7426403902cafa17dabd0bd40"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_utils_output::pretty_printer::fits (cyclomatic 18): flow_parser_utils_output::pretty_printer::fits has cyclomatic complexity 18 (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":"rust_port/crates/flow_parser_utils_output/src/pretty_printer.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b0e9da73fe895c0ce910f7901428520fc4fe0c820a3397b65133e4e7cd3540"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::print_mechanical_deserializer (cyclomatic 18): flow_parser_wasm::bin::codegen::print_mechanical_deserializer has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1498c5942e2cbf1400325f49ee2b0de757fc049a9aa3702d137416c4731f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::generate_estree_predicates (cyclomatic 18): flow_parser_wasm::bin::codegen::generate_estree_predicates has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"632560a90748475f6ec8781f92ac1d9ac09787779a3ffce01f2b032bc9cfb9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportInformationExtractor::import_declaration (cyclomatic 18): ImportInformationExtractor::import_declaration has cyclomatic complexity 18 (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":"rust_port/crates/flow_services_code_action/src/document_paste.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a459192b0bea9e3ff1c2f616de6347e4926ffb7036e1c8960a85ffd16d2eaf5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Searcher::export_named_declaration (cyclomatic 18): Searcher::export_named_declaration 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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6063692efe1349647c6a20ff984f6b30fdf7c3c3ee06568b92bb9007404e019"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn (cyclomatic 18): flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn has cyclomatic complexity 18 (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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"63473de57ebf7200e06be503b8a32754fd2358c432d3ecfe9e1375ad21f62a18"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::check_multiplatform_conformance (cyclomatic 18): flow_typing::merge::check_multiplatform_conformance 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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed44f949932661c81ca9eff0201351ee904f42ab34e3ee621c172033bef0d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::propagate_any (cyclomatic 18): Walker::propagate_any has cyclomatic complexity 18 (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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f67c918ce33eec5180c88beda7e3b46f08c74fb25b4386526c6622669a38d4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::perform_lookup_action (cyclomatic 18): flow_typing_flow_js::flow_js::helpers::perform_lookup_action has cyclomatic complexity 18 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4193d72718300c6b9a48d9255aade2a3c001fb96d77b35cea6b1ca84a84e7073"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args (cyclomatic 18): flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de253f96211aa8f1b1cf1ff9dafc7af70dd7b057cd9a559dc67669dd5592fae"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::intersect_slice_contents (cyclomatic 18): flow_typing_flow_js::slice_utils::intersect_slice_contents has cyclomatic complexity 18 (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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a09a75f99b1e02fb630e3c2238086368ff21fbb8481a94112ef657001df6a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::class_sig::supertype (cyclomatic 18): flow_typing_statement::class_sig::supertype has cyclomatic complexity 18 (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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2052f29656d4a50fdad5f80daf5d8a84b38d5bb92ad3e0517aadac10c4833e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::variable (cyclomatic 18): flow_typing_statement::statement::variable 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b731bc6cb9e3c281333b97cb2c5ed1adba5ee58c2a87d437c561520a24ab2a3e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::inline_interface (cyclomatic 18): flow_typing_ty_normalizer::normalizer::type_converter::inline_interface has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (has_implicit_receiver, extends, construct_props). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_ty_normalizer::normalizer::type_converter::type_destructor_unevaluated (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db751aaa73bcbe07401f44571a4bd640afb21cdb23d44df9b35544cac98413"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_interface (cyclomatic 18): flow_typing_utils::type_sig_merge::merge_interface has cyclomatic complexity 18 (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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4388}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb739bd835dd73ab977b32693ae30382f67532953c6aafc72c3908e04943c024"}},{"ruleId":"D1","level":"warning","message":{"text":"flowDefToTSDef.getTransforms.EnumImpl (cyclomatic 18): flowDefToTSDef.getTransforms.EnumImpl has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: flowDefToTSDef.getTransforms.translateType (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c352204f474ae034d44f10cfcd672c85131222528e016cedb4449226ecd27e80"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_ty::ty_debug::dump_decl (cyclomatic 17): flow_common_ty::ty_debug::dump_decl 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_common_ty::ty_debug::string_of_ctor_t (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed0e25d06ff9449f104c3b8b04d04e7347688102b7f94640265ab3307dd806"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common_utils::utils_js::typo_suggestion (cyclomatic 17): flow_common_utils::utils_js::typo_suggestion has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function items inside it that branch (typo_suggestions::distance, typo_suggestions::fold_results, typo_suggestions). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/utils_js.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406c737524148c674606845087fc2b69434c98ff05472789a64fc57d140c19e"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::visit_function (cyclomatic 17): DefFinder::visit_function has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::name_def::definition_reference_kind (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"a172f0f9bfcc32943294c6636614aa35efc309d5918920cf969563ef60943ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::member_expression_refinement_must_be_able_to_refine_base_object_to_non_maybe (cyclomatic 17): NameResolver::member_expression_refinement_must_be_able_to_refine_base_object_to_non_maybe 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ec282ce6ad42ad07323d7188229a4eee2d349e42df2de1eb2ad9395011f51"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_component_params (cyclomatic 17): flow_parser::declaration_parser::parse_component_params has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function items inside it that branch (param, param_list). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf40f54268f648b5b8ecc8ea1b3d587097a77ef38b55ad5f40234024cce45ec4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser::flow_lexer::consume_jsx_entity (cyclomatic 17): flow_parser::flow_lexer::consume_jsx_entity 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_parser::flow_lexer::decode_html_entity (cyclomatic 254) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"817195b8357893ee912eae0649d8a7d614bfb0ddcf0f10bf7e9df9035cd666e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_enum_body (cyclomatic 17): Serializer::serialize_enum_body 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 (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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3776}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8724817e65b429f4912f22ac43fb64bdc45294037a6436d871dc668b48f7b5"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::generate_estree_visitor_keys (cyclomatic 17): flow_parser_wasm::bin::codegen::generate_estree_visitor_keys 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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0b3dd2086f69eac42ee51ab8f212e0ba01a716758b9e416309f6f2948c32f4"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_module::commit_modules (cyclomatic 17): flow_services_module::commit_modules has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (commit_haste, commit_file). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"5615f5cff586d9983b6b1140c94d0afb0a0488b18cb52f03ce687e974f597e56"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::merge::check_strict_comparison (cyclomatic 17): flow_typing::merge::check_strict_comparison has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"46351b2d84708ff08b67fb655cfa4de97cf9249bbb18caf5e0167b0dd02098d0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::concrete_type_eq::eq_swap_reason (cyclomatic 17): flow_typing_flow_common::concrete_type_eq::eq_swap_reason 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 (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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b82bd80a98e75223df918f86ec7a65652644ea4488b4294eaecc2f7a4f3e83"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::collect_prototype_t::go (cyclomatic 17): flow_typing_flow_common::flow_js_utils::collect_prototype_t::go 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83a5b80ee288879f7e216135211a871c7f9a11f7d80c7f9b9875fc0ffee6718"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::is_builtin_class_id (cyclomatic 17): flow_typing_flow_common::flow_js_utils::is_builtin_class_id 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5709732eadc7cde4775245a84dc95adcba701de05664f05a07ef774120b1d0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::wraps_utility_type::loop_inner (cyclomatic 17): flow_typing_flow_common::flow_js_utils::wraps_utility_type::loop_inner 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6f215abaf6c9feae132e3f5ccd164b02ec9f8dd104454d147831bd7c7122a"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env (cyclomatic 17): flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5525}}}],"partialFingerprints":{"codehealthFindingId/v1":"0383185a6d009b0f89c3fb1d3891c5134a5c83a038222891949ad4f52de4d1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::import_type_t_kit::canonicalize_imported_type (cyclomatic 17): flow_typing_flow_common::flow_js_utils::import_type_t_kit::canonicalize_imported_type 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4635}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a91f3cb5c86e4762e1be56d2a8025f1491acb560ef7b597313e3cb541fb382"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::merge_upper_bounds (cyclomatic 17): flow_typing_flow_js::implicit_instantiation::merge_upper_bounds 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"477bffad4a5b4eaab86242ddf6cf13a705764a1e5eeb2e65abc1d87f42952db5"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_targs_once (cyclomatic 17): flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_targs_once 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 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee8d55bb241495be468d62dae91169d79860dfdf75c67a6e8c1144af89872fd"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::object_kit::compute_name_remap (cyclomatic 17): flow_typing_flow_js::object_kit::compute_name_remap 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 (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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ddc922538971afb1fb8902ef872a329d80c0e44f81cddb4237bb70d9391ed"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::export_specifiers (cyclomatic 17): flow_typing_statement::statement::export_specifiers 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 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebad159084f7c9c7b2fb7615fae7353c5ba9ab702cc751b7ec179ec80df2ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::mk_component_sig (cyclomatic 17): flow_typing_statement::statement::mk_component_sig has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (mk_param, mk_rest, mk_params, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19826}}}],"partialFingerprints":{"codehealthFindingId/v1":"905b65c5578b0f98d09282765e0aaa2055cfd3b2a398c1161ccfa3e11555c6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"OptUseT::eq (cyclomatic 17): OptUseT::eq 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 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_type::type_::string_of_use_ctor (cyclomatic 75) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1c64bfda7d48822df8cfdccdc2fc8cf2cee7d9806780422033557581ad3cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_type::type_::union_rep::disjoint_union_optimize (cyclomatic 17): flow_typing_type::type_::union_rep::disjoint_union_optimize has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (almost_unique_values, intersect_props, base_props_of, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_type::type_::string_of_use_ctor (cyclomatic 75) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecd82c747a532719070d00fc74f52e3aa1fe70a063c1e44f6430c7ba6206527"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_env::maybe_predicate_function (cyclomatic 17): flow_typing_utils::type_env::maybe_predicate_function has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function items inside it that branch (on_ground, on_t, on_concrete, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5d2c4db3ed1ce691e86027863d696586388970284430eedd5a120849dfc17c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_env::read_entry (cyclomatic 17): flow_typing_utils::type_env::read_entry 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 (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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9824c58a559a1ff8a985e8bb33fe5c56c460e94bf5896281efdd96e3efca48b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_filter::array_length (cyclomatic 17): flow_typing_utils::type_filter::array_length 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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27db083fe402f56e48a55894c956232bee559c1abea9c5af38c85313bfde98"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_interface_extends (cyclomatic 17): flow_typing_utils::type_sig_merge::merge_interface_extends has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac971b90ba3a94601ecf6a66f0ee82b473a64288f7987ef8b745b9814d2943"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_visitor::destructor_default (cyclomatic 17): flow_typing_visitors::type_visitor::destructor_default 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 (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":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e70cc79bc8066037c1712da42ddcfe3921dde40f1c660b7ca53c8af9a99345"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeBase.isStrictScope (cyclomatic 17): ScopeBase.isStrictScope has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong 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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a87da06f2454f310bc52407661e18a6559889285cb155a365cca1e23ee2b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"StatusBarWidget.render (cyclomatic 17): StatusBarWidget.render 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":"packages/flow-for-vscode/src/FlowLanguageClient/StatusBarWidget.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf570f89125b9bc22cda91c6101d04b92d41c45420029fbfcbf369b7b561de7"}},{"ruleId":"D1","level":"warning","message":{"text":"runnable-wasm.flowToRunnableJSWithSourceMap (cyclomatic 17): runnable-wasm.flowToRunnableJSWithSourceMap 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":"packages/flow-remove-types/runnable-wasm.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6636ed696a2233f4847b395b66d379e5a4fa55404740b510737efd1054b92"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_cli_support::stop_command::main (cyclomatic 16): flow_cli_support::stop_command::main 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":"rust_port/crates/flow_cli/src/stop_command.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5db5c1192405f3790bd57713300d8dc754e70d9db4f123268fb7aba3a47ff6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotateExportsMapper::map_class_element (cyclomatic 16): AnnotateExportsMapper::map_class_element has cyclomatic complexity 16 (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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f458514f7e62e6ddfa33e388efa746e0efc1c700ab1a46091b8d761c2dcd89"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_command_utils::make_options (cyclomatic 16): flow_command_utils::make_options has cyclomatic complexity 16 (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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec13476cdb99b2a885643cbb5d11c380b17ac736b85c090c542c37d30b6603"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_common::js_number::ecma_string_of_float (cyclomatic 16): flow_common::js_number::ecma_string_of_float 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":"rust_port/crates/flow_common/src/js_number.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"28550148f280e072d1f7da453511766ffa960080764ca7580f65d69e9073c229"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::runtests::check_website::render_snapshots (cyclomatic 16): flow_dev_tools::runtests::check_website::render_snapshots 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":"rust_port/crates/flow_dev_tools/src/runtests/check_website.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28e506cabdad4cd1d6d3a8478a6f2169b2c64305f1a9e495c13c61970863bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_dev_tools::update_suppressions::update_suppressions::runner (cyclomatic 16): flow_dev_tools::update_suppressions::update_suppressions::runner 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":"rust_port/crates/flow_dev_tools/src/update_suppressions/update_suppressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61d57f6b5329a804d7b5106bf1879b88a53a4a3874b8e8a9583ffcc2152fca6"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::class_internal (cyclomatic 16): DefFinder::class_internal 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::name_def::definition_reference_kind (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf1aa6ed988ec02e15f03c404b8c48e8f118d2214c70928f39eb7193232944a"}},{"ruleId":"D1","level":"warning","message":{"text":"DefFinder::visit_call_expression (cyclomatic 16): DefFinder::visit_call_expression has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::name_def::definition_reference_kind (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f1953bbbe31f2999bf51dc7d625d381a500196b2d206c7a3a67f6ecc079ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::find_providers::join_envs (cyclomatic 16): flow_env_builder::find_providers::join_envs has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (join_entries, join_scopes). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::find_providers::extended_state_opt (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c34988e0c88866a8152f58085068262024b2478d99f32715b816ab19781ecb7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::find_providers::simplify_providers (cyclomatic 16): flow_env_builder::find_providers::simplify_providers has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::find_providers::extended_state_opt (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc24461259b6e85da20e335d65fd55d4fbb68f38830dddc07b1d38618a77fad1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_env_builder::name_def_types::print::on_hint (cyclomatic 16): flow_env_builder::name_def_types::print::on_hint has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder::name_def_types::print::string_of_source (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def_types.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"507a230434fe6dd4d6de974add0551f12687f3d8532487d25ef1e04a5075b65b"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::merge_conditional_branches_with_refinements (cyclomatic 16): NameResolver::merge_conditional_branches_with_refinements 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":5070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e3fa65d2df2854e8bfa550a36c48f55a0f16bd5486e7a4e09b05b1dbf2fa8"}},{"ruleId":"D1","level":"warning","message":{"text":"NameResolver::maybe_prop_nullish (cyclomatic 16): NameResolver::maybe_prop_nullish has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_env_builder_resolver::name_resolver::error_for_assignment_kind (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b150e5c980824a7841df0fd1a292e36e83b1633b49cc16ae5837b9609c97466"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentLowerer::map_statement_list_inner (cyclomatic 16): ComponentLowerer::map_statement_list_inner 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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c842ba2c270d9f8f6974ecfbf67252eeb7eb9af0ea9849430f5e183ecb1a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializer::serialize_export_named_declaration (cyclomatic 16): Serializer::serialize_export_named_declaration has cyclomatic complexity 16 (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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"7410192ad1373a18862446676a187fdc0d21bc149045c70bc22ab826894bd70b"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor::internal_start (cyclomatic 16): flow_server_monitor::flow_server_monitor::internal_start has cyclomatic complexity 16 (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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"486213dbaaf47d694f19098b94819a656de8c1ca2f80ade789336cd28c573923"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_autocomplete::autocomplete_service_js::autocomplete_unqualified_type (cyclomatic 16): flow_services_autocomplete::autocomplete_service_js::autocomplete_unqualified_type has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: flow_services_autocomplete::autocomplete_service_js::string_of_autocomplete_type (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc071c418054075f5d7c08f557ad091a502bc9000806568a11fdf9d7991d1851"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_autocomplete::autofix_imports::update_import (cyclomatic 16): flow_services_autocomplete::autofix_imports::update_import 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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d1f37fad76e137f09cc5f9441b3de0de2bfe5c849af05cbe0fce0fa222dbe4"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeNormalizationHardcodedFixesMapper::on_t (cyclomatic 16): TypeNormalizationHardcodedFixesMapper::on_t has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: StylizeTyMapper::on_union (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6406d59cbdf40d84d0f9a3965f96b93847f9d34ef27b44ceb0987a64c741c288"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_services_code_action::autofix_imports::update_import (cyclomatic 16): flow_services_code_action::autofix_imports::update_import 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":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5335e9d951f3fb4a6af65c55d495ce0889a13650a8bb168fe388b2ad6c8118"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageFolder::statement (cyclomatic 16): CoverageFolder::statement has cyclomatic complexity 16 (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":"rust_port/crates/flow_services_coverage/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c7413af896d25f6292c3cbed75ef17909ad2cdc612fbaf12841bf005431824"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_hint (cyclomatic 16): flow_typing::env_resolution::resolve_hint has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (resolve_hint_node). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2654e878e7aa00937879029c56cb974dc561fc0a7ef6184c8070cebb217b6750"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing::env_resolution::entries_of_def (cyclomatic 16): flow_typing::env_resolution::entries_of_def has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0403a3f95071f273195873ba0b44d1cc408b1616090fa5280fddd84508a14ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::union_optimization_guard::union_optimization_guard_impl (cyclomatic 16): flow_typing_flow_common::flow_js_utils::union_optimization_guard::union_optimization_guard_impl 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_flow_common::flow_js_utils::error_message_loc_of_upper (cyclomatic 52) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"767411b7446579ccb4f353f65f9fe5d182d2c9628b4713fb736c3b1ee54da7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::pin_bounds (cyclomatic 16): flow_typing_flow_js::implicit_instantiation::walk::pin_bounds has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: Walker::head_at (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":7248}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ca39ad009e05567f9682809b30dacdf456492b4b688cad2fe55cfeaef6489"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::react_kit::props_to_tout (cyclomatic 16): flow_typing_flow_js::react_kit::props_to_tout has cyclomatic complexity 16 (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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba56e840bf3c7cc26cc24058684c906d4a7057f3697ade1773fa5f735dac3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut (cyclomatic 16): flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut 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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a7627c5c35c31321e6ba8bd31b68c7e4d7cf7ab0bea24115ff82b09c25ab1e"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectExpressionAcc::add_computed (cyclomatic 16): ObjectExpressionAcc::add_computed 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1169560acbd22366d0662c8c64d4fb78dc22eea7ce8ecadfca34f1a4fdd3359e"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::class_sig::merge_tparam_polarities (cyclomatic 16): flow_typing_statement::class_sig::merge_tparam_polarities 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca2ed7434439f0ea42f57ff8392cf2a13ae164e553f86989c2e54b40409f7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_statement::statement::op_assignment (cyclomatic 16): flow_typing_statement::statement::op_assignment has cyclomatic complexity 16 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3264393f5696afa56fef1c2fb1866e2bdc45eb9233fd55cb2f9509a065c725"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::annotation_inference::elab_t_wildcard_op (cyclomatic 16): flow_typing_utils::annotation_inference::elab_t_wildcard_op 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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"67be67fb3a1d7882ac1799ec7b2269ecefd946017ea9fc1b6050fcd6ed53612c"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test (cyclomatic 16): flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4a88295bf0a8b12df003ac6e7dcf3f6ba3126d65f59b972ac988758d8ddd1f"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::eq_test (cyclomatic 16): flow_typing_utils::predicate_kit::eq_test 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. This is NOT this file\u0027s highest cyclomatic complexity: flow_typing_utils::predicate_kit::predicate_no_concretization (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3643}}}],"partialFingerprints":{"codehealthFindingId/v1":"43affce2ff39004591395e3d378481fb5b19b0011e679480bd7a3ac9cec500d1"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::strict_es6_import_export::gather_declarations (cyclomatic 16): flow_typing_utils::strict_es6_import_export::gather_declarations has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb189cfed09b017ba56617251c1b4b40499efee766c86e16ec944a69d0a2012"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::type_assertions::has_nontrivial_this_param (cyclomatic 16): flow_typing_utils::type_operation_utils::type_assertions::has_nontrivial_this_param has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f823ed8c130929e34f4f28194bb878deb9351b5c2a6b761ae12feec1da00794"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_exports (cyclomatic 16): flow_typing_utils::type_sig_merge::merge_exports has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (copy_star_exports, merge_star, copy_named_exports_star, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdd26ba71d936cb0edb7d78d287450e6fc0cf36b3740347151cbb6f125b7290"}},{"ruleId":"D1","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::union_flatten::flatten_into (cyclomatic 16): flow_typing_visitors::type_mapper::union_flatten::flatten_into has cyclomatic complexity 16 (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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2412e5715a5e55485388503c2fe024b69f30f132f2d08dc65c740ae097814bb"}},{"ruleId":"D1","level":"warning","message":{"text":"index.flowRemoveTypes (cyclomatic 16): index.flowRemoveTypes 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":"packages/flow-remove-types/index.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae13fc63dbe94a5b43557c017ccd267deb1a38c47b922a8af9309cbcdd8487ce"}},{"ruleId":"D1","level":"warning","message":{"text":"util.skipNewline (cyclomatic 16): util.skipNewline 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":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"077841743fd6a97adedd93c986ec9fa73f31ce7e42705e0ff5e5b12c4d2d53f5"}},{"ruleId":"D1","level":"warning","message":{"text":"mapComponentParameters (cyclomatic 16): mapComponentParameters has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"17be51cba849b99c424c68b077538ffa16aa10d5330811b7fe53b50fad67a043"}},{"ruleId":"D1","level":"warning","message":{"text":"describeNodeForDebugging (cyclomatic 16): describeNodeForDebugging has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56bc8ee7af1227158fe5742262bbd2ec307610b0488b8ae94d374a5e56f75c"}},{"ruleId":"D1","level":"warning","message":{"text":"getOptions (cyclomatic 16): getOptions 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":"packages/flow-parser/oxidized-src/index.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a44c354d9cedbbf2a685846ca7fa45d3d4fb6feab8a19300c1b47041206c309"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::dispatch::__flow_impl (cognitive 646): flow_typing_flow_js::flow_js::dispatch::__flow_impl has cognitive complexity 646 (threshold 15). Drivers by points: if/else 141 (282 pts), match/switch 109 (254 pts), loops 31 (65 pts), boolean chains 45 (nesting depth added 320). Of this number, 644 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3626dfa5bfce40173e46a0c346f93ba9013a8da26893750743f31ad71024fca8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::to_printable_error (cognitive 569): flow_typing_errors::intermediate_error::to_printable_error has cognitive complexity 569 (threshold 15). Drivers by points: if/else 159 (273 pts), match/switch 124 (231 pts), loops 21 (58 pts), boolean chains 7 (nesting depth added 258). Of this number, 547 points are the body\u0027s own statements and 22 belong to 6 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe7b50c56a54265e98143a7b6bdc0c1e9f58e2fe54a6e40c0f3523f116c118"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::mk_class_sig (cognitive 353): flow_typing_statement::statement::mk_class_sig has cognitive complexity 353 (threshold 15). Drivers by points: if/else 62 (184 pts), match/switch 48 (152 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 228). Of this number, 318 points are the body\u0027s own statements and 35 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0670526e0bd63f7dd00d2a3d5652854b7bc5ae8df6b8946edd82446ae2b3f5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::add_interface_properties (cognitive 321): flow_typing_statement::type_annotation::add_interface_properties has cognitive complexity 321 (threshold 15). Drivers by points: if/else 58 (197 pts), match/switch 22 (109 pts), boolean chains 13, loops 2 (nesting depth added 226). 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fba430895bf6939299f7e9748570b0a8830687ca5e3418f2a314e2b8e7cf4b"}},{"ruleId":"D2","level":"warning","message":{"text":"flowDefToTSDef.getTransforms (cognitive 321): flowDefToTSDef.getTransforms has cognitive complexity 321 (threshold 15). Drivers by points: if/else 89 (165 pts), ternaries 50 (72 pts), boolean chains 45, match/switch 14 (25 pts), loops 10 (14 pts) (nesting depth added 113). Of this number, 231 points are the body\u0027s own statements and 90 belong to 21 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5204b0a0f0792fe1f2ce2793811c335a71e9a195098bde3006a67184360ef838"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::rec_sub_t (cognitive 295): flow_typing_flow_js::subtyping_kit::rec_sub_t has cognitive complexity 295 (threshold 15). Drivers by points: if/else 75 (157 pts), match/switch 35 (83 pts), boolean chains 36, loops 9 (19 pts) (nesting depth added 140). Of this number, 293 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efb8222a36ce944d1db9f6331206c7862916a9e3589e36119395e8339696440"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_inner (cognitive 235): flow_typing_statement::type_annotation::convert_inner has cognitive complexity 235 (threshold 15). Drivers by points: match/switch 38 (115 pts), if/else 33 (84 pts), boolean chains 22, loops 7 (14 pts) (nesting depth added 135). 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38a68518330bfc0846f170ed104f10b51a9f45b66ba59b4bcf5fa401a6ec58"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::statement_list (cognitive 230): DefFinder::statement_list has cognitive complexity 230 (threshold 15). Drivers by points: if/else 68 (217 pts), loops 7 (20 pts), match/switch 6 (15 pts), boolean chains 10 (nesting depth added 171). 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. This shape REPEATS in the file: one other method here (DefFinder::statement_list::extract_func_static_assign) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b19dceb9e53dd0175e77fc3d774c5f9c3bf088e8a5d5b85596426ce11aba64"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::statement_ (cognitive 226): flow_typing_statement::statement::statement_ has cognitive complexity 226 (threshold 15). Drivers by points: match/switch 46 (111 pts), if/else 44 (91 pts), boolean chains 18, loops 3 (6 pts) (nesting depth added 115). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0c48014b9931508793037c1bd13f808d4b54c3b07d1acef3943f314fa92be2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot (cognitive 191): flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot has cognitive complexity 191 (threshold 15). Drivers by points: if/else 35 (77 pts), match/switch 25 (61 pts), loops 18 (37 pts), boolean chains 16 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd21209283a4ff86f5365b84884d9ee545d03c1d0f21e2752f50d3405d9c6a01"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::expression_ (cognitive 178): flow_typing_statement::statement::expression_ has cognitive complexity 178 (threshold 15). Drivers by points: match/switch 30 (77 pts), if/else 27 (71 pts), boolean chains 19, loops 4 (11 pts) (nesting depth added 98). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"494502f61ddbf934d9a680aac7fe08a7b6762c91c1d1f2a75cc094c00d200141"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::token_base_inner (cognitive 165): flow_parser::flow_lexer::token_base_inner has cognitive complexity 165 (threshold 15). Drivers by points: if/else 65 (130 pts), boolean chains 16, match/switch 5 (10 pts), loops 3 (9 pts) (nesting depth added 76). 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"a180435f2193955b2502683f5257af009c29816a3ef8cd73dc4d965633e6b81c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl (cognitive 158): flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl has cognitive complexity 158 (threshold 15). Drivers by points: if/else 63 (123 pts), match/switch 10 (24 pts), boolean chains 11 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_typing_errors::intermediate_error::make_intermediate_error) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"352b4a0fc12090b708457fd6ffdbba9ef224f580af1787656b50678573508b64"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::code_action_service::ast_transforms_of_error (cognitive 154): flow_services_code_action::code_action_service::ast_transforms_of_error has cognitive complexity 154 (threshold 15). Drivers by points: if/else 86 (132 pts), match/switch 10 (21 pts), boolean chains 1 (nesting depth added 57). 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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eee4bb17c1e1fe93985e321dfef663c008cd99de4ab1d04888faadf303e8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_debug::dump_error_message (cognitive 153): flow_typing_debug::dump_error_message has cognitive complexity 153 (threshold 15). Drivers by points: match/switch 87 (153 pts) (nesting depth added 66). Of this number, 151 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b93ba6cc88ea60e689a01834d455b68ab8cee54222ee0ae8c2ab4b17bb913f"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms (cognitive 147): getTransforms has cognitive complexity 147 (threshold 15). Drivers by points: if/else 49 (53 pts), ternaries 44 (52 pts), boolean chains 16, match/switch 13 (16 pts), other 6, loops 4 (nesting depth added 15). Most of this is not in the body itself: 5 of the 147 points are its own statements and the rest belongs to 96 function items inside it that branch (_translateIntoObjectMethod, Literal, TSImportType, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c148655d3906c3943fc829e4f8110c8d2b507d7eca05ef20eb5749e971a240"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::annotation_inference::elab_t_concrete (cognitive 140): flow_typing_utils::annotation_inference::elab_t_concrete has cognitive complexity 140 (threshold 15). Drivers by points: match/switch 26 (68 pts), if/else 21 (45 pts), boolean chains 24, loops 1 (3 pts) (nesting depth added 68). 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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"022fbd55cdc0201841324c61e15fde6134ec672200eefda8518731cb888448e9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::flow_obj_to_obj (cognitive 139): flow_typing_flow_js::subtyping_kit::flow_obj_to_obj has cognitive complexity 139 (threshold 15). Drivers by points: match/switch 24 (68 pts), if/else 28 (62 pts), boolean chains 8, loops 1 (nesting depth added 78). 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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd0e679f3c4834567a8ba8204e6b32f4cc449f63a3b65c00e770d9598d0b7da"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::module_info_analyzer::visit_toplevel_statement (cognitive 135): flow_typing_statement::module_info_analyzer::visit_toplevel_statement has cognitive complexity 135 (threshold 15). Drivers by points: if/else 30 (87 pts), match/switch 14 (37 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 85). 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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f59ade1e43c736dcfbc2ef12b58b4d2952dcaff4eb5ef02afb1a32514ade0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::members::merge_type (cognitive 128): flow_typing_utils::members::merge_type has cognitive complexity 128 (threshold 15). Drivers by points: if/else 23 (58 pts), match/switch 13 (45 pts), loops 4 (13 pts), boolean chains 12 (nesting depth added 76). 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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a89d2552398746ac8d7731df584fbd633638737eaaf4bc357dffff414975bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_structural (cognitive 114): Walker::walk_structural has cognitive complexity 114 (threshold 15). Drivers by points: if/else 21 (52 pts), loops 11 (23 pts), boolean chains 21, match/switch 9 (18 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5be3e8cd8bae13c4e70cbbd5800d894c9e8bab4c131a79b05cf34a7e45a19bb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::build_ordering (cognitive 112): flow_env_builder_resolver::name_def_ordering::build_ordering has cognitive complexity 112 (threshold 15). Drivers by points: if/else 18 (56 pts), loops 13 (43 pts), match/switch 3 (12 pts), boolean chains 1 (nesting depth added 77). Of this number, 77 points are the body\u0027s own statements and 35 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432b5b6f39fb43fc3d2b069344fc585b832f8e2661c153991377fc19d2f7bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::optional_chain (cognitive 110): flow_typing_statement::statement::optional_chain has cognitive complexity 110 (threshold 15). Drivers by points: match/switch 32 (61 pts), if/else 18 (35 pts), boolean chains 10, loops 4 (nesting depth added 46). Of this number, 90 points are the body\u0027s own statements and 20 belong to 5 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2a0ec64f3abc3bdb2225cc544716a9c54cd1278a42cd8c4c15e5f9575b218d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_annot (cognitive 105): flow_typing_utils::type_sig_merge::merge_annot has cognitive complexity 105 (threshold 15). Drivers by points: match/switch 28 (73 pts), if/else 10 (20 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 60). 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0793d221f17c6ebfd5a1be362c0410fb4129b0686f19744049c857b8b402a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::class_def (cognitive 102): flow_type_sig::type_sig_parse::class_def has cognitive complexity 102 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 13 (41 pts), boolean chains 12, loops 2 (3 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11788}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87058189384c726fbdff9cad0223d36431f33f28e2a1c036c5f00a265b5e98b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::export_declaration::parse (cognitive 99): flow_parser::statement_parser::export_declaration::parse has cognitive complexity 99 (threshold 15). Drivers by points: if/else 26 (47 pts), match/switch 17 (42 pts), boolean chains 10 (nesting depth added 46). 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8869415ddd570c3f63d6500f9fde94f488bc0037581337fd9b325c3c22bd7b44"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_initialized_unsafe (cognitive 98): flow_lsp_server::flow_lsp::main_handle_initialized_unsafe has cognitive complexity 98 (threshold 15). Drivers by points: if/else 31 (70 pts), match/switch 11 (25 pts), loops 1 (3 pts) (nesting depth added 55). 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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1488e1f0605037e42cfd32e7848b5915b3bc448b32a984321771f653aae87bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::value_union_builder::of_type_inner (cognitive 97): flow_typing_utils::exhaustive::value_union_builder::of_type_inner has cognitive complexity 97 (threshold 15). Drivers by points: if/else 12 (43 pts), match/switch 8 (30 pts), loops 6 (23 pts), boolean chains 1 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd39ab295ccf7be0dc3ec1cf84e6844c740f43262fdc80f4d39c3491fa91d9"}},{"ruleId":"D2","level":"warning","message":{"text":"run_swebench.main (cognitive 97): run_swebench.main has cognitive complexity 97 (threshold 15). Drivers by points: if/else 32 (53 pts), loops 8 (17 pts), ternaries 7 (14 pts), boolean chains 10, error handling 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/run_swebench.py"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aa98139281344dff818052ef9fc60733bed0f5ad8bae822330dd66f8014cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::friendly::message_group_of_error::loop_ (cognitive 96): flow_common_errors::error_utils::friendly::message_group_of_error::loop_ has cognitive complexity 96 (threshold 15). Drivers by points: if/else 30 (58 pts), match/switch 12 (26 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 45). 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"9029c57d88d57aee000a13db12f2213a6f9839c7e6ea717f1aaf830487eadf3e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parsing::docblock_parser::extract_docblock::parse_attributes (cognitive 96): flow_parsing::docblock_parser::extract_docblock::parse_attributes has cognitive complexity 96 (threshold 15). Drivers by points: if/else 34 (87 pts), match/switch 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 58). 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":"rust_port/crates/flow_parsing/src/docblock_parser.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd6cc383bb50f6063f54ba1a76f4ab874535c0ca657b6ecd1dfe40d5703a58d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::expression (cognitive 91): flow_type_sig::type_sig_parse::expression has cognitive complexity 91 (threshold 15). Drivers by points: if/else 20 (61 pts), match/switch 11 (28 pts), boolean chains 2 (nesting depth added 58). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10357}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c33fe5b2d536e7d62f7f3b075f8a3a3e24cf70bb2d7f597c971f3f50bd6624"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_to_union (cognitive 89): Walker::walk_to_union has cognitive complexity 89 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 15, loops 6 (14 pts), match/switch 5 (12 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b8c23a33e1d01bf891eaed810655a99214f2d27a48801a539983242c895cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Substituter::type_ (cognitive 87): Substituter::type_ has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (51 pts), match/switch 9 (25 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"797a5faa5040e8342b7f086c928b7218dedebd63173cc66a2f7a542bd56411f5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_binding (cognitive 86): flow_typing::env_resolution::resolve_binding has cognitive complexity 86 (threshold 15). Drivers by points: if/else 23 (40 pts), match/switch 16 (36 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 43). Of this number, 75 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f7c655b394280efc32c4137b6efe64651ec3ffd6d6df1654c073421a894129"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::statement_fork_point (cognitive 85): Mapper::statement_fork_point has cognitive complexity 85 (threshold 15). Drivers by points: if/else 18 (48 pts), match/switch 10 (37 pts) (nesting depth added 57). 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":"rust_port/crates/flow_services_code_action/src/autofix_type_to_value_import.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf69b2e8546416e5c0bca32200656d466b70297c49b590e6b7f2b4736c4d595"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::check_polarity::check_polarity_impl (cognitive 84): flow_typing_utils::check_polarity::check_polarity_impl has cognitive complexity 84 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 9 (25 pts), match/switch 6 (13 pts), boolean chains 4 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aab688ace98778907c41a8d649965b21fa65756e4e215aab77d528f2663a34"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorMessage::friendly_message_of_msg (cognitive 81): ErrorMessage::friendly_message_of_msg has cognitive complexity 81 (threshold 15). Drivers by points: match/switch 23 (47 pts), if/else 18 (32 pts), boolean chains 2 (nesting depth added 38). 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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":9925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e62e8586b9de50d002fc9b56f9c577ec4bd019b7fd842bf1b21b8ae38d1d62d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::type_default (cognitive 81): flow_typing_visitors::type_mapper::type_default has cognitive complexity 81 (threshold 15). Drivers by points: if/else 40 (62 pts), match/switch 5 (9 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 28). 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f6c23d663dfcb3adaee870721db7387616e0d0ec80f70d329c45f98a12934c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::class_element (cognitive 80): flow_parser::object_parser::class_element has cognitive complexity 80 (threshold 15). Drivers by points: if/else 91 (138 pts), match/switch 31 (53 pts), boolean chains 32 (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (flow_parser::object_parser::class_element::accessor, flow_parser::object_parser::class_element::property_end_and_semicolon, flow_parser::object_parser::class_element::init) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbb80217e37da67579598ad5064faa8fc1d0856f0cb55605eed4d1ce9da4b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::type_app::singleton_poly (cognitive 78): flow_typing_ty_normalizer::normalizer::type_converter::type_app::singleton_poly has cognitive complexity 78 (threshold 15). Drivers by points: match/switch 12 (62 pts), if/else 6 (16 pts) (nesting depth added 60). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeffa9f61d193a4a7940f9a0cd42278e679482d0d5e314b442e7c8d3a06e917"}},{"ruleId":"D2","level":"warning","message":{"text":"recordRunner.runner (cognitive 78): recordRunner.runner has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (64 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 53). Of this number, 71 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da9bd0aa844c973b5534c4cd4d61b36cdb1a8447bb1217bdaac786e439e2610"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::filter_object_by_pattern (cognitive 77): flow_typing_utils::exhaustive::filter_object_by_pattern has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (48 pts), match/switch 7 (15 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bbbb714eb81a7063a16f491759fd0a1c207247a3437ef2c9485831ca5c5456"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::array_elem_check (cognitive 76): flow_typing_flow_common::flow_js_utils::array_elem_check has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (56 pts), match/switch 6 (16 pts), boolean chains 4 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3865c267c5adcd77ec44da200770924aaf0270973a9577b3f6938568c9a70e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype (cognitive 76): flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype has cognitive complexity 76 (threshold 15). Drivers by points: if/else 13 (38 pts), match/switch 10 (25 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"42edfb06776ce5eb2a6eec04ea5a96b80da2dae73baf950b542d8e3e0c435882"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::is_builtin_class_id (cognitive 74): flow_typing_flow_common::flow_js_utils::is_builtin_class_id has cognitive complexity 74 (threshold 15). Drivers by points: if/else 11 (54 pts), match/switch 4 (20 pts) (nesting depth added 59). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4099b5a1a7d7ca66c9d892f4a623e10ec750f9106c91cf65e28a39ce6e7a6e98"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::unification_helpers::__unify_inner (cognitive 73): flow_typing_flow_js::flow_js::unification_helpers::__unify_inner has cognitive complexity 73 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 5 (20 pts), loops 6 (18 pts), boolean chains 14 (nesting depth added 41). 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"44356fc33cdbc4a2e78898d5eb409d9d9ee970d7c8eb1dbe288dac8c1548a255"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::instanceof_test (cognitive 73): flow_typing_utils::predicate_kit::instanceof_test has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (42 pts), loops 4 (13 pts), boolean chains 12, match/switch 3 (6 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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c48f84acb16f2289793cf8d99212bb46b1900b27ba43b6f4fc4865a5cb4398c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references (cognitive 72): flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (51 pts), match/switch 5 (11 pts), boolean chains 8, loops 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08e418c9612bf99543446fd47bd9880525c0e92bba4e3edec240bcb099efdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::visit_match_pattern (cognitive 70): NameResolver::visit_match_pattern has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 12 (22 pts), loops 5 (6 pts) (nesting depth added 35). Of this number, 68 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d984b64848bba5c24b043cc88ab683e5cc68d630c0c5a032f3c5fb3dd8a3dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_object (cognitive 70): flow_typing_statement::type_annotation::convert_object has cognitive complexity 70 (threshold 15). Drivers by points: if/else 42 (80 pts), match/switch 22 (50 pts), boolean chains 9, loops 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_typing_statement::type_annotation::convert_object::named_property) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5677115cefd357a095e7b67adfd3c5de06d2e83a87783fe49669269228dfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_export::fuzzy_path::score_match::do_fuzzy_score (cognitive 68): flow_services_export::fuzzy_path::score_match::do_fuzzy_score has cognitive complexity 68 (threshold 15). Drivers by points: if/else 28 (52 pts), boolean chains 10, loops 4 (6 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_export/src/fuzzy_path/score_match.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f88ce452ab591fd9147b15758f468fa1352a59eedc7d2a7f6e5e8591cf64f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::files::make_next_files (cognitive 67): flow_common::files::make_next_files has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (50 pts), boolean chains 9, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 36). Of this number, 62 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4ba26376856833ba81ef7c542777a6dc5652740dde37d648426cce37dfa7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::estree_translator::statement (cognitive 67): flow_parser::estree_translator::statement has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 24 (49 pts), if/else 8 (18 pts) (nesting depth added 35). Of this number, 59 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ea8ff7d75cba8d1d7832e192fa05af9a9c64ba9cd64175363dc4a4d64d8c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Annot::iter (cognitive 67): Annot::iter has cognitive complexity 67 (threshold 15). Drivers by points: loops 11 (28 pts), if/else 8 (20 pts), match/switch 9 (19 pts) (nesting depth added 39). 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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eb535d7a672a0642d0b1770430ceb465764e0e487b218087ac91e7e15969ca"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::main_parser::check_for_duplicate_exports (cognitive 65): flow_parser::main_parser::check_for_duplicate_exports has cognitive complexity 65 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 6 (21 pts), match/switch 7 (15 pts), boolean chains 1 (nesting depth added 42). Of this number, 49 points are the body\u0027s own statements and 16 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7393e145f2531bacb6b9e31ecd3450508ef6102f50af481d83a4469bc8ee68"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::map_object (cognitive 65): flow_typing_flow_js::slice_utils::map_object has cognitive complexity 65 (threshold 15). Drivers by points: match/switch 17 (42 pts), loops 4 (14 pts), if/else 5 (9 pts) (nesting depth added 39). 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a948a1c1948e6d54f60758b1dce9748983bf4b7b23d29637f50e51003f4daf6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::perform_type_cast_with_env (cognitive 65): flow_typing_utils::type_operation_utils::perform_type_cast_with_env has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 10 (18 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"0239ad8d99c3ca2aa9de2428655691ef9912197a30051881b3b58bcbaf3ff825"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::maybe_special_unqualified_generic (cognitive 64): flow_type_sig::type_sig_parse::maybe_special_unqualified_generic has cognitive complexity 64 (threshold 15). Drivers by points: match/switch 29 (57 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 29). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd68fbb61526bc7f9b47a97422f60e12f50a5bef88ef2550bcb11a1491c019ec"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array (cognitive 64): flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 10 (23 pts), loops 2 (6 pts), boolean chains 5 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args, flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_call_arg::flatten) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"72292a17b7b8c07463e2660a08ff2552f410e1db456d2844031cb347ca62c503"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::prop_exists_test_generic (cognitive 64): flow_typing_utils::predicate_kit::prop_exists_test_generic has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (41 pts), match/switch 6 (16 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 39). 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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"438f4b9c02077afb9f95665ca14b6f4c8db3c88879bee0c841ac9c38784c0134"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::parser_env::peek::offset_after_current_trivia (cognitive 63): flow_parser::parser_env::peek::offset_after_current_trivia has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (44 pts), loops 4 (10 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d598b133a9637ba83513014cc60131045189e0362223469f324f8bdcb3a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::object_type::property (cognitive 63): flow_parser::type_parser::object_type::property has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 7 (20 pts), boolean chains 8, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_parser::type_parser::object_type::properties) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd3fa43975185f6b21e6b591a5d7cfba8994fea42f59b9f1e61b0c1883b0d48"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::check_multiplatform_conformance (cognitive 63): flow_typing::merge::check_multiplatform_conformance has cognitive complexity 63 (threshold 15). Drivers by points: if/else 8 (36 pts), loops 3 (14 pts), match/switch 5 (11 pts), boolean chains 2 (nesting depth added 45). 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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a306e12f5184e647a18b8bcaa401e1dab5650e9852c9ebdaefc4776cdf6387"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::members::extract_members (cognitive 62): flow_typing_utils::members::extract_members has cognitive complexity 62 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 7 (19 pts), loops 4 (12 pts) (nesting depth added 41). 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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"7212057009081d663f4e1441c20d1ca5291ff4f03b54f061867a21ea97ece6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::destructor_default (cognitive 62): flow_typing_visitors::type_mapper::destructor_default has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 8 (15 pts), boolean chains 4 (nesting depth added 27). 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"42edc41bf7337db32526cbcdc01ce2ba4c06db7fa5ff1d1529d5451b60da7436"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::import_declaration (cognitive 61): flow_parser::statement_parser::import_declaration has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 20 (33 pts), if/else 15 (25 pts), boolean chains 2, loops 1 (nesting depth added 23). Of this number, 16 points are the body\u0027s own statements and 45 belong to 10 function items inside it that branch. 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c802c4a593ee8bfab37ea5fa56f8a91a77afda57f86e1e16903827725c24610"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::statement (cognitive 61): flow_type_sig::type_sig_parse::statement has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 12 (27 pts), if/else 10 (24 pts), loops 5 (10 pts) (nesting depth added 34). Of this number, 60 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14848}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ac29efc659ff9d35c08aa2b6da72a6060183bc3e54422e22cacb0192ac230"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::class_element::init (cognitive 60): flow_parser::object_parser::class_element::init has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 14, match/switch 9 (14 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. This shape REPEATS in the file: 3 other methods here (flow_parser::object_parser::class_element, flow_parser::object_parser::class_element::accessor, flow_parser::object_parser::class_element::property_end_and_semicolon) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc761429a0ea5c8c061d6be63aef609126861a7b381701da6da4f7a2c583d946"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::position::compute_positions (cognitive 60): flow_parser_wasm::position::compute_positions has cognitive complexity 60 (threshold 15). Drivers by points: if/else 30 (46 pts), boolean chains 8, loops 4 (6 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":"rust_port/crates/flow_parser_wasm/src/position.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8481bbcb9956ae566158e74c8e78782404a83f6fc0e15f99a77bb47203cbf1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::handle_generic (cognitive 60): flow_typing_flow_js::flow_js::helpers::handle_generic has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 7 (12 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d354dacf253a9d6fdf3acb3d2e7bf36f68fba4f99f5938ece356589b48e5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_debug::dump_use_t_ (cognitive 59): flow_typing_debug::dump_use_t_ has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 37 (51 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 15). Of this number, 56 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45ed42373c16cf9d4d1d7304e2f8a1b76ee1fd264784de1206e2cfcd5522a4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_object::named_property (cognitive 58): flow_typing_statement::type_annotation::convert_object::named_property has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 9 (21 pts), boolean chains 4 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing_statement::type_annotation::convert_object) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4616}}}],"partialFingerprints":{"codehealthFindingId/v1":"91aacf5460cf579676a4b88296ddd7d1682955a56a06aa67cccbe60c65b15cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::has_flow_pragma (cognitive 57): flow_parser_wasm::has_flow_pragma has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (39 pts), loops 4 (12 pts), boolean chains 6 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47183b03380c53a6db32ec2595247af178dae425bf2bb84bb843c0345cdd188"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::t_of_use_t (cognitive 57): flow_typing_flow_js::implicit_instantiation::t_of_use_t has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 21 (46 pts), if/else 4 (10 pts), boolean chains 1 (nesting depth added 31). Of this number, 51 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a278021af1cf3b108440f2e3a2b100f156c0c7a783b52d9e54bee8fdcbed1a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_def (cognitive 56): Walker::walk_def has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 15 (30 pts), if/else 10 (23 pts), boolean chains 3 (nesting depth added 28). 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2592b1ddde034a42a96cc6ca28f1ad560a5864a5ccdb4053c80b4aa948433"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::element_converter::toplevel::singleton (cognitive 56): flow_typing_ty_normalizer::normalizer::element_converter::toplevel::singleton has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 14 (38 pts), if/else 3 (12 pts), loops 1 (6 pts) (nesting depth added 38). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bab36aed11108c6353b6045c61babc3c0581fa02f6c0ee5750680310c02e95"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_hint::type_of_hint_decomposition (cognitive 56): flow_typing_utils::type_hint::type_of_hint_decomposition has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 15 (33 pts), if/else 11 (16 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 26). 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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d2a73b6fde7319f0fe215a9499c20ef6161afd2cc4cf21b2042ba6d25f1752"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::expression (cognitive 55): Writer::expression has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 6 (12 pts), loops 3 (7 pts) (nesting depth added 29). 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/expressions.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a3823368448da15e08fd348c8d89c47efb84437976a164d2bf8aa3b4ed13b"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_from_eval (cognitive 55): Walker::walk_from_eval has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 7 (13 pts), boolean chains 8 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5333}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cdbfc128bc05ea419bfa1aab42eab1d60d42355359df1a94d9f22c45c96982"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::object_kit::run_with_env (cognitive 55): flow_typing_flow_js::object_kit::run_with_env has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 11 (15 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"191cb6697b32b5097cd7b12887d7a8d48ccb69d9ada8e8f36feeba5b87060b95"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator (cognitive 54): flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (41 pts), loops 3 (7 pts), boolean chains 6 (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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b1bba92b2bdbe1afd1f280505f4a196f1a58c9040ed19819ebd76bd2866e30"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::detect_sketchy_null_checks (cognitive 54): flow_typing::merge::detect_sketchy_null_checks has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (51 pts), match/switch 16 (39 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_typing::merge::detect_sketchy_null_checks::make_checks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3ace1461e96b6ea199efdd7edd850b53abc390dc8db2a912df44a252c3cc39"}},{"ruleId":"D2","level":"warning","message":{"text":"WholeAstVisitor::visit_function_with_id (cognitive 54): WholeAstVisitor::visit_function_with_id has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 12 (30 pts), if/else 11 (17 pts), boolean chains 7 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc31022885c21515f5ba05735f5613bfbc0eae7cfb61669155d6c97dbc525ea"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_debug::dump_t_ (cognitive 54): flow_typing_debug::dump_t_ has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 20 (46 pts), if/else 7, boolean chains 1 (nesting depth added 26). Of this number, 47 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d2619a376ad5098d82112da21bf02c61f7bd35256d0c2dfee3687996b3032c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::name_def::collect_declared_namespace_members::collect_one (cognitive 53): flow_env_builder::name_def::collect_declared_namespace_members::collect_one has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 32). 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"335dec6d11d942a4c529ab508819e3fb575ffee88916dd10fb4ab239b62da572"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::enum_validate::validate_implicit_type (cognitive 53): flow_parser_utils::enum_validate::validate_implicit_type has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 12 (30 pts), loops 5 (14 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 30). 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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f632f074b3586e126b187029944c42d5b599ba3569a17f1979466032ba1a65e0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::call_latent_pred (cognitive 53): flow_typing_utils::predicate_kit::call_latent_pred has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 4 (19 pts), boolean chains 5, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"848e46d64e6fa2f9d443a906cddf05af8b956a18ddc06ee926fb6a062cec6679"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.attach (cognitive 53): comments.attach has cognitive complexity 53 (threshold 15). Drivers by points: if/else 28 (48 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cff4ae7090a9bb28fa3004cfc595e75d9f378b2076e01ff82883ee36ce742f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::binary_cover (cognitive 52): flow_parser::expression_parser::binary_cover has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 4 (9 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 25). Of this number, 42 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed9dab6bf8f3acb7565c6c0524499864b9bb1c826d43389008ed207747ec73"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::flow_ast_differ::list_diff (cognitive 52): flow_parser_utils::flow_ast_differ::list_diff has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 5 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 25). Of this number, 44 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448bb889583f00fd4144f1db68723db7e59a1458ddc6319fd30c07bb83dd027"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::hermesParse (cognitive 51): flow_parser_wasm::hermesParse has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (28 pts), match/switch 10 (19 pts), boolean chains 4 (nesting depth added 15). 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":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"270a3134684aee45b666a659192d0fe8f713781fdf68c7e87951561f5c074b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::merge_conditional_branches_with_refinements (cognitive 50): NameResolver::merge_conditional_branches_with_refinements has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 33). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":5070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a4ba3d62b94e2cbbba618260ded29809367ade1aba38db931dcfb13aa71c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::reposition::recurse (cognitive 50): flow_typing_flow_js::flow_js::helpers::reposition::recurse has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 10 (27 pts), if/else 7 (17 pts), boolean chains 6 (nesting depth added 27). 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e004d29eb813f3b2e1c848fa551928b73c1c9b073f81ed232d814def9bf4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"FindProviders::expression (cognitive 49): FindProviders::expression has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (47 pts), boolean chains 1, match/switch 1 (nesting depth added 36). 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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ab64647b58be6311b6c69d7240ca9853182a50d8f22fd59c8402b6bbc810d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseError::fmt (cognitive 49): ParseError::fmt has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 8 (16 pts) (nesting depth added 19). 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":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"33364470e0490935610e9506ad0e2a530c0fc4aefab049ba2359067e3e775d08"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeNormalizationHardcodedFixesMapper::on_union (cognitive 49): TypeNormalizationHardcodedFixesMapper::on_union has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 7 (14 pts), boolean chains 11 (nesting depth added 16). 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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05b50f1d4978f69ef2e569111adb9442ad8eb51a59b6ba1789e5aaab6c7f55b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::def_type_default (cognitive 49): flow_typing_visitors::type_mapper::def_type_default has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (39 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1ee0c9aaeeb94ff46a292299b59cfaf00c9ebc662f34c4151cfa008982977"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::class_body::class_elements (cognitive 48): flow_parser::object_parser::class_body::class_elements has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (34 pts), match/switch 4 (13 pts), loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93197e85e202754ec8ad1350271e0a86f8fa0b5e49dcdcec061a119ac5dac96"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::statement (cognitive 48): Writer::statement has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (32 pts), match/switch 6 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"467bf1b59ebc873e5e82c8f8420e96872a703aa59e31e12867d7b558a8bb1498"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_class_body_element (cognitive 48): Serializer::serialize_class_body_element has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 13 (27 pts), if/else 6 (13 pts), loops 4 (8 pts) (nesting depth added 25). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a0287f7433f5e1efec5427da36507c3be86e7af8eed283daabb18119c06018"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::mk_func_sig (cognitive 48): flow_typing_statement::statement::mk_func_sig has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 17 (22 pts), if/else 16 (20 pts), boolean chains 5, loops 1 (nesting depth added 9). Of this number, 34 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":20245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3feab61184931a849997c949bc52c3a762e5ed21b46baf59ad12f8fbd3ce83"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_annotate_exports::normal_diff (cognitive 47): flow_dev_tools::runtests::check_annotate_exports::normal_diff has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 5 (13 pts), boolean chains 4, match/switch 1 (2 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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eaa53dab8c98ea982c2cd5530b346d9e966e484f734f1b3d1edc9ebdf38582"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::merge_service::sig_hash (cognitive 47): flow_services_inference::merge_service::sig_hash has cognitive complexity 47 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 8 (15 pts), match/switch 9 (15 pts), boolean chains 2 (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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"449a1a3c244a12a6e52f675cbe6735fc4b2746c40d76a6182961ebeee8a1582a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::propref_for_elem_t_with_env (cognitive 47): flow_typing_flow_common::flow_js_utils::propref_for_elem_t_with_env has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (46 pts), match/switch 1 (nesting depth added 31). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f06edad9955b4d4622b8dea82ebfe868854484e5a993abc1f661faf2b8a45"}},{"ruleId":"D2","level":"warning","message":{"text":"run_swebench.run_eval (cognitive 47): run_swebench.run_eval has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 13 (18 pts), boolean chains 5, error handling 1, loops 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":"evals/run_swebench.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"378c9ef264385563dcf3816161dbb030cb11fbad8d5132926d6577a8962c5950"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms::ObjectTypeAnnotation (cognitive 47): getTransforms::ObjectTypeAnnotation has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 5 (8 pts), ternaries 2 (5 pts), boolean chains 3, other 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e1905ccffbef1b09aab4c34f2e0e847b2c42f45de038a0a5cade0cc303122"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::name_def::expression_is_definitely_synthesizable::synthesizable (cognitive 46): flow_env_builder::name_def::expression_is_definitely_synthesizable::synthesizable has cognitive complexity 46 (threshold 15). Drivers by points: if/else 6 (24 pts), match/switch 10 (20 pts), boolean chains 2 (nesting depth added 28). 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da32834b8d5979b8842dd153832d99b37c69a25e429c7fa23a9f6e37f1b702f"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_to_eval (cognitive 46): Walker::walk_to_eval has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 9 (17 pts), boolean chains 12 (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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"75923009581ddf51b62834420d694ba705955953b3b6ab3d0add02f00a589f3a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::switch_to_match::convert_switch_inner (cognitive 46): flow_typing_statement::switch_to_match::convert_switch_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 5 (11 pts), boolean chains 9, loops 1 (nesting depth added 16). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fbf2163635204f1d4451e74fce5525fc76ac40e95be7797166d6277a81b0d6"}},{"ruleId":"D2","level":"warning","message":{"text":"TyIterTy::default_on_decl (cognitive 45): TyIterTy::default_on_decl has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 8 (22 pts), match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (TyReduceTy::on_decl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b45529908aad1ed84d0b8d75a6e0d8d6907def1ba692eef1956956d7b764c88"}},{"ruleId":"D2","level":"warning","message":{"text":"TyReduceTy::on_decl (cognitive 45): TyReduceTy::on_decl has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 8 (22 pts), match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (TyIterTy::default_on_decl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0ce7f278ea0194054e87eacf80c3ea661ff7e19b143c5b965423081545a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_get_def::get_def_utils::def_info_of_typecheck_results (cognitive 45): flow_services_get_def::get_def_utils::def_info_of_typecheck_results has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 9 (30 pts), loops 2 (9 pts), if/else 4 (6 pts) (nesting depth added 30). Of this number, 38 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b46ec0dcf4e1fe391fe29ee9a56a8af9e0101d15d2a6edd32e682c530b3bd4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::jsx_element (cognitive 44): DefFinder::jsx_element has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 11 (20 pts), boolean chains 1, loops 1 (nesting depth added 21). Of this number, 35 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d7b8ea32d71c63b711d48c903e58acf0c3675be64a2ab936e97f4aaceafafc"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportExportVisitor::export_named_declaration (cognitive 44): ImportExportVisitor::export_named_declaration has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (18 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"f070db54e7985b1cbbe509b8dd15f0095e29ac3235f910cfa8adef33225ef331"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::serializer::decode_template_raw (cognitive 43): flow_parser_wasm::serializer::decode_template_raw has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (2 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670d502094eda92ab24d4f0ebabd5e2b3f81bab3377e49c21842ed6c6a72373"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_get_def::get_def_js::get_def::loop_fn (cognitive 43): flow_services_get_def::get_def_js::get_def::loop_fn has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 9 (27 pts), if/else 3 (10 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 28). 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":"rust_port/crates/flow_services_get_def/src/get_def_js.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685655676b30b084238e09d38e2f8fe2e1853d01bacbc4c2b4cada5c6a44134"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::interface_props (cognitive 43): flow_type_sig::type_sig_parse::interface_props has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 21). Of this number, 19 points are the body\u0027s own statements and 24 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef25269313d26075f223513b35b22a516c84e01ff331b6c4278e360600e3b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::ty_members::members_of_ty (cognitive 43): flow_typing::ty_members::members_of_ty has cognitive complexity 43 (threshold 15). Drivers by points: loops 12 (16 pts), if/else 9 (12 pts), match/switch 6 (9 pts), boolean chains 6 (nesting depth added 10). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 8 function items inside it that branch (intersection_of_members, union_of_members, members_of_union, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"418451db548cd23102f0086a82c8472130f7b6af57ff7ff0ab6b83872d457779"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_call (cognitive 43): Walker::walk_call has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 8 (17 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fc41663799f0b01f7042c96d0f9c80d62870d5a01337f31c8994ecc669c1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::check_override_side (cognitive 43): flow_typing_statement::class_sig::check_override_side has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 2 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"deccb9b31c0b763ff004a7c53a3fcd084b8e9519b7be4f004ec2357f9abe29df"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::func_sig::toplevels (cognitive 43): flow_typing_statement::func_sig::toplevels has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 14 (25 pts), if/else 10 (17 pts), boolean chains 1 (nesting depth added 18). 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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68b567f28096c73ffe113b79b4ed885730ed9c55ce2721e6529db2bd4a0ce05"}},{"ruleId":"D2","level":"warning","message":{"text":"compile_swebench.generate_grading_script (cognitive 43): compile_swebench.generate_grading_script has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), ternaries 3 (9 pts), boolean chains 3, loops 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":"evals/compile_swebench.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6ad0e55621c6d9dee78420fe6ab40d8ac01cb528e913029625d8b4ecd7b6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_command_utils::connect_and_make_request_inner::wait_for_response (cognitive 42): flow_command_utils::connect_and_make_request_inner::wait_for_response has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 3 (8 pts), boolean chains 4, loops 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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"a731de1598d78bb63f7b45bc34cabfb62a6abed9ba76d8cc3adaf24cfc7906bb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::files::ordered_and_unordered_lib_paths (cognitive 42): flow_common::files::ordered_and_unordered_lib_paths has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (33 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"21059c3875681b3769fd002cea60b53a65c4be7f5d96cfefee539673a79138d1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_exec_file_promise::split_shell_args (cognitive 42): flow_dev_tools::runtests::check_exec_file_promise::split_shell_args has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b138e34aa3f458cca0b9757f5e8d7218abbb10231109e33251882b7b5812f13"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::string_quote (cognitive 42): flow_parser::flow_lexer::string_quote has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 8 (16 pts), loops 3 (7 pts), boolean chains 2 (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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fa654f4c4c66c0656cb6182e31ce69d4321cb8fba81d63affd225e517bf8a4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::declare_export_declaration_body (cognitive 42): flow_parser::statement_parser::declare_export_declaration_body has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 7 (14 pts), boolean chains 7 (nesting depth added 16). 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c68f8221b2b671ceac6b97a6a8026b470daa41a625e02bdd238f614f3e72a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_match_pattern (cognitive 42): Serializer::serialize_match_pattern has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 15 (34 pts), loops 4 (8 pts) (nesting depth added 23). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c928bec59623f547ae0ced21e3c9c40ffbb183612ee1055087e28cf297755"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn (cognitive 42): flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 9 (27 pts), loops 6 (15 pts) (nesting depth added 27). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbadb711661bfd0681a031fb8f695e32f6bf9d8183632588d4e5b6a390806070"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::make_intermediate_error (cognitive 42): flow_typing_errors::intermediate_error::make_intermediate_error has cognitive complexity 42 (threshold 15). Drivers by points: if/else 88 (158 pts), match/switch 37 (66 pts), boolean chains 19 (nesting depth added 99). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_typing_errors::intermediate_error::make_intermediate_error::unwrap_use_ops::loop_impl) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e94c2f847c383ca85ef69560cb287e33abf7ad9bca6c42d9f6961c8bcefeaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::spread2 (cognitive 42): flow_typing_flow_js::slice_utils::spread2 has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 15, match/switch 6 (9 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf54fae406a7f3f8c44fe092103e78e63bcc3fdfa9ad3c44a5139ff307da69b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::elements (cognitive 42): flow_typing_statement::class_sig::elements has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 9 (10 pts), match/switch 3 (6 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91cd5efa8185902a116a0f337df9d3001232e7ad0d912046ee92fc219023828"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::mk_env (cognitive 41): NameResolver::mk_env has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (13 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2071b0b8e67268daad278aca62c668876a82fd8f4163654fb017a2f396124b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::param_list_or_type (cognitive 41): flow_parser::type_parser::param_list_or_type has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 7 (15 pts), boolean chains 3 (nesting depth added 16). 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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea27fce7ed07aa21cb39fe359bbba8de0011163a65ef466812223b3018bb5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::print_mechanical_deserializer (cognitive 41): flow_parser_wasm::bin::codegen::print_mechanical_deserializer has cognitive complexity 41 (threshold 15). Drivers by points: loops 10 (21 pts), if/else 9 (20 pts) (nesting depth added 22). 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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a2f1207c39334678199f3a3974c24b76fac3e38e849baaed677891318d610f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::mk_record_sig (cognitive 41): flow_typing_statement::statement::mk_record_sig has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 10 (29 pts), if/else 3 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 26). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18949}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec10d5a298d15498bde728ee748b833d8dfbb7e8ad04b0d1e8c5a49b894992b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::value_union_builder::lookup_prop (cognitive 41): flow_typing_utils::exhaustive::value_union_builder::lookup_prop has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). Of this number, 23 points are the body\u0027s own statements and 18 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d1efb53eb3c5ab51642741e0e15e72efe9107293e09dfd014ef2e352a73be"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::strict_es6_import_export::gather_declarations (cognitive 41): flow_typing_utils::strict_es6_import_export::gather_declarations has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 3 (11 pts), loops 2 (4 pts) (nesting depth added 28). Of this number, 39 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1327179140f1cc436cd0b94ae554d0817879f7434e60b7ed2f45e957f8f59e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorMessage::map_loc_of_error_message (cognitive 40): ErrorMessage::map_loc_of_error_message has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 20 (40 pts) (nesting depth added 20). 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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"db064783ba0e4265bdb575d8b46dba1577183c19fc084f5703e570c968791409"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::create_computed_prop (cognitive 40): flow_typing_statement::statement::create_computed_prop has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 6 (13 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 20). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cae908a1a0788742ef9e7e1bf9fdb0f7edfd11b97d8b6c9f9bdc5698fabde39"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms::DeclareExportDeclaration (cognitive 40): getTransforms::DeclareExportDeclaration has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 2 (7 pts), boolean chains 3 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"59edc66c97ee17420ccdbcf0b90fe4742acb9e788a591e2f5578b13a4b71f2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::token (cognitive 39): Lexer::token has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (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":"rust_port/crates/flow_common_semver/src/semver_lexer.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c815e291872df2c452f9f3acd3adb99054b914d46e4258de9e9b1cf6fbfa205"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::tuple::element (cognitive 39): flow_parser::type_parser::tuple::element has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 5 (10 pts), boolean chains 6 (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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"574845871518653addc2f0a329b3285b29f52699634015ef1bb08d3a29087ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_export::fuzzy_path::score_match::do_score (cognitive 39): flow_services_export::fuzzy_path::score_match::do_score has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 7 (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":"rust_port/crates/flow_services_export/src/fuzzy_path/score_match.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb03542a93ef0c6dbc604a0a64f336449ec587b1fd01efcd3af475caef0555b"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::assignment (cognitive 38): NameResolver::assignment has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 9 (18 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d47ccd93b899db2e56bcac4d7bd715136e57b3395215ba872ddaadbd8f120e6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_function_params (cognitive 38): flow_parser::declaration_parser::parse_function_params has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 4 (7 pts), boolean chains 6, loops 1 (nesting depth added 11). None of this is in the body itself: all 38 points belong to 4 function items inside it that branch (param, this_param_annotation, param_list, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea799522e1d5e7b9b14fb6b3e009f2e0db8fb5522df6f4e0fa052a6cafd5130f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::assignment (cognitive 38): flow_type_sig::type_sig_parse::assignment has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30 (94 pts), boolean chains 4, match/switch 1 (nesting depth added 64). 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. This shape REPEATS in the file: 3 other methods here (flow_type_sig::type_sig_parse::assignment::is_module_exports_assign, flow_type_sig::type_sig_parse::assignment::is_exports_prop_assign, flow_type_sig::type_sig_parse::assignment::is_module_exports_prop_assign) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efdc748da4683e7c4a1aa8db28dd74f21bc72774524be9d8b80dd3e957acd05"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::query_types::type_at_pos_type (cognitive 38): flow_typing::query_types::type_at_pos_type has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 8 (18 pts), boolean chains 1 (nesting depth added 20). 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":"rust_port/crates/flow_typing/src/query_types.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b359812d3a7196e8c328abf98e366f9e99e5ac1b27c4ff7839b68c379e7e04b"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectExpressionAcc::add_computed (cognitive 38): ObjectExpressionAcc::add_computed has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 22). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83f13af48cbad002d56e1f7b8f370973023a23f7fbfe7c4435223bda553fcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::reason::code_desc_of_expression (cognitive 37): flow_common::reason::code_desc_of_expression has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 12 (23 pts), if/else 10 (14 pts) (nesting depth added 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. 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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f333569fd692f6f8832a0cd3cf67e4e9a08db5e07db627de65a9c20660b21a"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::pattern (cognitive 37): Writer::pattern has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 23). 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/patterns.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5829d4f1bb44b24012143e25808d74d1520fd926dddbdd639eda4a0ccb8265e"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetFinder::jsx_element (cognitive 37): TargetFinder::jsx_element has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 4 (18 pts), if/else 4 (13 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 26). 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":"rust_port/crates/flow_services_code_action/src/stub_unbound_name.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef06ee72e54b018e78bff0e50b22a41c86c6e3cd865b03d612c169336475abf"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_statement (cognitive 37): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_statement has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (8 pts), loops 3 (7 pts) (nesting depth added 22). 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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e7b63915fef3650c00c4339468fc52c544d0f9650bfebb2c5fd1a287c3255f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::check_conditional (cognitive 37): flow_typing::merge::check_conditional has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 8 (17 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"658b3592cee9075f5249b5e0899a41102d57aa1920ad76ffe33eab3b4aee3de7"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms::GenericTypeAnnotation (cognitive 37): getTransforms::GenericTypeAnnotation has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, match/switch 2 (3 pts), other 3, ternaries 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35c5102400addfe05dc3127c46448ed4f250e98eec0805cedc34d0863afff93"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_commands_connect::command_connect::connect_rec (cognitive 36): flow_commands_connect::command_connect::connect_rec has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 6 (13 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":"rust_port/crates/flow_commands_connect/src/command_connect.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"db08e7ad047baa6e67e36a17ffdc5341ff6306e2f5f197d113346d2bce167d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::for_loop (cognitive 36): flow_parser::statement_parser::for_loop has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 8 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). Of this number, 33 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80e9fc7d85b074806d754fa09d54bf09f00e8070c24c678b6cc85ab885d1c23"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchLowerer::analyze_pattern (cognitive 36): MatchLowerer::analyze_pattern has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 5 (9 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8cfd3b4ae24f7247cc9abb3e5e2d83999e3ef8ecaab0ccd009572768243603"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_references::local_import_ref_searcher::search (cognitive 36): flow_services_references::local_import_ref_searcher::search has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 4 (11 pts), match/switch 3 (7 pts) (nesting depth added 23). Of this number, 29 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rust_port/crates/flow_services_references/src/local_import_ref_searcher.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"13760a565104fed7b1c7e19521842a68511176f91a2fb012e6e357c1dfc09012"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::builtin_react_element_nominal_id (cognitive 36): flow_typing_flow_common::flow_js_utils::builtin_react_element_nominal_id has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (35 pts), match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing_flow_common::flow_js_utils::builtin_react_renders_exactly_nominal_id) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6994a8839647613b7d005dbf4920d3fcf2835025a068c3aa38c7b641fba3d9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::builtin_react_renders_exactly_nominal_id (cognitive 36): flow_typing_flow_common::flow_js_utils::builtin_react_renders_exactly_nominal_id has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (35 pts), match/switch 1 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing_flow_common::flow_js_utils::builtin_react_element_nominal_id) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a5754da3c42df3a5209a78192ac16d2d102cfe4392a66c52d9e296af99146"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::merge_upper_bounds (cognitive 36): flow_typing_flow_js::implicit_instantiation::merge_upper_bounds has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (15 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd1301f540c90395c262c5498f8438edf599c17ed993617c72c5be468e062ad"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 36): parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (25 pts), ternaries 7, boolean chains 4 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2456314d90f629c0ca98dc7942ca0761848003c1c9ecf42313e35837651745ab"}},{"ruleId":"D2","level":"warning","message":{"text":"report (cognitive 36): report has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 5 (10 pts), boolean chains 5 (nesting depth added 18). Of this number, 26 points are the body\u0027s own statements and 10 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4edc30a98e80bd99558c1fb657e2d37aad88d48d1ee48cdd2f3adbe730e608"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::comment::comment_mutator::expand_comment (cognitive 35): flow_dev_tools::comment::comment_mutator::expand_comment has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 10, loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/comment/comment_mutator.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a759409ba95e7e27ebbf9e8d59f8c4a2033a8ad1d73776711e983aea802b63"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::visit_object_expression (cognitive 35): DefFinder::visit_object_expression has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 6 (12 pts), loops 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f519387dbebef0840fd5820dc1354fd71b6c459b727dd4fa761450ff30c795"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::variable_declarator (cognitive 35): NameResolver::variable_declarator has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 20). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d76b4900ed2d94560c82a5e87bb719150b2fdaa4177d6b2bcb6ecd8f2741179"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::consume_jsx_entity (cognitive 35): flow_parser::flow_lexer::consume_jsx_entity has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 2, loops 1 (2 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed5bb6a2a95934de1f4611ae6a5ed3687453d2c4486c04817f65ee9577717aa"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::match_pattern_parser::subpattern (cognitive 35): flow_parser::match_pattern_parser::subpattern has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 5 (14 pts), loops 1 (3 pts) (nesting depth added 23). Of this number, 17 points are the body\u0027s own statements and 18 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"939cd59c6da6a7541a8f47f670093eb7699a7b590007e4bfedbf76b8f60f6a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::record_body::elements (cognitive 35): flow_parser::object_parser::record_body::elements has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (8 pts), boolean chains 5, 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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a02911d67494352ba1c7d0d33e4b83d9bf22520e36dd91823fd7c8c52a5941"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::opaque_type_helper (cognitive 35): flow_parser::statement_parser::opaque_type_helper has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (28 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3147e25b0bf2ed459e44ba17599a5447605280c2cf597bd927012ee26460b52c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::merge_tparam_polarities (cognitive 35): flow_typing_statement::class_sig::merge_tparam_polarities has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (8 pts), loops 2 (6 pts), boolean chains 3 (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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2faff402adf6557bad2f35539e36055275c28504e49a2c92ddb0b32a4569fb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert (cognitive 35): flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 11 (29 pts), if/else 4 (6 pts) (nesting depth added 20). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbf29cddb9129f52f20d6a5c00257ab1874e1ab713f2cf77935dd0727f80210"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references (cognitive 34): flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (27 pts), match/switch 6 (7 pts) (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5783e21bc180c788f4a0edb25052b4c50608996f3d6bbed4d283eae7059ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_config::flowconfig::parse_rollouts (cognitive 34): flow_config::flowconfig::parse_rollouts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":3122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b6df1c814dc2fffa380b828b1c55a98f60515869f846df5da615a093c0dafb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor_daemon::wait_loop (cognitive 34): flow_server_monitor::flow_server_monitor_daemon::wait_loop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 3 (6 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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_daemon.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6e908e68758f3a8ccbce4ef3954d6bc5c04340104a3192fa816665a04f6b48"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::refactor_extract::extract_from_expression_refactors (cognitive 34): flow_services_code_action::refactor_extract::extract_from_expression_refactors has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (9 pts), match/switch 2 (nesting depth added 21). 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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf4c77c95eada14f5d926011db0998405072e5958ad14ad1352e2d550c353ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::generic_type (cognitive 34): Searcher::generic_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 1 (6 pts), match/switch 1 (5 pts), boolean chains 1 (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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"14501965a9f90edf3f93e78fed5cfbab4c1921f2b691d56c77e72ffd3a235176"}},{"ruleId":"D2","level":"warning","message":{"text":"MergeStream::new (cognitive 34): MergeStream::new has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 5 (9 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":"rust_port/crates/flow_services_inference/src/merge_stream.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c55b50fcecf7e7767d97b83a9178e915b9b55e6ef2696f1118acebd534496c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::interface_merge_unify_tasks (cognitive 34): Context::interface_merge_unify_tasks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (11 pts), match/switch 1 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"750938b952ae77eac9d2462e2d73c5a9ae78864dcc9a3baf19255774bfc57a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::eval_helpers::eval_destructor (cognitive 34): flow_typing_flow_js::flow_js::eval_helpers::eval_destructor has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 5 (9 pts), boolean chains 7, loops 1 (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7726976135828bcdc9ffc6894b2da80473c361e6b62d490f86897f790e2fba57"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args (cognitive 34): flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 17). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f99dac774dde132c8daaa2245a14020847813f99fdf69761b48fabe3481596"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::resolve_with_env (cognitive 34): flow_typing_flow_js::slice_utils::resolve_with_env has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 11 (23 pts), if/else 3 (6 pts), boolean chains 5 (nesting depth added 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f14ca72764b83b02be655e4535fff3b5ee300a3088d6da0000b3e5efb0d015"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueObject::to_pattern (cognitive 34): ValueObject::to_pattern has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 19). 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":"rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"3761155e103d41b73eeeec799c79ad13af47ae87197fb82e4d7adfdc7a69a525"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test (cognitive 34): flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (17 pts), loops 3 (13 pts), if/else 2 (4 pts) (nesting depth added 24). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"31552354ab33364f89c0b5388fb34e64aed6949b099e8b247a516c7c328bc517"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::autocomplete_command::main (cognitive 33): flow_cli_support::autocomplete_command::main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (10 pts), match/switch 4 (8 pts), boolean chains 2 (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":"rust_port/crates/flow_cli/src/autocomplete_command.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697a36f3da0094819fab0fcc6543a513ac78a14de3353448e46b1a06199a637"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::update_suppressions::update_suppressions::runner (cognitive 33): flow_dev_tools::update_suppressions::update_suppressions::runner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 6 (9 pts), boolean chains 1 (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":"rust_port/crates/flow_dev_tools/src/update_suppressions/update_suppressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c04850e806edbb7559da610ca301bb22326004b8bf6a5eb3840f6f66d15786"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::class_internal (cognitive 33): DefFinder::class_internal has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 2 (3 pts), loops 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2e1821c17c6ed7941d7de6ec0817b4e4d5fadc3b8f57689f838ddf6648a18"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::name_def::obj_properties_synthesizable (cognitive 33): flow_env_builder::name_def::obj_properties_synthesizable has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 8 (16 pts), loops 4 (9 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_env_builder::name_def::obj_properties_synthesizable::synthesizable_expression) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a71a408ec395daae99d605ac2092de3ae304d5e3d032b98e659ed01f234d297"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::string_escape (cognitive 33): flow_parser::flow_lexer::string_escape has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9bd4bb6c4a4644cfab67dc89ad4cd8216b650d3c301f601efc8897a7db2221"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::refactor_extract_utils::variable_analysis::collect_relevant_defs_with_scope (cognitive 33): flow_services_code_action::refactor_extract_utils::variable_analysis::collect_relevant_defs_with_scope has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (11 pts), loops 4 (6 pts) (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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"f152c3b5a92caff2ab6c33eb4f977c3cb06ad8d93d23d0693955922f593cbd66"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::object_type::object_prop (cognitive 33): flow_type_sig::type_sig_parse::object_type::object_prop has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_type_sig::type_sig_parse::object_type) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d457518bed60d8b2d83c230b5964058a1c432d06300fbfefcea75d505472d9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::bind_interface (cognitive 33): flow_type_sig::type_sig_parse::scope::bind_interface has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 9 (16 pts) (nesting depth added 16). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"659e3fad28e612947ddfd0b1e30508df640f30a1e628742b13d745391497201a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::cjs_require_t_kit::on_module_t (cognitive 33): flow_typing_flow_common::flow_js_utils::cjs_require_t_kit::on_module_t has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 6 (12 pts), boolean chains 1 (nesting depth added 18). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba8cdf4bb9ce1189c1a9c37259f2d6d257f0b87aec003917d0a339384012e00"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::post_inference_check_abstract_obligations (cognitive 33): flow_typing_statement::class_sig::post_inference_check_abstract_obligations has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (13 pts), loops 6 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 16). Of this number, 27 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ded22013b18c9423c1bd5307e9c866254766c2f4304ed4b004381dd10595e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_util::ground_subtype (cognitive 33): flow_typing_type::type_util::ground_subtype has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 9, match/switch 2 (3 pts) (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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"72403372e26a8165d7d4d4bb09eb9be2c0142001bf991b744044c3df62207af8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::annotation_inference::elab_t (cognitive 33): flow_typing_utils::annotation_inference::elab_t has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 4 (14 pts) (nesting depth added 22). 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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"56324e29011b97be8e91e0ebab5e693b4d69c2d80ae68f0bc233b76f2a3e274e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::check_for_unused_patterns (cognitive 33): flow_typing_utils::exhaustive::check_for_unused_patterns has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (6 pts), match/switch 1 (6 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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e6a5f03a31684b9b357c129159c647f5505e4f6a46954cd2b9646f935ade79"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::members::extract_type (cognitive 33): flow_typing_utils::members::extract_type has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 15 (30 pts), if/else 2 (3 pts) (nesting depth added 16). 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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6b3261d7a8dda98cdb5a575bc29b4090a0747616e2e5eed44f5552d31b56bd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::array_length (cognitive 33): flow_typing_utils::type_filter::array_length has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (8 pts), boolean chains 7 (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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"a970b1307cb3f4b9fb09bd6fed72ffb912b5c68a4057ef6b153a851bd11a361b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_hint::instantiate_callee::handle_poly (cognitive 33): flow_typing_utils::type_hint::instantiate_callee::handle_poly has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 6 (14 pts), boolean chains 1 (nesting depth added 21). 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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcce4b9351f76fa36d5decb042fa30c5a5cec3eac32cb1907c0fa337bc8dd65d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::layout_references (cognitive 32): flow_common_errors::error_utils::cli_output::layout_references has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 4 (9 pts), loops 4, boolean chains 2 (nesting depth added 15). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to 3 function items inside it that branch (add_tags, add_close_tag, update_colors). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d206e861aab305226d2646b65043cab6f780f2abc343e6b34c5bd586e711da4"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::update_from_map (cognitive 32): Graph::update_from_map has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 6 (12 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":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd62418c14af103e10dea92a48bbe247deff5be5584bee055d368389daa430ec"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::mk_type_env (cognitive 32): NameResolver::mk_type_env has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (11 pts), boolean chains 3, 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5fa98aced25a4fb1d65df2db17551360ef97166aa6f24f38b0715d92338a52"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::bin::parse_test262::main_impl (cognitive 32): flow_parser::bin::parse_test262::main_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/bin/parse_test262.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb93310627b6cf67e99b37861fac4d7faefe8a8eb9b9ee02484cfd2cb37ec9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::initializer (cognitive 32): flow_parser::object_parser::initializer has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 10 (16 pts), if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 10). None of this is in the body itself: all 32 points belong to 6 function items inside it that branch (properties, property, parse_shorthand, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3202e13b43c710f6a3ce0b635a39213e58ac9bcb41760b80d08fea6471cce6a9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::pattern_parser::parse_object::parse_object_properties (cognitive 32): flow_parser::pattern_parser::parse_object::parse_object_properties has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 3 (11 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e72406e413daebdecfed674ba18293a9efa9a6177198097070b647f02441e96"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::export_specifiers (cognitive 32): flow_parser::statement_parser::export_specifiers has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 21). 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9c8859e6e3b69e88bfe00b3eac43d9500a4b3492a299be054a2b57a767b21d"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_export_named_declaration (cognitive 32): Serializer::serialize_export_named_declaration has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 6 (10 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a373cdd666b4c58bbd67af30c488fb1f155b1c9ec6fb0ae1edefea95ed1a6c1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_expression (cognitive 32): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_expression has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (15 pts), loops 6 (13 pts), if/else 2 (4 pts) (nesting depth added 18). 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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"41083de1bc11015c33f4b825d3e11f3c31e7c654cbe8b937532e946ae3c9f16e"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::export_named_declaration (cognitive 32): Searcher::export_named_declaration has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"955c3f15346b5dfe1365bfdc266dd55cc2701d3c18a63cb3150228bb79e4c157"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::kit::run_conditional (cognitive 32): flow_typing_flow_js::implicit_instantiation::kit::run_conditional has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11, match/switch 2 (4 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"51684fb1d08abda461ae3d14f44433f0ade29d5a5570821849a9655908e8bece"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::pin (cognitive 32): flow_typing_flow_js::implicit_instantiation::walk::pin has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (11 pts), loops 5 (6 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":7077}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af83f5084400d11b004280b0cd1ba0c1acc262b34682581319b70e1a96a2557"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env::on_concretized_react_node_types (cognitive 32): flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env::on_concretized_react_node_types has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 8 (22 pts), if/else 4 (9 pts), loops 1 (nesting depth added 19). 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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80670da5718fb3c7714c49b42a5ea50b8e424b6ec38534f7024c2993658e4a7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env::assign_from_after_concretization (cognitive 32): flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env::assign_from_after_concretization has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 7 (13 pts), loops 4 (10 pts), if/else 3 (9 pts) (nesting depth added 18). 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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eea8053f2c5ddef7407895b6301064861ab47169f42f97a95307203cfae1fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"FlowParser.detectSourceType (cognitive 32): FlowParser.detectSourceType has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 11, match/switch 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c9e77194d7023a9a3108d10bc49fdb70318d0935e0fd86b901a84b523d88d1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::ast_command::main (cognitive 31): flow_cli_support::ast_command::main has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 10 (14 pts) (nesting depth added 12). 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":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d5e8d38f88473b71d4f4c24d1fc3748b2fa9b4493c219d91f0b1209cde250e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::get_def_command::main (cognitive 31): flow_cli_support::get_def_command::main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (8 pts), match/switch 4 (8 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":"rust_port/crates/flow_cli/src/get_def_command.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2b63d096520c56ee20490a0e650b2d06e1c2399872ce7f06658f23045f4542"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::ls_command::main_impl (cognitive 31): flow_cli_support::ls_command::main_impl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ef120e5981bfad5321398e27650689e51ced351e78f55f0d7aef567a443ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::compare_printable_error (cognitive 31): flow_common_errors::error_utils::compare_printable_error has cognitive complexity 31 (threshold 15). Drivers by points: if/else 29 (60 pts), match/switch 7 (10 pts), loops 1 (nesting depth added 34). 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. This shape REPEATS in the file: one other method here (flow_common_errors::error_utils::compare_printable_error::compare_friendly_message) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13b9383e3a7b9c6275cc09d333ea09e2f5c2a9468fb2b1fa68807ab6d553737"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::call_cover (cognitive 31): flow_parser::expression_parser::call_cover has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf9d2fd8326c7e6ead71b9ae8e27809a59ab0cf73b80cbf4b60d6440f241138"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::handle_persistent_infer_type (cognitive 31): flow_server_command_handler::command_handler::handle_persistent_infer_type has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 4 (6 pts) (nesting depth added 13). 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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca82e6f68da6231230ee2c04fd805f8f91afaef698b955eb67705c6bbdaaefd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor_server::keep_alive_loop::wait_for_server_to_die (cognitive 31): flow_server_monitor::flow_server_monitor_server::keep_alive_loop::wait_for_server_to_die has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 6 (10 pts) (nesting depth added 14). 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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8886c927f4c47de714aab16fc61a23b2256ce04e2400375c2076412fbedb8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_named_prop (cognitive 31): flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_named_prop has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_type_sig::type_sig_parse::declare_class_props, flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_computed_prop) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8841}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1323e37d55815ec69edf8ea2c572514fca17eaafac82f9bd624202babf7629"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::env_resolution::merge_with_conflicts (cognitive 31): flow_typing::env_resolution::merge_with_conflicts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 20). 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ccd8c1e69170c9a869b3f14475fcf4131128a57f8a14edd51856c69908d28"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::suppression_comments::should_suppress (cognitive 31): flow_typing_errors::suppression_comments::should_suppress has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (5 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":"rust_port/crates/flow_typing_errors/src/suppression_comments.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"825c09dc4d13171e5b6b95341c16472fd7c002e9c727782946ae6c20803536cc"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::module_info_analyzer::export_specifiers (cognitive 31): flow_typing_statement::module_info_analyzer::export_specifiers has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 13 (22 pts), if/else 4 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f8d6588100a6cd28c802828550e7c168a4357b5e61e3d32cbff6640cd7bddc"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::union_rep::disjoint_union_optimize (cognitive 31): flow_typing_type::type_::union_rep::disjoint_union_optimize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 4 (7 pts), loops 6 (nesting depth added 12). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 5 function items inside it that branch (almost_unique_values, intersect_props, base_props_of, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9042}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca404e061261cf629f4a275340c5e602c58bf3cb7be3b7e8adb9c816b90976a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::members::instantiate_poly_t (cognitive 31): flow_typing_utils::members::instantiate_poly_t has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 4 (9 pts), loops 1 (4 pts) (nesting depth added 20). 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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa242652524537e94046072956bdb108172fc3db807a86a32cb4e9d0d5e42e65"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::eq_test (cognitive 31): flow_typing_utils::predicate_kit::eq_test has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 2 (3 pts) (nesting depth added 15). 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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dd487487af13faf716d0f03ac89a24b2c62d80bf1537d5ae37c4564ebd5bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::recorded_declare_namespace_member_opt (cognitive 31): flow_typing_utils::type_env::recorded_declare_namespace_member_opt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (6 pts), loops 3 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 6 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (namespace_types_at_path_prefix::namespace_types_for_root_path_element, namespace_types_at_path_prefix::namespace_types_for_child_path_element, namespace_value_member_opt::object_value_member_opt, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4edcbc487ae22a1ddb5ba285f8b708c1cd0622e7d84a6259b984bc5c985814"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_value (cognitive 31): flow_typing_utils::type_sig_merge::merge_value has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 5, match/switch 1 (nesting depth added 8). 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1afd5b4546cdf836a97ff377e2d58c728927ba2197a30bc928768abe94fd20"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_ty::ty_printer::type_impl (cognitive 30): flow_common_ty::ty_printer::type_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6218c4e9a24f154754e43a8fdede12162995c0704985f1c2486e7fbc1a71b818"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_website::render_snapshots (cognitive 30): flow_dev_tools::runtests::check_website::render_snapshots has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 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":"rust_port/crates/flow_dev_tools/src/runtests/check_website.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dcc0384b3af92b43b271c5715f99a3b57ba5ac07aabed10e74033269d82034"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::update_suppressions::update_suppressions::get_errors_for_all_roots (cognitive 30): flow_dev_tools::update_suppressions::update_suppressions::get_errors_for_all_roots has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (11 pts), match/switch 1 (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":"rust_port/crates/flow_dev_tools/src/update_suppressions/update_suppressions.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12cae3a2276554eb891a4a011336452814a377b63792e2544b9d7d1b0354937"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::primary (cognitive 30): flow_parser::type_parser::primary has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, match/switch 1 (nesting depth added 9). 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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f3a91001120d870d5627ceae31f317dc35ee77d5cc9573f2dacb94b6e8682"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_type_object (cognitive 30): Serializer::serialize_type_object has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 3 (6 pts), loops 4 (nesting depth added 16). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f199c5e6c6d6b6bb6ea4848019431ebd2ab72a0eeacf104188672df3ebed8f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_mark::mark_local_binding (cognitive 30): flow_type_sig::type_sig_mark::mark_local_binding has cognitive complexity 30 (threshold 15). Drivers by points: loops 11 (23 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 15). 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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9eee5a4b5e0007477cc20a03b49b40b24f42c9c0d107b6139b49429d9678ca"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::detect_sketchy_null_checks::make_checks (cognitive 30): flow_typing::merge::detect_sketchy_null_checks::make_checks has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 14 (24 pts), if/else 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing::merge::detect_sketchy_null_checks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6373d34c646d216abffcf4be47989f323bca992852abe79a2d2ec518c3996b"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::collect (cognitive 30): Collector::collect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 19). 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":"rust_port/crates/flow_typing_flow_js/src/intersection_kit/objects.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"267a2c3d9f538631dc69feb8ceaa32db7b450bacf752e1bdbc8acba77438d716"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::is_number_text (cognitive 30): flow_typing_flow_js::template_literal_type::is_number_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 12, match/switch 1 (2 pts), loops 1 (nesting depth added 2). 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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98831528d948d93f3e9b99e3b0f2fcc7bc4e0c4302835cd3360457620710b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::collect_inherited_members_both_sides (cognitive 30): flow_typing_statement::class_sig::collect_inherited_members_both_sides has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (14 pts), match/switch 5 (9 pts), if/else 5 (7 pts) (nesting depth added 14). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (visit_static_concrete, walk_one, walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99a2a40714d159c26f86946ba17c42ab578a94d6e232f4d54c8e493c658538a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_return_annotation_inner (cognitive 30): flow_typing_statement::type_annotation::convert_return_annotation_inner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 13). 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaba9b6d44de5b9e3016e72fb68fdeae3328058fc30f62029e57420fde16e5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::type_ctor (cognitive 30): flow_typing_ty_normalizer::normalizer::type_converter::type_ctor has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 3 (6 pts), loops 1 (4 pts) (nesting depth added 18). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e139bbd22bcb3612c204bf9a0a0e519c8c4cae7700d68fddfa870e8eba7069b0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::analyze (cognitive 30): flow_typing_utils::exhaustive::analyze has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (10 pts), match/switch 2 (5 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"31122eb51fb166fb186291397fdf7dd495e67e6367740ee5f29751bda43a1a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::sentinel_prop_test_generic (cognitive 30): flow_typing_utils::predicate_kit::sentinel_prop_test_generic has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 4 (7 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"063f243637e9515d9b751251db8cccaa56ad0c01d0beaed96debd02a512990e9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::operators::check_strict_eq::distribute_strict (cognitive 30): flow_typing_utils::type_operation_utils::operators::check_strict_eq::distribute_strict has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (9 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 16). 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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b1911482c2985e475012395221f5dfe6f0e5f7d399b4583f616ff411106ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"compile_swebench.main (cognitive 30): compile_swebench.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (5 pts), error handling 1 (3 pts), boolean chains 1, ternaries 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":"evals/compile_swebench.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b773ff2a2d3b021837c8dd48e12f6ad86b781ba5fcc2dc8ad482e1571850c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"findDuplicates (cognitive 30): findDuplicates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (3 pts), match/switch 1 (3 pts), ternaries 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":"packages/flow-upgrade/src/codemods/removeDuplicateClassProperties.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36427f78e51c7c79507f6de03c5904135a6aeb97bca9799a5c1dd3a6db49703"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_ty::ty_debug::dump_t (cognitive 29): flow_common_ty::ty_debug::dump_t has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (14 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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5b671b140466534d9315f02b1ead9871976cf354d3e16ea6c2dcaad66d458e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::comment::comment_mutator::add_comment_to_text (cognitive 29): flow_dev_tools::comment::comment_mutator::add_comment_to_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, loops 1 (2 pts), match/switch 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":"rust_port/crates/flow_dev_tools/src/comment/comment_mutator.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00062229657f424f4db55e11a8b617eb66915ec6c65d4465cb3583cf75402c"}},{"ruleId":"D2","level":"warning","message":{"text":"LintSettings::of_lines (cognitive 29): LintSettings::of_lines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (8 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lint_settings/src/lint_settings.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46111e9ecb5b4d0e329d28bf7ca415dcea836427b182aa117e328c5ba2c5fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::try_connect (cognitive 29): flow_lsp_server::flow_lsp::try_connect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (8 pts), 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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc767fec41475abf4d8dcd7d8f6e1c5246ba83a757ab5f7b34aa62d159cd20d3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_function (cognitive 29): flow_parser::declaration_parser::parse_function has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 6 (8 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b688e3135b120e6944e368b7821c1a5da1516dfc4341612499740f89aa3d6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::regexp_body (cognitive 29): flow_parser::flow_lexer::regexp_body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcbeb39dcabc6520d07d8b49852a2f8ee70c443fc0c1115019e10a08976bd06"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::expression (cognitive 29): flow_parser_utils_output::js_layout_generator::expression has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 7 (13 pts), boolean chains 3 (nesting depth added 10). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e060cec3d47507a5e26589cd2f7da4f08ea0e8ef2482f5c6f9f68547d01b33"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_expression (cognitive 29): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_expression has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (14 pts), loops 4 (8 pts), if/else 2 (7 pts) (nesting depth added 18). 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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f4f1ab105e0f3526c0a10f599645b850cbdd275256e0b39b88b2ee1178d390"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::assignment::is_module_exports_prop_assign (cognitive 29): flow_type_sig::type_sig_parse::assignment::is_module_exports_prop_assign has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (28 pts), boolean chains 1 (nesting depth added 21). 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. This shape REPEATS in the file: 3 other methods here (flow_type_sig::type_sig_parse::assignment, flow_type_sig::type_sig_parse::assignment::is_module_exports_assign, flow_type_sig::type_sig_parse::assignment::is_exports_prop_assign) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4511bb0718aa7d00b27173ab5d33804584cff17ca0ebcb60e4240f333517d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::error_message_kind_of_upper (cognitive 29): flow_typing_flow_common::flow_js_utils::error_message_kind_of_upper has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 6 (11 pts) (nesting depth added 13). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"61098b3e8b404dc6bfb2c84e8ebc0ec4f114bb19f68ebde2911caf7fb1cf6498"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_fun (cognitive 29): Walker::walk_fun has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (7 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"24678718f1ad935e95c1eddb6a74a7c9880d56a25930e693be0fb63fc282eec3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::object_prop (cognitive 29): flow_typing_statement::statement::object_prop has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 11 (20 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 13). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4165b9b0b20ea1f0d0bb4b84b1d87c95dfb87f077ed0832e0b32b93bd2f94d4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::variable (cognitive 29): flow_typing_statement::statement::variable has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 7 (9 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6184}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c8bdcacaada23fe99ccdfb57fa84b165f2cc2323b9b4dceaeb6089b3963a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::op_assignment (cognitive 29): flow_typing_statement::statement::op_assignment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 7 (14 pts) (nesting depth added 16). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ff726c209668c9d9c34f22a4e468772d1734936faf5e7a3e9a73e50b70bd81"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_print_signal::string_of_signal (cognitive 29): flow_print_signal::string_of_signal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29. 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":"rust_port/crates/flow_print_signal/src/lib.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bce7d94b55e51401b7e6286d418408c651e6560d34b662bec6b878cdba745a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateExportsMapper::map_class_element (cognitive 28): AnnotateExportsMapper::map_class_element has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 4 (9 pts), loops 1 (4 pts) (nesting depth added 18). 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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f63716366faf79d4adf109eb30d04ff58f3912905216c4718c6f75e6816ed"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::statement_list::extract_func_static_assign (cognitive 28): DefFinder::statement_list::extract_func_static_assign has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (28 pts) (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (DefFinder::statement_list) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f953633b1eb8eda0083b2e374160433bcbd49dc8dac448007a5206a1ab323698"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::member_cover (cognitive 28): flow_parser::expression_parser::member_cover has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a02c84125ea5439ed840cdfa719351ec60484558cf9a507f0bc89f595fd27fc"}},{"ruleId":"D2","level":"warning","message":{"text":"RequiresCalculator::import_declaration (cognitive 28): RequiresCalculator::import_declaration has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 5 (11 pts), loops 1 (4 pts) (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"678f24849cd0b66997fa42d8966a9f9a90afa3d074e72d75ec105f26572e881f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_autocomplete::autofix_imports::update_import (cognitive 28): flow_services_autocomplete::autofix_imports::update_import has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (6 pts) (nesting depth added 15). 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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6d53e04b08a16281cffccf65c9f7768a2caca83a87f9cdd4da218447b44944"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::autofix_imports::update_import (cognitive 28): flow_services_code_action::autofix_imports::update_import has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (6 pts) (nesting depth added 15). 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":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd96302e49852c1f146c795bc9683268be0eef2ae0c8e084947df7d7f04e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::code_action_service::autofix_imports_fn (cognitive 28): flow_services_code_action::code_action_service::autofix_imports_fn has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (19 pts), match/switch 4 (9 pts) (nesting depth added 19). 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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5345d846cea1ae9b1993214052b170df09e65bbfe4ad4650a636c663957ad5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::collect_prototype_t::go (cognitive 28): flow_typing_flow_common::flow_js_utils::collect_prototype_t::go has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cdaed5482844a701036be0333cf78de22446fc5d3b68a4355ee2117b60fa1d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::union_optimization_guard::union_optimization_guard_impl (cognitive 28): flow_typing_flow_common::flow_js_utils::union_optimization_guard::union_optimization_guard_impl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, match/switch 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca97c353d988deae9ae85a2467aeb58c26d1700856be54cdd32aa0d43c48d9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::key_markers_seen (cognitive 28): flow_typing_flow_js::implicit_instantiation::walk::key_markers_seen has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5958}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c738497d6a009d062c19df132257fee7580ab7264e1045a19ced5a4112a10"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner (cognitive 28): flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 2 (4 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 13). 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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"821ecf39157281875071a9469315862fd48c2d0007f7555edefcf6ec691a38f1"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.handleClassComments (cognitive 28): comments.handleClassComments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 12). 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06e586fd397892708ebf56886944ce33b22623404feb1be2cc97991bd5b7e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::ls_command::get_ls_files (cognitive 27): flow_cli_support::ls_command::get_ls_files has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c72127a03530fd8e4beefcd33178a6c535039f8d8caef7f65a607db4be00cf"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::binding_type_identifier (cognitive 27): NameResolver::binding_type_identifier has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 7 (9 pts), boolean chains 6 (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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8970}}}],"partialFingerprints":{"codehealthFindingId/v1":"335a78fbb40500ce3d84aaaab14ee4fc365600a5a98c3919b6bf348f9acb1c03"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::ast_utils::acceptable_statement_in_declaration_context (cognitive 27): flow_parser::ast_utils::acceptable_statement_in_declaration_context has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, match/switch 3 (5 pts) (nesting depth added 8). 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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06af07d30eeabfc8106ef37dc4156b27c291288e9fa19fc0201ab7d78c90fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::layout::print_node (cognitive 27): flow_parser_utils_output::layout::print_node has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 15). 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":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f074e776125665c463a25190c974036a3031dc595cc5f27f58b33b663cb24a48"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentLowerer::map_statement_list_inner (cognitive 27): ComponentLowerer::map_statement_list_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 1 (2 pts), loops 1 (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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fc4cb196f8e742992b7df9a3a398ffd94e860d9a2082b282bf352c637a0af1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_env::server_monitor_listener_state::recheck_fetch (cognitive 27): flow_server_env::server_monitor_listener_state::recheck_fetch has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 4 (10 pts), boolean chains 3, loops 1 (nesting depth added 14). 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":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaecc1d8d3ab877a919620e68ad65458b0e4600b688494d0fe5345c946dfb68"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::file_watcher::edenfs_file_watcher::edenfs_listen_loop::main (cognitive 27): flow_server_monitor::file_watcher::edenfs_file_watcher::edenfs_listen_loop::main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (8 pts), loops 2 (6 pts) (nesting depth added 18). 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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"484c3f9e242e582b990cb71e8700304687af74091680671b3843b829d7c9d804"}},{"ruleId":"D2","level":"warning","message":{"text":"Def::iter (cognitive 27): Def::iter has cognitive complexity 27 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 4 (6 pts), match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b135abaf79fba1f3edb2eb4723caf16ddce6aaf769be80bd793abe19e4dbd78a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::declare_class_props (cognitive 27): flow_type_sig::type_sig_parse::declare_class_props has cognitive complexity 27 (threshold 15). Drivers by points: if/else 29 (65 pts), match/switch 6 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_named_prop, flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_computed_prop) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c680ba178bc4cda56a105a97f19f4c2153fa617d1da19c6dccd908cfdd20049"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::try_eval_concrete_type_truthyness (cognitive 27): flow_typing::merge::try_eval_concrete_type_truthyness has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 6 (11 pts) (nesting depth added 13). 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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"084d07fe5a020419770db84290d61a8013b18995a62346deb5ae56ba3ad86859"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::object_rest_with_env (cognitive 27): flow_typing_flow_js::slice_utils::object_rest_with_env has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 3 (9 pts), loops 3 (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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"337baba7d24617cfebaa0db1e07257caafadfb7f8fbfdee335ebec864c2e99a7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::match_pattern::object_properties (cognitive 27): flow_typing_statement::match_pattern::object_properties has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b037780c0d304cbda307f302c09df0991efacf020ca1cf797a9cb432013b3ca"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_guard::check_type_guard_consistency (cognitive 27): flow_typing_utils::type_guard::check_type_guard_consistency has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (9 pts), loops 1 (2 pts), boolean chains 1 (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":"rust_port/crates/flow_typing_utils/src/type_guard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6ebdadadc311f74e9353172871e322b9aa0e23e07db2007c0fa5c052d95f09"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportDeclaration (cognitive 27): ImportDeclaration has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 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":"packages/flow-remove-types/index.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b521edcf9b4392f40d286e121a35426cf632c9f940118095e69f02b2eec76bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::glean_runner::source_of_exports (cognitive 26): flow_cli_support::glean_runner::source_of_exports has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 12 (26 pts) (nesting depth added 14). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 4 function items inside it that branch (soes_of_packed, soes_of_packed_value, soes_of_packed_def, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"943de7507e54fbbdaf252e96042d3c6d9b7a6d2b84b788f78f69593b39492c60"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::stop_command::main (cognitive 26): flow_cli_support::stop_command::main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (5 pts), loops 1 (2 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":"rust_port/crates/flow_cli/src/stop_command.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420e3b9c4898892f4d886889f05d6ade4177f8156c065b138e3d548087d744f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::json_output::json_of_loc_context_abridged (cognitive 26): flow_common_errors::error_utils::json_output::json_of_loc_context_abridged has cognitive complexity 26 (threshold 15). Drivers by points: loops 3 (15 pts), match/switch 3 (6 pts), if/else 2 (5 pts) (nesting depth added 18). 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4767}}}],"partialFingerprints":{"codehealthFindingId/v1":"948ce57e830e032288c4fb071c93088f3860bda61516823a4bea93577fc7056e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::annotation_locs::bind_loop (cognitive 26): flow_env_builder_resolver::name_def_ordering::annotation_locs::bind_loop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 4 (9 pts), loops 1 (2 pts) (nesting depth added 15). 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":3875}}}],"partialFingerprints":{"codehealthFindingId/v1":"9883bf24b6ec8c6533691aad0d7c11670b398778898ece4f21c263ab07ff2c12"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::estree_translator::expression (cognitive 26): flow_parser::estree_translator::expression has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 10 (20 pts), if/else 3 (5 pts), boolean chains 1 (nesting depth added 12). 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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5be58acbdb0070210670a2586461965541d56264e9c956bde9aac2f05d63284"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::jsx_parser::element_with_optional_opening_less_than (cognitive 26): flow_parser::jsx_parser::element_with_optional_opening_less_than has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 19 (37 pts), if/else 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_parser::jsx_parser::element_with_optional_opening_less_than::children_and_closing_helper) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec53300a7f2b03663deb92687f13a07a6df636d7e53e3ed37afa65c3f2d1dc9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::import_declaration (cognitive 26): Writer::import_declaration has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (3 pts), match/switch 1 (2 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81eeb39d3c1f18856655a6dac317900a288f96ed5e995dad9a9e99494c62917"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::type_object_property (cognitive 26): flow_parser_utils_output::js_layout_generator::type_object_property has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 8 (12 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf689b7b87441e9c8ed0e9f02880bdd3c7d7c5d7b0eac64cfef824e8ef8b507"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::serializer::decode_escaped_raw_bytes (cognitive 26): flow_parser_wasm::serializer::decode_escaped_raw_bytes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (2 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6696fdaacc79f03f82728123539ab1eca82317cc6a7fa314a55e6825d881579"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::recheck::recheck_merge (cognitive 26): flow_services_inference::type_service::recheck::recheck_merge has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (8 pts), boolean chains 2, match/switch 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"af08e5ced5120733943d2d4379880b9872e87ce1224b0ee91c6a3865a1b78bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::object_type (cognitive 26): flow_type_sig::type_sig_parse::object_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26 (54 pts), match/switch 7 (12 pts), boolean chains 7, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_type_sig::type_sig_parse::object_type::object_prop) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4313ee4ef7fd94f8b39568928f674b55798011682d09483f1bea231794b824"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::param (cognitive 26): flow_type_sig::type_sig_parse::param has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, match/switch 1 (nesting depth added 7). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11198}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf3562195fa8294b5b4a769bdf58e9f04c58f09c47ca12f80545f6f4bec21d1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::type_inference::scan_for_lint_suppressions::process_comment (cognitive 26): flow_typing::type_inference::scan_for_lint_suppressions::process_comment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 16). 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":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"298c6e2d17b5243736f5578368f6c9a03ba6d987893dd1c870d30a9ac7199327"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorMessage::convert_type_to_type_desc (cognitive 26): ErrorMessage::convert_type_to_type_desc has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 14 (26 pts) (nesting depth added 12). Of this number, 13 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":7021}}}],"partialFingerprints":{"codehealthFindingId/v1":"581b93089d7b9275200051e2fdcb1c8dfddf07858f17ea66b1280afe1f334ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"Substituter::destructor (cognitive 26): Substituter::destructor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). 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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"a019624090521b2967c467010d5eef7e61b3135d65d05ca22da7d721d6c72cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::flatten_args (cognitive 26): Walker::flatten_args has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 4 (12 pts), loops 1 (nesting depth added 17). 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"626446a3f144ca4c6309ca106bda3f63ac88e21332ee99d518415d37af0466f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_renders (cognitive 26): Walker::walk_renders has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (10 pts), boolean chains 3 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b31c9577a8a3aeddc5eeec10d2b3ec4bfea365e9fe12ee430e4d0b612c493b"}},{"ruleId":"D2","level":"warning","message":{"text":"PropsToIndexerContext::flow_props_to_indexer (cognitive 26): PropsToIndexerContext::flow_props_to_indexer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts), match/switch 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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db7660a62db16a2ae6fde5087caf06a13944908480e4dfe3496353c6d7c1569"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::merge_lower_bounds (cognitive 26): flow_typing_flow_js::implicit_instantiation::merge_lower_bounds has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), loops 1 (2 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"840578e1202d34e3911e4ea54456944e34810c25677e6dcb9b1d97698f9b0610"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::jsx_title (cognitive 26): flow_typing_statement::statement::jsx_title has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (9 pts), boolean chains 3 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12891}}}],"partialFingerprints":{"codehealthFindingId/v1":"a336ad00f68fbf10658fd72bce4de54bd2d6b49bd86a39dace4586d7b46e866f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::predicate_of_refinement::pred (cognitive 26): flow_typing_utils::type_env::predicate_of_refinement::pred has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 4 (8 pts) (nesting depth added 13). 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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"76895a020f30dfb60182054e1a478ee78d504b9212fc3dc2286a7f967680f033"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::predicate_default (cognitive 26): flow_typing_visitors::type_mapper::predicate_default has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 7). 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac2fc188f23fe1be312f831ef8817035c781e4631390578bf234827bc41481"}},{"ruleId":"D2","level":"warning","message":{"text":"mutateESTreeASTForPrettier.mutate (cognitive 26): mutateESTreeASTForPrettier.mutate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, match/switch 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":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40c82b2f2ae35d1518763f869fae97418d9a4c0b0b8f258d2f309729a8545cc"}},{"ruleId":"D2","level":"warning","message":{"text":"convertClassMember (cognitive 26): convertClassMember has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"7536490dec23c0c44f11b6606808a0e32ddb485e42048cf475ace24d806a5faa"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransformContext (cognitive 26): getTransformContext has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 16, if/else 8 (9 pts), loops 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 13 belong to 30 function literals inside it that branch. 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":"packages/flow-transform/src/transform/TransformContext.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d5dd72f27bcc54cb6e2501deb53452315822f171ef335c6b1cad0759e77dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::compare_printable_error::compare_friendly_message (cognitive 25): flow_common_errors::error_utils::compare_printable_error::compare_friendly_message has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 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. This shape REPEATS in the file: one other method here (flow_common_errors::error_utils::compare_printable_error) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a2eb56962001f18a8bb706d62dc1f50b278eee0c9538a0af0daf67a3e1bc2a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::find_providers::join_envs (cognitive 25): flow_env_builder::find_providers::join_envs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (join_entries, join_scopes). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0fc43023be26b29c1c34d57af0d7fcbd330d42f9405c2ce4a3855c2b6c079d"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::binding_pattern_track_object_destructuring (cognitive 25): NameResolver::binding_pattern_track_object_destructuring has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 2 (6 pts), loops 1 (2 pts) (nesting depth added 17). Of this number, 16 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"047ab804628f5212707b7a8e6271f440217bf9636d2709bd3c85d6f87a17337f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::scan_block_comment (cognitive 25): flow_parser::flow_lexer::scan_block_comment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a9149bdd5c81af284deeaf3c570df8e56a02569934ec30df75c67063f0a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::parse_directives (cognitive 25): flow_parser::statement_parser::parse_directives has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (8 pts), boolean chains 3, loops 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56182fe2c7b1fce342c32eb317c90e651a9302e30c3c099ff57fa641e43cb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::function_param_list_without_parens (cognitive 25): flow_parser::type_parser::function_param_list_without_parens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 3 (6 pts), boolean chains 3, loops 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. This shape REPEATS in the file: one other method here (flow_parser::type_parser::function_param_list_without_parens::param) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19319c64e27587e00af4094ecdd0f294ee9e58592ff127c9bc7e10868fd3113"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::export_named (cognitive 25): Writer::export_named has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (3 pts), match/switch 1 (2 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea641503719fadb73628ed7bd4e2604e1c79779f6378ba0cab635f757cb42b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::generate_estree_visitor_keys (cognitive 25): flow_parser_wasm::bin::codegen::generate_estree_visitor_keys has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e80515f6bd13405a23d4c148d79b3bc59b11cd9a04e2c15dd71ab644e4e4835"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::handle_persistent_signaturehelp_lsp (cognitive 25): flow_server_command_handler::command_handler::handle_persistent_signaturehelp_lsp has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 10 (24 pts), boolean chains 1 (nesting depth added 14). 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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea39917f69273170625eae4bc5d5a477ca8c534f96ab168aa3c30ae0aa42aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_autocomplete::autocomplete_service_js::autocomplete_member (cognitive 25): flow_services_autocomplete::autocomplete_service_js::autocomplete_member has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91f4cf8db0ab68eb78a916a6bc8f77165d331ad606d67d3d450dbd0aa160dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::map_expression (cognitive 25): Mapper::map_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 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":"rust_port/crates/flow_services_code_action/src/autofix_new_to_record.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4df86d76d1ca89df2b73f116900a891df4fcd5be6f7f830d11561fee111e607"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportInformationExtractor::import_declaration (cognitive 25): ImportInformationExtractor::import_declaration has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 5 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). 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":"rust_port/crates/flow_services_code_action/src/document_paste.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bd2c02bcaedcbc9a516e3a45d85c969ac51c690c1dd65c851605ff7b92a3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Finder::jsx_element (cognitive 25): Finder::jsx_element has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (12 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fe9627d600078adac1fc55d23e9906f3c903d5d8b8f605c9914a1dce6d6f18"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_component (cognitive 25): flow_typing::env_resolution::resolve_component has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 5 (8 pts), loops 3 (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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"338287fe4b695e5a697c4e0d741c6fc073c2b73f48e78bbafa5c95d90f285c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::post_process_errors (cognitive 25): flow_typing_errors::intermediate_error::post_process_errors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 9, match/switch 3 (nesting depth added 4). Most of this is not in the body itself: 11 of the 25 points are its own statements and the rest belongs to 3 function items inside it that branch (dedupe_by_flip_loop, remove_unify_flip, dedupe_by_flip). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1269f0afbea85a4a2168c7592a12452900d71219dac1f4799bb1af586070d952"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations (cognitive 25): flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (12 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c0e6de8e0ac27b8ec7af929a9cca4483ac9229d2061b576daaac7fe5e1305d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::extract_strings_aux (cognitive 25): flow_typing_flow_js::template_literal_type::extract_strings_aux has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (8 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). Of this number, 20 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc64a32894e91290a9ef3dd6391ae80fc9e27e0d3e7ede27687414b5d454a11c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::convert_types::json_of_destructor (cognitive 25): flow_typing_utils::convert_types::json_of_destructor has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 13 (25 pts) (nesting depth added 12). 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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab688b7b30428e2bdeb985744addf4a576a4a8a7c43147c53b8e159f2af07b0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_fun (cognitive 25): flow_typing_utils::type_sig_merge::merge_fun has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, match/switch 4 (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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00c3c6681022a575e0fd1582ac52ac20e6a98bc63e8f74ae83dafdab7c1a83"}},{"ruleId":"D2","level":"warning","message":{"text":"StripFlowTypes.transformProgram (cognitive 25): StripFlowTypes.transformProgram has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eb4f771b514829c605db9967f12f9a07969591360f606266c5c85e67266434"}},{"ruleId":"D2","level":"warning","message":{"text":"visit (cognitive 25): visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 5, ternaries 1 (3 pts), loops 2 (nesting depth added 12). 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":"packages/flow-remove-types/index.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"630d4fdd9ecaedb48245f917517ffacc38a5c3b5f6a0db0f0574acc07f4c03b3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_analysis::scope_builder::lambda (cognitive 24): flow_analysis::scope_builder::lambda has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (9 pts), loops 3 (8 pts), if/else 6 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9ea776e61603a60087fcd51914bf321c592f4593641ef62bc047904771bd9d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateExportsMapper::map_function_return_annotation (cognitive 24): AnnotateExportsMapper::map_function_return_annotation has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (5 pts), loops 1 (4 pts) (nesting depth added 16). 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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1294b85ce3e266bdaa91df6b6891862b8b0f2257bb5392da920e788bf373c8e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::class_element::property_end_and_semicolon (cognitive 24): flow_parser::object_parser::class_element::property_end_and_semicolon has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 4 (7 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 3 other methods here (flow_parser::object_parser::class_element, flow_parser::object_parser::class_element::accessor, flow_parser::object_parser::class_element::init) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb1a80e1407a27392e1af7142000b9616eff46ecc41ffd97c7ce62d0fc0d253"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::parse_statement (cognitive 24): flow_parser::statement_parser::parse_statement has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5171}}}],"partialFingerprints":{"codehealthFindingId/v1":"06327623be782e9a355b2406c52d4ab08f70f485f48d8166e639ebceb95b52f0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_export::export_service::add_imports (cognitive 24): flow_services_export::export_service::add_imports has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (17 pts), if/else 1 (6 pts), loops 1 (nesting depth added 17). 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":"rust_port/crates/flow_services_export/src/export_service.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c2600dde0f6e3b632aa5dfd687c2959dd1bbc036045e8e0e55d8b7caf55ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::pattern (cognitive 24): Searcher::pattern has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (9 pts), boolean chains 3, loops 1 (2 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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dda38808bd1d6a8099361e075b66ee5116d44c44fa6fd8a456d6b7683b15c2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::check_files::check_files (cognitive 24): flow_services_inference::type_service::check_files::check_files has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4 (6 pts), loops 3, boolean chains 1 (nesting depth added 5). 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1b11c2e19b6b92212f3f4ce572ce541e898767af9e588671de2e22e9444561"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_component_type_params (cognitive 24): flow_typing::env_resolution::resolve_component_type_params has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 6 (8 pts), loops 3 (6 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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec14cca996f08a1fbe51368e0307b2df5697eafad293f80142ab050e8b8f6321"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args (cognitive 24): flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array, flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_call_arg::flatten) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"25169babb84857f86f637ecf1fe001b5ad4d1b8e15225c6403ee378c1da3e224"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut (cognitive 24): flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (7 pts), boolean chains 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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56f3f24e636fc48a28acbe9269e0d6b42f025d8c4bedc1aee5be47748537cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::check_super_abstract::walk_one (cognitive 24): flow_typing_statement::statement::check_super_abstract::walk_one has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (9 pts), loops 1 (3 pts), boolean chains 2 (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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a44d792a049230b8c41f1e452bc092f141053521a2446a680972a0bd568e4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::static_method_call_object (cognitive 24): flow_typing_statement::statement::static_method_call_object has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (6 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14415}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaa47257b571fa3fd738ceb15a12650e9940cc3fc57fdee967350c8846f9ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_exports (cognitive 24): flow_typing_utils::type_sig_merge::merge_exports has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (11 pts), loops 4 (9 pts), if/else 2 (4 pts) (nesting depth added 11). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (copy_star_exports, merge_star, copy_named_exports_star, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbcfacec782dd1c73dc886d7fca6bd4f285de7602f4fcdb81f170a47750ae91"}},{"ruleId":"D2","level":"warning","message":{"text":"compile_swebench.compile_project_pattern_evals (cognitive 24): compile_swebench.compile_project_pattern_evals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), error handling 1 (2 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":"evals/compile_swebench.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3677f7721af8dfce0cd09413f9dc3e430ea7d758ac1acb478bd6073fdaa7ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeBase.isStrictScope (cognitive 24): ScopeBase.isStrictScope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 11 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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c768151af9d8ee3ff25abce635f88c5057d67d8cc1bf88ec0851d50aa42d16a7"}},{"ruleId":"D2","level":"warning","message":{"text":"flowToFlowDef (cognitive 24): flowToFlowDef has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (6 pts), other 2 (nesting depth added 10). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (updatePendingStatements, storeTranslatedStatement, updateProcessedStatement). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"034eef06f173a002fead7c93b0a891987498605f873ecf11527ae6f2cfe014a4"}},{"ruleId":"D2","level":"warning","message":{"text":"transform.VariableDeclarator (cognitive 24): transform.VariableDeclarator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/src/codemods/collapseObjectInitialization.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3a304ac215b0e277a0bde2c48e51c0bc85c6944cc465e407dc6c11465b2729"}},{"ruleId":"D2","level":"warning","message":{"text":"parse (cognitive 24): parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/command/Base.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c213597026387269cb97a375630dbb17e5ba01e51a97d4e108b3ba10015c29a"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphOverlay::update_from_map (cognitive 23): GraphOverlay::update_from_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (10 pts), match/switch 1 (2 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":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df6bf40280043c3e9701e7b7ea340105379f06a84a1ba6723cf34ae14e6e2b1"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::normalize_total_refinements::recur (cognitive 23): NameResolver::normalize_total_refinements::recur has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"065a0b7eb3c0b5e625586163f07f25e42ad6ecb5b7934f0a5dcc07cc08744963"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceLocationTable::skip_trivia (cognitive 23): SourceLocationTable::skip_trivia has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 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":"rust_port/crates/flow_parser/src/source_location.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2057d26a30adfd7223cd1249b82a242d44ac4eaf45e9482820507687902c4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::new_expression (cognitive 23): flow_parser::expression_parser::new_expression has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 pts), boolean chains 3 (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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d2e51861c66727a40ee42d15f7374cd4b9ae67b9c0970ed1ad429a12168024"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::decode_identifier (cognitive 23): flow_parser::flow_lexer::decode_identifier has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a0e56d75e74f89e9a3ce5c46c82cb617572bd96168d8c2d7a075d8796b9549"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::jsx_child_text (cognitive 23): flow_parser::flow_lexer::jsx_child_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab748c598fa4f89e2c64a0fdcc0e217d0ae485f9a545ef6001090843dba33a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::object_parser::class_element::accessor (cognitive 23): flow_parser::object_parser::class_element::accessor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (flow_parser::object_parser::class_element, flow_parser::object_parser::class_element::property_end_and_semicolon, flow_parser::object_parser::class_element::init) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"07579b4440461c1dbc9b622bfd564d641850939cfd56751c7beb90ed003f0086"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_export::export_search::take (cognitive 23): flow_services_export::export_search::take has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_export/src/export_search.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"57780d71de163ceaafc1e7bd5215180fcd5cc6641f63fe33228099565d79886d"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::pattern (cognitive 23): Searcher::pattern has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). 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":"rust_port/crates/flow_services_references/src/property_find_refs.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ada18567edd7fd4373b3fe2ccd566c2bacc0d0b824abd8efe8adb0d4e13c9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::merge_namespace_entries (cognitive 23): flow_type_sig::type_sig_parse::scope::merge_namespace_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f9f428b4594b805d526f9697ba70ad58dfe2b3f0c42935280eed2c65635840"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::import_export_utils::get_module_type_or_any (cognitive 23): flow_typing_flow_common::flow_js_utils::import_export_utils::get_module_type_or_any has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (11 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":6486}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca848a25546c8505df6db3af9e7d45b1266d73121005ee3730e5991f9848e0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::import_type_t_kit::canonicalize_imported_type (cognitive 23): flow_typing_flow_common::flow_js_utils::import_type_t_kit::canonicalize_imported_type has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 8 (23 pts) (nesting depth added 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. 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4635}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d10b96e7a27f99c373be52eda1c018c17128564d4964d20f0732e4316816a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::propagate_any (cognitive 23): Walker::propagate_any has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2d45d70e6d5eb687c297e7b88132d6c1894e2efe3eae64d9fbd5275c269f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::helpers::perform_lookup_action (cognitive 23): flow_typing_flow_js::flow_js::helpers::perform_lookup_action has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 6 (11 pts) (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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f99341428d98606b3a4ac8f6bff1e62b4d74106bbd36b2e3878d0e617e621e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_conditional_type_targs (cognitive 23): flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_conditional_type_targs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c68b153cf2f821ca47acf706626aeecce61123482126380ecd3ab8d4fa4dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::class_sig::supertype (cognitive 23): flow_typing_statement::class_sig::supertype has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (9 pts) (nesting depth added 10). 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f444434de230b6631101f6cbfadfa0cd37d515559d2d17a789b6a08f975960"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTInner::eq (cognitive 23): UseTInner::eq has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 22, match/switch 1. 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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b06eed8061a0e5acacea6102f4849b3f0721de280aa37cbf490579f13a69b60"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::filter_values_by_patterns (cognitive 23): flow_typing_utils::exhaustive::filter_values_by_patterns has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4, match/switch 3 (4 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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"55220442df52d47ada717086ee8543b48a7ce961801c3fa71469e1fc0de373b5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::sentinel_refinement (cognitive 23): flow_typing_utils::type_filter::sentinel_refinement has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (11 pts), boolean chains 7, if/else 4 (5 pts) (nesting depth added 5). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (filtered_loop, enum_match, is_str_or_num_or_bool_or_bigint_or_null_or_void). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"720d37ccc7a9a053efa2cb6a03964fc63fe7919c43a610699f747ec31d63d8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"transformProgram::transform (cognitive 23): transformProgram::transform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 10). 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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa312c2371481a6e78eb2c2e14198999ec7ef427219fe78b6c92284915a018a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::config_command::check_subcommand (cognitive 22): flow_cli_support::config_command::check_subcommand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 2 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_cli/src/config_command.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a29a521d819b71acb8cac617f4a37de20e13a1acc2f102c56fe5b01af3e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_annotate_exports::run_annotate_exports (cognitive 22): flow_dev_tools::runtests::check_annotate_exports::run_annotate_exports has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 8, boolean chains 1, match/switch 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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb73f14edaa582f412c11dc665341730d1e390834b233b6b6bb8689eba1761b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::update_suppressions::update_suppressions::update_suppressions_in_text (cognitive 22): flow_dev_tools::update_suppressions::update_suppressions::update_suppressions_in_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/update_suppressions/update_suppressions.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a32fce9274085f22abd9bcf78430eb7a91a3e1721ff358740640b458258753"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::member_expression_refinement_must_be_able_to_refine_base_object_to_non_maybe (cognitive 22): NameResolver::member_expression_refinement_must_be_able_to_refine_base_object_to_non_maybe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 6 (8 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b60155b0de94d3276f039c8c80994707cb1ca14fd87ae36bd383112d5a8f889"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_error (cognitive 22): flow_lsp_server::flow_lsp::main_handle_error has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (9 pts) (nesting depth added 12). 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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d489113676e45390e07cc180676f9aac4593f2fe1df71e817fb0c4a6aa97e52b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::object_type::properties (cognitive 22): flow_parser::type_parser::object_type::properties has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_parser::type_parser::object_type::property) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7b8d2198dab5066e4f3faad88490579992e8a2b2a6e513b6ee7aaac02bb985"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::enum_validate::validate_explicit_string (cognitive 22): flow_parser_utils::enum_validate::validate_explicit_string has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 12). 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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ca75f6dd205fc3774c636911377695630d1c955869ace671551ef569b1e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::ast_diff_printer::edits_of_changes_rec (cognitive 22): flow_parser_utils_output::ast_diff_printer::edits_of_changes_rec has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1 (nesting depth added 12). 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":"rust_port/crates/flow_parser_utils_output/src/ast_diff_printer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc4df0e1a69c76c41f7396a9c4169feffc0853753a97f5a4199affc9d219556"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::statement (cognitive 22): flow_parser_utils_output::js_layout_generator::statement has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 9). 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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"c807d7ace8b231579b50195df261e953dbe567b0e0b85337ab36882b504470d3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::serializer::parse_bigint_value (cognitive 22): flow_parser_wasm::serializer::parse_bigint_value has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 8 (10 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":5145}}}],"partialFingerprints":{"codehealthFindingId/v1":"db62affc6796af3d06c00e7a898ba1ab224185653d5385f6d13e513f7da82f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor_server::server_instance::start (cognitive 22): flow_server_monitor::flow_server_monitor_server::server_instance::start has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (10 pts), if/else 7 (9 pts), loops 2 (3 pts) (nesting depth added 6). 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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc307652da4aee7c0c06673dd02c093022bd9195b604b788ac87d8def72cc841"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::socket_acceptor::perform_handshake_and_get_client_handshake (cognitive 22): flow_server_monitor::socket_acceptor::perform_handshake_and_get_client_handshake has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 4 (6 pts) (nesting depth added 5). 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":"rust_port/crates/flow_server_monitor/src/socket_acceptor.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"41700b1dc961ae53ee367ea32c6a8bb7e9ef0d0aa7c001a823761421a52c692e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_statement (cognitive 22): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1828716d92196988302b5062765caaf6f18e708614a6dd79094a385d0a314f"}},{"ruleId":"D2","level":"warning","message":{"text":"Searcher::expression_inner (cognitive 22): Searcher::expression_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c032ce7831c92e92b84c42906761a4afbd316323903e98eb90e968c316d169"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_get_def::get_def_utils::extract_def_loc_resolved (cognitive 22): flow_services_get_def::get_def_utils::extract_def_loc_resolved has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (10 pts) (nesting depth added 13). 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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5416317d3800ac93c60d5db453fe5c14ce412ce14b091394c654ba9de7a0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::recheck (cognitive 22): flow_services_inference::type_service::recheck has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb963044ed1756dcd21d42f9ffbd758896291cbdbbd4c5fceef208b717d2fc71"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::check_files_for_init (cognitive 22): flow_services_inference::type_service::check_files_for_init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518f4a4ee426ecb05fa9888e24a91b40c4fbbd8fedefe1c8f5ebf244e6cd376"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::ancestors (cognitive 22): Walker::ancestors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 1 (3 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b496eb42f136b3ad860c4d35cc671d390e549e5bb3cd67c7a5645061d9d2d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::object_kit::compute_name_remap (cognitive 22): flow_typing_flow_js::object_kit::compute_name_remap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 8 (9 pts), loops 2 (3 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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4bd3f0bb8531e22b3d55275796e8206cf022c143edc3ce9844ab650d05d946"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::react_rules::downstream_effects (cognitive 22): flow_typing_statement::react_rules::downstream_effects has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 4, loops 1 (2 pts) (nesting depth added 10). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. 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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f12bf0f0251ef7ec829ee3c6a8e156e27a6923f0ab0c39156bec2e6cef0493"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::union_rep::lookup_almost_disjoint_union (cognitive 22): flow_typing_type::type_::union_rep::lookup_almost_disjoint_union has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d2f03b535c633a472575e56dcd5579e489e7d134f67477c54fc9c0c3b726f7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::operators::check_eq (cognitive 22): flow_typing_utils::type_operation_utils::operators::check_eq has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), match/switch 5 (6 pts), loops 2 (4 pts) (nesting depth added 5). None of this is in the body itself: all 22 points belong to 4 function items inside it that branch (equatable, distribute, will_fail_check_if_unmatched, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d491126ef4fb00d7544f1f7b59d90423eb044444a3e54374f33da6545e624d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_operation_utils::type_assertions::assert_iterable (cognitive 22): flow_typing_utils::type_operation_utils::type_assertions::assert_iterable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), match/switch 2 (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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f92548f87d5b1c329d36478745c9bbeb94592ce203adb5e4c731d7d45eff0"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms::DeclareClass (cognitive 22): getTransforms::DeclareClass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 4 (6 pts), other 5, match/switch 2 (4 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6c70ec0f50efb5af4fe7cbbb87f6fbbd12ffed22159d0afbdfa55f71446763"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms.EnumImpl (cognitive 22): getTransforms.EnumImpl has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 4 (6 pts), match/switch 1 (2 pts), loops 1, other 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"255721cb058fa001ce68148f32df8f88836ad2b022e1993b02adeff737e3a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"convertExportDeclaration (cognitive 22): convertExportDeclaration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 4 (8 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"964fc2ba617c252f2c79dde9468ede0a8d2293dd9ce0049adb37f5539becc2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"eliminateAbstractComponent (cognitive 22): eliminateAbstractComponent has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (8 pts), ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ee60f2330fc37c6ac99007f3a151abc7fe16f2c0da80728007f54df1b64e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::check_contents_command::main (cognitive 21): flow_cli_support::check_contents_command::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4, boolean chains 2 (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":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8210646e54173b4ed2733e83e642d7688a6a3b6fd716bb13dfceaedc44d72511"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::env_builder_debug_command::main (cognitive 21): flow_cli_support::env_builder_debug_command::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (9 pts), match/switch 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/env_builder_debug_command.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90122f31c6d35cf3e5b429fa90be35bc2b7a58b54e0f8cd3c854d254bfde68e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::status_command::check_status (cognitive 21): flow_cli_support::status_command::check_status has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (3 pts), match/switch 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":"rust_port/crates/flow_cli/src/status_command.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b0a8019f47bfe9209092cd308445751e3dd4e70e746abc6e36d764190c2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_website::extract_blocks (cognitive 21): flow_dev_tools::runtests::check_website::extract_blocks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_website.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b4e4a8b75b70dd49739303c38efa1d214bbaf326aaa50ecf9cd1d13cdf2f32"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::jsx_element (cognitive 21): NameResolver::jsx_element has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (13 pts), if/else 2 (4 pts), loops 1 (4 pts) (nesting depth added 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. 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c13777aeb7ab49941a201bb13a38669fce6b045c80b332c1fcc9c71c34c5f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::array_initializer::elements (cognitive 21): flow_parser::expression_parser::array_initializer::elements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts), boolean chains 1, 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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":3140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e56a6bff61b27642b9ea2fc37be0e1e6915a43ad6ae94ea38fbb0d2020dca87"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::flow_lexer::starts_with_id_continues (cognitive 21): flow_parser::flow_lexer::starts_with_id_continues has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad54c36f8853b946aebc5559b46318fdbaeb8f55c2bcf9e34c50a71f1c67506"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::component_param_list_without_parens (cognitive 21): flow_parser::type_parser::component_param_list_without_parens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 12). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbee4ee92327c0d215c598e5f70a9687b79672c4ad3fb3e0226310a300f90c3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_wasm::bin::codegen::generate_estree_predicates (cognitive 21): flow_parser_wasm::bin::codegen::generate_estree_predicates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 8 (nesting depth added 3). 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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a33e2e116b2abd81004d781a779a436765d7e29d092625f5223961b7d42cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::map_match_pattern (cognitive 21): Mapper::map_match_pattern has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (4 pts) (nesting depth added 8). 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":"rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b785db29db1fe91508c9aa96f79b68c2ef91f9c20bd2d6eafbc57ad9b7f78b"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::map_expression (cognitive 21): Mapper::map_expression has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_prop_typo.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"23475f9117a0e605bd7f971f03bd700d9b248d9feeab3fe36ad138f204e82922"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_class_body (cognitive 21): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::collect_class_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (7 pts), 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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f9473ef16059482c0cb892b787c296b88868ad704c67d598ed6f2036823f38"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::autofix_missing_local_annots::map_of_fixable_missing_local_params (cognitive 21): flow_services_code_action::autofix_missing_local_annots::map_of_fixable_missing_local_params has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (12 pts), if/else 2 (8 pts), loops 1 (nesting depth added 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. 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":"rust_port/crates/flow_services_code_action/src/autofix_missing_local_annots.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"027a4aab335bc841a2b80fdbdd6006883f68384d981255863062a56dd7a88644"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::refactor_extract::create_extracted_function_call (cognitive 21): flow_services_code_action::refactor_extract::create_extracted_function_call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), 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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376c699ea8248756bff1dff785aa5be5c7e477bcd02fcdcb8bfe9ddc849c99e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_type_of_name::type_of_name::summarize_ty (cognitive 21): flow_services_type_of_name::type_of_name::summarize_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). 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":"rust_port/crates/flow_services_type_of_name/src/type_of_name.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"615c349b49735e6d626cc12a6b4c5e48a16c98c9139f1a68e80bee9f4179b7de"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::compact (cognitive 21): Builder::compact has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (8 pts), loops 2 (nesting depth added 8). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (loop1, loop0). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/compact_table.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"254678b961fc0e62679db3ce214f5b841d3366e88ee3e4fd1d09c75978341832"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::bind_declare_class (cognitive 21): flow_type_sig::type_sig_parse::scope::bind_declare_class has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 6 (9 pts) (nesting depth added 8). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bead6615e1c61ff7af1d2209dbe9e75b789cbbccf27832476977f8fd5a97e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::type_inference::stmt_validator (cognitive 21): flow_typing::type_inference::stmt_validator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 7). 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":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b8d43b81deb1bba08dd9cb91d6d46edfd1b68300a356d0b0b96ba000f8df35"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::quick_error_fun_as_obj (cognitive 21): flow_typing_flow_common::flow_js_utils::quick_error_fun_as_obj has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 4 (7 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 9). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2890}}}],"partialFingerprints":{"codehealthFindingId/v1":"2921a72279044974903ab4d8048bf6ceaf12737b869465b80929732c554db9e8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::walk::pin_bounds (cognitive 21): flow_typing_flow_js::implicit_instantiation::walk::pin_bounds has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5, boolean chains 3, loops 1 (nesting depth added 6). 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":7248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb7afa53b3dff45d579946357600481d094bde4ed069cc22e01370f963dd567"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::array_flow (cognitive 21): flow_typing_flow_js::subtyping_kit::array_flow has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (8 pts), boolean chains 5, match/switch 2 (5 pts), if/else 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a3264ee7e49efb8162dbec509aaceff00bcba223fbb3d89c90e3f455ac625"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::is_bigint_text (cognitive 21): flow_typing_flow_js::template_literal_type::is_bigint_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (4 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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeef1e7e6072fef42c6e04a6fd4566cbe31c27e2d51b7d70230a88408e48f01"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::template_literal_type::try_subtype_template_to_template (cognitive 21): flow_typing_flow_js::template_literal_type::try_subtype_template_to_template has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 1 (2 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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad2af7d197d3b625aade90313bf4c8e2a5478949e0cba96a1916dff5bd982db"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_variable (cognitive 21): flow_typing_ty_normalizer::normalizer::type_variable has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 5 (9 pts), loops 2 (nesting depth added 10). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (uses_t, resolve_from_lower_bounds). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed1d11e6c8d1912a8d3be9f8becd4a0699724518d55d5424cd8f9f5cbf02f62"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::inline_interface (cognitive 21): flow_typing_ty_normalizer::normalizer::type_converter::inline_interface has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (11 pts), loops 3 (6 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (construct_props, has_implicit_receiver, extends). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c520206671e8ea9ee6a02b3a81bdabf6060f1c23fb34663e2ff67e4b704bb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportExportVisitor::variable_declarator (cognitive 21): ImportExportVisitor::variable_declarator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (4 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3d2cf0507b5b84e8cdfad85f3f1f4085cdb8e6f97b8b2d649db8faf56deb7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::has_prop (cognitive 21): flow_typing_utils::predicate_kit::has_prop has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 9 (15 pts), boolean chains 3, loops 3 (nesting depth added 6). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (find_key, some_has_prop, try_all_have_prop, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2662c6806286da8d91a4b994d934e712ce55749282c1a6537459b328f26be3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::strict_es6_import_export::is_require (cognitive 21): flow_typing_utils::strict_es6_import_export::is_require has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 1 (nesting depth added 15). 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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce48303d9e127823b5885d4fc0cd132c17734d3f59178cd6397999fada3897"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::maybe_predicate_function (cognitive 21): flow_typing_utils::type_env::maybe_predicate_function has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). None of this is in the body itself: all 21 points belong to 4 function items inside it that branch (on_ground, on_concrete, on_t, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06b251786373c41ede02c32d6b96aa8ae5fe0c03f6983a2ecb88e8755fb8943"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_enum (cognitive 21): flow_typing_utils::type_sig_merge::merge_enum has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (6 pts) (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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"43db15db6c9bab86682a1c93d75fe0d5b3a16b3c49bbcb65c8a5042c2e30e922"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_interface_extends (cognitive 21): flow_typing_utils::type_sig_merge::merge_interface_extends has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 2 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0255a672814dc38f18cb54e88b25d46d1ab74fc90d9acdda1c3e958c1bd13b5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_this_class_t (cognitive 21): flow_typing_utils::type_sig_merge::merge_this_class_t has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (6 pts), loops 5 (nesting depth added 9). 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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c2c0589abc3883dc1cae0028e2eb4526e206727413ab2357c442d176f70354"}},{"ruleId":"D2","level":"warning","message":{"text":"compile_swebench.validate_config (cognitive 21): compile_swebench.validate_config has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/compile_swebench.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"20be7043ef4e0f089a5e017e564f7a0c23c23bbdd820ea29ef4b5b127f337194"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.getSortedChildNodes (cognitive 21): comments.getSortedChildNodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 2 (4 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc20d07e5a1cb5b836a3035b7db08fbfe4ee708b25d6cd9762667cb1b3d57f7"}},{"ruleId":"D2","level":"warning","message":{"text":"loadWasm (cognitive 21): loadWasm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 171, (anonymous)::finish, (anonymous)::onRuntimeInitialized, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flow_dot_js_wasm.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"873c0fcf8a578348c0b585d753d57049fa4b7022deb2f69dbe330b6ecd104eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateLiteralDeclarationsMapper::program (cognitive 20): AnnotateLiteralDeclarationsMapper::program has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), loops 2 (3 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":"rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb1196ff365e75df5e9e17743d7057e02baeb0149fa520005767912aaf3d94e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::js_number::ecma_string_of_float (cognitive 20): flow_common::js_number::ecma_string_of_float has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (4 pts), boolean chains 3 (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":"rust_port/crates/flow_common/src/js_number.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b751857026477dff61ff1545f008f5db8a57f84df1b63e8923aae06607b7fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::print_message_friendly::concat_words_into_lines (cognitive 20): flow_common_errors::error_utils::cli_output::print_message_friendly::concat_words_into_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (5 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4665cd393cc94322a18fdbb30120cae367590ab411d5b13928bd2ec6398a78d2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_utils::utils_js::typo_suggestion::typo_suggestions::distance (cognitive 20): flow_common_utils::utils_js::typo_suggestion::typo_suggestions::distance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (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":"rust_port/crates/flow_common_utils/src/utils_js.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"98842e25e7b5d4812901afaf581c2c2ab02cb31e4723b66a8725fac2151cec23"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::comment::comment_mutator::format_comment (cognitive 20): flow_dev_tools::comment::comment_mutator::format_comment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 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":"rust_port/crates/flow_dev_tools/src/comment/comment_mutator.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940de80887ec0dcfea67e578913e693173a7d3916674af128226e10a4eab5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::visit_function (cognitive 20): DefFinder::visit_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 5 (7 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a7d5d3fdd0fff4f63175b9807bc7c30e80e835c2852936a03b2f1cf8760d91"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::name_def::obj_properties_synthesizable::synthesizable_expression (cognitive 20): flow_env_builder::name_def::obj_properties_synthesizable::synthesizable_expression has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (6 pts), match/switch 3 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_env_builder::name_def::obj_properties_synthesizable) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f453f201ef8c30e566a12f158a85c39b8e148f13f4274af29ef7334dc478596"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder_resolver::name_def_ordering::depends::depends_of_hint (cognitive 20): flow_env_builder_resolver::name_def_ordering::depends::depends_of_hint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (6 pts), match/switch 3 (6 pts) (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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bda20e7c24d652bdec507dbfae61953358f07d8d4e982734a5f218801ec38a4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_component_params::param (cognitive 20): flow_parser::declaration_parser::parse_component_params::param has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_parser::declaration_parser::parse_component_params::param_list) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fd81f91c01c7d29b87c02daffa959d59d7ced03aca591e937af0548ff83124"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::assignment_cover (cognitive 20): flow_parser::expression_parser::assignment_cover has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20 (35 pts), match/switch 11 (16 pts), boolean chains 3 (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. This shape REPEATS in the file: one other method here (flow_parser::expression_parser::assignment_cover::try_assignment_parse) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f70f4baeae47bb5adc209e56d1b9362e222d66bbd75adf02f8a310719090fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::logical_cover (cognitive 20): flow_parser::expression_parser::logical_cover has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 1 (3 pts), loops 3 (nesting depth added 10). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function items inside it that branch (coalesce, logical_and, logical_or). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3213303f824202e65d2ba23d8a9a6c3601770965d8e3cd969462ccbb31a6a3c9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::match_pattern_parser::object_pattern (cognitive 20): flow_parser::match_pattern_parser::object_pattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 9). None of this is in the body itself: all 20 points belong to 3 function items inside it that branch (properties, property, property_key). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"d381a21081184c7b42bf9c2978bf6cfc745cf6c947e795685572f8bb3a56cbd7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::declare_namespace (cognitive 20): flow_parser::statement_parser::declare_namespace has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c533cbb7401a8a4a29dab50774c86874b433da7aef67ae981777fd103f06a502"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSig::to_debug_string (cognitive 20): FileSig::to_debug_string has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (9 pts) (nesting depth added 8). 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":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fea8e299e32ea12c58887e96893a024b959dfbdbe9f8e13a7b2327a063c033"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::class_element (cognitive 20): Writer::class_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"0732567797eabf05d70ac57ef22d001db6ae176e43928107aba28231af79a265"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_declare_export_declaration (cognitive 20): Serializer::serialize_declare_export_declaration has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 4 (6 pts), loops 2 (5 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9664f3d915098a20c1915b82e0bf79b551863b7d186f444be860fbfba110ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_component_declaration (cognitive 20): Serializer::serialize_component_declaration has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), match/switch 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9828726c8508e77432a2b0bd2f90b088bd27369c8c5623515785398f35a13466"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parsing::parsing_service::reducer (cognitive 20): flow_parsing::parsing_service::reducer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (4 pts), boolean chains 3 (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":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f17835f89f6a1e81887f1ac4d5e636cf4260a9541228a44757e2c8763412f9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::handle_global_find_references (cognitive 20): flow_server_command_handler::command_handler::handle_global_find_references has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 2 (5 pts) (nesting depth added 12). 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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d493a90746d7488b53d27cdc7714e14b4c14f69db50939aa9ac28884f69d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::handle_persistent_coverage (cognitive 20): flow_server_command_handler::command_handler::handle_persistent_coverage has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 4 (9 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e4608f42cf1f6890be58a81f70de5f6e1a56badb451f38525e66305fa1beec"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::get_persistent_handler (cognitive 20): flow_server_command_handler::command_handler::get_persistent_handler has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (9 pts) (nesting depth added 8). 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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeed085cf165fde996f659767f679939742d594b3e467f212a335acc6affb93"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_autocomplete::autocomplete_service_js::local_value_identifiers::is_record_type (cognitive 20): flow_services_autocomplete::autocomplete_service_js::local_value_identifiers::is_record_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (20 pts) (nesting depth added 13). 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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"75922a31fbc656ed28d059a58529dc300e527faf9717a5c4e7a10cb6257823f4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_autocomplete::autocomplete_service_js::autocomplete_id (cognitive 20): flow_services_autocomplete::autocomplete_service_js::autocomplete_id has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). 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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"202705a46b2c117137aba1c929590b4fbcb320ce91a3dee62dfefaaa19f44699"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_export::export_service::entries_of_exports_helper (cognitive 20): flow_services_export::export_service::entries_of_exports_helper has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (7 pts), loops 1 (nesting depth added 12). 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":"rust_port/crates/flow_services_export/src/export_service.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2be45ff175ca6883518b92cf93998f0070264269ceb1df9f65cbef8bf25af"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorMessage::error_code_of_message (cognitive 20): ErrorMessage::error_code_of_message has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 2 (3 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":13031}}}],"partialFingerprints":{"codehealthFindingId/v1":"9470e8afb9c78bcced74d0db79339e73f989a8f2b41c6eb5cf6e40b93913037d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::eval_helpers::eval_selector (cognitive 20): flow_typing_flow_js::flow_js::eval_helpers::eval_selector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c7726aff76aad8c0e4d9fb8acf08092cf6e10d33140dc071c87e000ee283bf"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::get_prop_helpers::get_private_prop (cognitive 20): flow_typing_flow_js::flow_js::get_prop_helpers::get_private_prop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fccd3161bf72f524fba71482139f1d054abd44f64b0dcabb404c60348e1dcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::intersect_slice_contents (cognitive 20): flow_typing_flow_js::slice_utils::intersect_slice_contents has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (6 pts), boolean chains 3, loops 1 (nesting depth added 6). 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f3f833b421bf37e03c9dd9fdfc622a3c544aaab8be371533211cfc79c6640"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectExpressionAcc::mk_object_from_spread_acc (cognitive 20): ObjectExpressionAcc::mk_object_from_spread_acc has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 4 (6 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a026f25b4bbcf8d7ccf6427875d369e6776a6bbf0d641ae5252c9284620a6474"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::tuple_spread (cognitive 20): flow_typing_ty_normalizer::normalizer::type_converter::tuple_spread has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 3 (6 pts), if/else 1 (4 pts) (nesting depth added 12). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9599ee2f32cbb04f9092870f4f510ee3a21e9534997c3119de2d7504377864fa"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::exhaustive::pattern_union_builder::leaf_of_type (cognitive 20): flow_typing_utils::exhaustive::pattern_union_builder::leaf_of_type has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (5 pts) (nesting depth added 13). 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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0fcbb60460c26a57a61158dec9d265c5c0550a69aa7140c182ffd7e4d033c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::intersect_type_guard::try_intersect_related (cognitive 20): flow_typing_utils::predicate_kit::intersect_type_guard::try_intersect_related has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 6 (7 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (flow_typing_utils::predicate_kit::intersect_type_guard) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aa4d54496f39562baf4f091c0df6afdde7f8ddad3a99e5aae71f2cfd9a3ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::read_entry (cognitive 20): flow_typing_utils::type_env::read_entry has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 2 (4 pts) (nesting depth added 12). 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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ab4e7078e0d9291e66261b6b0dc095aa4fe284213cdc7133a3b71624ed253"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::subtype_against_providers (cognitive 20): flow_typing_utils::type_env::subtype_against_providers has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 11). 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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"24497a2791975f9b1d45eb92b9053f1090226366a9931b2bdd7db60d03fa631f"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusBarWidget.render (cognitive 20): StatusBarWidget.render has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 4, if/else 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-for-vscode/src/FlowLanguageClient/StatusBarWidget.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f089ebf5d1acd20c7c96ca3cb4156c514735de64b40c583c506533f6b31cffd4"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformMatchSyntax.analyzePattern (cognitive 20): TransformMatchSyntax.analyzePattern has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf3f8a239cf3421c01b1db61dc37e220744c74a2d7bc7f8527bc105e31760b7"}},{"ruleId":"D2","level":"warning","message":{"text":"findDeclarationByName (cognitive 20): findDeclarationByName has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ea51d49afdd62fae8e9c777f2686ec280b1f542e6f3dced5689d6e75a9d23"}},{"ruleId":"D2","level":"warning","message":{"text":"transform.ClassDeclaration, ClassExpression (cognitive 20): transform.ClassDeclaration, ClassExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/src/codemods/removeDuplicateClassProperties.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"710e046b14c07dfe477165743f3e646a3a7512138e24b7553af0e8b41e9e865c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::js_number::shortest_string_of_float (cognitive 19): flow_common::js_number::shortest_string_of_float has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 3 (5 pts) (nesting depth added 5). 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":"rust_port/crates/flow_common/src/js_number.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd19a87937ee25d672f094a6b05b670cf06b735e6a7e1f58268877cfaf06e34"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_errors::error_utils::cli_output::format_errors (cognitive 19): flow_common_errors::error_utils::cli_output::format_errors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 2, boolean chains 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fd8f3ebf551c3dd6b011910579ef3e87edeb8906a49081ea3f4a2dab14bf99"}},{"ruleId":"D2","level":"warning","message":{"text":"FindProviders::add_provider (cognitive 19): FindProviders::add_provider has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9f7f077cd0848beb7ba47d1cb72898483dbb97c22647fdd75988068d5916cd"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonrpcQueue::new (cognitive 19): JsonrpcQueue::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (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":"rust_port/crates/flow_lsp_server/src/jsonrpc.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ffc0002b943de6ad523adc2ca51e91387380ca1799371c7ac75ad3f8c71ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::assignment_cover::try_assignment_parse (cognitive 19): flow_parser::expression_parser::assignment_cover::try_assignment_parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_parser::expression_parser::assignment_cover) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e65e0926f57310324f358dc72554a7fd7ce1b50ff880fbc36aafbcbf06c94d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::primary_cover (cognitive 19): flow_parser::expression_parser::primary_cover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). 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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ce0f78a5cdf21d2bfbf2f8482d48b51548bd8a569c2408b8e9fb8ee951fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::import_attributes (cognitive 19): flow_parser::statement_parser::import_attributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (13 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 13). 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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb62a59cfad90183d657971e82180ded3b83c3095246368cb241d705b7324a0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::pretty_printer::print::print_node (cognitive 19): flow_parser_utils_output::pretty_printer::print::print_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). 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":"rust_port/crates/flow_parser_utils_output/src/pretty_printer.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66d4ab0e4d395122b3acd9423ee0ef577e7218e38e54840aae9c3073aa2b53"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentLowerer::component_params (cognitive 19): ComponentLowerer::component_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7611915f64e8b7fc9b84290e95a3530ada7dac069f2a5f7489ed595bd82e54"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_import_declaration (cognitive 19): Serializer::serialize_import_declaration has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5, loops 1 (2 pts) (nesting depth added 7). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b18b153da564c50d9c6fc4de93fb6aa41aa05c576bea714746a40206a9ced"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parsing::parsing_service::do_parse (cognitive 19): flow_parsing::parsing_service::do_parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts) (nesting depth added 9). 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":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7fe6718856494f699bd934a38015329435de27f60c3a5586754c01a2d60f69"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRequestSearcher::jsx_element (cognitive 19): ProcessRequestSearcher::jsx_element has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1, match/switch 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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c21e15eecf751d8cf3e7c9cd70de0611f3c27e3894171ff66e0d81b4b026b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRequestSearcher::import_declaration (cognitive 19): ProcessRequestSearcher::import_declaration has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (5 pts), loops 1 (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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f999bab1ac112de997d761d3dd9b800fb895fe7beea9bed4e6618ca7ebe26c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessRequestSearcher::record (cognitive 19): ProcessRequestSearcher::record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (7 pts), boolean chains 1, 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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"438c49feeee8258670371c0e08b3e46dfe0d42080cec51bb7b19debf4e84dfe2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::stub_unbound_name::stub (cognitive 19): flow_services_code_action::stub_unbound_name::stub has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5, loops 3, boolean chains 1 (nesting depth added 5). 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":"rust_port/crates/flow_services_code_action/src/stub_unbound_name.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e94c72cab740080f85859177e73849e09d42e908c6aa013bd70362140a47a9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_module::commit_modules::commit_haste (cognitive 19): flow_services_module::commit_modules::commit_haste has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (8 pts) (nesting depth added 10). 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":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7efdee6048d8f841870724a0cd6b7339aa98611e2c2bfc15371eba32d699bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::object_literal (cognitive 19): flow_type_sig::type_sig_parse::object_literal has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (7 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (prop, spread). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583c884dedac08ecb3fb07e41877059412f2ee337c53de55fc47ac386697989"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::merge::detect_non_voidable_properties (cognitive 19): flow_typing::merge::detect_non_voidable_properties has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (5 pts), loops 3 (5 pts) (nesting depth added 9). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (check_properties, is_voidable). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a074e6a30ed9d32704faf8ac172e6914bb12325ae2f7b32632affdd9c85e182"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::collect_construct_ts::go (cognitive 19): flow_typing_flow_common::flow_js_utils::collect_construct_ts::go has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (6 pts), loops 2 (4 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"162d9062b17f2b490394144fed19b6f70b95bb0406cf6072ac427979ff29e673"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env (cognitive 19): flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 5 (7 pts), loops 1 (3 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5525}}}],"partialFingerprints":{"codehealthFindingId/v1":"89678314883cb5487cbdeea24f18b6bfda26f6ba5356405e56717c2c4d7267fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_inst_ (cognitive 19): Walker::walk_inst_ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa14ccfda48af8014a9c816a70eba621e148ae953b73f5f52cee4fe582337333"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::react_kit::props_to_tout (cognitive 19): flow_typing_flow_js::react_kit::props_to_tout has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 9). 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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d821ee4494687cbefbe355780f2bfd401942a2444935c564d735b61554b2db"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::refinement::keys::key_of_member (cognitive 19): flow_typing_statement::refinement::keys::key_of_member has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 2 (4 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_statement/src/refinement.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6cb5b7894fc82c1ee2dbb60d1dc3eb674cc6b7402118b6e256773e24d329d9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_truthy (cognitive 19): flow_typing_utils::type_filter::not_truthy has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 3 (5 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4215e0526d25ac95161826386adea75f9d9b6edf10472956122086ca31b416"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_guard::check_type_guard (cognitive 19): flow_typing_utils::type_guard::check_type_guard has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (9 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":"rust_port/crates/flow_typing_utils/src/type_guard.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"310041626914017302a9c506f3f4a8287efb6acbc623b04ed70605446f64a809"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::arr_type_default (cognitive 19): flow_typing_visitors::type_mapper::arr_type_default has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 6). 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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91339d2d7574480498e2af0835240b591169e8449dc91187373657ae5fd45a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_utils_find::make_next_files (cognitive 19): flow_utils_find::make_next_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (process, process_stack). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_find/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0d88613ef016107899c34f71fe902472eb94ff1ceb541fe6d214ee9ebec310"}},{"ruleId":"D2","level":"warning","message":{"text":"flowToFlowDef.applyDefaultExportDocPlacement (cognitive 19): flowToFlowDef.applyDefaultExportDocPlacement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd6c6d3d2cfae6c0e9fd9fa8975781eacb48f9ee1a4a10afa00b9061b364a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformComponentSyntax.mapStatementList (cognitive 19): TransformComponentSyntax.mapStatementList has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 12). Of this number, 15 points are the body\u0027s own statements and 4 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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f11ed3eee3f7e55542578d476bcf22b755b8c7b0cb7f6eeac4e6915814c960"}},{"ruleId":"D2","level":"warning","message":{"text":"index.flowRemoveTypes (cognitive 19): index.flowRemoveTypes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, ternaries 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":"packages/flow-remove-types/index.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe30d0e3642adebd50111ec351338025466bc95f149f5694a06dcc4976c5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"visitFunction (cognitive 19): visitFunction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1, other 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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55fc059ac3c7057cb5da2611a50806980d297f9c36a4b987e89b9ec8778492a"}},{"ruleId":"D2","level":"warning","message":{"text":"dfsForRange (cognitive 19): dfsForRange has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"805a068e09d6a15faada0bbbb6f919b1dedc8d2f300b98d39a1b1c80a7811fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"mutate::transform (cognitive 19): mutate::transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0d3578406052bdd2a034e91287657d4363f38682b220dd4c0ab927fcd038e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_analysis::property_assignment::eval_property_assignment (cognitive 18): flow_analysis::property_assignment::eval_property_assignment has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (6 pts), match/switch 4 (6 pts), if/else 4 (5 pts), boolean chains 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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac00065f530d10d2b55772893a1012bbbfb4c0e074e81c3a91b6ae62188cdcd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::type_of_name_command::handle_response (cognitive 18): flow_cli_support::type_of_name_command::handle_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 5 (9 pts) (nesting depth added 5). 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":"rust_port/crates/flow_cli/src/type_of_name_command.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5708426b38313ccf88a318a1e20e8b3b61cba748f436355c5c9506deb1b64162"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateOptionalPropertiesMapper::get_props_for_obj (cognitive 18): AnnotateOptionalPropertiesMapper::get_props_for_obj has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (13 pts), loops 2 (3 pts), if/else 2 (nesting depth added 7). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_codemods/src/annotate_optional_properties.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"836bd47e5e685a2a93f28b1efe0359e9acb9f6d3664f4f4d6f12487edc6c002c"}},{"ruleId":"D2","level":"warning","message":{"text":"TyIterTy::default_on_t (cognitive 18): TyIterTy::default_on_t has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 9). 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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"874b5a7d8562df7e737cf82f073fdc6db00811f24fa02164b41fb325b4ffad27"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_config::flowconfig::filter_sections_by_rollout (cognitive 18): flow_config::flowconfig::filter_sections_by_rollout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"260168bf963180559ad2a48c5d6cc4873a664f299d579351b2e992947069ee62"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::comment::add_comments::add_comments_to_code (cognitive 18): flow_dev_tools::comment::add_comments::add_comments_to_code has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/comment/add_comments.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7bf91156f0a5377871001e1464e74fb1b321c526e253dcf644cfde3d53c1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::comment::get_context::get_context (cognitive 18): flow_dev_tools::comment::get_context::get_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"rust_port/crates/flow_dev_tools/src/comment/get_context.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc85717fd595236a885f99cb78a6aa5a01f9425b2a456cc22ce2624b15149ad"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::hint_pred_kind (cognitive 18): DefFinder::hint_pred_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e99ec7e852241af9df74b20578a8f6ddf327048aa5efff723703f8c004b8dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::visit_assignment_expression::other_pattern_hint_opt (cognitive 18): DefFinder::visit_assignment_expression::other_pattern_hint_opt has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 2 (4 pts), if/else 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c927f3c21498f14e4e88856cbbab69941cdeaf9f368c089b886abc2ceeea4d"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::havoc_current_env (cognitive 18): NameResolver::havoc_current_env has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 6). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c972d16b6373a13d2f9121b3c9e40d0d07ad5e570c76992efa0b70cce55a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::havoc_changed_refinement_keys (cognitive 18): NameResolver::havoc_changed_refinement_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":5357}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c9f28bc2e11253748982af090ef62de902439306ecd24e7c6cf50a0ed4eee"}},{"ruleId":"D2","level":"warning","message":{"text":"StringQuoteValue::to_cow (cognitive 18): StringQuoteValue::to_cow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 10). 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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db0db337334ee49aae99aed25b32da524911d7737d0543f2155524798cd9af7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::ast_utils::get_inferred_type_guard_candidate (cognitive 18): flow_parser::ast_utils::get_inferred_type_guard_candidate has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c341048ec8ffca854447b4283e24a386f94ba656e2b38624755c1be0c6e072"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::number (cognitive 18): flow_parser::expression_parser::number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 7). 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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5bee34bb4230ba87610d4043b06d7b52769ee2d508d758fbf784cc5b3de0e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::pattern_parser::object_from_expr::object_properties_from_expr (cognitive 18): flow_parser::pattern_parser::object_from_expr::object_properties_from_expr has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (4 pts), loops 1 (nesting depth added 11). 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":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06b2c80d0af4e86e233224ff18b722701378a31e6ba24943c4b9f7c7d57e026"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::pattern_parser::array_from_expr::array_elements_from_expr (cognitive 18): flow_parser::pattern_parser::array_from_expr::array_elements_from_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"283c99db6bf6f80babd0092991af59421d2435cbf4ed50dacdac66922c8f505d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::package_exports::resolve_matched_wildcard_path (cognitive 18): flow_parser_utils::package_exports::resolve_matched_wildcard_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 3, 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":"rust_port/crates/flow_parser_utils/src/package_exports.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"673689e3fd2e4766a6497e1f32cd16446a71b46eb8fdab1ef960d8c06a1646e7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::arrow_function (cognitive 18): flow_parser_utils_output::js_layout_generator::arrow_function has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 3 (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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3060036754a45135d24ff1146a04b759b5594b6c6810d3e013bee8e163b9a32d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::js_layout_generator::type_object (cognitive 18): flow_parser_utils_output::js_layout_generator::type_object has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba5e0b86eb440de96a06dfad5f5d67d46d9f1a2c7bfc7cb0c538d7d3a28b1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor_server::server_instance::handle_response (cognitive 18): flow_server_monitor::flow_server_monitor_server::server_instance::handle_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 10). 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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f8b174fbba7a738e46e2182d9575a0c88c887f7c7dff02b9fca8df7653db84"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_class (cognitive 18): flow_services_code_action::ast_extraction_utils::insertion_point_collectors::class_collector_visit_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (9 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ff99105298bc744ab13d4eb733e15ae99a54b4763d8b29c5f7679337fda44"}},{"ruleId":"D2","level":"warning","message":{"text":"MatcherBase::add_candidates_bulk (cognitive 18): MatcherBase::add_candidates_bulk has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 3, boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_export/src/fuzzy_path/matcher_base.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"913dbca72d932ff83cdddd3bcd967e2afaa82021231ca233af660c06b73a43f5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_references::property_find_refs::get_loc_of_def_info (cognitive 18): flow_services_references::property_find_refs::get_loc_of_def_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_references/src/property_find_refs.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"af862b43e0f350a49fe0951aeb7fb8b9848bef1c08a5084b90fb8d9364ecce9a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_computed_prop (cognitive 18): flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_computed_prop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_type_sig::type_sig_parse::declare_class_props, flow_type_sig::type_sig_parse::declare_class_props::declare_class_prop::add_named_prop) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8938}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c28886967ee917078c5eb8ca3335027db90cf1a2bef4c34a2d6f4c1db54439"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_errors::intermediate_error::score_of_msg (cognitive 18): flow_typing_errors::intermediate_error::score_of_msg has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 2 (3 pts) (nesting depth added 7). Of this number, 9 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. 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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3649855e171ef8a87682ebba90e5582a1156f6e7a178e23933192fab9117855a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::instantiation_kit::instantiate_poly_with_targs (cognitive 18): flow_typing_flow_common::flow_js_utils::instantiation_kit::instantiate_poly_with_targs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1de16a5b6c97ca958c50eff9541f48676e733250d5161b78ea9195b9f60f8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"InwardSplitter::type_ (cognitive 18): InwardSplitter::type_ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"45459dc77eeef9c6cfed544a46ae7a2b5dbc5db26006ac66a716d4292fc1680c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_call_arg::flatten (cognitive 18): flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_call_arg::flatten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::flatten_spread_args, flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list::finish_array) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef516346bccc60497ce9bba256156c250cd61cc711d6dfa51879187cf0d7bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::react_kit::run_with_env::tin_to_props (cognitive 18): flow_typing_flow_js::react_kit::run_with_env::tin_to_props has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e75532380fe53c3d9e7a27ab2b96324e79b6d758f2e634d63809f1edb295d0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::type_annotation::convert_typeof (cognitive 18): flow_typing_statement::type_annotation::convert_typeof has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 8). 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6f394c1be141f627123ac26c6b89d8f81b50d1165de1a26a0e3c7df31e419"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::expand_members::type__ (cognitive 18): flow_typing_ty_normalizer::normalizer::expand_members::type__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc99f250c35988f60daf1239df4f4c70377b26129ac4d052a7d24a04986fbaf"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::convert_component (cognitive 18): flow_typing_ty_normalizer::normalizer::type_converter::convert_component has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4, boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b27d1790071a77ac468c9a6c063579dedcfd83242ca1031be3321ca5c1b5fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::property::map_t_with_polarity (cognitive 18): flow_typing_type::type_::property::map_t_with_polarity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7564}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d9f0e71ddc03874016b4bd86df439d112e6d2139385691be37d35d778b0b01"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::intersect_type_guard (cognitive 18): flow_typing_utils::predicate_kit::intersect_type_guard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 33 (42 pts), match/switch 20 (38 pts), boolean chains 16, loops 2 (3 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. This shape REPEATS in the file: one other method here (flow_typing_utils::predicate_kit::intersect_type_guard::try_intersect_related) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"03977deb945ad3996a1c18d043349d7952d145f5557cbc60440233814569a9d7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::local_classlike_binding_kind_at_loc (cognitive 18): flow_typing_utils::type_env::local_classlike_binding_kind_at_loc has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 2 (5 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"62799befa464c3dc270fd182073329438cde8890072ed3a7f0b927ebaf96bf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::boolean (cognitive 18): flow_typing_utils::type_filter::boolean has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::number, flow_typing_utils::type_filter::bigint) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7487e77d62e0db73e43a8cd567499606a69deb304641af46ab656a8e747965"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_boolean (cognitive 18): flow_typing_utils::type_filter::not_boolean has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::not_number, flow_typing_utils::type_filter::not_bigint) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddbf7b99a88e0097c55dccb28a8568fca79a7ddce17ee968517dd6cfc770a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::string (cognitive 18): flow_typing_utils::type_filter::string has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"efecc2a4a6b571c8b3a0fe62c6a1e7fce9d9b40dcf806424cd39a29432781079"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_string (cognitive 18): flow_typing_utils::type_filter::not_string has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef41d023514c86a93def77967cc3732c00b09ca72407d6f6f95f1d7fc30dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::number (cognitive 18): flow_typing_utils::type_filter::number has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::boolean, flow_typing_utils::type_filter::bigint) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa91eaed2690d1a9b3857e24fc8b04c109127ce7ac2d8a4c61b1528c729efcec"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_number (cognitive 18): flow_typing_utils::type_filter::not_number has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::not_boolean, flow_typing_utils::type_filter::not_bigint) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b473a854015d8cc96249ecc0ad2b100583ac5059930faffebea0f5ea40f8eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::bigint (cognitive 18): flow_typing_utils::type_filter::bigint has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::boolean, flow_typing_utils::type_filter::number) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"922aea8e92ab8bbddb66f43ddb952d12db9ba45a64fae5dc511f31ecf5575ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_filter::not_bigint (cognitive 18): flow_typing_utils::type_filter::not_bigint has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (flow_typing_utils::type_filter::not_boolean, flow_typing_utils::type_filter::not_number) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4132f68017e8b0735488126a8ba3df6e5bf4c4eca273c1f82d4b164c0dedbc85"}},{"ruleId":"D2","level":"warning","message":{"text":"run_swebench.find_eval_dir (cognitive 18): run_swebench.find_eval_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 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":"evals/run_swebench.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d36b36413c064258099fdaa63fca08d3066df4d91937ef5e9ef98d38cc03882"}},{"ruleId":"D2","level":"warning","message":{"text":"flowDefToTSDef.getTransforms.EnumImpl (cognitive 18): flowDefToTSDef.getTransforms.EnumImpl has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (6 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6eac1d0a669d725a2db71d1cc1bb594a467b8f77bf6baaaa4e6fa298738157"}},{"ruleId":"D2","level":"warning","message":{"text":"flowResult.prettyPrintMessage (cognitive 18): flowResult.prettyPrintMessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/flowResult.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda88f5ceffe83479360616e2904b3101b60427b79c565ea02ee53decd458e54"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleTransform.transform (cognitive 18): SimpleTransform.transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 74). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/transform/SimpleTransform.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"14331efa74176411951b241b81a843424c236f98e025f29e08a3e7ecf9ffe095"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformMatchSyntax.mapMatchExpression (cognitive 18): TransformMatchSyntax.mapMatchExpression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 6 (8 pts), boolean chains 1 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fa1f929ea8f5d09a9f4945422adc17fbb3fac561bdad331f061782d63785f5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.removeNode (cognitive 18): index.removeNode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2, boolean chains 1, loops 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":"packages/flow-remove-types/index.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"67db135e6bc4ceed96a15810ab2045a14a27613c3783a7cf15e9606ea86ae710"}},{"ruleId":"D2","level":"warning","message":{"text":"mapRecordDeclaration (cognitive 18): mapRecordDeclaration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (4 pts), match/switch 2 (3 pts), loops 1, other 1 (nesting depth added 6). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 92, 183, 98, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/estree/TransformRecordSyntax.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb5c2b7b8bd601a853e57c00ebcb92df9538bd80e6dd57b88f4abf62b173bd"}},{"ruleId":"D2","level":"warning","message":{"text":"transform::enter (cognitive 18): transform::enter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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":"packages/flow-parser/oxidized-src/transform/SimpleTransform.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b98aaccd33642bbe0c782d2d29a6df2d7855ee54dc81c84739b3cfe971533f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateExportsMapper::map_expression (cognitive 17): AnnotateExportsMapper::map_expression has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (4 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"a736b6e0c39b6a737b9d11482b90bd19f773e1708dcb47ef09e781c4c2745edc"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::path_matcher::fixup_path (cognitive 17): flow_common::path_matcher::fixup_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, match/switch 2, 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":"rust_port/crates/flow_common/src/path_matcher.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8140caee9e2f7a42e74624d62f286d25c6d0aff0c5f3587b7739eb99eaf0f65"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_semver::semver_range::satisfies (cognitive 17): flow_common_semver::semver_range::satisfies has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 1 (4 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":"rust_port/crates/flow_common_semver/src/semver_range.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d78861d88052a3955f6aad56c6e988d701fe5895eb20a3a407c06679c35575"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_ty::ty_debug::dump_decl (cognitive 17): flow_common_ty::ty_debug::dump_decl has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 3 (5 pts) (nesting depth added 7). 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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"221ec2eb03b29e3725b9f8e3f108beda6428c16043168e0c216f5c90e677ed6e"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckedSet::add (cognitive 17): CheckedSet::add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/checked_set.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0150852b06f6009313c172fd457c573759d1d85a9401dfbc3baa6102a85d9568"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphOverlay::fold (cognitive 17): GraphOverlay::fold has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OverlayGraph::to_backward_map) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06f8393eac272b2d3bd132f1015d0bdcbfeaf026310df63364c1a21a9d36681"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayGraph::to_backward_map (cognitive 17): OverlayGraph::to_backward_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (GraphOverlay::fold) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"700228a7036a8c9f06dd6c1ddf50cb4f97e3fc2a7834757f216523089ec6e75f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common_utils::utils_jsx::trim_jsx_text (cognitive 17): flow_common_utils::utils_jsx::trim_jsx_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 pts), loops 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":"rust_port/crates/flow_common_utils/src/utils_jsx.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"28276907b16b4829e5974134edfcdf601ff76b85ca4a3d389ff4a21ae8776631"}},{"ruleId":"D2","level":"warning","message":{"text":"Iter::next (cognitive 17): Iter::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_data_structure_wrapper/src/overlay_map.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2687a01383f7e648629193dfdfe269387adfe869775ae016c2d8274f2f747e55"}},{"ruleId":"D2","level":"warning","message":{"text":"DefFinder::visit_function_param (cognitive 17): DefFinder::visit_function_param has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4, loops 3, boolean chains 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"987ef312e5f7ef2f5b849ee2b88df4b7c66c8cb6332117b69faff4f5458f7cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_env_builder::name_def_types::print::on_hint (cognitive 17): flow_env_builder::name_def_types::print::on_hint has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 2 (6 pts), loops 2 (4 pts) (nesting depth added 10). 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":"rust_port/crates/flow_env_builder/src/name_def_types.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"205365fd484a4802b8d201e70d31718afe4b641a0450e0cbd6aa82f37a547e15"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::scoped_for_statement (cognitive 17): NameResolver::scoped_for_statement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":5561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9651390800889974afafbf1c0b9076c6e07d6f7458f38b599a2d29c0023d3adf"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::add_assertion_call_refinement (cognitive 17): NameResolver::add_assertion_call_refinement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7016}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cc02fff2084f6a45d55b7a0b9521096292a46d3f8878cb3be99351afef1fca"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::maybe_prop_nullish (cognitive 17): NameResolver::maybe_prop_nullish has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 5). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7695}}}],"partialFingerprints":{"codehealthFindingId/v1":"303f9be56320dfe89e4523636d0e024f39e31353aea450801767cf46e1a1c39c"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::declare_namespace (cognitive 17): NameResolver::declare_namespace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1, match/switch 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076ce3158e485af0a5076bae0cf2dcfc8eeaa018e58c57e956ea9657dbc5ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_flowlib::flowlib_contents::apply_patch (cognitive 17): flow_flowlib::flowlib_contents::apply_patch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_flowlib/src/flowlib_contents.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6995e8fbdba1bbb9a0f519eff3e03348c340ed25fd7678ab51fa340e67493ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Transaction::set_resolved_requires (cognitive 17): Transaction::set_resolved_requires has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 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":"rust_port/crates/flow_heap/src/parsing_heaps.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e78aca7a80ebedebf67560095a1a51d18dfa368e267149d6c2f71ec95951d7"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::declaration_parser::parse_component_params::param_list (cognitive 17): flow_parser::declaration_parser::parse_component_params::param_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 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. This shape REPEATS in the file: one other method here (flow_parser::declaration_parser::parse_component_params::param) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b89e0405869ea52e77e41c89ba2cc3ef38ecf0171ebe6eb570e56456e8321c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::pattern_parser::parse_array::parse_array_elements (cognitive 17): flow_parser::pattern_parser::parse_array::parse_array_elements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 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":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b728edb9095d6b0e12c5a665e4131d3090a811f46068c1a4dc16938e07d52c0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::type_params::params (cognitive 17): flow_parser::type_parser::type_params::params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4163}}}],"partialFingerprints":{"codehealthFindingId/v1":"512a60d896941046c3febb6177b5fcc29a5c907448260382835951910eed2097"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::export_condition_map::pick_target (cognitive 17): flow_parser_utils::export_condition_map::pick_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/export_condition_map.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0cea73a1818a5f00971e3a460ed180e5cbf44020c018355852703ba570b549"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::jsx_element (cognitive 17): Writer::jsx_element has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (7 pts), loops 1 (nesting depth added 8). 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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/jsx.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e41009c8abddef016c1029ea4879f64fef47d3339254b9f481903df3aed6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils_output::layout::fuse_with_space (cognitive 17): flow_parser_utils_output::layout::fuse_with_space has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (ugly_char, helper). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f093886682324d68f48e94e3ea6b02548aee2471cb76a03c44981ecc968e784"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchLowerer::lower_match_expression (cognitive 17): MatchLowerer::lower_match_expression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d06b300edb16010b585eddab67301b2a253fdffb806a986ac9af355009fca"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_pattern (cognitive 17): Serializer::serialize_pattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 6). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7c5fe5091ecc1720709966bfa9494632330b3d525f2b6b3fcb8abdc6466e6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::check_that_we_care_about_this_file (cognitive 17): flow_server_command_handler::command_handler::check_that_we_care_about_this_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (check_file_is_opted_in, check_file_included, check_file_not_ignored, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d55625e0eb72172b3d705ae97315f6ea7e73725c0d9808251788db784b15a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::collect_rage (cognitive 17): flow_server_command_handler::command_handler::collect_rage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f4d1c54f942e5b0aa1c7911430044b02df966b1c66d7676040407f9fe3f4ef"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::get_file_artifacts (cognitive 17): flow_server_command_handler::command_handler::get_file_artifacts has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). 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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e1c39d2727cfa4967f1b8994c96600d74d322d9c0446af2d0379f942f089f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_env::flow_lsp_conversions::flow_completion_item_to_lsp (cognitive 17): flow_server_env::flow_lsp_conversions::flow_completion_item_to_lsp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (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":"rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b29253f59adcf17f86138127f57e26032164bb7af655adffda8488860ce74"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_env::server_monitor_listener_state::update (cognitive 17): flow_server_env::server_monitor_listener_state::update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 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":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e03bcd4a2d355292c0a11e1f88f045690c8b2a59f4270f8bd985714080d7fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::refactor_extract_utils::variable_analysis::collect_escaping_local_defs (cognitive 17): flow_services_code_action::refactor_extract_utils::variable_analysis::collect_escaping_local_defs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 2 (9 pts), if/else 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1af3c0f670ae017b0ea42da76dd0cf76f366dacbb5b9e87d2fc553a82a053f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::pure_dep_graph_operations::rdep_closure::loop_impl (cognitive 17): flow_services_inference::pure_dep_graph_operations::rdep_closure::loop_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 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":"rust_port/crates/flow_services_inference/src/pure_dep_graph_operations.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5817ae72e888421d3da67d9259d092ea854487a4c4438759ae2a9048608dee54"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::recheck::recheck_parse_and_update_dependency_info (cognitive 17): flow_services_inference::type_service::recheck::recheck_parse_and_update_dependency_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a772aa19cee9dd17454ebe84dda21d42eb64911a2b30f2019715ed3fd789e856"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::iter (cognitive 17): Value::iter has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 8). 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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"3960988af11dbf0ec23be3c2ddb1763d26bfe0fbd267bf79459ca65d578bac39"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::export_ref (cognitive 17): flow_type_sig::type_sig_parse::scope::export_ref has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (7 pts) (nesting depth added 7). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106d6cc0272f0ba2313f9975a9c28582e96bdeab8c2816f221ad0cb4c6efb55"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::scope::resolve_declare_namespace_exports (cognitive 17): flow_type_sig::type_sig_parse::scope::resolve_declare_namespace_exports has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1, 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5688}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eeab79e3ab9f1819dd511a4fbd44ec15181cf16a964382525cadb338190599"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing::env_resolution::resolve_import (cognitive 17): flow_typing::env_resolution::resolve_import has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6928c6e2c469c5b0bfb0ee6b3596f7357bdc03b243644779aee5e52d34f2b8a4"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::concrete_type_eq::eq_swap_reason (cognitive 17): flow_typing_flow_common::concrete_type_eq::eq_swap_reason has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (7 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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbe7be7783e1325e325f8bd6fb196938eeb45093b28936ac0c8c3a4e6f94a2b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::type_subst::union_ident_map_and_dedup (cognitive 17): flow_typing_flow_common::type_subst::union_ident_map_and_dedup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (flatten_into). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ccbd8bdf45f66168a7e12ff52c2d9eed1dc4467b47f7c417c68c34fbbc4dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplicitInstantiationVisitor::type_ (cognitive 17): ImplicitInstantiationVisitor::type_ has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 4 (6 pts), loops 1 (3 pts) (nesting depth added 9). 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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0d700c6266f6550fe44590f03948ef9606c58a6476005bf5c93f895e3769e6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::implicit_instantiation::placeholders_leaked_into_bounds (cognitive 17): flow_typing_flow_js::implicit_instantiation::placeholders_leaked_into_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3981fe6a437e8cdbaa0a40b31373961b4a042ade682b64fd35ee69f8a1d952f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::renders_kit::rec_renders_to_renders (cognitive 17): flow_typing_flow_js::renders_kit::rec_renders_to_renders has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 6). 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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3112cb6c7b10a6017f6a122ea870ffad1eb11b144b31884dc2a61e0b9ec46bd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::speculation_kit::long_path_speculative_matches (cognitive 17): flow_typing_flow_js::speculation_kit::long_path_speculative_matches has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 1 (2 pts), loops 1 (nesting depth added 8). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. 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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f79f43156519ec7b0a6783262c1651273e14f5910fb0420769776b5564d9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::error_on_this_uses_in_object_methods (cognitive 17): flow_typing_statement::statement::error_on_this_uses_in_object_methods has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (13 pts), loops 2 (4 pts) (nesting depth added 11). 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"385126a5e928b1f63647a2eb036f0eca5d6c1f60a92c33b4df81e3b8dfbf649d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::property::map_t (cognitive 17): flow_typing_type::type_::property::map_t has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing_type::type_::property::ident_map_t) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d96060448680278b7f07288e100e978fab8ed5eb6e41e83a1a60c7c7dca53"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::property::ident_map_t (cognitive 17): flow_typing_type::type_::property::ident_map_t has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_typing_type::type_::property::map_t) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fca74b97f2b55027f084d37634b877c063abd4e2e0fae06a8349930fe6fbd73"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::predicate_kit::type_guard_diff (cognitive 17): flow_typing_utils::predicate_kit::type_guard_diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa3669c3114dde2922a2de401ea5e01835aee6dfdccb3ca6cf88cda5884af21"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::prop_default (cognitive 17): flow_typing_visitors::type_mapper::prop_default has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf18651c1b379651e1ec6d19e2608d8a0fc356edc562b764be3a7321353eefa"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeManager.acquire (cognitive 17): ScopeManager.acquire has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/ScopeManager.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"415703ca9ed1d7cc48f0a44b084889e63252790ce4098f06d5e8c4ca698ebb57"}},{"ruleId":"D2","level":"warning","message":{"text":"VisitorBase.visitChildren (cognitive 17): VisitorBase.visitChildren has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/referencer/VisitorBase.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8184d949f858e519c87798bc2ebb4e2ff985cc2ca34ad7d9d7d38d75280708b"}},{"ruleId":"D2","level":"warning","message":{"text":"convertObjectExpression (cognitive 17): convertObjectExpression has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 7). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 742). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"deffe5b8c9dcee1308463c1b6bb36b6ac3dece61e7e1fd42c00af35bf7ce83d2"}},{"ruleId":"D2","level":"warning","message":{"text":"traverseWithContext (cognitive 17): traverseWithContext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 1, ternaries 1 (nesting depth added 6). None of this is in the body itself: all 17 points belong to 11 function items inside it that branch (getBinding, getScope, a function literal at line 176, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/traverse/traverse.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb93a32f5f52201ce7782a8cfcb2e617ec163d697e5846c7ba8090708bb85af9"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_cli_support::agent_helper_command::run_inspect_types (cognitive 16): flow_cli_support::agent_helper_command::run_inspect_types has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). 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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee4d84ce55b80c70fb8938703e69b3f74507b859dce7f189e267dafd82b636d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateOptionalPropertiesMapper::variable_declarator (cognitive 16): AnnotateOptionalPropertiesMapper::variable_declarator has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_optional_properties.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b45e95c36e5c3de7d62a17600cdce23ce97f734cb367cc12ec0cf027dbfeda"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_command_utils::file_options (cognitive 16): flow_command_utils::file_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (5 pts), boolean chains 1, match/switch 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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"052432c3cf8ad2d8c1cc8489506752fd423d2f805df972cdc9d6c6640e49ba69"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_command_utils::make_options (cognitive 16): flow_command_utils::make_options has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, match/switch 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f495f6333ae92191d44da0ed916384c1db21998981d81da871aa8938474931"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_common::files::absolute_path (cognitive 16): flow_common::files::absolute_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). 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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e5149900fce6a01017b84000e5bf90e6a2d5a793c48a1d8049b76ca78b0366"}},{"ruleId":"D2","level":"warning","message":{"text":"TyReduceTy::on_t (cognitive 16): TyReduceTy::on_t has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 1 (nesting depth added 8). 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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3af9d8d884806492d65698816dfe5175afe6ed46e69749c55598d78cc3c7f42"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_config::flowconfig::write (cognitive 16): flow_config::flowconfig::write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 4, match/switch 2 (4 pts) (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (write_options, write_ignores, section_if_nonempty, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f61949b7e570d126413970cd411f0e5d34b8f1396791d6d4626f2d413ea4c3"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_dev_tools::runtests::check_annotate_exports::find_files (cognitive 16): flow_dev_tools::runtests::check_annotate_exports::find_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 3 (4 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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c5e7d8a87ce648771c45df289af14109f16d79c85b92fab81020f73069e4df"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::env_switch_case (cognitive 16): NameResolver::env_switch_case has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (5 pts), loops 2 (nesting depth added 6). 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":5866}}}],"partialFingerprints":{"codehealthFindingId/v1":"8012e9f3ff0a661f77cd7ec2bc5cde2c812bb7699a3f644bbcffbcebf4f9d777"}},{"ruleId":"D2","level":"warning","message":{"text":"NameResolver::commit_refinement (cognitive 16): NameResolver::commit_refinement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44acc83a5fa49ce454a087001dcc5efbeb6b74b86af7ce1c3fd31f5c21c393f"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedHeap::mark_slice (cognitive 16): CommittedHeap::mark_slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e08b358212e934e4dc416d10b10eaf259e4061f80b1340e2f73351d3ad7714"}},{"ruleId":"D2","level":"warning","message":{"text":"CommittedHeap::collect_slice_with_force (cognitive 16): CommittedHeap::collect_slice_with_force has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 3). 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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8cbced4c63f70db137d4ebfe1c4545d2f2beab2af051f986ba5dcbfe997cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_lsp_server::flow_lsp::main_handle_unsafe (cognitive 16): flow_lsp_server::flow_lsp::main_handle_unsafe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 4 (7 pts) (nesting depth added 7). 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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31d8752edeab87a31606e7b13f5f384ab4937cc228c94dcd99fdfc08b835ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::expression_parser::unary_cover (cognitive 16): flow_parser::expression_parser::unary_cover has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (6 pts) (nesting depth added 9). 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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f821dafb942f1de7358e395c06c0deed64ec7fdf8c750b79c66070baa5f5af"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::file_key::resolve_root_with (cognitive 16): flow_parser::file_key::resolve_root_with has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). 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":"rust_port/crates/flow_parser/src/file_key.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b6db3cc58607f7f7bd423e520bf15dd36b37f6de6cccf42301139825fa7c50"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::jsx_parser::element_with_optional_opening_less_than::children_and_closing_helper (cognitive 16): flow_parser::jsx_parser::element_with_optional_opening_less_than::children_and_closing_helper has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_parser::jsx_parser::element_with_optional_opening_less_than) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b45054e7e624973d286b3c847aec159140a457dedca3a479225e5c31a7a1ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::statement_parser::parse_statement_list_item (cognitive 16): flow_parser::statement_parser::parse_statement_list_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d170a452835a7f02eb4c5ab9902d7e1e4685d3290b3ffea2baf7bbeef785f067"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser::type_parser::function_param_list_without_parens::param (cognitive 16): flow_parser::type_parser::function_param_list_without_parens::param has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (flow_parser::type_parser::function_param_list_without_parens) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1790}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0775d7e1b63d6fd6bd2808e1ced271c80fe6ba6cac9fafd78616822206b8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_parser_utils::enum_validate::compute_rep_for_explicit_type (cognitive 16): flow_parser_utils::enum_validate::compute_rep_for_explicit_type has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 2 (3 pts) (nesting depth added 8). 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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1d8a72894430df7038d624edd1738dfb9eb6ca22a03c1746b79747eab826d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializer::serialize_tuple_type (cognitive 16): Serializer::serialize_tuple_type has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5 (7 pts), loops 1 (nesting depth added 7). 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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d197a7937eacd52af3bb85aa29eddeb97c3a5d6a7403bdb5cf084ca3e4dc7d81"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_command_handler::command_handler::get_def (cognitive 16): flow_server_command_handler::command_handler::get_def has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (16 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"410ca1e96ad679b94f31c216a0efa0fb062b43a2e3b1a8b32545aae6bf86219d"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor::handle_waiting_start_command (cognitive 16): flow_server_monitor::flow_server_monitor::handle_waiting_start_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8b2cc23a76e98c60eec60ab185e1d43eaf6830fb0a95e882fca0ab70dfed53"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_server_monitor::flow_server_monitor::internal_start (cognitive 16): flow_server_monitor::flow_server_monitor::internal_start has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 9 (10 pts), if/else 5, loops 1 (nesting depth added 1). 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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c620031c351a3bdd17829f3c736c937503bf46204e9e51312ad6a21a050eae"}},{"ruleId":"D2","level":"warning","message":{"text":"Mapper::map_type_ (cognitive 16): Mapper::map_type_ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 10). 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":"rust_port/crates/flow_services_code_action/src/autofix_legacy_flow_syntax.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3eadf68e72a236908de5ab39ecf3b14ccaad67f8e818503aefe89ee597c3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_code_action::document_paste::provide_document_paste_edits (cognitive 16): flow_services_code_action::document_paste::provide_document_paste_edits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (2 pts), match/switch 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":"rust_port/crates/flow_services_code_action/src/document_paste.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a36a3d10e24a81752b5a4988bd848f9209642973bc40073d894f277d88b087a"}},{"ruleId":"D2","level":"warning","message":{"text":"MatcherBase::find_matches (cognitive 16): MatcherBase::find_matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 3 (7 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":"rust_port/crates/flow_services_export/src/fuzzy_path/matcher_base.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c17816a4a93fccaa012cd5ce5ad70ce4918c46f9ecda89b8bb8aa889a51002"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::handle_updates_since_saved_state (cognitive 16): flow_services_inference::type_service::handle_updates_since_saved_state has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), if/else 3 (4 pts), loops 2 (4 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3052}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e0f7d28f99f9cb6f8fa1ea1dfa4e4c93fb65a354405cb7658602cbe9a5f388"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_inference::type_service::check_once (cognitive 16): flow_services_inference::type_service::check_once has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 3). 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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad61fcfd3d3612bd8ea70c717652eabd7d55d4dc8282d4bc70c77b0dbd6a2c32"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_type_info::signature_help::find_signatures (cognitive 16): flow_services_type_info::signature_help::find_signatures has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 2 (3 pts) (nesting depth added 8). 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":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb70e84c0e893c1c3cf938f324fa5296f88c87251289b4d0e5ec07d8fd6cb43"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_services_type_info::type_info_service::type_at_pos (cognitive 16): flow_services_type_info::type_info_service::type_at_pos has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 2 (6 pts), match/switch 2 (nesting depth added 9). 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":"rust_port/crates/flow_services_type_info/src/type_info_service.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbfd53773959cb7473c40a7b39acc9e988505e035dea11b59f5298115ffd00f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::conditional_type (cognitive 16): flow_type_sig::type_sig_parse::conditional_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (3 pts), loops 2, 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9773}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a9c5155bf4657e25422a6bb7ad504571647da089ce5ec820e87a555f8ec179"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::function_def_helper (cognitive 16): flow_type_sig::type_sig_parse::function_def_helper has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 4 (7 pts), boolean chains 1, loops 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11483}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cd85d9d25049d75346625d0598159830f5d2de8c9df2fa4c4266d1733b5878"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::record_def (cognitive 16): flow_type_sig::type_sig_parse::record_def has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13452}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ff3fadab6129739a57afc912a9ef033a9e02aea5cd9702ff73ca67101b0b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::assignment::is_module_exports_assign (cognitive 16): flow_type_sig::type_sig_parse::assignment::is_module_exports_assign has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 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. This shape REPEATS in the file: 3 other methods here (flow_type_sig::type_sig_parse::assignment, flow_type_sig::type_sig_parse::assignment::is_exports_prop_assign, flow_type_sig::type_sig_parse::assignment::is_module_exports_prop_assign) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad9a7b66e71168e21cd646ff54ae60467176a3493655f91ef4c1f8dd0c6cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_parse::assignment::is_exports_prop_assign (cognitive 16): flow_type_sig::type_sig_parse::assignment::is_exports_prop_assign has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 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. This shape REPEATS in the file: 3 other methods here (flow_type_sig::type_sig_parse::assignment, flow_type_sig::type_sig_parse::assignment::is_module_exports_assign, flow_type_sig::type_sig_parse::assignment::is_module_exports_prop_assign) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14690}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd3ae312c407364b154a7d27996f39c86c9fae2effcf3fe0c11d42791e2a8c5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_type_sig::type_sig_utils::parse_libs (cognitive 16): flow_type_sig::type_sig_utils::parse_libs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), boolean chains 2 (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":"rust_port/crates/flow_type_sig/src/type_sig_utils.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf2ba4e93b325f6c1df9351b13981da55e896a869770c000699cdf9cdeb1222"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::concrete_type_eq::eq_with_env (cognitive 16): flow_typing_flow_common::concrete_type_eq::eq_with_env has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 7). 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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"28537789f6eccfe45d98261457b3aa58e0e69c575ac7f04e0cbb06f11d168d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::collect_lowers (cognitive 16): flow_typing_flow_common::flow_js_utils::collect_lowers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), match/switch 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e213e82e8983c9e9aa5950afaacf2edb82507f0ae5f3095da3d449b794dfe25f"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_common::flow_js_utils::render_types::on_concretized_renders_normalization (cognitive 16): flow_typing_flow_common::flow_js_utils::render_types::on_concretized_renders_normalization has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (6 pts), if/else 2 (5 pts), loops 1 (5 pts) (nesting depth added 10). 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9854}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f42a09dda76fa28847ce3cd9649f1645f004e0215f6757505441ec1265b4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::flow_js::unification_helpers::__unify (cognitive 16): flow_typing_flow_js::flow_js::unification_helpers::__unify has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3, boolean chains 1 (nesting depth added 8). 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0721e548b50a9384bd7903fbe47253802e65919b8c84f349f9c3ec95270b17fa"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::slice_utils::object_spread_with_env (cognitive 16): flow_typing_flow_js::slice_utils::object_spread_with_env has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (10 pts), loops 2 (3 pts), if/else 2, boolean chains 1 (nesting depth added 5). 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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa751d159074a5b98240a86207e19b00fb09ecb9ab4cee0d3db5f531bed1859"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_flow_js::subtyping_kit::try_method_bivariant (cognitive 16): flow_typing_flow_js::subtyping_kit::try_method_bivariant has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 3 (5 pts), match/switch 4 (5 pts) (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (direct_method_bivariant, apply_method_bivariant, can_try_method_bivariant). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7a55c785202f66c68a571fbc3c7eb28cd4f999ff2fd508699d1cd064296efd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::validate_declare_component_params (cognitive 16): flow_typing_statement::statement::validate_declare_component_params 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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5009}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d642a3875b45e92eed686648a473fe2e96b634be8691ebb52b652c8c17f4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_statement::statement::check_property_initialization (cognitive 16): flow_typing_statement::statement::check_property_initialization has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b73a9c71c9abeddca70836f42fbe519188cb3d715007b067c07a66cd23ceb18"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_ty_normalizer::normalizer::type_converter::arr_ty (cognitive 16): flow_typing_ty_normalizer::normalizer::type_converter::arr_ty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). 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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadb1d90ccf54c6d6caf991fd35b84599ffc060c53abc6e566aec5c05c3a5a35"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_type::type_::union_rep::enum_optimize (cognitive 16): flow_typing_type::type_::union_rep::enum_optimize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 6). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":8967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982d7e57e5da874fe3546b0af8ca7905bd262a93c17b51967ec27ece3eee0f5"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_env::possibly_refined_write_state_of_state::loop_fn (cognitive 16): flow_typing_utils::type_env::possibly_refined_write_state_of_state::loop_fn has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (3 pts), loops 1 (nesting depth added 8). 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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f1cad8fdc0c18469765fbf0818ed34677c1735cf514bf2d5ded0c2626f288c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_utils::type_sig_merge::merge_interface (cognitive 16): flow_typing_utils::type_sig_merge::merge_interface has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (7 pts), if/else 4 (5 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4388}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eacd95d4ce065a6a79e618f1ae6e52637e562b9a595491805985da8f61b2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_typing_visitors::type_mapper::union_flatten (cognitive 16): flow_typing_visitors::type_mapper::union_flatten has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (5 pts), loops 2 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function item inside it that branches (flatten_into). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8831b5eee99d065c894d47ae22769edee3fde9d7d731412b6db5dfe89054bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_watchman::with_retry (cognitive 16): flow_watchman::with_retry has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a81bbe74ea30711ee28927baba4024e92b3a4535610b2efb32c67ed459f41"}},{"ruleId":"D2","level":"warning","message":{"text":"flow_watchman::get_changes (cognitive 16): flow_watchman::get_changes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"db55df37be67005019a9c34ac217dc8af0429571a195c168e48b840f216bcf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"flowDefToTSDef.getTransforms.isReactImport (cognitive 16): flowDefToTSDef.getTransforms.isReactImport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 354, 339). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4a24b35ae74ff819b10195f3e2f392c8decee26c9cdb09567709eb99f9bcc3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.resultPrinter.toString (cognitive 16): index.resultPrinter.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 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":"packages/flow-remove-types/index.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95e536a3f5c95be22b780918ca54d3c2b4926125383175277fe08fd04bafe7a"}},{"ruleId":"D2","level":"warning","message":{"text":"util.skipNewline (cognitive 16): util.skipNewline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7484d89a34ad9d73fc17ca6d4e2871d18be7a568114d9a86906151833a54be1c"}},{"ruleId":"D2","level":"warning","message":{"text":"comments.decorateComment (cognitive 16): comments.decorateComment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a0336a28da7ef92025363ebda1b41b306e04da56f6630478a33eda29288c78"}},{"ruleId":"D2","level":"warning","message":{"text":"getTransforms.isReactImport (cognitive 16): getTransforms.isReactImport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 354, 339). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4bbdc7424ebf3a9090c356ceeb343fda4ba7f209aa392dce7fd9c4fc5cb195"}},{"ruleId":"D2","level":"warning","message":{"text":"resultPrinter.toString (cognitive 16): resultPrinter.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (5 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":"packages/flow-remove-types/index.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5506668fb1d27fe44d560ffec63c0348084707046f9fa3d70076643e790167e3"}},{"ruleId":"D2","level":"warning","message":{"text":"mapComponentParameters (cognitive 16): mapComponentParameters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, ternaries 2, match/switch 1, other 1 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b2c7e0569f0194ad477cafa7551aa524de5d3956a32a6b1edd4c7eea6e4af7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::dispatch::__flow_impl: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::dispatch::__flow_impl runs 7899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7799 over it, 78.99\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d603c4c8145fe03eb5175bab5505d5a3aeecf9b9bffc248bd85429c622853b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::intermediate_error::to_printable_error: FunctionTooLong \u2014 flow_typing_errors::intermediate_error::to_printable_error runs 5532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5432 over it, 55.32\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90a82ff6b7d443b98a7d86cc81843fbf1a3cc31f37fae3a86ce1ea827168fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/statement.rs: FileTooLong \u2014 16982 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 146 free functions. The bar is 500 significant lines; this is 16482 over it, 33.96\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27290d4d9e045a977f8579348108bbc0f1e69c9c40bc4a49ab534cafa74e76db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_visitor.rs: FileTooLong \u2014 14275 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 661 free functions. The bar is 500 significant lines; this is 13775 over it, 28.55\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cba03a89f9178867ad4b81df70cfc0595926640db528714c3af94556e54cab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::rec_sub_t: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::rec_sub_t runs 2739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2639 over it, 27.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7af5ef2519c010027e6dc8de3a517a7b49702198f3907fcc4ff094c71df154"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::mk_class_sig: FunctionTooLong \u2014 flow_typing_statement::statement::mk_class_sig runs 2687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2587 over it, 26.87\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e542defa9ebfcb8b827190404a003ab641bfdf7a3830d93ff434e04e79dd774a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::intermediate_error::make_intermediate_error: FunctionTooLong \u2014 flow_typing_errors::intermediate_error::make_intermediate_error runs 2373 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2273 over it, 23.73\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1d4f338b203af3b949cbf45ed01f0bb6d59a1882dce707e42534dd7f0b7261"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_sig_parse.rs: FileTooLong \u2014 11539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11039 over it, 23.08\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb3d4d17b03f069434cf637f0cbe88dd4df4d572420892237ba5f992836ace"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_debug::dump_error_message: FunctionTooLong \u2014 flow_typing_debug::dump_error_message runs 2163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2063 over it, 21.63\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"6522be616f7e16cd63ea61bfea9e9f1122ea28f7301a3b11bd28fdc427f31851"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorMessage.friendly_message_of_msg: MethodTooLong \u2014 friendly_message_of_msg runs 2154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2054 over it, 21.54\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":9925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e121a261e2e9519f01500047bb98a32eff714eac27bb3e273bb95d9ccfa52fc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_inner: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_inner runs 2111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2011 over it, 21.11\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4d320287eb6e5440369b668bd653ac36ae0b72dc0df85ca12a913e4192b12f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_message.rs: FileTooLong \u2014 10543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: ErrorMessage (5 blocks, 3526-13680). The bar is 500 significant lines; this is 10043 over it, 21.09\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"846085afd03447e929676559113e3c3f383bc4ee652e79ec42b3dab235a7de7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorMessage.map_loc_of_error_message: MethodTooLong \u2014 map_loc_of_error_message runs 1830 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1730 over it, 18.30\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4018d759ac95adf065fcbe591bb28e6631d195b3d75d41993dc70d5c6fe0c589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/name_resolver.rs: FileTooLong \u2014 9132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: NameResolver (4 blocks, 1734-12028). The bar is 500 significant lines; this is 8632 over it, 18.26\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735ba0c7bb6f81f57a79e48edac8bd8661fb14b50f8c473386b34fe54bda6326"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NameResolver: ClassTooLong \u2014 7247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 174 methods, 4 blocks, lines 1734-12028. The bar is 400 significant lines; this is 6847 over it, 18.12\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"17195997b086f54efd63615dca87adde2322027901fd56b559bc059adbfed634"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_.rs: FileTooLong \u2014 8877 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 8377 over it, 17.75\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb17042a1fa1ab3457b3362be8c64470086b4807000bd256f885a8614347dc74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intermediate_error.rs: FileTooLong \u2014 8825 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8325 over it, 17.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d35c6de843051f6685598faac783495e3dcad8bc16d4305593d853e31d7607"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::statement_: FunctionTooLong \u2014 flow_typing_statement::statement::statement_ runs 1732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1632 over it, 17.32\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f457bff509919e0409a1de7346a21d331f423557003821a680e04eabf56f5d31"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ErrorMessage: ClassTooLong \u2014 6831 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 5 blocks, lines 3526-13680. The bar is 400 significant lines; this is 6431 over it, 17.08\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d718f1c3e3b380e38295eb8343872252463d006a1ac39ef6f82b327f65b7917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/dispatch.rs: FileTooLong \u2014 8354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 7854 over it, 16.71\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ddd4c4e9e660cc1c723d71bf88ecec20f6ae65cfe6878130130ae20f937f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::optional_chain: FunctionTooLong \u2014 flow_typing_statement::statement::optional_chain runs 1633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1533 over it, 16.33\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8699}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b466e0b5e9cfbadd47f87c7de745649d2b691eade735629888408464216a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::annotation_inference::elab_t_concrete: FunctionTooLong \u2014 flow_typing_utils::annotation_inference::elab_t_concrete runs 1517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1417 over it, 15.17\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"112258dae0968e6de41cc2290bdb9689f1ad668ba320b6f029a415e7916f610b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_js_utils.rs: FileTooLong \u2014 7557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 152 free functions. The bar is 500 significant lines; this is 7057 over it, 15.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226fefa8b5fd4d1bf7a578122be2b01a701e71a1a47fa3f995c1fa0cdd52b2c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_annotation.rs: FileTooLong \u2014 7276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 99 free functions. The bar is 500 significant lines; this is 6776 over it, 14.55\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be73db3d74c7e4f8799efa60bbb48b4b4235d0217e426f08859c709311d89a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorMessage.convert_type_to_type_desc: MethodTooLong \u2014 convert_type_to_type_desc runs 1423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1323 over it, 14.23\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":7021}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc03db83d452accc9c10acd128c16af77a44b907e742b575ae65eddff9e8ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::expression_: FunctionTooLong \u2014 flow_typing_statement::statement::expression_ runs 1342 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1242 over it, 13.42\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f973f92994fedcdd4b29283ba6af5fc0795c36d62475c3184b14617357658"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command_handler.rs: FileTooLong \u2014 6476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 185 free functions. The bar is 500 significant lines; this is 5976 over it, 12.95\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c265f5f29d047b23757cfc0c01db3f46a1e578cdc07ed93909527e089d684e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::type_parser::object_type: FunctionTooLong \u2014 flow_parser::type_parser::object_type runs 1189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1089 over it, 11.89\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17e16b55d9c12f8fcf415d07f0fed147c5b179d22bfae4561e968ed7ecdecee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/polymorphic_ast_mapper.rs: FileTooLong \u2014 5735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 328 free functions. The bar is 500 significant lines; this is 5235 over it, 11.47\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ea0052a6f1fe828f575b5463445a054f2a107073c9fee7e1d9c46ae5db2ae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/js_layout_generator.rs: FileTooLong \u2014 5726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 218 free functions. The bar is 500 significant lines; this is 5226 over it, 11.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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15999a3dcc8c1827299cf5a93125449c42dd835d0598aed91d6a2e10211a38e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 5514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 5014 over it, 11.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2029c0097c2fc0907f2bba27d684523f6408a67b15285cf2d3a657d67e140"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_sig_merge.rs: FileTooLong \u2014 5411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 83 free functions. The bar is 500 significant lines; this is 4911 over it, 10.82\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abda23ff099031c640ea9e2a88721fb36334f7d551d27c12445ba4246192e6c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/name_def.rs: FileTooLong \u2014 5329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: DefFinder (3 blocks, 1724-7304). The bar is 500 significant lines; this is 4829 over it, 10.66\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"607f72707e78bef23cacb032eee0a1051c50e4258f6f87766e05e02f22aa5783"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_ast_differ.rs: FileTooLong \u2014 5267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 220 free functions. The bar is 500 significant lines; this is 4767 over it, 10.53\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be72819c9cb07eefa3ef053406c1fd088632ac135ace996b898c3ff9085cdc0e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AstVisitor: ClassTooLong \u2014 4112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 674 methods. The bar is 400 significant lines; this is 3712 over it, 10.28\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0a40ab6d55cd5db83da634eebc938b17080e9a4618d4dce4917fd8a55a2dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/subtyping_kit.rs: FileTooLong \u2014 5111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4611 over it, 10.22\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8299f2e0ac3d8a082b19492c787541ae40fe170622c2a25ba0ba694ecb05bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefFinder: ClassTooLong \u2014 4073 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 3 blocks, lines 1724-7304. The bar is 400 significant lines; this is 3673 over it, 10.18\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24bb8dceebe732addbf6cb7aee056a931d816f2421247a789e525039e43d334"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: implicit_instantiation/walk.rs: FileTooLong \u2014 4962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Walker (2 blocks, 552-5932), declaring 48 free functions. The bar is 500 significant lines; this is 4462 over it, 9.92\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70dbbd45bed8cf10501a23604c096a247b6cc245595db65027922448013be6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::code_action_service::ast_transforms_of_error: FunctionTooLong \u2014 flow_services_code_action::code_action_service::ast_transforms_of_error runs 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 887 over it, 9.87\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b59ddc696ec3b96293c46bff573f1dfabbbf7833a58d41deb95229c0d02143b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/estree_translator.rs: FileTooLong \u2014 4902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 164 free functions. The bar is 500 significant lines; this is 4402 over it, 9.80\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa711258fa2b1e001cbded950ad94fa5bea606df38101757f034fdb03db4910"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::add_interface_properties: FunctionTooLong \u2014 flow_typing_statement::type_annotation::add_interface_properties runs 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 868 over it, 9.68\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7266}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae60c952d7f485f5272a2ecf502b4920d7d9dd27d884fa0aaedfbbbe749c60"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: TooManyMethods \u2014 290 methods. The bar is 30 methods; this is 260 over it, 9.67\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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd7e56fbffb0968c605e9388b7e16818767832dfc9b7c215b8dc0203a34c1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_annot: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_annot runs 956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 856 over it, 9.56\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"2783f1faf1c7b941f17fa5f203b415adea1cc1f640e59946f1e88b8f649357bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/normalizer.rs: FileTooLong \u2014 4721 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4221 over it, 9.44\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c2b67f4e0218954f9f8882543775a9a38d609b0f480ec2b57b523f5d841a38"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScopeId: ClassTooLong \u2014 3687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 3287 over it, 9.22\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ea6a06b526d910eb9aa13793996177c9a544e9fbb4542c654544f76ac98de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 3529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 120 methods, 2 blocks, lines 552-5932. The bar is 400 significant lines; this is 3129 over it, 8.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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda944d32ed2825a03eb545fa571d0602e2b572f214f3d2543b718679552d404"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_object: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_object runs 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 718 over it, 8.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc75d367acc1423aaf028b3ce7380a2591b97cafdb6bf8928e924cc97096266"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp::lsp_mapper::default_mapper: FunctionTooLong \u2014 flow_lsp::lsp_mapper::default_mapper runs 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 694 over it, 7.94\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":"rust_port/crates/flow_lsp/src/lsp_mapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6848bd8faf16e49e6d1af9da1777b81db9edc4acf22a27115e65dacdb20d6ae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/statement_parser.rs: FileTooLong \u2014 3898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 75 free functions. The bar is 500 significant lines; this is 3398 over it, 7.80\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2f0087b3c9143ddc96ca78fc2f595bf0871e9f26a48e3d761095ea7b39372a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty.rs: FileTooLong \u2014 3865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 3365 over it, 7.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c33dd31c3db5b2385556d4b0ba06009959ee942225372c5a6c318caa2a9e89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list runs 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 670 over it, 7.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fa7d4f13dfea0b78daec610c226fcf6872cc5ea01af65350841a05eb002eb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::flow_obj_to_obj: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::flow_obj_to_obj runs 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 660 over it, 7.60\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"b434234d3b47e1d08c9a6dd7168057f5cc4ef4759d73ba6e08e595f244284aa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::eval_helpers::eval_destructor: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::eval_helpers::eval_destructor runs 759 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 659 over it, 7.59\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94f38cfb481eccfde917a32b33c2557acb3c27603181f987bd6f874b3f7419e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3258 over it, 7.52\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30c8fa270b29d35201b91622f02c0a2d7b9dd6e7f67a480f89086ce025c229c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_parser.rs: FileTooLong \u2014 3737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 96 free functions. The bar is 500 significant lines; this is 3237 over it, 7.47\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"861d1c52b5382fc1d5f1cc57c8317ac823e3e80abf2c5dc023617de5858e0704"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Serializer: ClassTooLong \u2014 2946 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 168 methods, 2 blocks, lines 57-4561. The bar is 400 significant lines; this is 2546 over it, 7.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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"57efb1cc61a76318d5db1ac6103cac252bce0f386bc0ec99e76986a64f5228c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::object_kit::run_with_env: FunctionTooLong \u2014 flow_typing_flow_js::object_kit::run_with_env runs 733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 633 over it, 7.33\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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38aea7fd57a84725a621238f9ad848e666622828d2bfc9882628635c828592"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_utils.rs: FileTooLong \u2014 3577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3077 over it, 7.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec1140b6c2d6f65bc9ad69dfe635517b81ad8ac6a24a2075320bd8ecf9eafae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_hint::type_of_hint_decomposition: FunctionTooLong \u2014 flow_typing_utils::type_hint::type_of_hint_decomposition runs 704 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 604 over it, 7.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a5d65ac4e857355ce7cf5d3e409d9c62e45923e18036699fc70f45b81da80a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::env_resolution::resolve_binding: FunctionTooLong \u2014 flow_typing::env_resolution::resolve_binding runs 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 591 over it, 6.91\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b9bdcc4f3bd3021aa99e4edf593dd72cc80d9aea150a28c389dd8e8cd73ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/serializer.rs: FileTooLong \u2014 3439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Serializer (2 blocks, 57-4561). The bar is 500 significant lines; this is 2939 over it, 6.88\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631e888ebcac03ea960d1920e1d6765c912d07b0d792c802ad33b5e4e9aa00a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::mk_record_sig: FunctionTooLong \u2014 flow_typing_statement::statement::mk_record_sig runs 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 585 over it, 6.85\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a496ef05a6da318ca80e5ea8ed016e3f6545bbdd62c289306df36914d8bd4ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::estree_translator::statement: FunctionTooLong \u2014 flow_parser::estree_translator::statement runs 682 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 582 over it, 6.82\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d577dc354ccd9b06b885b218ef3c4287a88fca6a898289e87f2a17c0ba110aeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/name_def_ordering.rs: FileTooLong \u2014 3400 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2900 over it, 6.80\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cae4e26aa0765de29f54ace66104a3e55e6e279b046711042e61987db4c153"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_service.rs: FileTooLong \u2014 3370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 2870 over it, 6.74\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff38585aa9d0735a79e1f73a6eb50df908cb03d01bea6ea1bc7b8fc237e5c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_config::flowconfig::opts::parse: FunctionTooLong \u2014 flow_config::flowconfig::opts::parse runs 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 566 over it, 6.66\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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bd3aa789f3c806cd44a7c6c9e7d99b439f724b82393a74be1f609d8a9838ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flowDefToTSDef.js: FileTooLong \u2014 3311 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 96% of them inside a single declaration: getTransforms (222-4850). The bar is 500 significant lines; this is 2811 over it, 6.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c04d5c56ece86f88446aae6b89944b480c5c3f3cf0eef706f483ee7ef92b93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/annotation_inference.rs: FileTooLong \u2014 3280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 74 free functions. The bar is 500 significant lines; this is 2780 over it, 6.56\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9075b2e1373b7b03604df16dfe0133f68f30ed2e81b6a8598a018a4d35d3207"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::flow_lexer::token_base_inner: FunctionTooLong \u2014 flow_parser::flow_lexer::token_base_inner runs 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 548 over it, 6.48\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"99186eea1fc0f4ab4064993d047910cfd2285d531db3ca8ec82adf44d48d2efc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_debug::dump_use_t_: FunctionTooLong \u2014 flow_typing_debug::dump_use_t_ runs 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 530 over it, 6.30\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c201ca0529656a4bd80344b4b3f5b89b2e4e40f26be6732cd03986c9dd6293"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.statement_list: MethodTooLong \u2014 statement_list runs 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 519 over it, 6.19\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0b6c13131e6e8f249a63e79cf916af2ab152385e7f5e9c27f3632602a7c0c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::get_persistent_handler: FunctionTooLong \u2014 flow_server_command_handler::command_handler::get_persistent_handler runs 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 517 over it, 6.17\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09ec29e4233b90ca3e7f5a26f7c46138fa5d1018f680e30388cdcb0074736a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParseError.fmt: MethodTooLong \u2014 fmt runs 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 511 over it, 6.11\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":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f95a1edde1bdfa455e89a11eedab4280a0ff90356ffd7f953ba5e0ab84096c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::static_method_call_object: FunctionTooLong \u2014 flow_typing_statement::statement::static_method_call_object runs 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 509 over it, 6.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0322f035cdc2eaaf6f49fe9fbfd10c6c5b3e0fb591aa092b14c566e27e883a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/slice_utils.rs: FileTooLong \u2014 2979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 2479 over it, 5.96\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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3125c5db978489f40669b99e29dfa186ac596b5f82c097dcd33861a9ecf38038"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NameResolver: TooManyMethods \u2014 174 methods. The bar is 30 methods; this is 144 over it, 5.80\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d0b393a652675665110152284d31c276de1e92e800748f9254768e054075d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/implicit_instantiation.rs: FileTooLong \u2014 2877 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 2377 over it, 5.75\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c9e5ad3308a3a919f0d0fea0267cc98da539b52855f2a452dac086abe39f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/env_resolution.rs: FileTooLong \u2014 2860 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 2360 over it, 5.72\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e8684634b261532f4e97ee80793df9d2c05ef50dc9755bf49bdf98308df055"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/code_action_service.rs: FileTooLong \u2014 2859 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 2359 over it, 5.72\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82caecd864ec1d8347ed3b3535c4f88fdf123e8314bd143b43638476ce18e0d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/predicate_kit.rs: FileTooLong \u2014 2849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 2349 over it, 5.70\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3356d7ef9c0104be69d4afd76d70865b4b7924f3d202f78db3a9507b7a3cf6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Serializer: TooManyMethods \u2014 168 methods. The bar is 30 methods; this is 138 over it, 5.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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"796e742781b12945ab197e7073b2b348c9f34c05b12c2be459ea06ee6d535da3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_lsp.rs: FileTooLong \u2014 2778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 101 free functions. The bar is 500 significant lines; this is 2278 over it, 5.56\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4af2087c2441491ba5048bc536cf6154c25f5d133b46d6ffb4adfe85a28f55b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorMessage.error_code_of_message: MethodTooLong \u2014 error_code_of_message runs 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 453 over it, 5.53\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":13031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8cbde291e0954f912274b8073c41c5debaeb2398e228c9366219e09cfcf9eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::mk_func_sig: FunctionTooLong \u2014 flow_typing_statement::statement::mk_func_sig runs 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 451 over it, 5.51\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":20245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73f9d495f4c7baf3cb32ed2fe31f5c45b7ae04ec9367db413227804b46e1d0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autocomplete_service_js.rs: FileTooLong \u2014 2666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 78 free functions. The bar is 500 significant lines; this is 2166 over it, 5.33\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"179133cfe5b5aa00f8f242706236c58b4a69f6bc735d33d924fcc4696e45d420"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::check_service::mk_check_file: FunctionTooLong \u2014 flow_services_inference::check_service::mk_check_file runs 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 432 over it, 5.32\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":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b50cb4aa43fd031c9413d2330b5118770aac9fc8b24910116dc61dd459be3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::class_def: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::class_def runs 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 432 over it, 5.32\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11788}}}],"partialFingerprints":{"codehealthFindingId/v1":"816fa15f64f5240719a3622b77528cc4170782978d3e941030ae6b7d429a3589"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 119 free functions. The bar is 500 significant lines; this is 2152 over it, 5.30\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef72bcb15302653c662ad7bd16e92995776be98653796f9d520364ab6e3f7d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flowconfig.rs: FileTooLong \u2014 2564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 79 free functions. The bar is 500 significant lines; this is 2064 over it, 5.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccd99016d978ff986c41b90d75a296b8834fccb4491db943a4ebabef2e57430"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/helpers.rs: FileTooLong \u2014 2528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 74 free functions. The bar is 500 significant lines; this is 2028 over it, 5.06\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efd8a1d8ba515d97fe95f5c9df0c38e35619f82680cbd60f139ffd206bcafbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expression_parser.rs: FileTooLong \u2014 2505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 2005 over it, 5.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4148c6b7f23ac48c81a20cf5112b5e5c7a5199397175cd9f5d30acd31203fd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::helpers::handle_generic: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::helpers::handle_generic runs 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 401 over it, 5.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"031ea667440b7600144621a0189bc79510ada3ca603d812a11d972798c17c8f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_util::mod_loc_of_virtual_use_op: FunctionTooLong \u2014 flow_typing_type::type_util::mod_loc_of_virtual_use_op runs 496 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 396 over it, 4.96\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"548a0beb614d9d01838a331550c57d6e190ad02d89cf380f28415052a221c766"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_command_utils::make_options: FunctionTooLong \u2014 flow_command_utils::make_options runs 491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 391 over it, 4.91\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34290498fe295241a9da404cdac9196cefa2e6aabb9131170921062db3cf527"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::merge_service::sig_hash: FunctionTooLong \u2014 flow_services_inference::merge_service::sig_hash runs 487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 387 over it, 4.87\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30320c5c150cd5601abfd1771420cbaa55e48ad47e2717424ca988bc46f5979"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2416 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: Context (3 blocks, 878-3680). The bar is 500 significant lines; this is 1916 over it, 4.83\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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb2313077afcb7331e71cf668859d17a5a6b7be4bf0364845ab7df98aca7ece"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_sig.rs: FileTooLong \u2014 2408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1908 over it, 4.82\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7bc22c12c90154eb59293ff97914ccec1be2cf7626d2b30166898a01f92f43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.visit_match_pattern: MethodTooLong \u2014 visit_match_pattern runs 478 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 378 over it, 4.78\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1a0d4818cfa2c4f954938ce8510a52cb220e15b521f003a9eb3eba3dc184e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::check_polarity::check_polarity_impl: FunctionTooLong \u2014 flow_typing_utils::check_polarity::check_polarity_impl runs 473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 373 over it, 4.73\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":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ec9844c5a0b07cd9297f73437af1d83f7f0d3e5f570216515d0693dc0c2ad0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_operation_utils.rs: FileTooLong \u2014 2324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1824 over it, 4.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a3f227df387a2ef0757709f688e95f5262b1439352e0604673f69e50cecd85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/object_parser.rs: FileTooLong \u2014 2318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1818 over it, 4.64\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3ac06697a1a32f811fa2128c96d150e41eee99d868f629a612c404ee48c95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Transaction: TooManyMethods \u2014 138 methods, declared across 2 files: src/parsing_heaps.rs (84), src/transaction.rs (54). The bar is 30 methods; this is 108 over it, 4.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"266b85c5d6352f4f2870e956d2dbcb1002fddaee993d4ae5e65d7437ed907ca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_util.rs: FileTooLong \u2014 2297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 64 free functions. The bar is 500 significant lines; this is 1797 over it, 4.59\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c630fa8374ed5887fb145660e499e9c513d9cfedee7683834a9a833247b8a1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_util::util_use_op_of_use_t: FunctionTooLong \u2014 flow_typing_type::type_util::util_use_op_of_use_t runs 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 357 over it, 4.57\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c5dedc689138ed0cc10dc2d86626a53c815847e37ecea6680a32c9b725a520"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::estree_translator::expression: FunctionTooLong \u2014 flow_parser::estree_translator::expression runs 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 345 over it, 4.45\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"759206096fed32bccd385497da4a6a6f554da02a51cb8fc76ab2c1245a90d987"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intermediate_error_types.rs: FileTooLong \u2014 2213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1713 over it, 4.43\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":"rust_port/crates/flow_typing_errors/src/intermediate_error_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"223875b0b75bbda70c7c26f2c42fe0d89d3dccca7a94d656477ba06987be73da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.walk_structural: MethodTooLong \u2014 walk_structural runs 439 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 339 over it, 4.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"acefdecff99bddf1de4e2b03f348087e7881b0a9afeef96f2a4a05285930b61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::expression: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::expression runs 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 334 over it, 4.34\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"912c3db1326d79b8c1e5f1e32075073cec62f1bdb76457478bd26de39317b118"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_builder.rs: FileTooLong \u2014 2169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1669 over it, 4.34\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":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaba578a29385b32b5288e7318357d00b82f2826ec117e402d11923d792f39b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::predicate_no_concretization: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::predicate_no_concretization runs 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 330 over it, 4.30\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc795ca8089e9779a608bacd3a3ef3e84f673b494c6f962247cf1317b7ec3b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::react_kit::run_with_env: FunctionTooLong \u2014 flow_typing_flow_js::react_kit::run_with_env runs 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 319 over it, 4.19\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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a37aa1b8edc2565912ee3c6311efb64bd33f9cf28b026ca86ee6c743eb1bd2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorMessage.loc_of_msg: MethodTooLong \u2014 loc_of_msg runs 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 318 over it, 4.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":8938}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a67d761c03dbd2e7c3b29a6b4b2f846a413038ae4579ccfe2fe0e644a052b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::module_info_analyzer::visit_toplevel_statement: FunctionTooLong \u2014 flow_typing_statement::module_info_analyzer::visit_toplevel_statement runs 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 318 over it, 4.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4579a574f93112f8e43a815474ef7ad04cfbd26d57c561ac443606c0dfaf3c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser_env.rs: FileTooLong \u2014 2086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 100 free functions. The bar is 500 significant lines; this is 1586 over it, 4.17\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bd7f59c0d9dcb7ca49a3f6e229e535e9030486a180e626e2bcd4c03d5e4aee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Opts: TooManyFields \u2014 124 stored fields. The bar is 30 stored fields; this is 94 over it, 4.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"665d8b587cde759f2fccfce1fc4374eee7da4d06ab6bbf0622df4f92b08bcb75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_env.rs: FileTooLong \u2014 2054 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 79 free functions. The bar is 500 significant lines; this is 1554 over it, 4.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5921d4dee7f0c803ef45fd3ca83e5596b3bbec6065a46bdc823744e9d85d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::walk::solve_targs_in_snapshot runs 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 308 over it, 4.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":6421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ea22d6dc598a6a66e75743fb4c44a58742d7f78a21b31fde8a49afef52062"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::members::merge_type: FunctionTooLong \u2014 flow_typing_utils::members::merge_type runs 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 306 over it, 4.06\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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86757778c9704c26d6eb810194252259bb8d0afdc1141d8f4b40d0b4b1b9a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env: FunctionTooLong \u2014 flow_typing_utils::type_operation_utils::special_cased_functions::object_assign_with_env runs 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 305 over it, 4.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"65567861763bdd2daf60fb1cfdaece10e096f3c9db71c5c23462b60b5aa79021"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Volume: TooManyMethods \u2014 121 methods. The bar is 30 methods; this is 91 over it, 4.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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0ba1229c3bd79b271a677790dfdff077242ddbec7b8be1c94f8e41ba3dcec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exhaustive.rs: FileTooLong \u2014 2012 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1512 over it, 4.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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a398f1f088dfddfd5837a8650393d279148c4126db10b7933caf47136ff32bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 120 methods. The bar is 30 methods; this is 90 over it, 4.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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"586be53b24cc87451c0c15a30023e74f32096b0e99cd4b14b6850a1a64757cc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::t_of_use_t: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::t_of_use_t runs 400 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 300 over it, 4.00\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecf21d54de646a9e3bc86a46534913d0616bd7a6938cff45b8128ab53498fe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::expression: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::expression runs 399 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 299 over it, 3.99\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e48adcb52e55ae9e2354ffb1cc7a7877bccede1cd87a5644c512461f3480b4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::unification_helpers::__unify_inner: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::unification_helpers::__unify_inner runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83a0a629f9375d6cc3cfdd443aaa36d835a46f3a821e59f48e66157964abfe7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_lexer.rs: FileTooLong \u2014 1936 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1436 over it, 3.87\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de537f1ab9312371a77a8d29aee83afedc5f7ebed526887045380ef90b3a37c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::element_converter::toplevel: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::element_converter::toplevel runs 387 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 287 over it, 3.87\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186a895977f185a3b9b26469578d3ac6f500e1ae5cbb02c7335a76c0a1f1a8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/class_sig.rs: FileTooLong \u2014 1925 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1425 over it, 3.85\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f8d1d9fa88c7c93d2eb727dc48a5a07cc961e6d1b35f7d4463f2cb34add53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::expand_members::type__: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::expand_members::type__ runs 384 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 284 over it, 3.84\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c1ed69f87efb0236021c1d53aed80ce06039793f713aff7a2cd259e460720"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::intersect_type_guard: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::intersect_type_guard runs 380 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 280 over it, 3.80\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0b0605fb45b551f24da011e2665d31b664311db48e905b2119b25cab5abec5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_debug::dump_t_: FunctionTooLong \u2014 flow_typing_debug::dump_t_ runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"922212e128d97c00b2f15ed386e547d00a39472f489906b1c33b62d9d0563ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::friendly::message_group_of_error: FunctionTooLong \u2014 flow_common_errors::error_utils::friendly::message_group_of_error runs 375 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 275 over it, 3.75\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"076a51031a028928aee7ecd8b8f69346bfa60e062d769725875b3fca7fc1b0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp_server::flow_lsp::main_handle_initialized_unsafe: FunctionTooLong \u2014 flow_lsp_server::flow_lsp::main_handle_initialized_unsafe runs 372 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 272 over it, 3.72\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b145953cdd7d672b7bfbe81cd551879849a6114d17e129e563f34d9077974ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Options: TooManyFields \u2014 110 stored fields beside 1 method. The bar is 30 stored fields; this is 80 over it, 3.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/options.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"259cbc2cd0430b7539d41907b1142664bec88e081b37b6d6d015a5a58ee39722"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Context: ClassTooLong \u2014 1457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 290 methods, 3 blocks, lines 878-3680. The bar is 400 significant lines; this is 1057 over it, 3.64\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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ba09a98153dd9436bda7f14403dc2bb47bc22f726f8d3f7f3734adce9c43d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_type_sig::type_sig_parse: TooManyFunctions \u2014 109 free functions. The bar is 30 free functions; this is 79 over it, 3.63\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b47263025b51ae3dc6833e113d78eab7aade389b0f651a858ef8aa4badd3325"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::glean_runner::source_of_exports: FunctionTooLong \u2014 flow_cli_support::glean_runner::source_of_exports runs 359 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 259 over it, 3.59\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"149837c65b6f6dd6f0ebe7af939e7e09b33a07d1b0f7f55b4ea23d6acecf0cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype runs 359 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 259 over it, 3.59\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360b81ddc94af63e19124ac79aa3983a38e10f0b2d225d4598d997dcd6c6438"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/merge.rs: FileTooLong \u2014 1769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 1269 over it, 3.54\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"454e3cd5887f0daba3723e7c74923cdee8173c62c31765d7b60a2f482fdd4f7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::statement: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::statement runs 353 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 253 over it, 3.53\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133830c59878d923d5650813d66d2994459947a334ef70a8060007080a9814e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/react_rules.rs: FileTooLong \u2014 1762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1262 over it, 3.52\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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacc044a76122062c99d7c001a3ea6fa509f7d20bb2ff633b70e01e3f03faa76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.js: FileTooLong \u2014 1760 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 260 over it, 1.17\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":"packages/flow-estree/src/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa50117d3d65fb45e4ca1e2ed95aab26b7b4cc0e583c895841a141068b31ef3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_builtins: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_builtins runs 348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 248 over it, 3.48\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":6402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11a10f14f924460a564ce961e7c9efe818fec57df61430c6062b9c014649773"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scope_builder.rs: FileTooLong \u2014 1735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1235 over it, 3.47\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cf28d5df24a4349a6ed89156b9648f747741ed22aac07d43625e52c6f542ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/glean_runner.rs: FileTooLong \u2014 1730 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1230 over it, 3.46\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f052d4c46cf14b1ec818dcadae7e98f0dc1fa670b9711b99eb5a178b7e7593d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::instanceof_test: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::instanceof_test runs 345 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 245 over it, 3.45\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3abe37ac82449b3031249fe4d30cc7daa04343539632e8735589d09a08e098"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: T: TooManyFields \u2014 103 stored fields. The bar is 30 stored fields; this is 73 over it, 3.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp/src/lsp_mapper.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"90798960317b3b1d6fc27823b3e5c8ec2939979a211bd4d78c821896835b49bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_mapper.rs: FileTooLong \u2014 1701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1201 over it, 3.40\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c891ab7cc2ff681fe56bae503e7a6221cff02a2d24d7acd3682ef957660f12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_printer.rs: FileTooLong \u2014 1681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 1181 over it, 3.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20657935a1034c91364d8a01e7cabe57ca22cceb95294aa9f6cfdc677898b07b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: environment/jsx.js: FileTooLong \u2014 1679 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 179 over it, 1.12\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":"evals/flow-typed/environment/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"870334c2c145b40ea30950f4d9be9103e2406fac9e426bb02db6f98dd54e9f69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::statement: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::statement runs 335 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8480d2a0a1493ae309d2bccfa78b8178f46c3cd544e34844ae54629c2b017ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::type_inference::scan_for_lint_suppressions: FunctionTooLong \u2014 flow_typing::type_inference::scan_for_lint_suppressions runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9949a2a585c9962aca71f6e2ff7a877362906567d8c74025c6f3586a05a359b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::ty_members::members_of_ty: FunctionTooLong \u2014 flow_typing::ty_members::members_of_ty runs 316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 216 over it, 3.16\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":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554cf581b91198c68e1483ac630450dfa584f421359bb277dfdb0a20046f659"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/TSDefToFlowDef.js: FileTooLong \u2014 1578 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 97% of them inside a single declaration: getTransforms (84-2086). The bar is 1500 significant lines; this is 78 over it, 1.05\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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008cc372b91a4643e2021a6e295eed1b64a1bc6bd19a1ce276ec06a184230da2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::func_sig::toplevels: FunctionTooLong \u2014 flow_typing_statement::func_sig::toplevels runs 313 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 213 over it, 3.13\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"12307213a33cf33d4a99382d2788650c10ab6b04dc2ba42a33e081f22948c8bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_pack::pack_local_binding: FunctionTooLong \u2014 flow_type_sig::type_sig_pack::pack_local_binding runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8837e873d614ac2380ee21b77dab40db4b64078ace0aead1cddb9852cbe0d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/find_providers.rs: FileTooLong \u2014 1539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1039 over it, 3.08\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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a6f2a7c7a4833b2ddf07bfc520280c810e7b169b3bd3d8c9566724f8b89c3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1032 over it, 3.06\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":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d169725de1cb092d9a9baa70f5cf2b007b8c33a00c65991eb61336da8702d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flowToFlowDef.js: FileTooLong \u2014 1522 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 1022 over it, 3.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93edb41061891a8f809bf1e8bc4d412c7d1b54b1efefb1ed4d9f671ef3c8ee84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::mk_component_sig: FunctionTooLong \u2014 flow_typing_statement::statement::mk_component_sig runs 301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 201 over it, 3.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19826}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23bedaa9aac108f87a6d63d5c513d2536a814ffa47e49dc71fb13469726a79d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_hint.rs: FileTooLong \u2014 1501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1001 over it, 3.00\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74f0127e8ef28af4eb7aa59bf9d6764d1fca1bcca996bc36e2f631477ba756b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ssa_builder.rs: FileTooLong \u2014 1498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: SsaBuilder (4 blocks, 478-2298). The bar is 500 significant lines; this is 998 over it, 3.00\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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43230ab6049f57bff5ab6df64f4947ca50a4776600fdcbbb4f0b1afcd0a902b8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SsaBuilder: ClassTooLong \u2014 1192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 4 blocks, lines 478-2298. The bar is 400 significant lines; this is 792 over it, 2.98\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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a87b697ebc2488d8d0e929d06cde8b53e3e0eedcdc83a3fd129e3158354d0ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::match_pattern_parser::subpattern: FunctionTooLong \u2014 flow_parser::match_pattern_parser::subpattern runs 298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e735f7bb8ebab2474176accabb287df37b7cfa2215d1b120a2eb51ecce1bded"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node_kinds.rs: FileTooLong \u2014 1487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 987 over it, 2.97\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":"rust_port/crates/flow_parser_wasm/src/node_kinds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ef0d6ea2390d5880c324b1b18d97bb3fdf1f4d32ae86bdfb48bf3c8c2570e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::comment_attachment::statement_add_comments: FunctionTooLong \u2014 flow_parser::comment_attachment::statement_add_comments runs 294 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 194 over it, 2.94\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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fbd95e4303be4e473b7ff969a126940d2b49d97b158a44830d4ceb26f8419c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::mk_declare_component_sig: FunctionTooLong \u2014 flow_typing_statement::type_annotation::mk_declare_component_sig runs 294 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 194 over it, 2.94\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":9006}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad9f8dbc752d047dc43ce1cfdc4b8717878fe55af40d14eb012da859d377b02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references: FunctionTooLong \u2014 flow_common_errors::error_utils::cli_output::print_colorful_code_frames_friendly_with_coalesced_references runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f1922835e7aeec1410eedd3c0760dcc15341ed811dccc6b44f61e2e006b5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::object_type: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::object_type runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"2013667f33ab9aca5810369f23a363a22b6d9484cfab0a7f52b522df2393eeec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/ts-estree-ast-types.js: FileTooLong \u2014 1443 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 943 over it, 2.89\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":"packages/flow-api-translator/src/utils/ts-estree-ast-types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5424aaeb45d041d8278ed2aa921c5a7694cec7841684b15db8aeb1da6d62d730"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::jsx_mk_props: FunctionTooLong \u2014 flow_typing_statement::statement::jsx_mk_props runs 288 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 188 over it, 2.88\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b827586382fb5ae6c973d553eb48980580809e5d2bf818abc4320278ac501e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_visitors::type_mapper::type_default: FunctionTooLong \u2014 flow_typing_visitors::type_mapper::type_default runs 286 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 186 over it, 2.86\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a97c3854948031076d31c4782d69e44c07bffa574d4db2b38cba45a3916769f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_type_sig::type_sig_parse::scope: TooManyFunctions \u2014 85 free functions. The bar is 30 free functions; 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bb7d50edfed37e2339287bd101f2287904cac730ade1b164a97c52593ff7c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_debug.rs: FileTooLong \u2014 1408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 908 over it, 2.82\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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17be638f5844a763b200a0e029e805031318d6c22adc2e8c05fbc60c9bf9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_converter::type_ctor: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_converter::type_ctor runs 281 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8830905b5130096e635d3a8b49d1fa7c7f2a21518e2d545f1f632e8474dc86f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/eval_helpers.rs: FileTooLong \u2014 1392 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 892 over it, 2.78\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f68c6e402c8eb5bafcacd9a01e71045b3a6ed33034186b7215ca76d6c0af817"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::helpers::reposition: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::helpers::reposition runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f960eb97d07122a8383d5af7fea96357220b8ef2d0d63a95e85f1b61d981d323"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::jsx_title: FunctionTooLong \u2014 flow_typing_statement::statement::jsx_title runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.77\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12891}}}],"partialFingerprints":{"codehealthFindingId/v1":"8580e1a465a7966a102ee39501d11c249efe431035a3d411f851b511e06aa4dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_sig_pack.rs: FileTooLong \u2014 1381 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 881 over it, 2.76\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be237f4d4c1874f2e3ca9f3eff9b544cacc66a3f38fbbaa61fe6e903bc50843b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Referencer: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd70c1aa745cb1c66a6038dbf2545119c62786ec85611b5b772d432184c6dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserEnv: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5452770245c918ed67701167caa64c3df56ef4ab9aa6d3a2d33e6b29fe27fade"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_filter.rs: FileTooLong \u2014 1363 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 863 over it, 2.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8261e7ac14add27fc34e6ee264fd09c05db203cd030b2059232430884a65b20e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::assign_member: FunctionTooLong \u2014 flow_typing_statement::statement::assign_member runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11825}}}],"partialFingerprints":{"codehealthFindingId/v1":"d538e05909f3a717b7ddf5b3fa6b2f68b6f0012bf4e51399b6cc1e0e5d36764c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/codemod_runner.rs: FileTooLong \u2014 1339 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 839 over it, 2.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4528990bf6273cd1ee63f1d9593ac5ddf6f6972622b5ee004d0258c1cee220fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Substituter.type_: MethodTooLong \u2014 type_ runs 267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 167 over it, 2.67\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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6a51e273d63f3f19770ad3caaabaad81511c902f6cb469aa099481ebda014a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/insert_type_utils.rs: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 808 over it, 2.62\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd29a8d6c038853f223081eb2f484dcc2b6fd992b8651a42ac27cf9cd479c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::object_prop: FunctionTooLong \u2014 flow_typing_statement::statement::object_prop runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea47867bdd942fe0b918084a68baec4b45c57b07d2c7a6512376a2c0c5aa2c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::filter_object_by_pattern: FunctionTooLong \u2014 flow_typing_utils::exhaustive::filter_object_by_pattern runs 261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8f543e6a2332b4811920eff38c76efb814117e9cb24e575095982545c0b280"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_socket_rpc.rs: FileTooLong \u2014 1298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 798 over it, 2.60\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b3e8f9dae355570c063b41de07300328c5e4d19d4ba98acf0a7780098a729"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flowDefToTSDef.getTransforms.EnumImpl: FunctionTooLong \u2014 getTransforms.EnumImpl runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3495746de7bca7ab8f93597ca774cd18f82bb3a1fe98863d08137cd2ca4696b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autocomplete_js.rs: FileTooLong \u2014 1285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: ProcessRequestSearcher (3 blocks, 346-1680). The bar is 500 significant lines; this is 785 over it, 2.57\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df727566bc33b0b8cb06a4dd00835dc2b1ebcb52bf603c662d5adbd69788fec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_js.rs: FileTooLong \u2014 1280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: FlowJs (2 blocks, 234-1213). The bar is 500 significant lines; this is 780 over it, 2.56\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":"rust_port/crates/flow_typing_flow_js/src/flow_js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a59241995d06c1f7f9ec530592d4095731b86ebec116ffee83a73068106e2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::declare_class_props: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::declare_class_props runs 256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"505d05b6d1cca47ac7a691356f966936544d4349d596f9c3fe5e904b28269093"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reason.rs: FileTooLong \u2014 1275 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 775 over it, 2.55\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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf17d09f4f7ef7effb8ebc958617ca90138930b91eb7f822cbec9755ceb5280e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transaction.rs: FileTooLong \u2014 1274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 774 over it, 2.55\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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"794add04b579a70b0dc5779aae3396590d1e9d093ffd7cbb454cf8b43a8d075c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_converter::type_app: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_converter::type_app runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60cf4d8512f1bdfff14c0658076668e23ac6b2ae6585538a1e50bf5e3431a40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_value: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_value runs 254 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b315712ca101f950d7e3ca046306cea2905770635f9a9bcc586744b511e784"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/typed_ast_finder.rs: FileTooLong \u2014 1267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 767 over it, 2.53\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":"rust_port/crates/flow_typing/src/typed_ast_finder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d141b36e9357d0c9ea1baa4df9abedb98bfb0fbf0cc0a5499181288b88b86"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_event_logger::fb_facade: TooManyFunctions \u2014 76 free functions. The bar is 30 free functions; this is 46 over it, 2.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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cecfbbc918759e409967ccc00158fdfccfe0a323bed8024042be41791183a29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::estree_translator::type_: FunctionTooLong \u2014 flow_parser::estree_translator::type_ runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"c765e5a8229bc5930bdb1626e35f737fc8a2a6cbeca69e2ac3ca7c8a3979bb07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::eval_helpers::mk_possibly_evaluated_destructor_for_annotations runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbddd1458fe9bbece45cad5b1c6ba84827676799dacd78dd57096ee66177b0e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Annot.iter: MethodTooLong \u2014 iter runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6891de8c7de0e0fe7aa42caedf3682665a508b86a0725c0d625b1a9d6b29da02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_event_logger::stub: TooManyFunctions \u2014 74 free functions. The bar is 30 free functions; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"045d12281454004aa2135251599316e5fdf4086846135139d910d90130b86e00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FlowJs: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f563cbe5c95519d6f0e70f27c9d8a66dfb5a8eb08d1b08bd9b6abd2d2f7e80d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::compare_printable_error: FunctionTooLong \u2014 flow_common_errors::error_utils::compare_printable_error runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210643348a14d466f904f2267ef761c937287d58a506e030c115c6734fce806"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.expression: MethodTooLong \u2014 expression runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/indented_printer/expressions.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17a66bf656e512a069438da76973c801d8afc0b6c3482dabb5ab927549cda3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::mk_declare_class_sig: FunctionTooLong \u2014 flow_typing_statement::type_annotation::mk_declare_class_sig runs 246 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":9401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8218c27b3fcec7f4dc937126ff0e5ef1cf89326ad87cc5cae9d2175a34f68932"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::type_parser::primary: FunctionTooLong \u2014 flow_parser::type_parser::primary runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"681806249e745b3092783756adebb03952498ac524292b15ec08aef8b83ad640"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProcessRequestSearcher: ClassTooLong \u2014 974 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 3 blocks, lines 346-1680. The bar is 400 significant lines; this is 574 over it, 2.44\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d168567ee073ff78b50de90af38f25dc2a5992efac836ef316c072720b4f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Transform: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"151ff12d8c87755fc8bd805869c4ffc4dc26908c77a109bdf309a12627306894"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autocomplete_service_js::autocomplete_get_results: FunctionTooLong \u2014 flow_services_autocomplete::autocomplete_service_js::autocomplete_get_results runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b865404afb3a690aa452892312e69b59cfc362a5180c5f9fe4c8f7bb48e6b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_hint::instantiate_callee: FunctionTooLong \u2014 flow_typing_utils::type_hint::instantiate_callee runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfadaf57a4db5c861ae9fcf5a286ccf02ba4ebd6632842ba7b921b39e9bed0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comment_attachment.rs: FileTooLong \u2014 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 711 over it, 2.42\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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47637fb24f26993cf8e3cd2b3b0063974d55514d0b37d4c67d57d41924802ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GleanRunnerConfig.visit: MethodTooLong \u2014 visit runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd374741bf5746687bf67aa6b669bcbe6d7c9e37d829ea3ed4a8856903ede97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::switch_to_match::convert_switch_inner: FunctionTooLong \u2014 flow_typing_statement::switch_to_match::convert_switch_inner runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b569d7cbbec5adc5a21e85d7c4403848b6c492f89b069d279d1f1adcfc6efa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_declare_class: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_declare_class runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c0c836a0c9b07a1edbaf995a8a4c7fa8db8eb3c8bc7600e221216b5824c57f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/get_def_process_location.rs: FileTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Searcher (4 blocks, 193-1335). The bar is 500 significant lines; this is 707 over it, 2.41\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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3202d19c18c41442c2aa80fa6d9daac2cbee4d6e5251800d680f3e471ca3f2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::renders_kit::rec_renders_to_renders: FunctionTooLong \u2014 flow_typing_flow_js::renders_kit::rec_renders_to_renders runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4abdec9e7d0807fad3d635dd4effe3f1b469bc5ff58d6b252ddf54413d5473a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::env_resolution::resolve_hint: FunctionTooLong \u2014 flow_typing::env_resolution::resolve_hint runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab7499b01c2f8aace0bc9b9ecc438a166c96e0ec13de5b3ebd4e47ad73c2a4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/multi_arg_helpers.rs: FileTooLong \u2014 1170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 670 over it, 2.34\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e300de9aca839b069b35044c8776daf970f9a4a383305431db742ca7eac6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::env_resolution::resolve: FunctionTooLong \u2014 flow_typing::env_resolution::resolve runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d55de5303e8f63076fe6a9e7d7641312e88f75562384617765eba8f842e4cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.walk_def: MethodTooLong \u2014 walk_def runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4ef600ffbdce599f1e45390a3c66c48896759559e4fbaf7e571bdd26fb0194"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_operation_utils::operators::check_strict_eq: FunctionTooLong \u2014 flow_typing_utils::type_operation_utils::operators::check_strict_eq runs 232 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 132 over it, 2.32\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"664701b93f6e9e8fbe55826ba848c231c180fec12f7b06df05363a152d3e2bc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/object_kit.rs: FileTooLong \u2014 1150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 650 over it, 2.30\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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48b2b265787f25aee6b6e0a22bb685a4822fee2f6c5a836e4ee21b00d6fc147"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::value_union_builder::of_type_inner: FunctionTooLong \u2014 flow_typing_utils::exhaustive::value_union_builder::of_type_inner runs 226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 126 over it, 2.26\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf129357273bb586b02284191dc7560759025f693d83f8c738190c931e99e9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::call_latent_pred: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::call_latent_pred runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be6c6da65fa6165457f3a1abe2287a960b19c8b86aa8ea5ca6d453068f9264e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::detect_sketchy_null_checks: FunctionTooLong \u2014 flow_typing::merge::detect_sketchy_null_checks runs 224 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3829e2c0a831ece1c35f880ad94dc3af33683c8c83c81407f7f08db7a88de9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parsing::docblock_parser::extract_docblock: FunctionTooLong \u2014 flow_parsing::docblock_parser::extract_docblock runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\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":"rust_port/crates/flow_parsing/src/docblock_parser.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"140cdeb7815c45406189000839dc79fb96e03b907f50c127150ad4ee73c8d519"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::recheck::recheck_parse_and_update_dependency_info: FunctionTooLong \u2014 flow_services_inference::type_service::recheck::recheck_parse_and_update_dependency_info runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4ef8ef7a3bf08fd21dd039b443ca8cc19f4a0cfd844c8231f50bfaf601aa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_interface: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_interface runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4941fcbcb752d87abe62b0c7648214a1020c2e7f26a7c06c62a6c07bf44a5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_watcher.rs: FileTooLong \u2014 1113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 613 over it, 2.23\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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ef850cd639e9a519cb42274c6d88423f3f6711bbd5000c2906f9f14f4e6058"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/declaration_parser.rs: FileTooLong \u2014 1112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 612 over it, 2.22\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9424f904df91be1d7cffa1638198ab9fbc8f9a679db8ed5207b44bb0d87dad55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::code_action_service::code_actions_at_loc: FunctionTooLong \u2014 flow_services_code_action::code_action_service::code_actions_at_loc runs 222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 122 over it, 2.22\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18521790c0ac9d6f244fccb3ebd4e221df30cdd5e99b180ee3bbecc9efb9b92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::array_elem_check: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::array_elem_check runs 221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42ccb35eb48b301dadcd04635cd562662d75d6af5cb880e71fa2b89a4f4e0e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 604 over it, 2.21\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":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5accbf8880828a6a656c0f50a0eba9325c2a4424b2462898839ccb8f9fff17ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::export_specifiers: FunctionTooLong \u2014 flow_typing_statement::statement::export_specifiers runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b16f47f21d8ef873077ed1965b2386a4e84d3c7f0f14d4688e3ce5deeebc0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::annotation_inference::elab_t: FunctionTooLong \u2014 flow_typing_utils::annotation_inference::elab_t runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b71870df260508100412dea3d9b90ad847b99c11704f60e14a440582c93d213"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner: FunctionTooLong \u2014 flow_typing_utils::exhaustive::pattern_union_builder::of_pattern_ast_inner runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6deafd419b312a8ea6d3fb34eeba6a71918cb04c56fcf3b0e1768b48c584574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/files.rs: FileTooLong \u2014 1098 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 81 free functions. The bar is 500 significant lines; this is 598 over it, 2.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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e321130753f7501b7cbc3b29e3479238e381b2ae5091eb50c65a864fe38cb3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_utils.rs: FileTooLong \u2014 1096 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 596 over it, 2.19\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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5327e6174fd5d96c941a6f523b74ab848516f32646853925bbf27678de9154c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::check_files::check_files: FunctionTooLong \u2014 flow_services_inference::type_service::check_files::check_files runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca0141b3a89126b9d197856197a0855c9229cb0004e0b6e5311c055c27fd43b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_env::possibly_refined_write_state_of_state: FunctionTooLong \u2014 flow_typing_utils::type_env::possibly_refined_write_state_of_state runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5760b4701d14d00bc188d2d238e5373199ba011fa20dcb86596f92d0b9aab99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/refactor_extract.rs: FileTooLong \u2014 1083 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 583 over it, 2.17\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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1033bcea1e8581c302d3a06319ad56f30fb50d17c6e06bfb7aad2dc67a0555fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.mk_env: MethodTooLong \u2014 mk_env runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f3a5f36bb0d7e408f6aaaac7c519461381889f17ab351241eda68c70d3c050"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::cli_output::print_message_friendly: FunctionTooLong \u2014 flow_common_errors::error_utils::cli_output::print_message_friendly runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc60893a59374cdcc6fb9025784545e06123f06b94a65fbbc322395982b10a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_def: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_def runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5871}}}],"partialFingerprints":{"codehealthFindingId/v1":"25284b881fa2c16616c0d6a101edef3023cc364c1b3b041f9872f0203fd3839c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1074 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 574 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8717d59ee8761dbd34176d623963efec727a8d3c16ba27afae68fb1fdd6fc2a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/merge_service.rs: FileTooLong \u2014 1071 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 571 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc06c234b052387d05cf46245b264fcd789e5be5aad940b758eb1e35f540540"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TyIter2Ty: ClassTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 54 methods. The bar is 400 significant lines; this is 454 over it, 2.14\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"42286d0cabbf52d470e472cc5a70fbf0a8bf16f927f3d025188836ba1d6a5152"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder_resolver::name_resolver::error_for_assignment_kind: FunctionTooLong \u2014 flow_env_builder_resolver::name_resolver::error_for_assignment_kind runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"05acf865b72d75aba8f532035b88aa83e557c36541525ae8e9e606f0907f244b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_fmt.rs: FileTooLong \u2014 1054 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 554 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bfe24fd913070428230e40529fe6a870f4ae67907e9436d0d366cbf9a7943"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1053 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dot_js_wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f2db44a0ca48d1bc8ade1434ee8c9140ab38aee5b0d7887f6919eb13e46bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::type_parser::add_comments: FunctionTooLong \u2014 flow_parser::type_parser::add_comments runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1da01a59f0532631e269617c6d0d497e6e7a20b7482e7b20dc25b4e32ce6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mapper.statement_fork_point: MethodTooLong \u2014 statement_fork_point runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\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":"rust_port/crates/flow_services_code_action/src/autofix_type_to_value_import.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2444cd436a5c3dfdf69fa919d22733cf20de4c180741ece3aca42ccce3b8863"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_visitors::type_mapper::destructor_default: FunctionTooLong \u2014 flow_typing_visitors::type_mapper::destructor_default runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d7a58a5626e159ee5840d9d5f7a5cb495e587fc1408bfd2f9d780872195286"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Serializer: ClassTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods. The bar is 400 significant lines; this is 439 over it, 2.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":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8156961445b1fd98f1166130649e6bb6b42e0fc028b7ccb01593040dd7eb7363"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/refactor_extract_utils.rs: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 538 over it, 2.08\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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd0340cc0534bdd412cf1cdb4d0bdc81a3fd4f15154e6a34693b0e4b379b8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::ast_visitor::map_type_default: FunctionTooLong \u2014 flow_parser::ast_visitor::map_type_default runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":12634}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3eddc282e5eeb6a8149b8ae8d0740eaab41b90f3377cb7110815ba56602cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_get_def::get_def_js::get_def: FunctionTooLong \u2014 flow_services_get_def::get_def_js::get_def runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\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":"rust_port/crates/flow_services_get_def/src/get_def_js.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec4f7e3549a064c9fe733613a980f7c7c7989e38dfbeb0c93445df948a12fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::type_object_property: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::type_object_property runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e679f7f3efe3834e0bd2fdeacc93a9b16065b0ddf5cddc9fb378ef5538261eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::object_literal: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::object_literal runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12512}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aba072855f6b761c391ba8a5c53f7bc4cf98282ecb8305aeb2b98cc8821b5f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Searcher: ClassTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 4 blocks, lines 193-1335. The bar is 400 significant lines; this is 415 over it, 2.04\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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ace29a7e1e79af6f4cd35d84bce5e5e3e0d7241d5e291f71642a4e51de323be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_monitor::flow_server_monitor_server::server_instance::start: FunctionTooLong \u2014 flow_server_monitor::flow_server_monitor_server::server_instance::start runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d64a2cf35e39ce3b67001bed33917cee48775b060e0efe11a79924b00e8e1e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParseError: ClassTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 94-1195. The bar is 400 significant lines; this is 408 over it, 2.02\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":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab77eafc1069dd152971846693824af3c541aec780733e8e5fd78833ce02536"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::recheck::recheck_merge: FunctionTooLong \u2014 flow_services_inference::type_service::recheck::recheck_merge runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4fa7c4099aa840b9026952f7e298cd302a12ebb35f910ee642168f7561c1ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::default_resolve::default_resolve_touts: FunctionTooLong \u2014 flow_typing_flow_js::default_resolve::default_resolve_touts runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\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":"rust_port/crates/flow_typing_flow_js/src/default_resolve.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7b182d41e5da6af8dbfb0f6f9e7001a38b1a6dc456fba16ac705bf201a4ed6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_subst.rs: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 508 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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f221bbb8e6945e67cc4a7c7da444896407b34b5670e41b408dc6fe42929aaa6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/react_kit.rs: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 508 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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b635ff319e8ff4532634ef56b58bfed8f0fe560d78b15e5e27f18076492153"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_assignment_expression: MethodTooLong \u2014 visit_assignment_expression runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8fdac00851bbf98311427aae5ef9fb38b83d59232b641107775d8b5a9c9ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::convert_types::type_to_json_uncached: FunctionTooLong \u2014 flow_typing_utils::convert_types::type_to_json_uncached runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd0916eb8c48aa8383d4b5e5fcdc8f16c9cc5e5b3b5242079246e07caabe99"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefFinder: 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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"b099c15a962b084f94cb373a1436c4f271b2908fd8a651fc8ca3bb8681f792c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references: FunctionTooLong \u2014 flow_common_errors::error_utils::cli_output::print_code_frames_friendly_without_coalesced_references runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"43104cac24e76b7a4a5e40e4576206d7ac09e8aaebbd04a7c5868338b684d0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_ephemeral_command_for_standalone: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_ephemeral_command_for_standalone runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3567}}}],"partialFingerprints":{"codehealthFindingId/v1":"6187e4c571fdf3c138f4bf85870f4e3c291fcdf60efa43b8ef09e725fbc8618a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::op_assignment: FunctionTooLong \u2014 flow_typing_statement::statement::op_assignment runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12335}}}],"partialFingerprints":{"codehealthFindingId/v1":"473db61aa6520fb479d0fabadab0ec3a483c74ba7e9d0565b132bef549b55e07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FrozenMetadata: TooManyFields \u2014 60 stored fields. The bar is 30 stored fields; this is 30 over it, 2.00\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"089684c7043c24e6b8a6cfa9e5d9eb1cf4c219fdd97f8d3514f6f41ecc027117"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FlowJs: ClassTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 74 methods, 2 blocks, lines 234-1213. The bar is 400 significant lines; this is 398 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":"rust_port/crates/flow_typing_flow_js/src/flow_js.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"460152e36b70365ad2330a89826d767467932c09f9cd1c0f266f47fb3b2bcac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/lib.es5.js: FileTooLong \u2014 997 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 497 over it, 1.99\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":"lib/lib.es5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90db897d5a7da98e6c09a0b53b4bcdc08a6f525d4b3860b623699e85f4c596ab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UseVisitor: ClassTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 244-1438. The bar is 400 significant lines; this is 397 over it, 1.99\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"98db9f81856e2785dc7390519f8c0581ea52924c2d3032c71cb577e6cdc9b27a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::kit::run_conditional: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::kit::run_conditional runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a05e52d16819199e87feea35c7144d1403cb41418ab1c4091ecfa835b22fdcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::analyze: FunctionTooLong \u2014 flow_typing_utils::exhaustive::analyze runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9b8a972269b6676629d49ec861de61d4d13a0644038fbae3c1d2b28bf764ca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MatchLowerer: ClassTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 3 blocks, lines 102-1191. The bar is 400 significant lines; this is 389 over it, 1.97\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cd4378e74fafea28c83dbfb2c9ce8c96a41bb5398609144744e0a3eced7ebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_command_utils::connect_and_make_request_inner: FunctionTooLong \u2014 flow_command_utils::connect_and_make_request_inner runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"385e3531beaf058719df3f59eaa3f1776c713b9979208967ba1321425fd2ee27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.statement: MethodTooLong \u2014 statement runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d18397e3df20318f19b7651406b675eff85efe7fe63461e614f0c159f295d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::multi_arg_helpers::multiflow_args runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"61146bba1b334228039832572012cbcb8a25efc90e084890720463270aecbebc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env: FunctionTooLong \u2014 flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"909e4652548e569a933b007f1307b305ff77b9494d02b1d52cece7c2644d136e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/convert_types.rs: FileTooLong \u2014 983 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 483 over it, 1.97\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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03c1e0ed5a8d9b039d81ac104043654127c2797cbf2fe06cb54fce343efb402"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/module_info_analyzer.rs: FileTooLong \u2014 981 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 481 over it, 1.96\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c65c288ddcc93b06afcde3393b3e5d3422b0d4dfa018de9066b4cbd22ba1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::match_pattern::pattern_: FunctionTooLong \u2014 flow_typing_statement::match_pattern::pattern_ runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6c2af5d81d4f0fa8d161bd21bbc041897826e02d22b5fcd4aa36da31273c33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::object_: FunctionTooLong \u2014 flow_typing_statement::statement::object_ runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5942}}}],"partialFingerprints":{"codehealthFindingId/v1":"a863bf501d4a9423c758b80fea24912904e11d9fc1d3507f05d8b72aea4615eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Annot.map: MethodTooLong \u2014 map runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a47f1635fa7713feb6db230cfb8040718b0f894e352ba5639c7fed859cb0129"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseTInner.cmp: MethodTooLong \u2014 cmp runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec749f979d92577456d1f89bcbc58690618ede77de35a6164df043af217db3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/match_pattern_ir.rs: FileTooLong \u2014 971 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 471 over it, 1.94\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":"rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6734b95edfe49fb12ffcab6f50761c37cb435d05499e30b44a7d2a0bb0d818"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UseTInner: ClassTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 7 blocks, lines 3157-4094. The bar is 400 significant lines; this is 376 over it, 1.94\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"73930397a34b482f3960b0cd7abe32470289a479341e9bbea9c85f3e4e464ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_wasm::hermesParse: FunctionTooLong \u2014 flow_parser_wasm::hermesParse runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\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":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc67b8df8411b4745eca5e812fdd2b17f1b49f4ddec4eb4c1bfd7851968abd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Writer: TooManyMethods \u2014 58 methods, declared across 5 files: indented_printer/statements.rs (19), src/indented_printer.rs (16), indented_printer/expressions.rs (11), indented_printer/jsx.rs (8), \u002B1 more file(s). The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/indented_printer.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"873cfb33a7174d096f70b8c073cedb96eb869214101c5088f5740a73f1015277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flow_server_monitor_server.rs: FileTooLong \u2014 966 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 466 over it, 1.93\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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbad2a143631c5504857e28afad7786fc1e288ba120ddd372110775b543e7a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::annot_with_loc: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::annot_with_loc runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":7208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9253cf902da1cecfb50438a699982352e276da67b5b25ebc31f78213ae0a5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::interface_props: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::interface_props runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8483}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fb4562f8147a0c7474460f3956b74688f472fd12fc8e2f21fdaf34af28e17e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/template_literal_type.rs: FileTooLong \u2014 956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 456 over it, 1.91\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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d349d57b486e16e078a234dbb15358fa7c3b7a5ca6cc11214c566f3273158f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::maybe_special_unqualified_generic: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::maybe_special_unqualified_generic runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9366}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d4f6625d794efd239c4d3a8b63caa5d124e131df066e3d7651dc730d61ecd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_env::predicate_of_refinement: FunctionTooLong \u2014 flow_typing_utils::type_env::predicate_of_refinement runs 191 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6322586558381131bc264b88a3ef4e0164e8f661658f7f2922d4b529e14771"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_serializer.rs: FileTooLong \u2014 951 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: Serializer (162-1279). The bar is 500 significant lines; this is 451 over it, 1.90\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":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7adfe4ec481da3bde63400207f8dce79c12459343180b23198ff60b3567dcfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::value_to_type_reference_transform::run_on_concrete_type_with_env: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::value_to_type_reference_transform::run_on_concrete_type_with_env runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e0b6958ab2967587ee8b2cda5f565a7ceed4e94d21147193c4ad3812d44dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::unary: FunctionTooLong \u2014 flow_typing_statement::statement::unary runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10941}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0fbee4539c6196fd94b2face7100d57840816ccc34a31d6d9835914afae09a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Serializer.type_: MethodTooLong \u2014 type_ runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e37396258c18a494b894450d397536b8f835a81b23cefd70fa3ccf59b1ea3e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Transaction: ClassTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 138 methods, 4 blocks, lines 57-1805. The bar is 400 significant lines; this is 350 over it, 1.88\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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084cc44b409f919ec003efd160156a05f2efe0754444763c4d9346516daf2e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_mapper.rs: FileTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 437 over it, 1.87\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":"rust_port/crates/flow_lsp/src/lsp_mapper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433d90b5d149f2ad85df23ae85e3eed2f57e7e2b1f68c8abcd02eb9b696339f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autofix_imports.rs: FileTooLong \u2014 935 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 435 over it, 1.87\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":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f0747b5f4b4bd9c14d31e1fea3e516f47c67e6cae8582f2471a85580f7cd51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp_server::flow_lsp::try_connect: FunctionTooLong \u2014 flow_lsp_server::flow_lsp::try_connect runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eefbbcf96abfaa647e633551644787830473c49a255ce264822fd8eb94ea39c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::polymorphic_ast_mapper::statement: FunctionTooLong \u2014 flow_parser::polymorphic_ast_mapper::statement runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb24fd9f623c241bccd8aee15cedeef95925c5e0ebfeb1becb9690a107710b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/saved_state.rs: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_saved_state/src/saved_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"665463e6035364a85ceb480fde588bace1f3b35624f5874b276d4f303c9d9832"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/members.rs: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0425c8b8cea7f1610d08e32c81f49f3b53dedc02bbfe3bc7b08ada7a508e6e92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::ast_visitor::map_statement_default: FunctionTooLong \u2014 flow_parser::ast_visitor::map_statement_default runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccb77fb46455b33b69607389a2b3a303a89acabfe26a7650c940dde24e85a76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common::reason::code_desc_of_expression: FunctionTooLong \u2014 flow_common::reason::code_desc_of_expression runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5be56a05700400cfeae2711352ff84ff2f81ff65a78eeaeb9db27e9d64a70bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::declaration_parser::parse_function_params: FunctionTooLong \u2014 flow_parser::declaration_parser::parse_function_params runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ddbbcaf8a2a2d35e137fe17d1d7755962ac13b129c021c8e7de5f11df07c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::query_types::type_at_pos_type: FunctionTooLong \u2014 flow_typing::query_types::type_at_pos_type runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"rust_port/crates/flow_typing/src/query_types.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"292c3f6fdfd0d1521c220189db84c558c74d21d1ae04ff866cac24d522a1ee5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Serializer.serialize_class_body_element: MethodTooLong \u2014 serialize_class_body_element runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"99026cd531971e604761d1a27397b4e39d847902114d436e99b38e314ad2078e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::intermediate_error::post_process_errors: FunctionTooLong \u2014 flow_typing_errors::intermediate_error::post_process_errors runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"2969487e44270dc12f7a3284c1439c657fbc8a0b2eb573e6643d804f666efcc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::check_instantiation: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::check_instantiation runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f24fbc6c1ec4eeaadec54eaf80c2f8ae8103d9f7e066ce5acbc22a5c112e05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::sentinel_prop_test_generic: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::sentinel_prop_test_generic runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"639784f17bf3546442dc171aa7f30c2088678414c1ece9ee445b491e7fa6688c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_inference.rs: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 403 over it, 1.81\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":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702ede134bf725d13488f775196e09d80aea2be16e4b72b467b92b26793a1bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::check_conditional: FunctionTooLong \u2014 flow_typing::merge::check_conditional runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c5926370d124d889030c20c97562b06289edd061b672ec606df77d6ebfbb27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse_error.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: ParseError (2 blocks, 94-1195). The bar is 500 significant lines; this is 392 over it, 1.78\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":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b9fe48ca04cb1b6152c1d477dc5300b62a5c46ddca6dd69f8a5af730634539"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_visitor.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 392 over it, 1.78\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":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91635384b84f0db00328338cb5af05671749acc8a5864c42db687e8c2829d36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::funt_to_funt_check: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::funt_to_funt_check runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb875b49df8c79ef068631b8236fd6110c1f5d9adfe137342d874541573a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::try_method_bivariant: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::try_method_bivariant runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c38dd24cb7f96839f27b9b51850c4b5f0be00c3c3b9cba4e2f80e49a0bb59e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_env::recorded_declare_namespace_member_opt: FunctionTooLong \u2014 flow_typing_utils::type_env::recorded_declare_namespace_member_opt runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb38df6b970ce02e52a0792925392e7a99d7512bea45f29ee48f739a81804d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_parser_utils::ast_builder::expressions: TooManyFunctions \u2014 53 free functions. The bar is 30 free functions; this is 23 over it, 1.77\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":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29b1cca6138de1b30104bfd2935d446061312f720e4b52c27d34b0e9b081cd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::jsx_parser::element_with_optional_opening_less_than: FunctionTooLong \u2014 flow_parser::jsx_parser::element_with_optional_opening_less_than runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8d95bb8b2714243454fb4c64fc353ad450a3f9693b4efc00b38650769e2cbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::flow_ast_differ::statement: FunctionTooLong \u2014 flow_parser_utils::flow_ast_differ::statement runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"1785971309d713a8e248ffd79884e3b3216ee240b518117ba3dfc7a4516e7b18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeNormalizationHardcodedFixesMapper.on_union: MethodTooLong \u2014 on_union runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"888f4754cd87632288dc43620039b2e04830f996d8f26b427b7d69e726348608"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/insert_type.rs: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 375 over it, 1.75\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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b1f8666adfcd5500ec8119f1d89d5618cf6ecd8520dfdda656b1f09633d38e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: babel_adapter/match_lowering.rs: FileTooLong \u2014 872 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: MatchLowerer (3 blocks, 102-1191). The bar is 500 significant lines; this is 372 over it, 1.74\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4bc8e0e7c2dfac899d35dfca1874943ee49c3cca95a7fc42ff0396968416fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/profiling_js.rs: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 371 over it, 1.74\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":"rust_port/crates/flow_profiling/src/profiling_js.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37232dca65efc7eb892dad6511d5e61a41f76df0b1995131c7b6d22b9a7a2329"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::flow_ast_differ::type_: FunctionTooLong \u2014 flow_parser_utils::flow_ast_differ::type_ runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c23a44382646fd4394b000a3a88fcbd702907bdaa8dacca821ce8dbfeb4409"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::speculation_kit::long_path_speculative_matches: FunctionTooLong \u2014 flow_typing_flow_js::speculation_kit::long_path_speculative_matches runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbccf0b3961b7aed118cf1eeca32e217fc5734be7fed024bc2b4e08f0f0a790a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ComponentT: TooManyFields \u2014 52 stored fields. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72dee21517d03bc054ec21fe9b9fc14a9d9cc9bde77b1de484581f665213f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TransformRecordSyntax.mapRecordDeclaration: FunctionTooLong \u2014 mapRecordDeclaration runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"packages/flow-parser/oxidized-src/estree/TransformRecordSyntax.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dcc9f2765f0930d34252b38dda826ee554dfe5f33bde5d3ffe05752fcac5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::declaration_parser::parse_component_params: FunctionTooLong \u2014 flow_parser::declaration_parser::parse_component_params runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"37785e24d709c342b4fcb602f4489ba255e34899104e211fe45f784038331292"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_operation_utils::operators::check_eq: FunctionTooLong \u2014 flow_typing_utils::type_operation_utils::operators::check_eq runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f192ec14392d04f757f299ed0b4423798aa3ecac497afae17d55b8d7dfe9a674"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_operation_utils::perform_type_cast_with_env: FunctionTooLong \u2014 flow_typing_utils::type_operation_utils::perform_type_cast_with_env runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd811662df8ba1707aa017d573a7e35ceac61be6f84913c94a2e3bf13aa71566"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/constraint_helpers.rs: FileTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 363 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048977ef4d8160584fb558223ef269127e2c5e63c1e7a62d265b6787123105d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::scope::bind_interface: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::scope::bind_interface runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"71992236fcc77e399a39cc2163120d9786ad285406bc048e36654d9093886432"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::intermediate_error::mk_speculation_error: FunctionTooLong \u2014 flow_typing_errors::intermediate_error::mk_speculation_error runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce7bb86c8c33d62042f293b351d335ee93c01db53a7692d161a09eede13fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::create_computed_prop: FunctionTooLong \u2014 flow_typing_statement::statement::create_computed_prop runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afef03425b68c3d7ea0fd4d9220e7d9a191ba52779164cce4b941d654c3ecea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_ty::ty_printer::type_impl: FunctionTooLong \u2014 flow_common_ty::ty_printer::type_impl runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c019dcbdc48ba52234795ba5241817da729c9cf71629baf8bfac299019d2dfef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::match_pattern_parser::object_pattern: FunctionTooLong \u2014 flow_parser::match_pattern_parser::object_pattern runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e074f2a491ad3112234f69b12af1e29d2987726a0fd03f575d81fbf869b79f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_mark::mark_local_binding: FunctionTooLong \u2014 flow_type_sig::type_sig_mark::mark_local_binding runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3d84c6e936ac9f9d299e19eac3a7d49681b1c9846ba4c8db4a32d09eb8cd8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_exports: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_exports runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a0c28495549f2f9d948298a99d1e6254c4949f99daa611d811dd12eb508dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::helpers::perform_lookup_action: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::helpers::perform_lookup_action runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b07a1c90b2b9c2a3df11fa912b3fae560f8f7296c202382bcd3ccb67fbe806e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComponentLowerer: ClassTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 45-981. The bar is 400 significant lines; this is 275 over it, 1.69\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f3d50cefab23e40ac14d6b5261aa4d548370bbe262bf3375f6db4cd15fff2b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Annot: ClassTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 3 blocks, lines 2263-3110. The bar is 400 significant lines; this is 275 over it, 1.69\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1086a1b3c0309d1288bc7b93a0d312d9942bbc4195bd14ce679d77bbd70a92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_extraction_utils.rs: FileTooLong \u2014 843 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 343 over it, 1.69\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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befb564768428bcc4ba6ad94315d3cc6f11f16150cd5c3b0cb4b4a61be3acc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TokenKind.to_value: MethodTooLong \u2014 to_value runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d88272443818c5145ce480089d87c451328071550558c13a2eb2e6bbbb1eee5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::init_with_initial_state: FunctionTooLong \u2014 flow_services_inference::type_service::init_with_initial_state runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":2755}}}],"partialFingerprints":{"codehealthFindingId/v1":"8489a4dedc67d999b3b45bcd1002a72983782836a9a9b5719fee99e201a24f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_env::read_entry: FunctionTooLong \u2014 flow_typing_utils::type_env::read_entry runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239173de6192f918d22a6eab416b1a547d3976398bcd3a463d7edbfc4d6c562"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_ty::ty_debug::json_of_t_list: FunctionTooLong \u2014 flow_common_ty::ty_debug::json_of_t_list runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77deb53095cc4f0388016966fe02c5696702f171b55267b7690ead8396c7fa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autocomplete_service_js::autocomplete_member: FunctionTooLong \u2014 flow_services_autocomplete::autocomplete_service_js::autocomplete_member runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75ac4cd499a52aa184af53b4d159ae30ce4d7ca67e2758643139da4de25dca0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_typing_ty_normalizer::normalizer::type_converter: TooManyFunctions \u2014 50 free functions. The bar is 30 free functions; this is 20 over it, 1.67\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5597d2ac129ee733771f1c52f0dbfa86ace06cb7e8195ae8bd577602b32f0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::param: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::param runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11198}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ae2199586f54027a1f09bed4315deaa3f324cb339c42bf6d049c7a645d442"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::constraint_helpers::goto: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::constraint_helpers::goto runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c10f865b719c23227fe85104625e19c3f11d8a88a8bdec63d1a625cfc4b8d1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::binary: FunctionTooLong \u2014 flow_typing_statement::statement::binary runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11329}}}],"partialFingerprints":{"codehealthFindingId/v1":"678af45db51a6f4f127b2a24c811231942e6925243918924d9502991491b1e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_expression: MethodTooLong \u2014 visit_expression runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc2d6e8c1160ac5fb8d5acce508cfc291d716b950e2e441b4037b28b869398"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::ast_visitor::map_expression_default: FunctionTooLong \u2014 flow_parser::ast_visitor::map_expression_default runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e1f565626ea7f533e04223868e9f9ed21c09f0734672357506460d2a4ba18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Annot.hash: MethodTooLong \u2014 hash runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"427173593acf2aadfdcdc82f701a52038eb0c99bb00b864f8eac3a0b978dddee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::prop_exists_test_generic: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::prop_exists_test_generic runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2180e296559990414ef5014824473527d7cb5c5b50ef05f59f11826440774828"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::autocomplete_on_parsed: FunctionTooLong \u2014 flow_server_command_handler::command_handler::autocomplete_on_parsed runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcac89fd285ef0529ea66f9cc3452ed49bbce0600ff0c95233bb7ee1eb23df83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder::name_def::expression_is_definitely_synthesizable: FunctionTooLong \u2014 flow_env_builder::name_def::expression_is_definitely_synthesizable runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f3648050d96b63204773a039d70caa37affe0b0c17a95000c10945e481deeb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Serializer.serialize_match_pattern: MethodTooLong \u2014 serialize_match_pattern runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d6a6fb632e8a316da5f1be6337aa85278539903e290968ce2aaeaf099c6ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::import_named_t_kit::on_module_t_with_env runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e09eb79eca5d1cda86119e73b8ca777bd085e23ebeffbe4c18ab456a45ec23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::helpers::handle_frozen_tvar: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::helpers::handle_frozen_tvar runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fe4bc6ccd0782d0b6a0139fe399c538df32b8bee9155a8187166ec6a4b7430"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/property_assignment.rs: FileTooLong \u2014 813 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: PropertyAssignment (3 blocks, 116-945). The bar is 500 significant lines; this is 313 over it, 1.63\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"812511a173cf9c1d867d1f68a705b0f021e5207a645cf1bf004c6404a591affe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TransformContext.getTransformContext: FunctionTooLong \u2014 getTransformContext runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"packages/flow-transform/src/transform/TransformContext.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78e7829a1bf03b43dede2ca696a483e40ca90f1e4d475acb4fbd8785175dc72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::flow_ast_differ::match_pattern: FunctionTooLong \u2014 flow_parser_utils::flow_ast_differ::match_pattern runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc75a3c32b8df556b0b72b02b2096f11f46dcc6bac8d26241edf541c50d8784"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::init_from_scratch: FunctionTooLong \u2014 flow_services_inference::type_service::init_from_scratch runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3150}}}],"partialFingerprints":{"codehealthFindingId/v1":"622242cf023dbb56e3e03e8c4ed56974852340af8e49eefd73abccb070ed0fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::module_info_analyzer::mk_module_type: FunctionTooLong \u2014 flow_typing_statement::module_info_analyzer::mk_module_type runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"371891cf20e7ccef450ca91812bbd5b3a6112d173fb22d16d7b1abb7bab68694"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_util::ground_subtype: FunctionTooLong \u2014 flow_typing_type::type_util::ground_subtype runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d317db0aa4e32936f3a22ad882f0fe2b9562bfe8eb19e9f5fae1f340536dda5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::module_info_analyzer::export_specifiers: FunctionTooLong \u2014 flow_typing_statement::module_info_analyzer::export_specifiers runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a17075e712a80722f5c05183a260743b212bef558ccced298ff47659b48fbe2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::convert_types::json_of_destructor: FunctionTooLong \u2014 flow_typing_utils::convert_types::json_of_destructor runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77077d3324d32dda3bc5e053442e7b376ddbeb701a792293e4173b33a983b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp_server::flow_lsp::main_handle_error: FunctionTooLong \u2014 flow_lsp_server::flow_lsp::main_handle_error runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69852cab8a7e0895cf471bdb6c29844e64f7876e6159aaed90304096cf27d8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::error_message::map_loc_of_explanation: FunctionTooLong \u2014 flow_typing_errors::error_message::map_loc_of_explanation runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":4456}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eae29bf33403f8bd41a2eed70dbcc2db63ca2e06d05022f30ee48002a84e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_this_class_t: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_this_class_t runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e6cefacb0180261b9c60b8cf9ec5b8cac8d636669ba6400c3a99b41eb880f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::ast_command::main: FunctionTooLong \u2014 flow_cli_support::ast_command::main runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"667e2a1af79595708aa4d6e18918a8344e1728de6fe5ac39a0566dc328877390"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_command_utils::file_options: FunctionTooLong \u2014 flow_command_utils::file_options runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea1b9eeb0ce38ce3489c20a381bd05a03f3694d5368270d94d50aac720f6b69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mapper.map_match_pattern: MethodTooLong \u2014 map_match_pattern runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dac730c4418934c78c9287c531698d94b027d55eb0102538b26da0e14f8adb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/speculation_kit.rs: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 289 over it, 1.58\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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"661c730c9ee12986b48e6eddae25257b7914c91bb67b3e25d2fc2bf26225d623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm/fs-extra_v10.x.x.js: FileTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 288 over it, 1.58\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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8608e76d08c25d6522f9ebe517e63dc863a8f96e4b905457a5d1e59d3661914f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/get_def_utils.rs: FileTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 288 over it, 1.58\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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5825495f002b5561be03b96bf8aa1eb10e39ef8e995211910969dc76b768d4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codemod_command.rs: FileTooLong \u2014 787 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 287 over it, 1.57\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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903585b89558f9f99313f0622adc74fcea150724ac3e3972704b09447454f0a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DaemonizeArgs: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b18f00dba02cc1230ba02d3694ad1766b055dd78e6f0711076acccca830f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp::lsp_fmt::parse_lsp_request: FunctionTooLong \u2014 flow_lsp::lsp_fmt::parse_lsp_request runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be1d4749edf4817c14cecd8ad4c11d6c14f830541e81255287dd3ef33484f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::check_files_for_init: FunctionTooLong \u2014 flow_services_inference::type_service::check_files_for_init runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab57b04fda44cae98194bf484efcf48f9d47617fdc58515c129e15caafd0e18"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PropertyAssignment: ClassTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 116-945. The bar is 400 significant lines; this is 221 over it, 1.55\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5cbf26b7aa81e61757a437f9e89a9ca4892d7f37160e737df033a4b65a0a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_ty::ty_debug::dump_t: FunctionTooLong \u2014 flow_common_ty::ty_debug::dump_t runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a50ff488c646e966f854693a0dbb57f674f3823265c0de7e30ffe741f083b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.jsx_element: MethodTooLong \u2014 jsx_element runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6891}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c09c309ca67d4f79f42fa111f0a2073129c6a84573ce78ab9ead8d4d2ad8daa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.walk_to_eval: MethodTooLong \u2014 walk_to_eval runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18439ef1771eb80667adedf5df276971dfc5a6735973746dc57012ca5a05eed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::filter_values_by_patterns: FunctionTooLong \u2014 flow_typing_utils::exhaustive::filter_values_by_patterns runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8d9064c79a178ca5245214f4cc2ff98aa44f53339c4334fa8548e34b72172"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/natural_inference.rs: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 273 over it, 1.55\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":"rust_port/crates/flow_typing_flow_js/src/natural_inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f472ef053faea749477fcd0bf0c4e5c439406ef9115cfd031cc054dd7e9fce4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::mk_method_func_sig: FunctionTooLong \u2014 flow_typing_statement::type_annotation::mk_method_func_sig runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0e9ccdad410315e392e8a1d3e5425dc56a368d5d06fef24e165eeda20a3c55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::annotation_inference::object_kit_concrete: FunctionTooLong \u2014 flow_typing_utils::annotation_inference::object_kit_concrete runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":4049}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a0b6b27ab6b5df496095c19fa1a98edd4b48aaa2fb2d0bf71db0da60c6149a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/react.js: FileTooLong \u2014 768 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: React$CloneElement (354-1838). The bar is 500 significant lines; this is 268 over it, 1.54\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":"lib/react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0178e35c247d3612bb6f939afdad7f88f63e1ff81fae9cb44a828ea16f4f4c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/match_pattern_parser.rs: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 267 over it, 1.53\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fbc7e640192ca5a287cd4baa677425d4df57bf5ff6bcbf41277df17666815f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/find_documentation.rs: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 263 over it, 1.53\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":"rust_port/crates/flow_services_autocomplete/src/find_documentation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774efdb098db13b9663234498a1680c807b164b4b521017ce6867ac413a0a1a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TyEndoTy: ClassTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods. The bar is 400 significant lines; this is 210 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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83289785c260fac1355aee5965b7a6bb0805c4817c3729e77c2064be8f1b498"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.binding_type_identifier: MethodTooLong \u2014 binding_type_identifier runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8970}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23cafaa73bcf30d5c147f72709a32d04b2f07759535de656962cf597bfb2032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TokenKind.as_str: MethodTooLong \u2014 as_str runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cd97c1a16a4815672d1bf1d22489ec87022b11fc58704d5ad5c2897477be5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordLowerer.map_record_declaration: MethodTooLong \u2014 map_record_declaration runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f37828c46ff8e1d0516175346740c49f7584a51b183d777d148116746c0c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parsing::parsing_service::reducer: FunctionTooLong \u2014 flow_parsing::parsing_service::reducer runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f24023dc212e8edb8291dc82511cc600dde8b8f4e3c4990b3958f3ce2120e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_persistent_infer_type: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_persistent_infer_type runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4987}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e587e3cdf9975c836a6e1790179ea29c2d862082162b68981b0de301486348"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_visitors::type_mapper::def_type_default: FunctionTooLong \u2014 flow_typing_visitors::type_mapper::def_type_default runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba58c36fcf2369316784eeb340a93b1c3856afaf3139d87b2517aa92976ca7e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/heap_state.rs: FileTooLong \u2014 755 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 255 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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a759e597c2ea5ea2093c262863cd6eed5d08b2ea96996c1cb14445b7f002e52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::main_parser::check_for_duplicate_exports: FunctionTooLong \u2014 flow_parser::main_parser::check_for_duplicate_exports runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f495f0e38c97db6b8b8b678bf90df0d400adff595fb26cbc1b96a56458e587d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::get_prop_t_kit::read_obj_prop: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::get_prop_t_kit::read_obj_prop runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8010}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c9d5386c577e5680aa422fd281e3d95a193c5c843bf3e302e1a9b1bd6a2f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::any_helpers::any_propagated: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::any_helpers::any_propagated runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5317c68de8f68ce7b2880b84e81cb8de9ae339ed92fa9419d4c7773c4fe09fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/renders_kit.rs: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 254 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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cd29a0ad03328a7271b7954eef9d8988c38a767a733e06d897f0cf5b71cb2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SelectionRangeFinder: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 3 blocks, lines 26-892. The bar is 400 significant lines; this is 200 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":"rust_port/crates/flow_lsp_server/src/selection_range_provider.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0fdcf9064dd6cdb5fafa835483da6deed44a71a239ae95ee710b5cdbcbf70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::declaration_parser::parse_function: FunctionTooLong \u2014 flow_parser::declaration_parser::parse_function runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002532ea7a789e6f3296c3781f81d4f5e59a834dbad550243f462742a1c843f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchLowerer.analyze_pattern: MethodTooLong \u2014 analyze_pattern runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce77a47ebc4bbeb5718c883ef6ae188d61b13e46f87cc7554ef1519369b52b5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::cjs_extract_named_exports_t_kit::on_type: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::cjs_extract_named_exports_t_kit::on_type runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":6197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb9b892ead646824a926cab9fedbae939cab293ff19b4038dfecc6a12df6318"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::class_sig::elements: FunctionTooLong \u2014 flow_typing_statement::class_sig::elements runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"275efa1ed905519adafd5ab5e18dad922e4848961046df9f5f0d5881634a166a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WholeAstVisitor.visit_function_with_id: MethodTooLong \u2014 visit_function_with_id runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30e180a3de8cf59ac2a2fb5a3381cead28396f2c1891e15dea7a3a8284b3def"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_polarity.rs: FileTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 247 over it, 1.49\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":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a469d67424e0070dc3578d875981b203651bcd917386cb0a6e9c47b85bf538"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FunctionBase: ClassTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 196 over it, 1.49\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":"packages/flow-api-translator/src/utils/ts-estree-ast-types.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05833d1635a18ff22e38ae1e42ef0ee21948a27b1ce85853123374321863784"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::recheck_impl: FunctionTooLong \u2014 flow_services_inference::type_service::recheck_impl runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"997ca2d5c95a8aec8b86d800425311ac19e7be69839edb8147f85b169c6d7e08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/unification_helpers.rs: FileTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 244 over it, 1.49\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96863356bc767d1548c0db18a852d691517d61246297e0decb1c6cde05782d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::polymorphic_ast_mapper::expression: FunctionTooLong \u2014 flow_parser::polymorphic_ast_mapper::expression runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de4543ff78fbb705aff76707cc4b6ec561f5e6afe71d144e2683dfad27af5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::type_parser::tuple: FunctionTooLong \u2014 flow_parser::type_parser::tuple runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4cff0bc38d2be2db0ceb857e2641ba82de0aef700f49aac6f97239405069c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::class_sig::supertype: FunctionTooLong \u2014 flow_typing_statement::class_sig::supertype runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"11af06104bef42c265e3fdf31995f65bf57ebdf632ab1a8d14b0f8365e03ced3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ObjectExpressionAcc.add_computed: MethodTooLong \u2014 add_computed runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c187b78bc71ffb5bafbe8f9b5fbedd5dd25622d3dcaa22361e59dfe6850422"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::pattern_parser::parse_object: FunctionTooLong \u2014 flow_parser::pattern_parser::parse_object runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c081b50b43d25fbae03a25499cc8d20d555729c52443ac47122b048ed0ddf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_wasm::serializer::token_kind_to_estree_type_index: FunctionTooLong \u2014 flow_parser_wasm::serializer::token_kind_to_estree_type_index runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c4618ca3b9b7417ba61ac60a57e5d749cc649871d6783a2ea3be64930169fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_global_find_references: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_global_find_references runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5745}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc727fca62508f9852578b7e0e92c1e45aec608b980f5bf50a20cd911660c2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_inference::type_service::recheck: FunctionTooLong \u2014 flow_services_inference::type_service::recheck runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"d708cef63ff47aa01ee8f41067d3cb1b30e691f7ec06ae600351078c64d66eb8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Def.map: MethodTooLong \u2014 map runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"abefc39d5e551b8fa72742c8540c1a3ffe58e3b1291765d29bca49fb6bb4ebe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::declare_export_decl: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::declare_export_decl runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14243}}}],"partialFingerprints":{"codehealthFindingId/v1":"762be2842072264527e934beaab11f23e60b50b68324cfe7f1f6985d05230cea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::members::extract_members: FunctionTooLong \u2014 flow_typing_utils::members::extract_members runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aadb8fea2575c61b172f38ed864f5e695af275f36753cad38b013fdfa37f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_parser_utils::ast_builder::statements: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"791f8e0916b6d9526753ae8fb13b3547e72c1f4768b9f56684ce604afe66acd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoveNode.getRemovalParent: FunctionTooLong \u2014 getRemovalParent runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/mutations/RemoveNode.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff39319dde682a425f42a52ac363383a788cc866623065404d426bae2d333b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropsToIndexerContext.flow_props_to_indexer: MethodTooLong \u2014 flow_props_to_indexer runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db3ee0368552ef5dd4c2b290a9d4d4312a0dd88cd7d5a2f0b66e186bc743aad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: babel_adapter/component_lowering.rs: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: ComponentLowerer (3 blocks, 45-981). The bar is 500 significant lines; this is 229 over it, 1.46\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af8aa72459a2f7727167fd832156f572826a9b1045d24963170647b37c13c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/insert_type_imports.rs: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 229 over it, 1.46\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":"rust_port/crates/flow_services_code_action/src/insert_type_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1423e5b311e24df2d7bb97007435c1e2f35a42c5c905d2be6586d172e72d2f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/annotate_exports.rs: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: AnnotateExportsMapper (3 blocks, 238-1003). The bar is 500 significant lines; this is 226 over it, 1.45\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7fd4383d7d32b70142c00d2da45432bbf19101601be9096b97813537a5f903"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Substituter: ClassTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 450-1213. The bar is 400 significant lines; this is 180 over it, 1.45\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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"881ce40f4925e4e94e4833ec77abf1b349dd1bd1c30980c18605e8d702b92e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::autofix_imports::update_import: FunctionTooLong \u2014 flow_services_code_action::autofix_imports::update_import runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a486002bf2e6903b25042ecb61f6437b880027a881b54036c1414162b60f277"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parsing_service.rs: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 221 over it, 1.44\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":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace0f76bb1ba22441b51ac6033b65b0cb53c908f1bcc1f69ed9b988ec8f3873e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliCommand.from: MethodTooLong \u2014 from runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfada8d5a2b8ccc5df524c5003c39467265d9fa5c954c4fffe1ceb35a6d538b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CliCommand.into_server_command: MethodTooLong \u2014 into_server_command runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a551f8f6adc68deacb35cb4d2af028816e41507cef0199b00d6615e228138"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::exhaustive::value_union_builder::lookup_prop: FunctionTooLong \u2014 flow_typing_utils::exhaustive::value_union_builder::lookup_prop runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa436bdb8dbf96b18d3db6c208aa09fff54d470bf56b6edc1d4c2f99b3846aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::members::extract_type: FunctionTooLong \u2014 flow_typing_utils::members::extract_type runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9f14dad81c22374bc4f60f97c643d0eee4a10e138861e576d05ff9608e67c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/codegen.rs: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 218 over it, 1.44\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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"055c75c4f7c40f6dcefc5ce4ef22278820ec71d02fa31ec3cbb5963e60b75ca7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_of_name.rs: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 217 over it, 1.43\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":"rust_port/crates/flow_services_type_of_name/src/type_of_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fcbc6b05cea1b8ddcc90c07f342536b237da5af52485ce6e7d32b4f6925169"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::start_command::main: FunctionTooLong \u2014 flow_cli_support::start_command::main runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_cli/src/start_command.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed8a16a6895eff977502d81fe2df07d7dd0836aa2babc9e3dff3ec6300f945"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::flow_ast_differ::expression: FunctionTooLong \u2014 flow_parser_utils::flow_ast_differ::expression runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"121a179468619260c7d2530196066b34916e112a9c429b802724ebf9d258979a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_pack::pack_exports: FunctionTooLong \u2014 flow_type_sig::type_sig_pack::pack_exports runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee537c7b560bd18d5c4ffbf5246cbb8a269f7a343fd3d1a5abf0b31851800cd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::variable: FunctionTooLong \u2014 flow_typing_statement::statement::variable runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84129d69eaea80a2a998a73e89bd6e5ce6946a4be027dace2f85a82dd403fa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_return_annotation_inner: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_return_annotation_inner runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f49f6418ed54120c462faf5ec799e1f9f50ba7c27b83cc95bc47bc47fdbaca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseTInner.fmt: MethodTooLong \u2014 fmt runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3942}}}],"partialFingerprints":{"codehealthFindingId/v1":"360974e4d3697809ab73319769e4b813ca21dee000be98a57e1022582d0200bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: estree/TransformMatchSyntax.js: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 207 over it, 1.41\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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b78e28ab22ac07eba9f19d58cba556388dcd4e18f281ca1cc3558d549b223"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_config::flowconfig::opts::default_options: FunctionTooLong \u2014 flow_config::flowconfig::opts::default_options runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5436af09cdf3e75c3c4f78a78c9f37485b200db09d0b9972371343cf10a81f74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autocomplete_service_js::exports_of_module_ty: FunctionTooLong \u2014 flow_services_autocomplete::autocomplete_service_js::exports_of_module_ty runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9a8f1c12036be3a7702f56bff230b2417e56d430548d86e254a3ab6b9a3e62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_module::commit_modules: FunctionTooLong \u2014 flow_services_module::commit_modules runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a5787a02821fa38b84b717bda1aec2a68d123ce5f5efd27e50de620acedb34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::react_kit::get_config: FunctionTooLong \u2014 flow_typing_flow_js::react_kit::get_config runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"1340e195bd0b4adac711fe439a68ebf2c88b8636722b61c2d52064e49d2e506a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut: FunctionTooLong \u2014 flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20a2137be7f1ea6b482fb32f5f222ce23d8c5726293929e9ff9dc36d84fa699"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::mk_enum: FunctionTooLong \u2014 flow_typing_statement::statement::mk_enum runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":21799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5962466ca859c3d78d90af728266923347dc954bd6ac5f97ad743cb6df9dab14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_operation_utils::distribute_union_intersection::distribute_2: FunctionTooLong \u2014 flow_typing_utils::type_operation_utils::distribute_union_intersection::distribute_2 runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4513f1be0073ee8d91f3e8e18722ba66571b081032a7b6e4ac3cc0cb8114328"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: evals/run_swebench.py: FileTooLong \u2014 704 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 204 over it, 1.41\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":"evals/run_swebench.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d80da53d649428bf4a04513186c21b91c52c7f2b6a06ecf6e3e5df026b7425d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/match_pattern.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 203 over it, 1.41\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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b84e78e1f859ed5de0b78793fb82bfc870690198831d3d63ae1b61c0e9d43f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::refactor_extract::create_extracted_function: FunctionTooLong \u2014 flow_services_code_action::refactor_extract::create_extracted_function runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c6a37224b3cd00f19fc9dd2095795b94487ea77e96dfcffb718099346d16db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::variable_decl: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::variable_decl runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0d4c455a6b1982bfcbcecef0c20064619d6381f38cc2ef05e14f5b3017d45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: try-flow/TryFlow.js: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 198 over it, 1.40\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":"website/src/try-flow/TryFlow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f23ac0a5a40a9cc4437bfee8a2826eb215396b4cf004d18d67d83d162c308e7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScopeBuilder: ClassTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 1496-2287. The bar is 400 significant lines; this is 158 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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c470ec9908e2a6ed82e3cc17ba3a7e437dbbeda9d0345bea1ed8a79db60e7735"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnnotateExportsMapper: ClassTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 3 blocks, lines 238-1003. The bar is 400 significant lines; this is 156 over it, 1.39\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"feabc37ccee4b40618a0f6c2818ae2859e9ceab2f7784a5e1fa211416a2edf12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::check_contents_command::main: FunctionTooLong \u2014 flow_cli_support::check_contents_command::main runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed705aa4d80060fc6e488d8c13a19f9899337eb8ef319da9565d095535910739"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::react_kit::props_to_tout: FunctionTooLong \u2014 flow_typing_flow_js::react_kit::props_to_tout runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40fa99ac4ac8e6ef9277b3ba4610088c2d20b945a9a741646ec0f5c1b5265e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ObjectExpressionAcc.mk_object_from_spread_acc: MethodTooLong \u2014 mk_object_from_spread_acc runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55b5c6db295201ebb859f86fbd00ba2ec7d1b05dd578c8d2f012ac035314c1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/glean_schema.rs: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 194 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":"rust_port/crates/flow_cli/src/glean_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd0f617856cfaa20a396d6e9f9149b7f7c2d9fe3de17271a84ebb16f48b6b58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::refactor_extract::extract_from_expression_refactors: FunctionTooLong \u2014 flow_services_code_action::refactor_extract::extract_from_expression_refactors runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"205454720aaec6762c7cbd5379018286b75438a00c7cd8e214475cd59c92df25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::react_rules::downstream_effects: FunctionTooLong \u2014 flow_typing_statement::react_rules::downstream_effects runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b72a0d0c8681f5a54e72c07d3e7b8d5d824f1b6f4f77e424900831344e36c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/func_sig.rs: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 187 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"056ea446d8829576b0e53bb5b8dbb3722aa580b18e3b72bf34fe991a17c7885f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DeadCodeMarker: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 4 blocks, lines 12038-12783. The bar is 400 significant lines; this is 149 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5141656460511ace293a66874ee84cfc8b5c708395b14b2ee75a15ab1d27164"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::glean_runner::source_of_type_exports: FunctionTooLong \u2014 flow_cli_support::glean_runner::source_of_type_exports runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35bd2e334633b76fadab437eea58f87368c4741e5704b3f033b45493d4542df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_monitor::socket_acceptor::perform_handshake_and_get_client_handshake: FunctionTooLong \u2014 flow_server_monitor::socket_acceptor::perform_handshake_and_get_client_handshake runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"rust_port/crates/flow_server_monitor/src/socket_acceptor.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6da61d0e0780e34b1aca08fd5c332622bc5f75983e3578fa72b0f85cf54fa89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::type_inference::initialize_env_with_mode: FunctionTooLong \u2014 flow_typing::type_inference::initialize_env_with_mode runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b7b2f06a5cdd63ace605c33114ebd047ba9e4cf9023a38536e354e930179fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::string_case_transform::resolve: FunctionTooLong \u2014 flow_typing_flow_common::string_case_transform::resolve runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3686cf0b275a0444245a8df4db8f5a9157548c02b84a732c7a3f37049fe83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Substituter.destructor: MethodTooLong \u2014 destructor runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"706388de83ad52772c77dffd0e6793e15357b654f3132b32094a00c6affe68db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeVisitor: 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":"packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46c59b1be41a2dc81a94540bb36b6c89f46e65ad947d4a83df7fae8c9b9b01e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parsing_heaps.rs: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: Transaction (47-937). 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":"rust_port/crates/flow_heap/src/parsing_heaps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2863ed843d917a251e90d265ce348ed4e72ca927fbf650a0c47b4c69660d1a6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HintDecomposition.map: MethodTooLong \u2014 map runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"rust_port/crates/flow_common/src/hint.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"76927121bfd256bda2112b1ff1f8350198c6ba2a81473d4ac90c858795f06dab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::check_assert_operator: FunctionTooLong \u2014 flow_typing::merge::check_assert_operator runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"077f29363587ab0791303627d8bc401b19d61afd99a225e666b1a70dc5757cda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::funt_to_funt_check_params_bivariant: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::funt_to_funt_check_params_bivariant runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd745525f93202d33d68c91b8ffe063752df3677bbbc400a0b8fb83865ba47e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::react_jsx_desugar: FunctionTooLong \u2014 flow_typing_statement::statement::react_jsx_desugar runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71024c7f9f2bdc2cda27b864a85454ef0fd72fe692fe3aea0b3f1a8bf24ebd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_service.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbe59c788b6291f3bb88e60107fdc4e7d2ec7e7b1220c64b3b9250d2e874182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/env_api.rs: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 176 over it, 1.35\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":"rust_port/crates/flow_env_builder/src/env_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"310c99a8ab0b82a42d5172b840f9a7856d78e32ef8f6be44858f4581de207fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimpleTypedTwoPassRunner.merge_and_check: MethodTooLong \u2014 merge_and_check runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d997651b704ae63b3ee52a1755c9ff421b95ac5f691a361c6d33eada57b5fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::type_parser::param_list_or_type: FunctionTooLong \u2014 flow_parser::type_parser::param_list_or_type runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"adabdae4754c3c1d2161ed0f370ab92e7725a0a41e9d97e02a149c8a26146902"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::live_diagnostics_of_uri: FunctionTooLong \u2014 flow_server_command_handler::command_handler::live_diagnostics_of_uri runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6941}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d24ff55dbb71b055576194d05bd141215781db9189a2a3287aebe4631f505"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_monitor::flow_server_monitor::internal_start: FunctionTooLong \u2014 flow_server_monitor::flow_server_monitor::internal_start runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1138ae5e4ba9931fe69273f10b6f128ebdde57981ffceec49c60ad813b52c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_converter::inline_interface: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_converter::inline_interface runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ecca44589565976267aea78be2061d80c22df2697c1c8a026d4c38f9aeea0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseTInner.hash: MethodTooLong \u2014 hash runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c418fa6663b6f2dbd5680452810e51f0484f5b5cecb079acddec5bd1531ab4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TransformMatchSyntax.analyzePattern: FunctionTooLong \u2014 analyzePattern runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7331b8e193be5c0b055d766937c11912d7f0faa327027efb9492463eabfbee39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::polymorphic_ast_mapper::type_: FunctionTooLong \u2014 flow_parser::polymorphic_ast_mapper::type_ runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6848}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3396db366f96c8073a4854bf36d8723539e958ddcd9fa61526c89281c83673"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::optional_chain_kit::run_on_concretized: FunctionTooLong \u2014 flow_typing_flow_js::optional_chain_kit::run_on_concretized runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"rust_port/crates/flow_typing_flow_js/src/optional_chain_kit.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a505b3ff8ab7e04ef6d040f4aaa093ec816b78d48cb7748fed897493b812dea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::declare_variable: FunctionTooLong \u2014 flow_typing_statement::statement::declare_variable runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4792}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b619748e65776f756fdefc51ca9cc623ce6ee1f1f2e23b8337d6eff145126"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::infer_type: FunctionTooLong \u2014 flow_server_command_handler::command_handler::infer_type runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03922397fb151a5a37f0aee938ea0d0c2214b847b5d49b18fa0ede9b6ee7417"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Checker.check_file: MethodTooLong \u2014 check_file runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67a6126a7dc6cfe8c3bc3a8fe1765f82aca0c6354ecdd0aaba447df548afd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder::name_def::match_pattern::visit_pattern: FunctionTooLong \u2014 flow_env_builder::name_def::match_pattern::visit_pattern runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7789d8e9d9e96c8b58b29841e47702b6a73ecf008792229c0d71d6df6b1d4db6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp_server::flow_lsp::main_handle_unsafe: FunctionTooLong \u2014 flow_lsp_server::flow_lsp::main_handle_unsafe runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21fea17942ae9700ee70c6ed1f93d7b014db6ff3838141a3b5aa3c5d08d9569"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autocomplete_service_js::autocomplete_unqualified_type: FunctionTooLong \u2014 flow_services_autocomplete::autocomplete_service_js::autocomplete_unqualified_type runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c988a1f0aa369a99c6c6098af086b57c3c8420a5ef356913759e95963d7f16f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::object_kit::compute_name_remap: FunctionTooLong \u2014 flow_typing_flow_js::object_kit::compute_name_remap runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c459ed2ea88d60f1ebf6e12a688d49773195ed969a8c57f0bc84fe0821b0b154"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::ls_command::main_impl: FunctionTooLong \u2014 flow_cli_support::ls_command::main_impl runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"195c575757b4704992b7fd67710833b10baa2b2aa7c6f94e33e42506a71cd058"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::json_of_autocomplete_result: FunctionTooLong \u2014 flow_server_command_handler::command_handler::json_of_autocomplete_result runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"11211a0fa6d39467b540747390743028aafccc2af54456128517a2563e8974b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_module::haste::resolve_import: FunctionTooLong \u2014 flow_services_module::haste::resolve_import runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db387cf121bf936c52d40d9232827ecf4bd737239f516c3fb07c4869269828e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/type_sig_mark.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 151 over it, 1.30\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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4da94afa07ea851a160f57a12d7517de259e9e8a761d99b17041b3cd6ecac9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UseVisitor: 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4b3c103d64c50b6c4292ae3c540485f9847c8cf6c17418d30d7278a22398fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeCache: 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":"rust_port/crates/flow_typing_loc_env/src/node_cache.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c8ff40434937758896baf963c80c316f73316641aec4baf278683c073e2f88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyEndoTy.default_on_t: MethodTooLong \u2014 default_on_t runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a00e3c7161f878813ef3959094d6022edefcca9ea2da4bde871defc9fa6863"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder::name_def::obj_properties_synthesizable: FunctionTooLong \u2014 flow_env_builder::name_def::obj_properties_synthesizable runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"22052ced2d752aa1851970f3e170b3e668194306246d30dbe3cbb0103dd25837"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.variable_declarator: MethodTooLong \u2014 variable_declarator runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9752}}}],"partialFingerprints":{"codehealthFindingId/v1":"36167e2178a17ad68716f87d2a739f5cd9bc50f6a758e39c39135bdf1bfa8731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signature_help.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 145 over it, 1.29\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":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be118ac199305c68a304e20c35ec617fd787d48048875954fcbbdc7e90af630b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Message: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 116 over it, 1.29\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":"rust_port/crates/flow_typing_errors/src/intermediate_error_types.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7fe8273fa7bdce183dd47a3644c9d41f1b562b0225525091affb6e98b0c14b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_lsp_server::lsp_interaction::trigger_of_lsp_msg: FunctionTooLong \u2014 flow_lsp_server::lsp_interaction::trigger_of_lsp_msg runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"rust_port/crates/flow_lsp_server/src/lsp_interaction.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dc2cf3627727c95eaf2d934f7313f0ae4b481c829993fad2d4269d05c65166"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::declare_export_declaration: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::declare_export_declaration runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"52614e9aff02184f024199f2a4bbd37bd6f7ea827f7341212f5bb53717271ddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: referencer/Referencer.js: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: Referencer (137-1085). The bar is 500 significant lines; this is 144 over it, 1.29\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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4394afe45036ba56aa0fdbc4154092a3b0dcbbff5dcc681e629d777ae91745"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/selection_range_provider.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: SelectionRangeFinder (3 blocks, 26-892). The bar is 500 significant lines; this is 142 over it, 1.28\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":"rust_port/crates/flow_lsp_server/src/selection_range_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faecba067cff58bd55ca81e6ad3ab2d8635fb982239fa275acea60f09e403f20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/persistent_connection.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 140 over it, 1.28\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":"rust_port/crates/flow_server_env/src/persistent_connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3f5779ea6c287f5cfc0740ec13e658640341a5f0f92be488f9245c6ddde68a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator: FunctionTooLong \u2014 flow_parser::parser_env::peek::comma_trailing_comments_after_current_if_line_terminator runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"62aa23dd536e390cf65c37af5ee84f3c2dcd67a0ca33bf9c43d0c681087b5f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autocomplete_service_js::autocomplete_id: FunctionTooLong \u2014 flow_services_autocomplete::autocomplete_service_js::autocomplete_id runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e4d3fb4b569582fc19958d7bada2a17e0cc771017960be86ee88aba77cba97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::find_documentation::replace_comments_of_statement: FunctionTooLong \u2014 flow_services_autocomplete::find_documentation::replace_comments_of_statement runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"rust_port/crates/flow_services_autocomplete/src/find_documentation.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400c7fcee041f3201646ba01d30e1e968d154555972d3189eef9428ee510948"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TokenKind: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 118-667. The bar is 400 significant lines; this is 109 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":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2be4a105d15fa12190c13bd57586a82c2161422494db5bf3d42aeb02810be29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.assignment: MethodTooLong \u2014 assignment runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03285a4613d70cb351f5b193c644855e2bef157aaa5b8d0b41fb7d7742d7a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_wasm::position::compute_positions: FunctionTooLong \u2014 flow_parser_wasm::position::compute_positions runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"rust_port/crates/flow_parser_wasm/src/position.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bdd821955cba2bdbb99487342aeb11cdde44d4263969fbb4e7783b866883b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::function_def_helper: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::function_def_helper runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3487bdc5105a4e4b47eeda479e28cc84387ecc6d696d5141de4bc40653e0ea13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::mk_type_param_inner: FunctionTooLong \u2014 flow_typing_statement::type_annotation::mk_type_param_inner runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a42969fc21837873bd1226ff66023633bc24dddba0f5155ea3d14bc60f7bbff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::flow_ast_differ::list_diff: FunctionTooLong \u2014 flow_parser_utils::flow_ast_differ::list_diff runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"568966920880af95915a522bbe3865c4d8e0a994f478bf0d28c50e45032c7fd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::refactor_extract::create_extracted_function_call: FunctionTooLong \u2014 flow_services_code_action::refactor_extract::create_extracted_function_call runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d3a3f786d453f7062f283d89f6338ba4397dab5b35d4584c19a4b246d9679c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::refactor_extract_utils::type_synthesizer::create_type_synthesizer_with_import_adder: FunctionTooLong \u2014 flow_services_code_action::refactor_extract_utils::type_synthesizer::create_type_synthesizer_with_import_adder runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"517d66a5eb1d495b4dedbd15f978f98213f42a8857ea0917053b859cfab6a1e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_ty::ty_printer::type_object_property: FunctionTooLong \u2014 flow_common_ty::ty_printer::type_object_property runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41fc3bd25c0fe67128cb1a0dfac78f1255854477ebb0c59aadd209a9816708b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::autofix_imports::update_import: FunctionTooLong \u2014 flow_services_autocomplete::autofix_imports::update_import runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a1ec48b644610b5ff0fbdd94f1c3f6fe87115f9cdc176f14488c7c18d80f80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::class_sig::collect_inherited_members_both_sides: FunctionTooLong \u2014 flow_typing_statement::class_sig::collect_inherited_members_both_sides runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10221ed288f16d0ae02a7cda6da72465bdd89459cd45b0d9ad38755d43da497"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::logical: FunctionTooLong \u2014 flow_typing_statement::statement::logical runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae06a278bf0022f34885a550fa244a10fa5fd92bd4dc0be7875a098e3e6f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: estree/TransformComponentSyntax.js: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b062b4e942202c46f3153659d0b350481c2698da0c8f3d05884fd456ad9c21d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_object_expression: MethodTooLong \u2014 visit_object_expression runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec69977414ec91751e6aed51ea15d61127aa9876adf154ee0a4cafb6f8cb0892"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalizeTypeLocAndCommentMapper.with_none_loc: MethodTooLong \u2014 with_none_loc runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rust_port/crates/flow_services_code_action/src/autofix_renders_variant.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb5b931531c15aa8658ad670405af3eb194400cf454f69f8a3691fa20fe2e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::renders_kit::non_renders_to_renders: FunctionTooLong \u2014 flow_typing_flow_js::renders_kit::non_renders_to_renders runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"792377ffdd9ca2b2ad2fad7f7fc3d6e03edc96dc9007905faa6838bfa6a8001e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::react_rules::hook_callee: FunctionTooLong \u2014 flow_typing_statement::react_rules::hook_callee runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"91353c5c15d82d9bc43a407fef47c7f0fbc237fb8f722c92358faab49bebf331"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::mk_component: FunctionTooLong \u2014 flow_typing_statement::type_annotation::mk_component runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8710}}}],"partialFingerprints":{"codehealthFindingId/v1":"67412a769b5d5beb678e13be28b332565f9061815ce603a12847622a625ec935"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language-js/comments.js: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 117 over it, 1.23\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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e910b905ba66acfb54a15247c43cfb4646eb0ca5f122de6752b9f72f806eda1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EnvTransaction: 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":"rust_port/crates/flow_server_env/src/server_env.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"445d4d50a303a7cb43541691fb52de40a644429f29d4b62b7079be5d305c8f39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComponentLowerer.map_statement_list_inner: MethodTooLong \u2014 map_statement_list_inner runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4b618e8db3965ab72ff956ebfed31176c858b7900541b790aea5002e25d782"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::walk::pin: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::walk::pin runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":7077}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf8de2fa7271d3f940648cbd881ba83dcc9b014cafc91281c5e4fbd2e1af473"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::code_action_service::code_actions_of_errors: FunctionTooLong \u2014 flow_services_code_action::code_action_service::code_actions_of_errors runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"06323a6f30bdb7bd7f657be84d242570b11e83581ac25d720cdd65caa444fb13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_util::mod_reason_of_t: FunctionTooLong \u2014 flow_typing_type::type_util::mod_reason_of_t runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51be6341dd2c9affbcff700c2597b8342af3dfbcbf0af8b9f79d523f4011598"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_interface_extends: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_interface_extends runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f41eac598cf2828891193c5f4a6163997ada47a666eb6e17c720b228beffa2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jsx_parser.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 109 over it, 1.22\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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f40d3889caaefd45772f2018158c6ae11c0f93c3342b2fb3a5e64bd7fd179c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::object_property: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::object_property runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82437a027334d0c5d2e56b441a4192814c3ac6a91ae2fd45b6d6225b0428dfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::find_code_actions: FunctionTooLong \u2014 flow_server_command_handler::command_handler::find_code_actions runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7586720279ff45c60a0061aaee6b4673ef64005a3f00ebb5c05c6a5cfcb7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_env::server_monitor_listener_state::recheck_fetch: FunctionTooLong \u2014 flow_server_env::server_monitor_listener_state::recheck_fetch runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c8cc2fcd11dbb859e51f47badbcc804cc901043ea4f07465cbb8b9b38e4f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_monitor::flow_server_monitor_server::keep_alive_loop::wait_for_server_to_die: FunctionTooLong \u2014 flow_server_monitor::flow_server_monitor_server::keep_alive_loop::wait_for_server_to_die runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"384e482345770fbcc4bca60058726d0e2a746d4d1c9298f2d8df37712622d79b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::stub_unbound_name::stub: FunctionTooLong \u2014 flow_services_code_action::stub_unbound_name::stub runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/stub_unbound_name.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b806e1adb472fcf8bb7978c0eff211e09ad242d3036a31b6d1754af09b98e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query_types.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\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":"rust_port/crates/flow_typing/src/query_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e8014300b4e5a1288bfbbfb0e8e1c346983703241b495458c40917f57bf836"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SsaBuilder: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3215434e851ffefdeeb4f5e066903b6003a3db32f8860ed604718d83b0f7a435"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm/memfs_v3.4.x.js: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09d47791bb2bf0a0a5eb6533d95721a6e702c57e7d8921f4e01dd3e4daf5596"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_analysis::property_assignment::eval_property_assignment: FunctionTooLong \u2014 flow_analysis::property_assignment::eval_property_assignment runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfce0dc16c2f77e546126b648d132165f0eef64d4ad43c2a9886c20cf9df09c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_call_expression: MethodTooLong \u2014 visit_call_expression runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae13bb2ce07fa9ecbd6bcef9882469241abe353cf72ac6150a54c208e7ddf5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.walk_to_union: MethodTooLong \u2014 walk_to_union runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3799ba09a042c7e2d8a922f96e7f808cdd7a3df2540158ffc8103990ce8aca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_typeof: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_typeof runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4134}}}],"partialFingerprints":{"codehealthFindingId/v1":"992b43030d9998d69ee5c3c2b1cdd2cec5f697e4dc85e827e7784cfd8ed5f0f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_tuple_element: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_tuple_element runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"565dbfa28c43f2b22c53afaa0f0328e54b5e39a5354191b264312c4a158fd873"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TrailingCommentsRemover: ClassTooLong \u2014 477 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 24-653. The bar is 400 significant lines; this is 77 over it, 1.19\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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad29d14d55afb5365d7ce24eacd5a67f529f94e59ca61b9e785adeb34d5f10c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.binding_pattern_track_object_destructuring: MethodTooLong \u2014 binding_pattern_track_object_destructuring runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40b67894621b02f335e1fad75fbf28a41071f759536a58cfd4e1c59cf3cf996"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_monitor_rpc::server_prot::request::to_string: FunctionTooLong \u2014 flow_monitor_rpc::server_prot::request::to_string runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_monitor_rpc/src/server_prot.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"419c1412396bf4aa95d90ea92a91a64581f412478e2fc4b931399588c3876a35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteConverter.type_: MethodTooLong \u2014 type_ runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_services_code_action/src/insert_type_imports.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088e3019b9f0943de91ed52afeaafc423189129f9d56112d425e8907956c298"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::assignment: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::assignment runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14651}}}],"partialFingerprints":{"codehealthFindingId/v1":"efecece2cc9f66341cb47f78d5a815fca47d21b3af271ddc211a7c1083fe3407"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::flow_arith: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::flow_arith runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a342e1d53ac2afc6d0c21ed07fd1b6db8458ce625d6c071953dc10f125299203"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_filter::sentinel_refinement: FunctionTooLong \u2014 flow_typing_utils::type_filter::sentinel_refinement runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1115556002fac6bb525792e4c523c4460e18d239e1f5307b38cdd8da5355e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParserEnv: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 82 methods, 3 blocks, lines 373-2581. The bar is 400 significant lines; this is 75 over it, 1.19\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf7c0699a3e01c74fdc264293f8bcd67a6afaf9efb262e75273c5967e37e410"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_sig.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: RequiresCalculator (3 blocks, 331-897). The bar is 500 significant lines; this is 90 over it, 1.18\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":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb65c8a2584c3a611f7f0b58e7d92f3e36e87a8c0ea9788cc9c668496a552b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common::files::make_next_files: FunctionTooLong \u2014 flow_common::files::make_next_files runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4962748f1da67e628998bb5708e78efd735d2e3e97bdee491c32447027d605c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_common_errors::error_utils::cli_output::layout_references: FunctionTooLong \u2014 flow_common_errors::error_utils::cli_output::layout_references runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee10cc122e7dcc16730d70866b92a9cb361104857fe27fdf87ae08438abb343"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::estree_translator::match_pattern: FunctionTooLong \u2014 flow_parser::estree_translator::match_pattern runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62adafc9e6e425abbd52c418983f63900153cae293ffc4de9b3671cbd3e3735"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::ast_builder::statements::synthesized_component_declaration: FunctionTooLong \u2014 flow_parser_utils::ast_builder::statements::synthesized_component_declaration runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a727b8feee32f217a5df361cc0f2ad3de19027024fa8de20b46dd485fd34e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::check_multiplatform_conformance: FunctionTooLong \u2014 flow_typing::merge::check_multiplatform_conformance runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c14ad3cca6e621697b2c5c226a0c3ba8e1fdc2d8587b712553e9c3847942777"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_errors::intermediate_error::flip_frame: FunctionTooLong \u2014 flow_typing_errors::intermediate_error::flip_frame runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d5bbe30c284d43383200a15cb22a5f05c4f5872da26a05c8d781abcf2c229f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_collator.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 88 over it, 1.18\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":"rust_port/crates/flow_server_env/src/error_collator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46288c9010bc2eaef1864191b7641a1b4d0629edbd1e02e5ae9653378ff5454f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/inheritance_helpers.rs: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 87 over it, 1.17\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6149327ae53ede7262af1b4d392e61d2be37d6d77e01666b0222081ac5221f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autofix_imports.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 85 over it, 1.17\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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ccb2c6dd131d23a8aa862ff7cedf76dd21faa80364cf6f0847bfd6033a29cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_analysis::scope_builder::lambda: FunctionTooLong \u2014 flow_analysis::scope_builder::lambda runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c241b4170bb9a7f0bfa3881d3f938c135cd9ed6e3dd2fdede393de85075d959"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypedRunnerWithPrepass.merge_and_check: MethodTooLong \u2014 merge_and_check runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d500a8659ac76a779191f4d9113cd3b1c9135b123e5d4e020cbefa60bbe0d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyIter2Ty.on_t: MethodTooLong \u2014 on_t runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cb82289e720714d29e1209ed288f2753f410f23d54c01ee0cfc0dd4219f9e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::refactor_extract::available_refactors_for_statements: FunctionTooLong \u2014 flow_services_code_action::refactor_extract::available_refactors_for_statements runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa3f4277052225eb50292d227adad1991b7b6d6555c7cf09336cb6f08badecf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.walk_from_eval: MethodTooLong \u2014 walk_from_eval runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":5333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b554df031265f05bbadcbff23da57f479b92fa9ee7304b9dd1cbf014eb1fe605"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::convert_types::def_t_to_json: FunctionTooLong \u2014 flow_typing_utils::convert_types::def_t_to_json runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"904bc38f57301168d4116b62d3a245c05d2487eb182a956da11f487b0a745d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Array: 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":"lib/lib.es5.js"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6f4423c2f5f2710e32c3aee1a1c350ece97f7351ac370cfea91574ecc8afde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Serializer: 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":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"de587d9d5b4ebb92bf3c2fa3146414080c7e9ac5472d10c0da5fc4ff2ad9d6fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_conditional_type_targs: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::instantiation_solver::solve_conditional_type_targs runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ffd9bc63192c38ef18f842be1b0be8328a65d683f62b92c52b550f28c26e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HoisterBase: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 40-701. The bar is 400 significant lines; this is 61 over it, 1.15\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":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f35356674fb775a56706b2646d33feef67fbe49d0019a033342b136283c0399"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FlowParser.parse: FunctionTooLong \u2014 parse 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c9986dc4130994cb61c0691515ac5b264a8bc8fa59a6155dd831d776e1955f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::scope::bind_declare_class: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::scope::bind_declare_class runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dcbba30c616f78fb1adbf5b2fd5331b010c32cdd7250a37cef13d640fbde3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::get_prop_helpers::write_obj_prop: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::get_prop_helpers::write_obj_prop runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd1c49e820136fda609e87e11d620393f6898c416fdcdc43f806b90172ddacd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::convert_qualification_with_lookup_mode: FunctionTooLong \u2014 flow_typing_statement::type_annotation::convert_qualification_with_lookup_mode runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3983}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e288b71cc149761f88ccd7d2bc205bd3413a48c041b4e59c6c229bd0927f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: TokenKind (2 blocks, 118-667). The bar is 500 significant lines; this is 73 over it, 1.15\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":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa715c70996aa50160e22aba0a29771085b4d68f14f8a932e7e4d742ad928178"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::glean_runner::type_import_declarations: FunctionTooLong \u2014 flow_cli_support::glean_runner::type_import_declarations runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdf7b6daa3720fe94403fe8c4a81ac11bdcf9a31ddf6b86158f334b7dc7534d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser::ast_utils::acceptable_statement_in_declaration_context: FunctionTooLong \u2014 flow_parser::ast_utils::acceptable_statement_in_declaration_context runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"7203f3449d22ec93d5f56ce39dc5d29af88ef1763f517f3ce402088dbf41ac2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_persistent_signaturehelp_lsp: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_persistent_signaturehelp_lsp runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e26aebe6a8eda2db8ab2feec2a4c6ae89156d40c76cec74ab6d06d708aa8d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_utils::parse_and_pack_targets: FunctionTooLong \u2014 flow_type_sig::type_sig_utils::parse_and_pack_targets runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"rust_port/crates/flow_type_sig/src/type_sig_utils.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8a83a7c4a62dc2cdc0b368ea59c0157f81fd1af9442deb6162d4420b4337c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::type_alias: FunctionTooLong \u2014 flow_typing_statement::statement::type_alias runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0714520c98e6096cf744f5cbfc0ef24404645f221ecb8b40a391d05abdbbfcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_aloc/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"323fb2f02d7815e832b150ca0b8b4503a87e54b5a8cc132889a0756e35d291d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_type_sig::type_sig_parse::scope::type_param_renaming: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdab1ef1589b7a34ff049f6830c120195915e91bb0b151645ed560fdb0378e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FlowJsEnv: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js_env/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ec1698335d9b36c567a94a555ccd939990a3700cfc9a2aa8b0df8c4092bb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyEndoTy.default_on_decl: MethodTooLong \u2014 default_on_decl runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3affce2c90f1486e827fbea877813ec8b207f3b51eacd8541ec2a9a87abed1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::inlay_hint: FunctionTooLong \u2014 flow_server_command_handler::command_handler::inlay_hint runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"1265a2e21e89ad1c2737d49829f1c6eb18fec19abeb950997025f63946bef9be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_rechecker::rechecker::recheck_single_attempt: FunctionTooLong \u2014 flow_server_rechecker::rechecker::recheck_single_attempt runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_server_rechecker/src/rechecker.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a0da09fd1c8069dc9bdf0e1fbd89f2a9382826d92d14c5fe88f1ac88cead6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_type_info::signature_help::find_signatures: FunctionTooLong \u2014 flow_services_type_info::signature_help::find_signatures runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"061016f2fffcb88bcb97bfa13f99a80d74bda6839902b4c8ed1f8068281c828b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::check_strict_comparison: FunctionTooLong \u2014 flow_typing::merge::check_strict_comparison runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f43148ad52b28aed34ed46e93520622d2f86cc901aafaf93e8f356983b04f14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UseTInner.eq: MethodTooLong \u2014 eq runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e07fbe35cf107f5710d25abf7545efe560b4e259fd810b46cfc8091b1df2a77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_targeted_module_impl: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_targeted_module_impl runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d3e445f6eb87d3ac980987072d80d0aa4d8d2bf660e3880492535f56b2f4b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_visitors::type_mapper::predicate_default: FunctionTooLong \u2014 flow_typing_visitors::type_mapper::predicate_default runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"499df8e7108db1cf057c82a9a49d4bd1baa8a1bd254acd08015a6cbbec6e744b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ty.map_locs: MethodTooLong \u2014 map_locs runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b8072fb8ae535f17992d57788a0a8974f0ae47651af3146b0f9177443ce16b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_autocomplete::lsp_import_edits::node_path: FunctionTooLong \u2014 flow_services_autocomplete::lsp_import_edits::node_path runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_services_autocomplete/src/lsp_import_edits.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"566482b215b2c8759824023983232cd15d7271b7a198d7a12ccbe88b11d5060a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::export_default_decl: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::export_default_decl runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6453d5a35185751299bc3b7b963932d84fad5e5dff0b705dcfd5b33b2c35aaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::eval_helpers::mk_type_destructor: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::eval_helpers::mk_type_destructor runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78cf373584d5daebf02ece5bbf60b7c0e95059e64ab26ea1938662ffee542b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::opaque_type: FunctionTooLong \u2014 flow_typing_statement::statement::opaque_type runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"44358cd43bb05ef2344c7f24539b07e1ce5154376805e7fd8b43961dc393d209"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_converter::type_destructor_unevaluated: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_converter::type_destructor_unevaluated runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc55ebffeb020103720f8136dd04f9fa1c63838474e166280200932f4bb51ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main_parser.rs: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"907e0cfb2241c59ea9d6df9e0472f7c5da169642d133d1dd99b6266b905c76c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: indented_printer/statements.rs: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: Writer (17-753). The bar is 500 significant lines; this is 57 over it, 1.11\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":"rust_port/crates/flow_parser_utils_output/src/indented_printer/statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c47254fc6f5b5adcfdb11c08416145318dccf909a5e766e5ce62a8460ec124"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_utils.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acd578a6d027fe05fa428d1faa6bd3cc5bda2c34c454a6efc1d1dcca2864237"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transform.ExportNamedDeclaration: MethodTooLong \u2014 ExportNamedDeclaration runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03520a13b981e668cc899272236bc5bccda3ed207c3447c78f71a912cb8c6ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::glean_runner::import_declarations: FunctionTooLong \u2014 flow_cli_support::glean_runner::import_declarations runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a09ce220dd86a874c563ffe5db0489eadacccd1ba50e9250d9f3d74f8ae3d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnnotateLiteralDeclarationsMapper.program: MethodTooLong \u2014 program runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd4596b46563e7c32604cd77857c0a0aa58097eb8651a2547c6fab01cbae78b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils::enum_validate::validate_implicit_type: FunctionTooLong \u2014 flow_parser_utils::enum_validate::validate_implicit_type runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"893c71da1f90d368de1d24c63415c2efed34b1874f9d9bc7a57ac9ae798d8ca3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComponentLowerer.component_params: MethodTooLong \u2014 component_params runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab6845fab7a51ef21b1ae96e2b444c304492e16465c3b99d37dd006ead634b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert: FunctionTooLong \u2014 flow_typing_statement::type_annotation::binding_kind_of_generic_id_post_convert runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff631be9d3ca4164dbe5fec246989ab2e9ec602ac94f2f587609513a2060b6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_impl: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_impl runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"4353f96faa07fc7daa4c8d5703a0f12afae4ecad6ad8c76dc234fab4a83127f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_visitors::type_mapper::arr_type_default: FunctionTooLong \u2014 flow_typing_visitors::type_mapper::arr_type_default runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5167a491734872c136fed35eaa8f6b0e26f0d277ed0fdf40c41706bf188e41"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FindDeclarations: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 4 blocks, lines 1066-1737. The bar is 400 significant lines; this is 41 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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe4cd38dd73904d32043dea1c98355c63c2d234a453b4acbdaec187fd05ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NameResolverState: TooManyFields \u2014 33 stored fields beside 1 method. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"578483eeaf5e909e3f7c9618acc3b179dac5a04ce174b11e58a5814a99c0f751"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hoister.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: HoisterBase (3 blocks, 40-701). The bar is 500 significant lines; this is 50 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":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847c53e1a2482bf96d37d2ceb0f2821e4b3c75fb466246e2540eae272bb94cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::dev_tools_command::runtests_spec: FunctionTooLong \u2014 flow_cli_support::dev_tools_command::runtests_spec runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_cli/src/dev_tools_command.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f042eeb53747c1a7f3a64cc02f4458e8b2401ced5171dd0a32eb866a6b01e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::ts_enum_sig::ts_enum_member_values: FunctionTooLong \u2014 flow_type_sig::ts_enum_sig::ts_enum_member_values runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_type_sig/src/ts_enum_sig.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b7ce1e8f4d9c38bb8832383658dca9bdb8dacfc67501b55105a09f7bd3d521"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::env_resolution::resolve_component_type_params: FunctionTooLong \u2014 flow_typing::env_resolution::resolve_component_type_params runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cacdefa1c28302c7aff61e2abd2e2c6821750f8fb7704b8b11f165ce46d4ff1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ValueObject.to_pattern: MethodTooLong \u2014 to_pattern runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb04f1ecb9409db7da2daa316a94c6fdf600c11777225e9c0a657c7d89c496f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::assignment_lhs: FunctionTooLong \u2014 flow_typing_statement::statement::assignment_lhs runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11678}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f83ecb04fb1ed89a726589b53fb09fe724fcd9ab63e79a7ba7fb4b5379a748"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::expand_literal_union::type__: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::expand_literal_union::type__ runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ab5e53b702d82c0ac662e864e873ddad1957676625aac2c40175b8be335b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_monitor_listener_state.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91071e52042375cf91d8c58985eacf6134a6805e4ae9b38e0e59aa25312296"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder::name_def::collect_declared_namespace_members: FunctionTooLong \u2014 flow_env_builder::name_def::collect_declared_namespace_members runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7ae6ac706547615d3a08ceec013634c2273ed19e08472cb8c7e7dbf58f753"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_env_builder_resolver::name_def_ordering::annotation_locs: FunctionTooLong \u2014 flow_env_builder_resolver::name_def_ordering::annotation_locs runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":3865}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d79a661a8926d370ec2855219b4fc28774218709677eefc7ef7a31c8d28ff79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::foreground_check_commands::focus_check_command::main: FunctionTooLong \u2014 flow_cli_support::foreground_check_commands::focus_check_command::main runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/foreground_check_commands.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ebf68df30310ae5d18b1438439fce0ec47ed88747ee56485f66386b4d5317b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_env::flow_lsp_conversions::diagnostics_of_flow_errors: FunctionTooLong \u2014 flow_server_env::flow_lsp_conversions::diagnostics_of_flow_errors runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae783927115cffdc753fb0cc995aa06c071d40d60a7dccb00ca1ab60a898315"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_code_action::autofix_imports::merge_imports: FunctionTooLong \u2014 flow_services_code_action::autofix_imports::merge_imports runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"48410272d1190f515dd7e423ac979954c56c562552e13cfb53267af4c1fab921"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::instantiation_kit::instantiate_poly_with_targs: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::instantiation_kit::instantiate_poly_with_targs runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9765bb5bffa43ada89435b75c83cb603953f7f696ed1b08ca5dc7d797d180fc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WholeAstVisitor: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 1404-1999. The bar is 400 significant lines; this is 30 over it, 1.08\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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ece5e958f324a766b3c92df5984e9c6dafd1cf4acf2418fb01b25890ec7cfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/strict_es6_import_export.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: ImportExportVisitor (3 blocks, 267-795). The bar is 500 significant lines; this is 35 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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb0a5dd7728024ee819be10807e395a3c3538cc421f53523e4697488607ab3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_persistent_autocomplete_lsp: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_persistent_autocomplete_lsp runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5206}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9b410070a9e78e29b325d72c6e45ece8522306bf22a96dc878f507f7fe88c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::merge::try_eval_concrete_type_truthyness: FunctionTooLong \u2014 flow_typing::merge::try_eval_concrete_type_truthyness runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5db548e0fb162b5317914b80df44a78be1185c1a6107f20024ec3a7780218be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_::union_rep::disjoint_union_optimize: FunctionTooLong \u2014 flow_typing_type::type_::union_rep::disjoint_union_optimize runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9042}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa60b5fdddd07f2fc95c0d241f801b420e32a63b26f06ef2c4314cf22f93b5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_type::type_::string_of_use_ctor: FunctionTooLong \u2014 flow_typing_type::type_::string_of_use_ctor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":12461}}}],"partialFingerprints":{"codehealthFindingId/v1":"899d54bfb2619d7e50d34c0c740bce8a584dd3d3e76497ed897e3057a4778678"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommittedHeap: TooManyMethods \u2014 32 methods, declared across 2 files: src/transaction.rs (21), src/heap_state.rs (11). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d50381a046d7890d82ccb33011505b026b069e4509b3d4d8ade4672264a89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_prot.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 31 over it, 1.06\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":"rust_port/crates/flow_monitor_rpc/src/server_prot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62fea801a5bce128644a4939d06b84898720efaadee523f2da5a9b65c5de44a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autofix_match_syntax.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: Mapper (2 blocks, 72-591). The bar is 500 significant lines; this is 31 over it, 1.06\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":"rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc74c3925d8e327680110aa729d9e93ec269b0ad5b1f73b8f1bc2a0bdf07232"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/get_prop_helpers.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 30 over it, 1.06\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe7c107d09d6917c92f0d864864d2bfe62fec8d146d2ac9c9fb5893be5f4fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.mk_type_env: MethodTooLong \u2014 mk_type_env runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"d703e604e876dabde23b2d9b6fc155cc0a46ab1e682712fa4244120d3a476db8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::mk_tuple_type: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::mk_tuple_type runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b99829b577ef01a2cefc5b1a74d4b08702ff19b650c41c2188bb307c6aac23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::component_declaration_config::eval_param: FunctionTooLong \u2014 flow_typing_statement::component_declaration_config::eval_param runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2095c048e3872b7929278d2ad88c0b4489dfabf483ac4b33503032ddccfd0bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::simple_assignment: FunctionTooLong \u2014 flow_typing_statement::statement::simple_assignment runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12196}}}],"partialFingerprints":{"codehealthFindingId/v1":"63513b8ceafe531f1f1eed138eb39b65072cec0eaa6787733a79c40cf35996ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/document_symbol_provider.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: Visitor (3 blocks, 133-669). The bar is 500 significant lines; this is 28 over it, 1.06\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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2892cf1ecabe424f2c4896dacf955c06921a649803ba611b309f26a4762448b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exports.rs: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 26 over it, 1.05\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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b75e7f2359b8e645cecf0c7f88ecd91ae3f58417c087f4ceca52cb306bfa2fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing::type_inference::stmt_validator: FunctionTooLong \u2014 flow_typing::type_inference::stmt_validator runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0801602826c0a778ea029e19804bb6ba76e2656a1e73bc66000743ed98d834"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_common::flow_js_utils::union_optimization_guard: FunctionTooLong \u2014 flow_typing_flow_common::flow_js_utils::union_optimization_guard runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7abfb5d1bfc5d01c5bfccef94e20fe5579cbd11273e121afd94ffd4950f3a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::match_pattern::member: FunctionTooLong \u2014 flow_typing_statement::match_pattern::member runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f955faf752fd4a7767f95599d3e64dffb3636bbb8064e9f5cc75a379d1b7df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\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":"rust_port/crates/flow_server/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ef2b84685fb23fbff60d09e9a385f42616bebb0213db6b5ef7a9bf5884ed4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/enum_validate.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d78ba9442d7d61f0baf69401ba6763d9984d1b262bc6c27d8c4a6529f40b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow_js/any_helpers.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe4b9547a0c117ac9849df739dd982e76ee63e07bc04ded7c39f93a6515105f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::status_command::check_status: FunctionTooLong \u2014 flow_cli_support::status_command::check_status runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/status_command.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dfd741241a316cb473ae389038519949b39b91f63996b642d28b7ee10ff724"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_dev_tools::runtests::check_exec_file_promise::exec_shell: FunctionTooLong \u2014 flow_dev_tools::runtests::check_exec_file_promise::exec_shell runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"569d9e65673a22f5680b02e52f89b675c01ec44785f513c5657d555f5b47b54d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_function: MethodTooLong \u2014 visit_function runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2750}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa5702924b6177b845fa3d2397812ea444936115cbb7078642af70bcf702eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NameResolver.lambda: MethodTooLong \u2014 lambda runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef712ca396142b9a87bfa8c56256b36516d60df3701a8a22e3a0f052d691065"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::subtyping_kit::array_flow: FunctionTooLong \u2014 flow_typing_flow_js::subtyping_kit::array_flow runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b6c5cfe55262fa68d7395aa2dc5f2b3b1b09819f922c87e0ac9527f0a929b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::delete: FunctionTooLong \u2014 flow_typing_statement::statement::delete runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac347546187b1a6127c9e9b39735d5cbf483a6def52a7adf627c0a370d5e69b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_common_utils::measure: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/measure.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d02802bd395360469d1f65ac51b1ab09a428d4106384845db3207d718295d24"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: flow_typing_ty_normalizer::normalizer: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a6954076c1c119662a558fa64d67d6b67e6b14a71beb6d5feb48105f7140d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_cli_support::glean_runner::declaration_infos: FunctionTooLong \u2014 flow_cli_support::glean_runner::declaration_infos runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"abefaf53aeb3e023515106baa77792faa5c5500737574c3ccf679df19d48425e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_command_utils::get_options_flags: FunctionTooLong \u2014 flow_command_utils::get_options_flags runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc94041382763ecd16578856413becb8725d0446689ca2c18b668575aea82d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_binary_expression: MethodTooLong \u2014 visit_binary_expression runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bda856493271a18e5976903362bb1f83837aa5a37dcfdd5849081eb42e432c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LintSettings.of_lines: MethodTooLong \u2014 of_lines runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_lint_settings/src/lint_settings.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e41527b83280c4a94b4892ed69dad1dfd40bfa52b8888185489b1ac17e5ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_server_command_handler::command_handler::handle_persistent_coverage: FunctionTooLong \u2014 flow_server_command_handler::command_handler::handle_persistent_coverage runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6193}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aeccf865ed8dffcedc87c32d2fca71682cc7f775c89870d0d409c203019235"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_references::find_refs_js::local_refs_of_find_ref_request: FunctionTooLong \u2014 flow_services_references::find_refs_js::local_refs_of_find_ref_request runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_services_references/src/find_refs_js.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af7de0833c713e37bfb52817c2c50cfbe141e4c5ddee040a01e2bd50f608a82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::implicit_instantiation::kit::instantiate_poly_with_subst_map: FunctionTooLong \u2014 flow_typing_flow_js::implicit_instantiation::kit::instantiate_poly_with_subst_map runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b3788de1a1d309814c92ab5a8caa92f78b2e7959aece08b130b7f8015421b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_statement::statement::declare_namespace: FunctionTooLong \u2014 flow_typing_statement::statement::declare_namespace runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5187}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e89690c6a1b0bdb7cad8a897ddd99f19f90ebf6c4a446f22435b64e0c169e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/name_def_types.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb5591f2f53311c52965f3ce84cd0e830296d93c66112883480821133a4429b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StripFlow: ClassTooLong \u2014 411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 26-600. The bar is 400 significant lines; this is 11 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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed5f57ce8042f424a5acd8d5f4533c77c64f7653d42d00fb0492666ba61e69d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: npm/jest_v27.x.x.js: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3314da5726313aa93872f7bdc94c4c76754c7e6c8080232aa597e6084f85536"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flow-remove-types/index.js: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 10 over it, 1.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":"packages/flow-remove-types/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60375c831c5255ef0624559dfbb21ae3428e4a155d8116a5066f80af199ab2fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/destructuring.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 10 over it, 1.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":"rust_port/crates/flow_typing_statement/src/destructuring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81db30cf38f555aa020c8ead157524c8d006fc72ad2c51a218a024f1bc812f60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_services_get_def::get_def_utils::def_info_of_typecheck_results: FunctionTooLong \u2014 flow_services_get_def::get_def_utils::def_info_of_typecheck_results runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee18e11c98f6f3cb87fe9d8cc365b38ea44cd489b082d560ed34558141d89c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::scope::merge_interface_into_declare_class_binding: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::scope::merge_interface_into_declare_class_binding runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb77bc703055fb4008d632e2b1f2eb781737e67dc621b3781170b12d1284934"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::any_helpers::any_propagated_use: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::any_helpers::any_propagated_use runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cff0376d648cf00ec0a1cef0a188bda8d1c7b71cbbab6534a7e9953f6e71c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_flow_js::flow_js::eval_helpers::eval_selector: FunctionTooLong \u2014 flow_typing_flow_js::flow_js::eval_helpers::eval_selector runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"729e335442f7a89582de30130c615ab4551ce96082548ec85b19dca2b6437096"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test: FunctionTooLong \u2014 flow_typing_utils::predicate_kit::concretize_and_run_sentinel_prop_test runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bfc80a33e65447e26aa4701731ab38b09a922ad4c989b3d65e26efbb9d2bed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.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":"rust_port/crates/flow_parser_utils_output/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b7c75aa53503de463413b74a110aef85e599a5bbb56c23bd9bb05caec4b85c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ssa_val.rs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/ssa_val.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eca31b667fe97c2678655f0f5e82b81cb87bae7cf86a1a1cdd12082e4daec3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefFinder.visit_function_param: MethodTooLong \u2014 visit_function_param runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa962843bf7b6598401d57a07676fe92eea80f874da25616c40a8e7bafac3651"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_parser_utils_output::js_layout_generator::enum_declaration: FunctionTooLong \u2014 flow_parser_utils_output::js_layout_generator::enum_declaration runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":3187}}}],"partialFingerprints":{"codehealthFindingId/v1":"181fdf5037a564b0f8a8e20367a68057d2748c4bff876d0cf434cbcaed209b19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::scope::finalize_declare_module_exports_exn runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"350ccb61a249bc8ac7f50c3127c4adc1ca8cfca0482f33ed58085d1fbdaa2aa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_type_sig::type_sig_parse::const_var_init_decl: FunctionTooLong \u2014 flow_type_sig::type_sig_parse::const_var_init_decl runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9061617ab8d883c69d8ad6c4a6bfc91028b02c5a3c119e2483b495a4e69e8d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_variable: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_variable runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d854064d256b1594a0adeff8bf6dfdd3b824e139170952993f2fdab18bbf9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::type_converter::convert_component: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::type_converter::convert_component runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa569e92bd1baa3b451b8641814fd931fdf4afdea4262c9b54e6bd82a36c017b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_ty_normalizer::normalizer::element_converter::type_t: FunctionTooLong \u2014 flow_typing_ty_normalizer::normalizer::element_converter::type_t runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4067}}}],"partialFingerprints":{"codehealthFindingId/v1":"a825d27dcd53ce5a5c64f3d007be4805d8879986d9cbcdf2e94e5c3b795ede8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_filter::not_truthy: FunctionTooLong \u2014 flow_typing_utils::type_filter::not_truthy runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8425e3d089ca46c6f9884567d232cedeb6cae8e9b369b93c9bec29ea1119833"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: flow_typing_utils::type_sig_merge::merge_fun: FunctionTooLong \u2014 flow_typing_utils::type_sig_merge::merge_fun runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1740157bf6406332a5f43949fa64e295c6efa510a55af5597f7b8c5750308fd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Mapper: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 72-591. The bar is 400 significant lines; this is 3 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":"rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c8f9f58209a8627e149653d47f21b3c94d300ead3eb06588d67b11943b2418"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Visitor: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 133-669. The bar is 400 significant lines; this is 1 over it, 1.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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63fad6e764221da36b57f206ddbc5850a6aaf5244e6355ac2821be83f83390a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 21 shared lines): rust_port/crates/flow_codemods/src/annotate_exports.rs:304-393 | rust_port/crates/flow_codemods/src/annotate_exports.rs:492-603 | rust_port/crates/flow_codemods/src/annotate_exports.rs:608-708 | rust_port/crates/flow_codemods/src/annotate_exports.rs:769-895 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:245-326 \u2014 These 5 members are variants of one another: a block of 21 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6c399f3e78620a96a82f48a7d0f8368943d85459b84e27c113405d7de05e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 26 shared lines): rust_port/crates/flow_codemods/src/annotate_exports.rs:304-393 | rust_port/crates/flow_codemods/src/annotate_exports.rs:608-708 | rust_port/crates/flow_codemods/src/annotate_exports.rs:769-895 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:245-326 \u2014 These 4 members are variants of one another: a block of 26 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77769e6a031590013d7791f71519e4ef6919695f6db9e6c2e46610eb993c753"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 68 shared lines): rust_port/crates/flow_env_builder/src/name_def.rs:2005-2140 | rust_port/crates/flow_env_builder/src/name_def.rs:2272-2389 | rust_port/crates/flow_env_builder/src/name_def.rs:2394-2489 \u2014 These 3 members are variants of one another: a block of 68 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3efdc7eae90717c2f6c370e0bd8b0f03cdb60b9b0e7ac540fb3eef3ee5d5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (126 shared lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8491-8744 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8802-9146 \u2014 These two members are variants of one another: 126 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a318a586cbecf8484302d88f7e8b2d2093c6e951e25031db6c5667ee82178a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): rust_port/crates/flow_parser/src/expression_parser.rs:2631-2723 | rust_port/crates/flow_parser/src/type_parser.rs:1001-1090 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2631}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ed35b3fcec13aa88ebeaa2be21ae8e926d303107d56cad009c21d3b6bf73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:4596-4688 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4763-4870 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4596}}}],"partialFingerprints":{"codehealthFindingId/v1":"81396bdf7bf6a93f3c30a3d48d1bf20297b57a21d2953ea07152c7bec610a0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3449-3676 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5159-5292 \u2014 These two members are variants of one another: 49 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5795f15bd060a2fe43299d542d4cb873367e3728a9ad4edf24512a37aeb1ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:154-228 | rust_port/crates/flow_parser_wasm/src/strip_flow.rs:128-202 \u2014 These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf45774d51d031346008ec277d80d62b05d044b846971e08a7a2aeb8a8adeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): rust_port/crates/flow_common_ty/src/ty_utils.rs:637-687 | rust_port/crates/flow_common_ty/src/ty_utils.rs:689-739 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74e4c3afe13e1ef74cc7430e4c7b5966dd226b0ffeeace04dc7417a14ca3ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): rust_port/crates/flow_typing_statement/src/class_sig.rs:1784-1908 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2025-2180 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a514834e6fe5e7b8d1a55ec4e76c1850736ac4ae04aa3b6e006e04387bd5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5738-5850 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5860-5968 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1481ab00e4b3a538b5bfa48641e618e1674546346c93d281555eae9e9f95aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): rust_port/crates/flow_cli/src/coverage_command.rs:374-471 | rust_port/crates/flow_cli/src/dump_types_command.rs:148-266 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"29679f9d0abcd97965864da0bc649f14ab5a97162dbd7fe61dbe24c129e2e738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_parser/src/expression_parser.rs:2240-2282 | rust_port/crates/flow_parser/src/flow_lexer.rs:254-291 \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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8e5538657462e2f3ef99d0499a44c655ddd31ecb5a588ad450d326110242e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5351-5369 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5375-5393 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":5351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c3791574209189df6195d59f356e8a6f568bcbd83ed30b2aab5e57c4e899e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12570-12598 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12604-12626 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4725a0245148d17d5c93c5ac4a02a1fc9add82f19ec263c95b880feea6f2883"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): rust_port/crates/flow_analysis/src/property_assignment.rs:526-556 | rust_port/crates/flow_analysis/src/property_assignment.rs:562-593 | rust_port/crates/flow_analysis/src/property_assignment.rs:599-644 | rust_port/crates/flow_analysis/src/property_assignment.rs:650-681 | rust_port/crates/flow_analysis/src/property_assignment.rs:687-719 | rust_port/crates/flow_analysis/src/ssa_builder.rs:808-856 | rust_port/crates/flow_analysis/src/ssa_builder.rs:863-901 | rust_port/crates/flow_analysis/src/ssa_builder.rs:907-946 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1660-1709 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1724-1763 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecee995bd2007285914e8799fab3d79a36b8147a2b539b29c36efd7beeb43bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): rust_port/crates/flow_cli/src/codemod_command.rs:809-900 | rust_port/crates/flow_cli/src/codemod_command.rs:920-980 | rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs:137-274 | rust_port/crates/flow_codemods/src/utils/codemod_annotator.rs:462-493 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1251-1297 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2224-2294 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2303-2383 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2392-2459 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3839-3969 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"530d8243ee021af387de599fe2b2ad0aaf676e8373cd196e1e0e0a9f024dfbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): rust_port/crates/flow_typing_utils/src/type_filter.rs:387-522 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1075-1131 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1133-1170 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1172-1228 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1230-1270 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1302-1355 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1357-1394 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1396-1451 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1453-1490 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935508b694d5fef17bb1100fe328cf2b6b72fa84bf19c6ae24bd0ca492f3605"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:246-444 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:545-552 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:560-567 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:575-582 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:590-597 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:605-612 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:620-627 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:635-642 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e76396c9a63d84351af3c370f158c3e7b5f978c709a6bce27cdcc8ae8e951e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): rust_port/crates/flow_typing/src/env_resolution.rs:502-510 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1934-1942 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1461-1469 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1474-1482 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1527-1535 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:319-443 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1484-1816 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:1410-1418 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"387909b845488d17d10469697803e8485f0e7e1683c8c59d76a17cd4ecf495dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust_port/crates/flow_cli/src/agent_helper_command.rs:245-330 | rust_port/crates/flow_cli/src/autofix_command.rs:166-254 | rust_port/crates/flow_cli/src/autofix_command.rs:338-398 | rust_port/crates/flow_cli/src/autofix_command.rs:507-574 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:92-175 | rust_port/crates/flow_cli/src/type_of_name_command.rs:159-268 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc126515dfbe961f3ba450422c9df2aa81e6952c469bd11467eaf42d9e02029"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust_port/crates/flow_cli/src/autofix_command.rs:24-61 | rust_port/crates/flow_cli/src/autofix_command.rs:264-287 | rust_port/crates/flow_cli/src/autofix_command.rs:408-437 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:19-63 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:19-75 | rust_port/crates/flow_cli/src/type_of_name_command.rs:13-57 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ab59d416f7d1bd76dda3eafc5320abce7d95fd84cb242842cc076212c8ecb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust_port/crates/flow_cli/src/lib.rs:364-407 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4213-4245 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4271-4293 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4617-4663 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:8059-8097 | rust_port/crates/flow_server_utils/src/file_content.rs:140-164 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/lib.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2af603eb504331b729e07666d03251c4b812fcfc0829dd13ec40b127972d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3063-3097 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3102-3136 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3141-3187 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3202-3248 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6174-6220 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ff868313e3422c6170f7fda682f1cc888b9bf5dc64da9516e8aa050d69155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rust_port/crates/flow_server_command_handler/src/command_handler.rs:3839-3969 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3979-4022 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:5348-5480 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:5566-5628 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6543-6598 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebad86fe093ad8a04521081e8b6e9cc065fa9abfa7ccd4ba37b17cff437eaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rust_port/crates/flow_services_inference/src/type_service.rs:1487-1766 | rust_port/crates/flow_services_inference/src/type_service.rs:2191-2369 | rust_port/crates/flow_services_inference/src/type_service.rs:2770-2973 | rust_port/crates/flow_services_inference/src/type_service.rs:3156-3354 | rust_port/crates/flow_services_inference/src/type_service.rs:3981-4170 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef18fd743e5e897971665cf3b147acf6f37c2d8102131b9235769ea469ceda93"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1016-1037 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2438-2483 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2485-2520 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2541-2599 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2674-2707 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6a15ae32c2278c9176f84b54f61c7896bf4521b230d42594cb8245a2fb0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_dot_js_wasm/src/lib.rs:813-848 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1027-1052 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1142-1178 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1180-1238 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dot_js_wasm/src/lib.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffae8098b0813f0f2b8c84ab20199d21e49e569c251c054cbcd1a248f97cae41"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser/src/enum_parser.rs:98-189 | rust_port/crates/flow_parser/src/enum_parser.rs:193-232 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:114-498 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:577-796 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/enum_parser.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4387dcb78b5f57b9cbcca45da9115b64966e48a2679820f76bb5e03c8cf72db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser/src/estree_translator.rs:3411-3480 | rust_port/crates/flow_parser/src/estree_translator.rs:3486-3515 | rust_port/crates/flow_parser/src/estree_translator.rs:3521-3555 | rust_port/crates/flow_parser/src/estree_translator.rs:5411-5460 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a91c9e8abdeab9a9253d40d26486d0bc770b02489855ec4d04b697b9298c31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser/src/flow_lexer.rs:1033-1844 | rust_port/crates/flow_parser/src/flow_lexer.rs:1925-1995 | rust_port/crates/flow_parser/src/flow_lexer.rs:2481-2595 | rust_port/crates/flow_parser/src/flow_lexer.rs:2673-2750 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622fba9d47810e4cd8876aebaf54c877040e59ad1c2c08d87d5b49d5d03c45a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser_utils/src/enum_validate.rs:94-104 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:113-121 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:123-131 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:179-187 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b9403d637166bfd20dd90d343d275017b3a23effccc032a8de26e32924000b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3017-3035 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3149-3167 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3208-3226 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3770-3788 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cdb8cca40884728237f099711b25cf80166a34a916d23ef768013db26d9f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3173-3202 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3418-3447 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3505-3533 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3794-3824 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c5cbd65ad0364407f38ff4e5a5dc868f305d7a134de8abaa1e03f92a858f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2330-2386 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5355-5394 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6887-6972 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6978-7022 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65efe795ab1c480453d971a39a20ad41021e64589405001efefae611514cad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7277-7344 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7349-7407 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7412-7442 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7447-7478 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6494ab6c43672e9a54986cce3f0e718ca63ba4a17842464fef2725c690b167"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:434-495 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1273-1307 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1761-1822 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1835-1920 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d265766b7aed751996a95a03937ecfcc5fcec6337673c495a82857296819b5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_typing_statement/src/statement.rs:2278-4561 | rust_port/crates/flow_typing_statement/src/statement.rs:5949-6172 | rust_port/crates/flow_typing_statement/src/statement.rs:12784-12889 | rust_port/crates/flow_typing_statement/src/statement.rs:21073-21124 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d972bfb001b66810546adb9820231b17d71ae67c5bc2ed02d66f8724282189"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust_port/crates/flow_typing_statement/src/statement.rs:5949-6172 | rust_port/crates/flow_typing_statement/src/statement.rs:6780-8494 | rust_port/crates/flow_typing_statement/src/statement.rs:10946-11174 | rust_port/crates/flow_typing_statement/src/statement.rs:11528-11676 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5949}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c52b976e8cb78bff0a58aebf33a7c611aaa49bd35d4deb84d1d59a0deb6794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (346 corresponding lines): rust_port/crates/flow_parser/src/comment_attachment.rs:870-1258 | rust_port/crates/flow_parser/src/expression_parser.rs:2790-3135 \u2014 These two members are one piece of code written twice and then edited apart: 346 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"263a13972d8ea780281cbf1012c459dd66ba135fce09e03aac9c74391415a783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (185 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:250-434 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:320-504 \u2014 These two members are one piece of code written twice and then edited apart: 185 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e89b95cb13974983e520fdcc2f847dd5382b4ab153f423a096408279b4437f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (120 corresponding lines): rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs:127-246 | rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs:252-382 \u2014 These two members are one piece of code written twice and then edited apart: 120 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28eaa122928e6367886266ac6b3b4ebfeb154661ada09d2e8cf0e668c55126e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (143 corresponding lines): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3990-4132 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4140-4290 \u2014 These two members are one piece of code written twice and then edited apart: 143 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d60923bfa6dfe1d7d524b82e04be4a164358ee6eee5bffb5e743513b92624b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (109 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:1199-1325 | rust_port/crates/flow_common_ty/src/ty.rs:2828-2936 \u2014 These two members are one piece of code written twice and then edited apart: 109 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a7afab7269c6f42e34918cc03ac8e06f05d5f5985d13b48567de5fbc5a633d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15510-15603 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1789-1882 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21648f4ad620f4a2861742905dd4b66c41b921ad989c6ed2d80b050cc91df1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (97 corresponding lines): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:156-279 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:205-301 \u2014 These two members are one piece of code written twice and then edited apart: 97 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5159f81f978fea03989e0e40a75e701936b05d81bec5722f6460d65fa9fbcf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (104 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:1331-1434 | rust_port/crates/flow_common_ty/src/ty.rs:2938-3046 \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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b95cb70b34e4326171b234d93529aba11caae52d0b6c9e8b6562fd82b6751c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (96 corresponding lines): rust_port/crates/flow_parser/src/expression_parser.rs:2531-2626 | rust_port/crates/flow_parser/src/statement_parser.rs:874-970 \u2014 These two members are one piece of code written twice and then edited apart: 96 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2531}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ef7136411f84e4cec4424fcf8453c0fc55efe2a833e6e726ca17c84586843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:420-495 | rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:521-611 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_concurrency/src/map_reduce.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f44c96280e30851322816d9e1c3fd05a0eb4ea5ab530f5f112301c6a40e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8997-9072 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3578-3641 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8997}}}],"partialFingerprints":{"codehealthFindingId/v1":"4707abad51702ac21b12eb1f13bf14f20e58018733e7aaa555518b636791e21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): rust_port/crates/flow_services_inference/src/merge_service.rs:997-1081 | rust_port/crates/flow_services_inference/src/merge_service.rs:1094-1164 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2ca27be1eb63a9d80c2dde779e5b9244d553f6b9d36ed603e5c3067d4ceace"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): rust_port/crates/flow_typing_statement/src/statement.rs:21230-21328 | rust_port/crates/flow_typing_statement/src/statement.rs:21357-21444 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":21230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8554bb4e4fdf1be4d497c963d9256f3143dd9f278513d7103ec1534b901c8b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:980-1020 | rust_port/crates/flow_type_sig/src/type_sig.rs:1105-1154 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a224696cac701b310e93783db31229e616cc824c6fddabdab16f10bff668e1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:7835-7905 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11673-11751 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":7835}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8dc32601875d07daba1e7b543902571829dc97d3b0c85f9e8730934cfa0992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:6269-6314 | rust_port/crates/flow_env_builder/src/name_def.rs:6320-6364 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a106c4c50368a021091910ab72ba55c37b861294ae92ae05bfce50c3b7972b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): rust_port/crates/flow_common/src/reason.rs:1718-1767 | rust_port/crates/flow_common/src/reason.rs:1805-1858 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa7805f7f878de781fb6fb373dd0ef23b1ab061f0ebe122df3f48007e4fccbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:10402-10461 | rust_port/crates/flow_typing_type/src/type_.rs:10470-10531 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":10402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fdc2176c7afdead85d757ce44f144a57eb3855bfbe459272f5a089b7f241c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 64\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7362-7425 | rust_port/crates/flow_typing_type/src/type_.rs:7567-7630 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:2119-2187 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 64 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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e1ad92b2ff2d71a83456f87262c5f70f2fff3f0727ae0c292ab82595095144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): rust_port/crates/flow_common/src/js_number.rs:59-130 | rust_port/crates/flow_common/src/js_number.rs:144-233 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/js_number.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd2224ceedaa02a7b5943512731cd4762a01fba7b06e5ee2de2a660c6be163f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:4774-4829 | rust_port/crates/flow_typing_type/src/type_.rs:5013-5070 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f95be02d2c48df77d5fc9bc8165ef463287378a58c37a2c93b4b2f1e5d3ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:907-976 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:993-1039 \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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"2469ba843213e8a64f34c616ce0f96e406e3594ed4df2122a4e7cd375c17af69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): rust_port/crates/flow_cli/src/codemod_command.rs:311-356 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:662-707 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"70783562d7d6be0c6c77ada0d7435581603a20d0415450718c9fe1e7600d1f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:224-275 | rust_port/crates/flow_parser/src/statement_parser.rs:277-323 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a7a8fda1547d16f5876c56e5ba9726e653ceb5203f5483fa262a74a8158bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:439-491 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:509-567 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17667719fb52e10088ac294739c81c0b6011dd4d20c832f5d88b77daed1a4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): rust_port/crates/flow_server_env/src/server_env.rs:480-543 | rust_port/crates/flow_server_env/src/server_env.rs:551-600 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_env.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d023ba18fabfa8e21af2cc721307e412cd192298401048a72058cbd0fba1f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 50\u002B corresponding lines): rust_port/crates/flow_cli/src/apply_code_action_command.rs:86-139 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:193-242 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:290-350 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 50 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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca28901b84cf43a716b39a2620b63b03ae61df9bae5565a2af88a68685099a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): rust_port/crates/flow_typing_statement/src/statement.rs:22055-22125 | rust_port/crates/flow_typing_statement/src/statement.rs:22132-22210 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":22055}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cd4b8492499f341707a3b599a6a34630c0fa38bd091620e140bf1cafc0b46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1080-1150 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1212-1285 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"de25193a52d9255173e08717b52edf0b39978adab5235257719c38fb8bdc20cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): rust_port/crates/flow_common_utils/src/graph.rs:482-523 | rust_port/crates/flow_common_utils/src/graph.rs:559-600 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"de06ffc09900ef1fdecc8b790329ecf27e7c6c50a96de6a75fb7bacc89e48396"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): rust_port/crates/flow_common_ty/src/ty_printer.rs:75-117 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:455-526 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86021b4c5b8bf51d76a60ed1f97b5200a655f48cc7b596f0647ba19ce791f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7758-7787 | rust_port/crates/flow_typing_type/src/type_.rs:7792-7821 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7758}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89510b1a3fe7a5058eb4bc1019dd466284213298b7f82896ea121c4b99f547"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:851-896 | rust_port/crates/flow_typing_utils/src/type_filter.rs:910-955 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d96fadf9baed3ddba083e70f80de968b01efcf2c876e4ec25628ed43609064a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:514-567 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:592-652 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0024b990a10f9e881ba035284d5453d736f3991281c8d1a026683d4f7f2210c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:227-280 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:287-340 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c9696caee26b8bd83fa94c42f80c5e85123fdb689e43231e702b201e84896b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:636-694 | rust_port/crates/flow_typing_utils/src/type_filter.rs:723-764 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13b0b582a1745a2b8eb4d5a7bedf0578d5c32bdbba48a04984296e42f7d34da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): rust_port/crates/flow_typing_statement/src/statement.rs:1588-1628 | rust_port/crates/flow_typing_statement/src/statement.rs:1635-1675 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5987847ac84c5df89ab09a6cce161dddb44f101f78787d5411cb2671e42766f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4993-5027 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5038-5075 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c557fe866d88c33223dd2f67050522ad94673bce0de8ba070736467e8657ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1239-1338 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1340-1411 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebe3afb6e6fcd2883eaee38de0eac3e8bf1e83892567373961f3895aa2d43fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1031-1124 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1131-1224 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ab7350150fac9f14c7fca2dc2da78b527cf06b0046c5cae718c3ee7aac4ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5759-5815 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7194-7253 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5759}}}],"partialFingerprints":{"codehealthFindingId/v1":"0289e81ed58742864a43ee9685fed0f84129f4e71c4d5baa1865c58edf2528c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6381-6430 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6439-6479 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eabc1c79f59828f7beb2c60823a2a8fe0f3d22dff378868867c7571fb26e9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): rust_port/crates/flow_common/src/files.rs:1391-1438 | rust_port/crates/flow_parser/src/file_key.rs:114-173 \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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2093affd799508959950f4b450fef6720a385ec32955cc19a255d6e83fd059a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1417-1458 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1463-1505 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d0d5a846cd305ede08c879b23cbab6c9568286af2d4a23e14e60d47f40431"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): rust_port/crates/flow_event_logger/src/lib.rs:1328-1370 | rust_port/crates/flow_event_logger/src/lib.rs:1390-1430 \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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fd7ec5d7988e38e1e16d8a58aeb366266e436f9e8b137dea068adbcecd646b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:295-329 | rust_port/crates/flow_parser/src/type_parser.rs:357-392 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbfb797933aa087c9bed2e70d53a0b68a46773e7b73bba0f4d4b6e695d642c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:386-424 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:430-465 \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":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb87f502f435b4a5df0d9de0ca84134b5347a7c416d876832b3e7fb994ea5f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): rust_port/crates/flow_analysis/src/ssa_builder.rs:1106-1142 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2048-2083 \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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60306c1635d8fd51ac5327ed4b31a210fe2267a39d804c7cb3562d610f4ad7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:173-224 | rust_port/crates/flow_env_builder/src/pattern_helper.rs:115-152 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"140be190d264db2034f300bc06105064a1ae3c9d72d400f1d30125d69ed433dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:969-1001 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1021-1053 \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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"600b5e7db73407ae2f8cbd19d37c0a502d4c48e93cb1b0730a1418051c24b9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:40-74 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:700-728 \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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fa806bc82070f4a3cc6159827fea8077c4b4bfc21b2dc82e0e7ad875d0f66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10089-10135 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10141-10180 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":10089}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e670d9ef6b9265e7b5f7c879d813691b6a4fecad950880581b1cd51e1ac291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3326-3359 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3363-3396 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"253edf1f6252049bfcaee41fdee16a5ce959d280a963fb8b39eeec17880697f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:16795-16825 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2437-2467 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f13fdc4e1559fc5986529216de408265378cde37dc408990a72654f164cbf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_parser/src/flow_lexer.rs:802-843 | rust_port/crates/flow_parser/src/flow_lexer.rs:2443-2475 \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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f334560811fbea2e4772920a311250fd1099d0220a4fdde51fa686674b3cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4033-4071 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4940-4996 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ed3ff78875f573150e2a71618b00cfd596d34e304d875ee1354be38acaeaf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_env_builder/src/find_providers.rs:1240-1269 | rust_port/crates/flow_env_builder/src/find_providers.rs:1275-1307 \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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"945fa3c813030702b78da55c3ec7c0a2c50bbe02d3f4ee726702244e1e882b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:756-800 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1951-2000 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6956f4e50ceb00a845932c439fd41775b155351c5b65f0d1bcb58e976bd7ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:3561-3622 | rust_port/crates/flow_parser/src/estree_translator.rs:3687-3755 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3561}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce76086588fd9b63333b86e2f499d313b631f3c9b6a43ff683b23f67501a99b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:2328-2375 | rust_port/crates/flow_parser/src/parser_env.rs:2377-2426 \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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"461f3788905d7b969c176e89320240090c94bc19206311132a486f6dcf0ed60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:53-85 | rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:152-193 \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":"rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c729921268dd72dcd8c9e9c1ab00ff72e39412bfabcccc0190420891c46659a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3697-3723 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3734-3763 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3773-3800 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3811-3839 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892085c94ed286aa6d3b99e315b2da671c6c16ba6a57d699551d2e53c8e1c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1615-1651 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1734-1774 \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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebdd0f94e6099df49ba08267554e3d0469f55abd5053d7e311d062d8d0e1d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust_port/crates/flow_common_ty/src/ty_debug.rs:1771-1853 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1888-1926 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7957ada4aeb128c9845e9fcfd58d983256e54bd5708dd393ad2225656b8277"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:8159-8210 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:8218-8251 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":8159}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fecdce05e08c388c6a66b1da03f7194b4d227bf47200c8202fedfd267e86b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:1148-1177 | rust_port/crates/flow_parser/src/statement_parser.rs:1179-1209 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"07af91eb955fc834b995f3072ec80dfa1229729ee01aa096b11a5f09bb433199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2151-2181 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2186-2216 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c510321e9dcaf076754a0f8722b146d04102a33772cb00690dc9bf34e2e166"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:2048-2075 | rust_port/crates/flow_common_ty/src/ty.rs:4478-4512 \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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f5edd5d8dd2b793636907910e2ff1f2972d66ccfb73226aeacfcbee8b37629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): rust_port/crates/flow_config/src/flowconfig.rs:495-545 | rust_port/crates/flow_config/src/flowconfig.rs:547-587 \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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c181e121e312001402ee579ce59c25c4957f955158f812c3481a83900a9ef197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2973-3017 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3021-3058 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d4b2ed8412cde6ac0c4a258e65c035edf7257bbc0ad931ae8421c6bc7241b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:610-634 | rust_port/crates/flow_typing_utils/src/type_filter.rs:696-721 \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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f2a80be76e84f303fb1eeded61706bb325cb03f7c41a6dd469b3885d51aceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14622-14647 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1382-1407 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14622}}}],"partialFingerprints":{"codehealthFindingId/v1":"df57eb288e80d3effa9584acf286ae488df8608f7ed968ff2ed1fcf65f1ac617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6505-6530 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6788-6827 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8f7255966ec56d90ffbd7e391f320cdf4f08f181fc96f4e28fab5ce6c18c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3966-4004 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4019-4062 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9967b17c12a9bd4c52c4dd4be80987a6947202fbd8d7dc9e63418dc6e3e84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:185-212 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:222-277 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9a22b6a49d9360a72178e3931c67a16cc72006b722c191f1212bcda5c2483b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_common_socket/src/socket.rs:408-440 | rust_port/crates/flow_common_socket/src/socket.rs:444-476 \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":"rust_port/crates/flow_common_socket/src/socket.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"49080a6940b87e370f238e24d2c47a959a50dbb63c75a2bfc007af672a441f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): rust_port/crates/flow_heap/src/heap_state.rs:195-265 | rust_port/crates/flow_heap/src/heap_state.rs:267-329 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"692056e273252f2334f822e5ba0586ee0bc6cafa6476e1ebca6a2b1b862caef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3902-3945 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4008-4043 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3865f1a144e600b9ab0a3b39cdedcab730bd5758693e700ba58bf2f52339bba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:589-627 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:677-706 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39f9046c5600724a372c7d40a91f41a35daaf7d92ac1d8ec287386c6200a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): rust_port/crates/flow_typing_statement/src/class_sig.rs:469-498 | rust_port/crates/flow_typing_statement/src/class_sig.rs:515-551 | rust_port/crates/flow_typing_statement/src/class_sig.rs:587-615 | rust_port/crates/flow_typing_statement/src/class_sig.rs:628-656 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c91462a1d84ca52f1506415824f9e26e7b55825529510e787e842352712345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6070-6109 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6141-6180 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6070}}}],"partialFingerprints":{"codehealthFindingId/v1":"05837cbeb1c47ff19e203e4d80f072a2852d4cf997bd17a80cc7106140c02d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rust_port/crates/flow_common_errors/src/error_utils.rs:4649-4690 | rust_port/crates/flow_hh_json/src/lib.rs:34-68 \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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4649}}}],"partialFingerprints":{"codehealthFindingId/v1":"55def530c1e432e6e9a8a0dbad902e37eafda20f252d801f45987d633c537d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3744-3773 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3798-3832 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a5fec099fea80eb295a93b26e24ae763c01c508bd500f0bb3ea948bfef564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13110-13148 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4727-4768 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7589f22d65dfd8c9450f143270f5bd93521f38c0572e799d189d3d675faab0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:4688-4725 | rust_port/crates/flow_typing_type/src/type_.rs:4925-4964 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4688}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe28415d1e7f77558d1b26f452a5c32478c3287bc0d5a92470ec3071a92bf369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_common/src/reason.rs:1772-1801 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2081-2115 \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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"67babd5d97b53db06a947d1559140466ff5eb2fcc219245f3803aa0ff9e2ae82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): rust_port/crates/flow_services_code_action/src/code_action_service.rs:709-737 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:746-777 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:787-824 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e6a140469454d21451301dbab6596031e9f8b6380278562387ee7d5ec53b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_typing_statement/src/statement.rs:4771-4790 | rust_port/crates/flow_typing_statement/src/statement.rs:4977-5007 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afd6f1b100ceb91efa007f58076a9d1ac06af380ac82829939ed0dafa97a6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3537-3564 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3573-3609 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c37aba5faefd6a0d4b724326ba7c687e42c52e42871a07210bd4b3283f0785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3598-3628 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3848-3880 \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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd11b45e01a8fbf5de9da5df5a932c1cb257a63bd5b7d76e6b970918a244ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3539-3575 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3635-3667 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3539}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff689ca292902edfa4b1ba8902ec6b978acc2b02cab0dfe4a4d945c1e1e4a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_profiling/src/profiling_js.rs:166-183 | rust_port/crates/flow_profiling/src/profiling_js.rs:185-202 \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":"rust_port/crates/flow_profiling/src/profiling_js.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8808e2269b367c877ee552ff3cbf20c9df7fc0c68afcd8b674f23730b91dc50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:6064-6088 | rust_port/crates/flow_env_builder/src/name_def.rs:6093-6117 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6064}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf076742de19d422f7fbf245f08ff9c42d297efa32d263f8ec473a9058b8d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:17591-17613 | rust_port/crates/flow_parser/src/ast_visitor.rs:17634-17656 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0502f7d6dc37c192ffe1f7c367405507bff42e3951a1c6548e329d5e736cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5795-5822 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6254-6283 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":5795}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d282610aca653e7af26ec9223d5f76c3f0414358326ed331c58a1881d302c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2055-2082 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2169-2189 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"656e979fb1ab1ac76f2c2c31d7d3c3520705c94357467f06e47a0546cd48be57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_codemods/src/utils/codemod_annotator.rs:269-298 | rust_port/crates/flow_codemods/src/utils/codemod_annotator.rs:306-342 \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":"rust_port/crates/flow_codemods/src/utils/codemod_annotator.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e6574958668f2b6da30dd5b092ab646335be84e66a2ab6259699766ea5ed3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:167-200 | rust_port/crates/flow_server/src/server.rs:93-125 \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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e992c99d712e123412c1f78ccb80235c5d4e845280f6e5cc3f69c1e0deb15e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7698-7731 | rust_port/crates/flow_parser/src/ast_visitor.rs:7832-7871 | rust_port/crates/flow_parser/src/ast_visitor.rs:7931-7970 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1acf013aa107126f3b9f6f6912b51f0301708c3dacf9654904fa5ad3a924260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3924-3954 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4010-4045 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3924}}}],"partialFingerprints":{"codehealthFindingId/v1":"527e84d574cbe0cf5d474752eaeba9df4c59f9d7822d031e6bf5de180a013192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7434-7471 | rust_port/crates/flow_parser/src/ast_visitor.rs:9872-9901 | rust_port/crates/flow_parser/src/ast_visitor.rs:16941-16969 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7434}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4042a7a0845842b753dadba2452477db01ae12d4a634508dab385f18e25fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2820-2860 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3303-3337 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5298-5330 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a929737028462791321a15a9e99202e62dd7118bb48de15c5c0859099a7bd8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6349-6373 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6592-6618 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":6349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd988cecd379a4de9ff5e79f42370ed18b847b2f307235da28e0cc174070b91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10467-10496 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5896-5925 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10467}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b90f67c4340207c16459f54e2bb46e4678d422d4bfa9b331804dc77fc4629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1760-1787 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1799-1833 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"caee24ca533b7b42f7fbf30f193a6021ad856fea60df6aea049a0a6fbee858dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:8772-8789 | rust_port/crates/flow_typing_type/src/type_.rs:8794-8811 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":8772}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a9d850480d883c441494e55bd30ce62cd426de410e3c09c01952ed2fc18fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15766-15792 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1990-2016 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15766}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e1f41ac415458074ac83a83f2df1352f09316c8e5527bd72017a9a5d995d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15952-15976 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2078-2102 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15952}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c85f8b52bb206376a0eb65a5598940bb011664e9d2b433c55de9ffa6bc3fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6465-6486 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6742-6765 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6465}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a1769ffecb60bc95c52bff9548877a9da3933d5e883a328ee722c6a78f3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_typing_statement/src/component_sig.rs:121-146 | rust_port/crates/flow_typing_statement/src/func_sig.rs:113-136 \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":"rust_port/crates/flow_typing_statement/src/component_sig.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5171f30f509375d47981e3d1101cb8b614f768a387160fac5b3b079411686ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2709-2741 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5834-5858 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5864-5888 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"27192b0fd3ce5e78fa9394c0d67a8194181fc3a778311baa1206acd9ceb6ef01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:138-161 | rust_port/crates/flow_parser/src/type_parser.rs:168-192 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b9b72359dc4c8cb1c0cd341ee46cc907ee84d606d17213e6d6d4f4cddd303"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:1560-1580 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1611-1634 \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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f1d686cfceeb97e0f34937d75bb28031b3a4dc2c2f8a6ceaa788c26df0ef77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_env_builder/src/find_providers.rs:852-869 | rust_port/crates/flow_env_builder/src/find_providers.rs:1313-1337 \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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb70f9becac0a6779357490b5327ab1acc710f4fb55a30d5bb07d31359e782c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:1077-1097 | rust_port/crates/flow_parser/src/statement_parser.rs:1103-1124 | rust_port/crates/flow_parser/src/statement_parser.rs:1126-1146 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cc1019836feea11bce0e5a2f1e4d133ad17ba95caad412e4220c04451d297f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_event_logger/src/lib.rs:884-910 | rust_port/crates/flow_event_logger/src/lib.rs:912-938 \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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03c5926fcca2f8fa464ccffcf13819fd73ac4384e5deccea8fbbec4e3a987dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_heap/src/transaction.rs:1688-1715 | rust_port/crates/flow_heap/src/transaction.rs:1720-1753 \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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff588db9bafb9e928575c79e657fbf03fd9bd770f535a3be5976fa2d3eb3d782"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_typing/src/env_resolution.rs:1019-1046 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5092-5120 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"e779367f48dd80b6bb8ce5a2f7ce85594d3247168f2ca2711a43aece83d8d856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:1554-1589 | rust_port/crates/flow_common_ty/src/ty.rs:3148-3176 \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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"67151a94d02cd5b791a846e10d32058e1feb48f87434d1410a9bd99b1c1e93af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:1359-1377 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1965-1986 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed34d0248581dcbe0421b804be281dc92103914c97b128739a357ddc00e072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_services_references/src/rename_mapper.rs:243-264 | rust_port/crates/flow_services_references/src/rename_mapper.rs:266-285 \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":"rust_port/crates/flow_services_references/src/rename_mapper.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e7ee13668cc77e3501452d3c24d1bf3ce11e0345e87de616b1a96b3c0531f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:4654-4684 | rust_port/crates/flow_typing_type/src/type_.rs:4891-4921 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f7cf4e53b95396e332ce3b7a65592af8ecfd6abd511348c04b55d1b85d5d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1524-1545 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1579-1600 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1640-1660 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d2fc3a6f2aaa8bab831bf6fddc0d703baa3cf7ee7f8402fdf213b7d9e1e355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type.rs:442-469 | rust_port/crates/flow_services_code_action/src/insert_type.rs:533-566 \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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc69ce136590bbe7828efc0da5c47c14353957dd68330484f77e8337a389ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1223-1258 | rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1268-1303 | rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1313-1348 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"817348a78765f85f096a7475e5949daba8663d15552b182f0fb8844629fbcf11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:597-624 | rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:629-654 \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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"124397ef49c9526fe94277fb41db9ead464f761800ac6d4c630afd783c4b95bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2037-2061 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2063-2086 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf8fbb79de9f453c00f66ac2cdfb6c9f0a0cec84b44aef354cfb2b29451c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10811-10847 | rust_port/crates/flow_parser/src/ast_visitor.rs:11049-11078 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff3ab42f9c67300f89916ffaa0f049e549d42a178592cd65ae6a2fb1828c9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5447-5476 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5480-5506 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd4ec3c5e0279b571bb6c92184ca9dcfc8c891745be1882df2dd97d7c14796d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_watchman/src/lib.rs:633-666 | rust_port/crates/flow_watchman/src/lib.rs:688-712 \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":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae64d7ba2837164a198a428ad4e469a33f5207aa43cbf168a1fb64f286cc230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1948-1992 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2066-2094 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea84824280edd6581e45aa43f320d08b43848d2fc4d231dde0ebea48312ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:876-892 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:928-949 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1400-1416 \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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e35bc371705745d08e4cc1edb4c2d24ed2eb7738d2840b18700594ea477e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:429-450 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:483-508 \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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"86863e601711c361ef613128f24ec573ce37cae1eceb2e5c3c9ccb648281927d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_port/crates/flow_common_utils/src/list_utils.rs:49-66 | rust_port/crates/flow_common_utils/src/list_utils.rs:73-90 | rust_port/crates/flow_common_utils/src/list_utils.rs:101-118 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/list_utils.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c29324831207761321e5d735957ec025b4fa3fe0ad7b17e7d7edf3dd0aae33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15894-15926 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2043-2073 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15894}}}],"partialFingerprints":{"codehealthFindingId/v1":"767f520b4f797c9a320408089deacf755ec14ebd1f6a5618149e4ec4e1a3e136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3682-3702 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3708-3733 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3682}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fef144388e9f454033413d40d07978bbae288090cb2c49c2f61e60c2fa083a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:675-694 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:762-780 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7acac1dbf54bc415f716ff1ba2d264eb513880c7cd18d99aa82b6a0d18b6629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:2080-2096 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4544-4560 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9774ccae1c4a771dbbfa0937b2fc29cc2ba4fcdb647ee368901c7580ea7dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:4833-4865 | rust_port/crates/flow_typing_type/src/type_.rs:5074-5108 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b38ebc661db92e518e3f7f242767d4622126175fbffe44e223a4124a8a93918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_typing_utils/src/speculation_flow.rs:114-136 | rust_port/crates/flow_typing_utils/src/speculation_flow.rs:153-185 \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":"rust_port/crates/flow_typing_utils/src/speculation_flow.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8588d9d3b5984eb7374c703e8a472613993cd84a4765368192c0d04975b50920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:1157-1176 | rust_port/crates/flow_common_ty/src/ty.rs:1657-1683 | rust_port/crates/flow_common_ty/src/ty.rs:3237-3258 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"040758ae23a106281273fba79f3cbc31bef39cf9d09ea96d062d59b4c4eca4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_common_vcs/src/git.rs:81-99 | rust_port/crates/flow_common_vcs/src/hg.rs:90-117 \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":"rust_port/crates/flow_common_vcs/src/git.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde93ebc9b886652572950d1269e7235aafee7ddb88c297b5e7ebb7a8d15cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:583-611 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2982-3014 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c36096e95ea67d87890338b36fb054a193c7c53756f81e206f79172831c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_command_utils/src/lib.rs:827-850 | rust_port/crates/flow_command_utils/src/lib.rs:855-877 \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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"47604d30d38c83b1b48aed6cdd13d1138e336043656763608b6c2c2521bcad2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_common/src/files.rs:906-928 | rust_port/crates/flow_common/src/files.rs:934-962 \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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c39c5aa5513ee77aaa0fc1ee1ddfb359e2615ebf7fcde8e9a93c303b56896a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6428-6466 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7726-7767 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6428}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cbd041a2c33419200b9fde0c7d8a5d33b265df31165573a1dafd572261b148"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:722-738 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:807-817 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"39da8a569f57fcc97796d8b2812b230329569132d03e0afec135d0d0c58d9a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 32\u002B corresponding lines): rust_port/crates/flow_cli/src/agent_helper_command.rs:101-132 | rust_port/crates/flow_cli/src/autocomplete_command.rs:27-63 | rust_port/crates/flow_cli/src/coverage_command.rs:20-56 | rust_port/crates/flow_cli/src/dump_types_command.rs:16-53 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 32 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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd4d24b6ec435d9e2a2cb6956213885eb584606e5419e57d368f0973faf5be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust_port/crates/flow_cli/src/foreground_check_commands.rs:375-398 | rust_port/crates/flow_cli/src/server_command.rs:14-35 | rust_port/crates/flow_cli/src/start_command.rs:16-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/foreground_check_commands.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba45c2751d60cb9ef0f534329325af2503168962668aa632e3a7b1d929b166b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:1907-1924 | rust_port/crates/flow_parser/src/type_parser.rs:2039-2056 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8f00a0d8952693d70670a06b3496415c1db9f51860b1930f311e8d25a788f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:4731-4764 | rust_port/crates/flow_typing_type/src/type_.rs:4970-5003 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4731}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bff5bf6bd9bf8256c5b4fd6fb1e8b022e1daf1ac167ce98a123b50277a2d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9159-9181 | rust_port/crates/flow_parser/src/ast_visitor.rs:9238-9267 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a0e3968c93f3aac24c493631fbf53512a5b014f97bdd72685e7e6c5ee1e7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/enum_validate.rs:303-326 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:328-351 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:423-446 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55cb9ebad120709d7207690f11ef706cf6dc504a3fa3ff723188c54a3162024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_hh_json/src/lib.rs:124-158 | rust_port/crates/flow_hh_json/src/lib.rs:160-188 \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":"rust_port/crates/flow_hh_json/src/lib.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64caca92203600643f45eb844c21994c37ecc024e9c6c324c924a3d5d7c2ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1127-1143 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1149-1168 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9ee0e554c88a5482a1bce8e10121b64136fd83da8916925f02279b62f0b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5424-5450 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5543-5578 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7f30805eb2f73cfa3ef88e668f0bd5aec107ad6c2657211d6d189bad3a4e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_type/src/type_util.rs:2685-2703 | rust_port/crates/flow_typing_type/src/type_util.rs:2709-2725 \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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"741a013416cbc1b5039de7aad8a8dafa4dcc96803615f616346e05a56e870a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_common/src/reason.rs:785-807 | rust_port/crates/flow_common/src/reason.rs:809-834 \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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31b6125251ec743a99aed0a59230df50f3e6fdc3fadc44977f45f953679681d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:3761-3781 | rust_port/crates/flow_env_builder/src/name_def.rs:3789-3809 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3761}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f61427f9cfa7b7254657c895ba25cdcc70feb9c91b35689fc3b0fdaec0f697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:497-520 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1577-1603 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85e23fd5dee70c6411930512db14634e4b36b9e354bbe82e92e1ea849bc333f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2283-2302 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:4894-4917 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29b227c18080059c55e37b1ee94f9b7a20392602b6e507db211f655d5fe51e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:547-569 | rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:366-388 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbee6f0605358e159b4a7e88d6309c3381288c3613870ce2324034ef86eed54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3634-3670 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3900-3940 \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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6596f60b0da701e30ccba52150ad178f77298f07c87c2a41afb8548683b152d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_common_ty/src/ty_printer.rs:706-733 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1343-1369 \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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eab000d5d1ae591650ffe863154fae2a97fdbe059ecb7483960e5b44a09dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser/src/comment_attachment.rs:400-415 | rust_port/crates/flow_parser/src/comment_attachment.rs:616-631 \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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec0a9f7e5c9f86284106a010de06a807cb1aee11138bc2aae6072be695a3ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:89-106 | rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:111-134 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e161c2a001e6872a517b566468fbc5bed898d0730b7d103eb9095635b00c571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:2516-2546 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:2555-2592 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c03ae777fadada00f2d726142bad0f6c8537ef637f97aa17fdc803ffda9881d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10907-10933 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6224-6250 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10907}}}],"partialFingerprints":{"codehealthFindingId/v1":"508442827fdbb1e71c56c804f7a04445ab75a6eded64bc1e6855005c3f753f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3541-3573 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3848-3874 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5554-5577 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c21e9c5e48732fb941a3a3f0e037df30ec1dee80e82ae872e135b7e65685028"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8536-8564 | rust_port/crates/flow_parser/src/ast_visitor.rs:16906-16935 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:752-780 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeaf897d66d7b992ff25dc900b46bc9d9e3ebedbd0adc568b89cf69348a92f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type.rs:988-1021 | rust_port/crates/flow_services_code_action/src/insert_type.rs:1122-1156 \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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3238a300643dacdf70f65a43acff0a33ceb828762b44a915dccf0e8463704b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:865-880 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:894-909 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a72cb2abfebf28c224d7991ab47eb07b58a69bd1cac1e07d2070c6a727b020"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:133-151 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:182-200 \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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"78244f487b8e6a7e4caa4480e9580f45f8f218650e5bb4f288e5a4a02eb074cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:513-530 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:558-587 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"18471c9c55bb488dcb2bc1471985ec145db14d6392d30562b8c4eee4e0c38755"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8961-8986 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8993-9016 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8961}}}],"partialFingerprints":{"codehealthFindingId/v1":"283271dc7773c0b2e1dd70621c7ccb5ca8094fcc1b69f1211e851e173048abf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:18376-18396 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5595-5621 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":18376}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f0229d6a6c4ebd1113c5a7c09d7a01f1007cd23d0cd70fbbac3198fa05076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser/src/jsx_parser.rs:53-70 | rust_port/crates/flow_parser/src/jsx_parser.rs:85-107 \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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2d255df74183d6724438fe9f280d33b50e86b85c7eadb57d68c37214837760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2492-2516 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2522-2548 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc8785e37ed46caea1d5212489fac712da402d98ef651e0eb8a05594827d185"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_cli/src/check_contents_command.rs:23-50 | rust_port/crates/flow_cli/src/foreground_check_commands.rs:325-344 \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":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"010dc9e27b77855076d5a5c00db5cda7752328e18f7d2a80dcdca863af5dd77a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4790-4810 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5318-5335 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":4790}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da0034a9767d5895fae54899d06866d2f5aa732b458fa54362cd24d881673c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:2706-2725 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2743-2757 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5751a45cf8b2b5f582946e3c651646cc1228fe32f3cdc24581170b7433afd646"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:71-86 | rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:88-106 \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":"rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c9786be6853299772425387b6babe00077534c67f60c28301d6a86025ddc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8924-8950 | rust_port/crates/flow_parser/src/ast_visitor.rs:10376-10396 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8924}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65f05ff9da9ba2c28e190976221661da2459f30eda07f105a5f203869ee5f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust_port/crates/flow_parser/src/offset_utils.rs:159-185 | rust_port/crates/flow_parser/src/offset_utils.rs:233-262 \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":"rust_port/crates/flow_parser/src/offset_utils.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed7bc2778684b04dab59c812fb91748771b6c759003e4c225c9db8fbff3334"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15154-15177 | rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs:541-571 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf44e8260aa807b5e06337612d3c29d950610022fcf4b2b8764cd8b15b0ef17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): rust_port/crates/flow_parser/src/expression_parser.rs:67-128 | rust_port/crates/flow_parser/src/expression_parser.rs:393-454 \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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed32f528319ed2dba070b840918a7cba705e748f79811fb53ec232ee6b48c4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2194-2214 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:9940-9962 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa652df21aadb4984ba433e54d0bf010aee0457320e74fcee0e76c06064d526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:910-926 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:928-944 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"5937e71b54cac8d81909caec0677af175321ab6b7500fb8397ea8cb000a618ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:38-61 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1730-1756 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5266-5292 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3748d1eb2c42cae1f1cb736faef227d5b66832068e20e89ea0f63f2539ec4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3453-3478 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5934-5961 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c847595ccd185481ca7f92d12642926e454d2b374102b139f5a39e0a40f208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_server_env/src/collated_errors.rs:163-192 | rust_port/crates/flow_server_env/src/server_env.rs:106-125 \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":"rust_port/crates/flow_server_env/src/collated_errors.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d2c3ae65583db9460923c379e3087d12bcc04956377aa3501966b41356f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs:173-194 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:574-595 \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":"rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dec607e23ded5a21cb398224c040b1555db03b8f6b739947c20fd379b2eb2e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/instantiation_helpers.rs:141-170 | rust_port/crates/flow_typing_flow_js/src/flow_js/instantiation_helpers.rs:179-208 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/instantiation_helpers.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea49adb6df6286c47d49c252982e0598ef3de40f3c664ad1ae4aa644296e6935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust_port/crates/flow_cli/src/apply_code_action_command.rs:36-64 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:149-171 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:252-272 \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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c365c4c4f962b07a660ee738cfb7df092c28f07627232feb7357c0ac49d381c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_common_errors/src/error_utils.rs:4623-4647 | rust_port/crates/flow_hh_json/src/lib.rs:8-32 \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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4004d6bb57524715a0e919d8515384946ac51130b0e1b1e1a605b8397e85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8839-8856 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12079-12094 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8839}}}],"partialFingerprints":{"codehealthFindingId/v1":"04afdc10d7f7567d3c22593a6372e54ef3449a6dea21ee780d1d5d569e0fc830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_logging_utils/src/lib.rs:85-103 | rust_port/crates/flow_server/src/server_daemon.rs:200-221 \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":"rust_port/crates/flow_logging_utils/src/lib.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8f11cde6c860d51e985746be0c32a71b1a15960c4dded7a406b9b8cf68d9ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:1003-1019 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1055-1073 \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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e324ca16a69b2c228decf2fb251e9fb866ee4fb64ab6284c08a45a017031cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:196-215 | rust_port/crates/flow_analysis/src/ssa_builder.rs:771-790 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b550bd46f387492720f2c3c5e664b7f046069382662a0d7d35e1de3b644fe120"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): rust_port/crates/flow_config/src/flowconfig.rs:824-854 | rust_port/crates/flow_config/src/flowconfig.rs:1450-1486 \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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26e7af1c1f4b6a83c0423a1631918d36b8bf35e008ccb8a3d4ec231e02ba582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:678-707 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:718-747 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5c886d3a1c4e4b489410d67e1437d90686cc337884434919fad0a125af2d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1842-1857 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1891-1908 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ec839b899945847de4224f711618a2417ca54eeb69930a313330a0d489ca59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:103-124 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:157-173 \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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ae4394b0eac728d7c0f399825f327330113d7080efc5da3bb6ed8c6b80067"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 21\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2552-2574 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2581-2603 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2610-2632 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2639-2659 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2666-2690 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1321363e9b47a9ea7fe9fe9fcd7fbdec9a89c74a67bd9b8955101a4186c559e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3581-3606 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3850-3869 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8670b55e9ed0b63e713f108adca063d20ade3fc539a900b9e1cbf1551fbb7411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1516-1534 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:4291-4316 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aeabbbf8bd93c68eaee36ad4904ce69c3ffbf4ebe4dceba1b0e7c74da6fb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:268-284 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:419-435 \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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c431f07794abe053400cb712ea7bacfa0c2ac0302f465426a574478140163458"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7191-7214 | rust_port/crates/flow_parser/src/ast_visitor.rs:16327-16352 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84536c45ddad84c7983c9d3de7a6068e66f0892cd15635d3a5fa1b556165ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8207-8238 | rust_port/crates/flow_parser/src/ast_visitor.rs:8686-8708 | rust_port/crates/flow_parser/src/ast_visitor.rs:15257-15283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9bf8706524d204a2e1d21ee7a2816bb91499834bf0cf6304969e32365c4e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1761-1784 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5420-5443 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa362b0e312cea200a2d2674fbd6572fe3ddb36a915cfe2023ca69d1dbcfe86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:3194-3213 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3636-3653 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3665-3684 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd418b64dd8a2913170b97bac2ea36cb12b5e8e58d133806e7db6d1c416edc06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_common/src/lock.rs:60-87 | rust_port/crates/flow_common/src/lock.rs:91-116 \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":"rust_port/crates/flow_common/src/lock.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a54cc8b7880fd952d09310456ab657062bbc285bc735f925bd67b65ecb8f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13260-13283 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4801-4829 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0574d1038e98bc7d6212048a8fa818fe10e98f1b385e4c2ed13c46c0992b3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14600-14617 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:1161-1178 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9470a3aae5edfe08034293c302e3d19ed2fbd662097bd05c1f6cd34b2b4ca6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:565-584 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:589-610 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:680-699 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5076b871fd5c54a011153024f1f77d9365429e549f9f1363f8850c6e643b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12121-12157 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12658-12697 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12121}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a38a33cc681054b8b84870f8a0df12ff4efbbe7a783e94d31f75fb5c7033d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:5967-5990 | rust_port/crates/flow_services_code_action/src/autofix_type_to_value_import.rs:52-81 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":5967}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5d06e5ee187d48656868d7de0e5af7da88340dcc6cdada5aab0d3ea094815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:852-867 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3045-3068 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee00a0b1f20d7aa4af34f56be47fca60f5b023f5b6332d02392e1579fa3ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6316-6342 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6567-6585 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":6316}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c40755a693facad9226ce8ea04e2559d8d50777d5358f62dcfa1a3f3958d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13566-13594 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13674-13702 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13711-13733 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9a3bae487b4024de715668eee1c14a35652fa200c36ef2ef28ecbbbb6cde2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:595-609 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:614-628 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:654-667 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8d1ce6a27904e8f19e639635be944f94011c7ce963d6d2587a4f1faef2bae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_typing_debug/src/lib.rs:4750-4771 | rust_port/crates/flow_typing_debug/src/lib.rs:4779-4800 \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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":4750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48f5f2150167a8582e605b967d3dca930b279e06a38e3d78909d0446e13e397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_flow_js/src/intersection_kit.rs:109-128 | rust_port/crates/flow_typing_flow_js/src/intersection_kit/objects.rs:195-210 \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":"rust_port/crates/flow_typing_flow_js/src/intersection_kit.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec6ba2c27e538df7adc0ed940a85bcb22032bcaffbb2d0669b8c4d62b9e455d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:1981-1997 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1893-1910 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6861cba52ee3182194d3bbfa6a2a845f1919af2eda27b7f3bbb94d913381fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4816-4845 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4992-5012 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec583a7683a0de579b67c6d648b608e260b1b21cdf29f88196f043b493f3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:516-527 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2822-2841 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87239405d2e03c34d49b58e6ed688fe427c05b0d6df5e5afcb067a3c73ace6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9925-9943 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4076-4094 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9925}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf284ab4646d8c0ff2aef4c7b6c2b3ff94120e0c2efd116144381eb3f14a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13485-13505 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1748-1769 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8823f15a58b55127f1ed8bd128444022aa7635ec142fc61d4e37dc0ee6cae4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_analysis/src/ssa_builder.rs:1039-1068 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1075-1099 \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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad143ce0072eebc6e78a81bef82513e72386bba4a432585d188de7ef6be6719"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:324-338 | rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:345-359 \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":"rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"82966654fc94c97cbaa926950ecfc414284e82fa52c87640f18b921fa3a664c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8278-8299 | rust_port/crates/flow_parser/src/ast_visitor.rs:8778-8799 | rust_port/crates/flow_parser/src/ast_visitor.rs:15846-15863 | rust_port/crates/flow_parser/src/ast_visitor.rs:16000-16017 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ddbe2fd6b38ebad98cd15ddb72d1ea4fbcccd08b1e09fd501edba83e93a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:77-91 | rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:107-125 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97a698435d0867f30ca3997fa34f70a7fdee73cba61f3b713524709e2be142a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5552-5572 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5620-5640 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5552}}}],"partialFingerprints":{"codehealthFindingId/v1":"0561aec4281f615af8cfab5e8c1b479d5b3ecaa95000fad856a31102086a09db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:337-359 | rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:363-382 \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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3468537b2763ec29fc2b2049516cd53e314d775e077c9f352f0a75a2b83305da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_cli/src/glean_schema.rs:125-136 | rust_port/crates/flow_cli/src/glean_schema.rs:550-561 \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":"rust_port/crates/flow_cli/src/glean_schema.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a8c2bcad0a4762438152f7132d1d3a474778548faa2aabeebc3f99ad437a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_codemods/src/annotate_exports.rs:251-274 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:201-224 \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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"abefc6b01032ea184c5c3fa0d71a670ea06884a84f0cbdadb5f1df112e62f1d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3505-3528 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:7028-7048 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3aec623d7d5f6be9de66801c3cafd7872c6cb42603dbb37f484fe520bd391e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1258-1282 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1351-1378 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d922c9496f0fc24b0ee4c16c2165f5d74580e48378f180a386a37e350b7c61b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1301-1317 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1321-1337 \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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f6393816543250ff174582da88e7073f6e963761a97a6ba6ba66b040af0230"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): rust_port/crates/flow_services_code_action/src/code_action_service.rs:3403-3432 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:3450-3472 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:3493-3518 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4257f4dbc15c8dbdfe7020f8a9534cf2aa1b62a5a329eedb54cf095d564340"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_hash.rs:158-175 | rust_port/crates/flow_type_sig/src/type_sig_hash.rs:183-200 | rust_port/crates/flow_type_sig/src/type_sig_hash.rs:207-224 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_hash.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ac50425b94ae68a0219cc926f9b8925bed359d6141d99998881e9ef0f04bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:117-142 | rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:55-79 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe63961f0bae9a68afeacffe233838a7c865edd1b4e1e34d14ae115f17a0b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:679-702 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:726-743 \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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"917747dbfdd0630b2c541f38813193336865811656017df03049621369f1a38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:736-752 | rust_port/crates/flow_env_builder/src/name_def.rs:786-802 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc93de810f82297140135b586259d861f4984347df42236fc801c89c3dfc10d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_utils.rs:358-378 | rust_port/crates/flow_parser/src/ast_utils.rs:398-419 \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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaddba77a5d1095eb41b219aabdfa59e55f1d41ee2bb74d76476cb1a6159bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:229-249 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:282-302 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e4eaa199fda7ef5bc839a3761fcce9a215bcac9a470ac4b4e5184c558443a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1305-1322 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1330-1349 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa280c78c5e3d001ed32612148d31c5e4c97ea1ab9fa079daed4e09f59a634a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_typing_context/src/lib.rs:1349-1358 | rust_port/crates/flow_typing_context/src/lib.rs:1379-1391 | rust_port/crates/flow_typing_context/src/lib.rs:1393-1403 \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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"153d0443f3ad6084730cfd41c8a20a420d0d88cb90812d4d540dcefb2476f001"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11281-11296 | rust_port/crates/flow_parser/src/comment_attachment.rs:355-369 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a806b1b50a001090c859769dd73c16788607010bdf74292627e637407ba4b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7328-7345 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5625-5648 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7328}}}],"partialFingerprints":{"codehealthFindingId/v1":"318fde99fd820fe390f5d7f4dd4a9f131238fc2028cc7b9448b3a0bc3a80b11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:3811-3831 | rust_port/crates/flow_parser/src/estree_translator.rs:4210-4230 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a95b8fda21c84bf109a50d5d88f7950d4555928e3d39173303f860090938b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_parser_wasm/src/bin/codegen.rs:402-418 | rust_port/crates/flow_parser_wasm/src/bin/codegen.rs:439-469 \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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1653078f5b1049113396258d6977a019dbf56b24d52f27e6c5667dc9a913862"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3677-3690 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:6102-6117 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3677}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c57a87a1cb816a6fa1beaa25f4b3d6131351836ba6deb1102f8fe4757e4f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14690-14710 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1412-1430 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea3f64b1ba97610fb448626eba7afcc5105be488fb5341e5013d5e8f1d0f582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1997-2018 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6043-6065 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6115-6136 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"686fa8af86d05f80f5df156fc0b9836d543bf8407c19efc8e683c721463a7cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:1184-1197 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:1203-1216 \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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8a49ec5a0c0bff61a509880c8e64410827d2fd684c249142c90efb59d3368a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:92-106 | rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:197-214 \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":"rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba609f53d2828c527d4bd3e6aeffd3d46417f9c7ebe02a373aa405bd84225818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:247-265 | rust_port/crates/flow_analysis/src/scope_builder.rs:273-292 | rust_port/crates/flow_analysis/src/scope_builder.rs:300-319 | rust_port/crates/flow_analysis/src/scope_builder.rs:326-344 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"04642ed9faf5a1fb3a6c435c3b67cc6d1b1342ea8069c9a9cdb8c4a02759eac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3975-4003 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4066-4094 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4165-4183 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"803a03d5de0338aa313e0e185886f0cd6069582c4dc9007019fa637966873c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4273-4297 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4374-4395 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5538-5558 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c00ae6c2e4fab07c194be21b888d04a6902b1529ccefac95e1aa9ec1607aaee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9048-9061 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9067-9080 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9048}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412910e456db7f228c839ee05a91d2be1d12da3ee8ed2336db930a1864020ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2036-2049 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2148-2163 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"4691161e327190f33ccdd68ca0ab89969683470fabcdc6e680d3fee010e87088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): rust_port/crates/flow_cli/src/codemod_command.rs:436-463 | rust_port/crates/flow_cli/src/codemod_command.rs:549-571 | rust_port/crates/flow_cli/src/codemod_command.rs:706-733 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"417a7dd803ef697e9cb35afed9f1638af839da28938fc00f56d4a7b3d164f5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_lsp/src/lsp_fmt.rs:509-521 | rust_port/crates/flow_lsp/src/lsp_fmt.rs:532-543 \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":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f2eddfe2f400ef5f31834ea9f266de27a5395c38c633ef811d4f81e01ae81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1215-1239 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4131-4157 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6086-6107 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f70b0a450012bea2cba5cab55e7787f1834d36260604e8d1067c3d2f044b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1381-1395 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1602-1615 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a5152046237a50efd7c04263dd2cec6fff74362410778019f9ab8de6057e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rust_port/crates/flow_cli/src/cycle_command.rs:11-33 | rust_port/crates/flow_cli/src/graph_command.rs:19-49 | rust_port/crates/flow_cli/src/query_command.rs:13-30 | rust_port/crates/flow_cli/src/save_state_command.rs:15-42 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/cycle_command.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f0dbc9a0f2a7b82e6d2371a6d72097bdea33eae3044beb6228bc9d27483b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_common_ty/src/ty_utils.rs:527-540 | rust_port/crates/flow_common_ty/src/ty_utils.rs:542-555 \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":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ce8eb837941f432bbd1e62b7dd51f5238fad52802c40f35be77dd405de7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10957-10979 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6302-6324 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10957}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac57e9721ade921cf734b0b751831b788d76abdec8f1462929db08bf66c4d68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14052-14069 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5086-5102 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14052}}}],"partialFingerprints":{"codehealthFindingId/v1":"829636cb4621f73d0461f575e7f4fa4e84403d47e758e953c747d5f8d88b4461"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:307-327 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:339-360 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9df8e55b7b58883deee074acc3174fce59df28c5232fa6e5a553f103c07487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:4060-4088 | rust_port/crates/flow_parser/src/estree_translator.rs:5704-5729 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4060}}}],"partialFingerprints":{"codehealthFindingId/v1":"97638bc7a3298063fc82122fd7ae8dad62aefb89671a8ccb0f48551bf6da88f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:894-910 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2239-2257 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fc276e0f932a793e9b51545b9e3d8f22f8ddec3df90fd070fb890e972513f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:780-796 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1326-1341 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"42587923ecd92d2904077e769dbb53e53abe0b7cf476e21db5591c31b467b98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:2916-2931 | rust_port/crates/flow_parser/src/estree_translator.rs:3997-4012 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa0b244c4c4cc0fd4b4bc670772412799b6e7a92d6270af1014cd86b1892ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 18\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1004-1024 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1143-1162 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2310-2333 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2553-2576 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2608-2634 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2870-2887 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdc7d00852d868cca3a09c58d740207ad81d7961128dff34bcf9a30f74221ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_server_monitor/src/file_watcher.rs:507-525 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1219-1239 \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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c09032be1a4b9032e3b849b025b23a5de9c83ac765591867b30321cf19da970"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:2867-2876 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:2879-2887 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6868ac64218821d268ebbfd729213323bae9228013609e20c5aaa4687f3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9843-9866 | rust_port/crates/flow_parser/src/ast_visitor.rs:13758-13782 | rust_port/crates/flow_parser/src/ast_visitor.rs:18352-18370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9843}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b48c42ee6eca240e17be83dff2e95e42399fd0b2eb445f640d2e46bfc462ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 18\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2021-2038 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2135-2152 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3347-3366 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5875-5892 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6111-6130 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ca37ae8993ceab1a1bed2b5d0f754b0fece92f2a953c835f31be65752f141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:553-576 | rust_port/crates/flow_type_sig/src/type_sig.rs:668-685 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fb725cf51eca5783738370cb1f2c69b0475a1e9e6033428542c4df5ad74596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7542-7560 | rust_port/crates/flow_parser/src/ast_visitor.rs:7752-7770 | rust_port/crates/flow_parser/src/ast_visitor.rs:7989-8007 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7542}}}],"partialFingerprints":{"codehealthFindingId/v1":"68903e74d136a039cc234f6f1f8cd712c02c837f5e56f8f9e026f523c3c28601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15343-15359 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5400-5416 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e53e48c9384ebc708035d257f702b0a90471d835cf1c136e684ed9215341f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:16428-16446 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2276-2288 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c455197b48642441f13a0d8e6759c146e5e53565ec9d8ef16fadedbae13a5cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:95-116 | rust_port/crates/flow_services_inference/src/type_service.rs:2519-2534 \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":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9247c1356471fbfed6082b5a57a02392a6c7a1b2530882c3f9a6e5c0111ffcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:578-587 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:663-675 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb083c7143acacb8c7e31a55e584c32c80584681539f6d84aa1c0c6cc9f15f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_services_code_action/src/autofix_renders_variant.rs:350-365 | rust_port/crates/flow_services_code_action/src/autofix_renders_variant.rs:381-396 \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":"rust_port/crates/flow_services_code_action/src/autofix_renders_variant.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3182215c6df0356b4389194c66b81fbde6a7827f946bbc2503f7f9b2fe108013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type.rs:185-208 | rust_port/crates/flow_services_code_action/src/insert_type.rs:246-268 \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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc024850149e770eba0916c09ecc70f77e32fb03a6f5e827d20134f456cdddfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3401-3418 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3572-3588 \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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ccc982f118a4bb064a071e4e5f2e7811f6156fafc001e20e993cb3b0c478f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2273-2293 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2295-2313 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2315-2334 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bac7a2421f3ce6581f19c193d894668d762325b46a2f184f596ae3d4e46e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9307-9325 | rust_port/crates/flow_parser/src/ast_visitor.rs:18567-18585 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9307}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca80e28874009cd3a4aecee6164ac74689a8020843f24280dc4487a17cb39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14236-14258 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1168-1188 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14236}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdd0b6d0ab609ad2a62e9f0704db447d9581b931de2250747fc3a49df8db12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1700-1715 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1729-1748 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1801-1816 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1837-1852 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e5cf3fd3c165bf5cbea2f47c7e36c1d175aa7adc482fed06b512e1ea800d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2258-2268 | rust_port/crates/flow_typing_type/src/type_.rs:2353-2362 | rust_port/crates/flow_typing_type/src/type_.rs:2727-2735 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1ff5293d4574fdcc7089486b3cdc808b90d99b2484552dbe6310507b40b0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:285-299 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1010-1027 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af5b6e20ed66b51539aa4fbdfee7bcc140ab57603ec144f34c28323040522c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7673-7693 | rust_port/crates/flow_parser/src/ast_visitor.rs:7803-7827 | rust_port/crates/flow_parser/src/ast_visitor.rs:7902-7926 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1963a7d9b204371983300b2534fbb6cfbbcb99bac560737db0e7a2f0ad7bfbb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8033-8061 | rust_port/crates/flow_parser/src/ast_visitor.rs:8084-8106 | rust_port/crates/flow_parser/src/ast_visitor.rs:8131-8156 | rust_port/crates/flow_parser/src/ast_visitor.rs:15430-15451 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8033}}}],"partialFingerprints":{"codehealthFindingId/v1":"09412a5c33d53419983f8bca6b2cc94b8da656780ee581de9a6fec3cd74c1e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6447-6461 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6724-6738 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce835c3546b86b12b088dca27e189c1636c452aa53649806f049b15a829c258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser_utils/src/ast_builder.rs:1755-1774 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:1814-1829 \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":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c15818f6e884eece563a4d47c77f7e120caf02cf7884fb477e03b3db9f9116f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6488-6498 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6767-6778 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6488}}}],"partialFingerprints":{"codehealthFindingId/v1":"053185cf4bd555fc3780e479fdefe8b0309ba884e60d3836b345b25f49369a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs:463-480 | rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs:482-497 \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":"rust_port/crates/flow_server_env/src/flow_lsp_conversions.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1c29acff4545818cad2103531b6f402f06ad60aff1c7716932fdc5e2d084fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:77-96 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:137-150 \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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ec9fb54a9a05d670928a85e1c507b7bdadcfb8846ddd466b5bb4b348ee7193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11021-11044 | rust_port/crates/flow_parser/src/ast_visitor.rs:11525-11545 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11021}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ccf45d3503dcce0548a50ed28f68981eec9d5941edfff0b0e9cb428588e09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15385-15406 | rust_port/crates/flow_parser/src/ast_visitor.rs:18116-18137 | rust_port/crates/flow_parser/src/ast_visitor.rs:18161-18184 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15385}}}],"partialFingerprints":{"codehealthFindingId/v1":"466e56420804c4493ef0a6b84724a4330e54b6ce2176a3b8f281ed51359ebec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1708-1725 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5244-5261 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5533-5550 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"d551060f805b477e3010ca4e05491282ab89b01c50bbb0180dafa2e8e121794e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6386-6405 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6409-6429 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4915ede00069fca6672d0654ecfc4b847e8dc3372e729a3a9eeb0c466621dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:273-288 | rust_port/crates/flow_parser/src/type_parser.rs:331-350 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5aa11780a9368d9466595f81ef040534cf07c03786573c1de2baab0aebb239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1728-1740 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1796-1808 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab4e1c249a856a7c2d495c68142c1f6bf2d3feb7d502b78c408a1505663fed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:757-776 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1658-1677 \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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3749343cedc7b3c0182ec2262f0e10b7e735fa7140bad2e10177f7da73b27e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8734-8753 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6134-6154 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8734}}}],"partialFingerprints":{"codehealthFindingId/v1":"303e3a618505814ffc6aa01a5b6c6f74910043685250d8c38081681718d2a843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6579-6599 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6617-6628 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6633-6644 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6579}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a394d0412a16f633fd6db7d0c2e1f1df520ad0b45421cb7435ebc837a79ad42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:612-631 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:796-815 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:832-851 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac850b5a01b91fda304e7a7fa56ce8af596e17b9d3432c85b1be6a13e9d36669"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_type/src/type_util.rs:2558-2574 | rust_port/crates/flow_typing_type/src/type_util.rs:2576-2593 \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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"079c22cf81f8c00460b76db54d8083a5b73f4375df208c759091317136803f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_monitor_rpc/src/monitor_rpc.rs:128-136 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1720-1730 \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":"rust_port/crates/flow_monitor_rpc/src/monitor_rpc.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"de12861ef845779fb4024bfd16598803d6888e88d5c868c19379b85b131acd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8321-8341 | rust_port/crates/flow_parser/src/ast_visitor.rs:9101-9120 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f82226bddb81b2c80f9efb35dfa43ab38b5469350890daf176937d85ba104d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11460-11478 | rust_port/crates/flow_parser/src/ast_visitor.rs:11501-11519 | rust_port/crates/flow_parser/src/ast_visitor.rs:12236-12254 | rust_port/crates/flow_parser/src/ast_visitor.rs:12276-12294 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afc767b05294302867367e67534f6b264161ab4e21feeb80aa3d6becc503bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3370-3392 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4370-4392 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4554-4571 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7a6d4e391a05634177ba38bf8bb58a8373a189d0b852ed455809580c38cb48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:1796-1809 | rust_port/crates/flow_parser/src/statement_parser.rs:1919-1932 | rust_port/crates/flow_parser/src/statement_parser.rs:2069-2087 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"17547a4d6013f87c3c82c3e82bb520e3400db613888ec4af7756c2f79a5e4bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_statement/src/match_pattern.rs:80-98 | rust_port/crates/flow_typing_statement/src/match_pattern.rs:104-119 \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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fec0555056fa7c583edf0b9472f00bfea82efa7570c6b124dad37d06464cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:976-991 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:996-1009 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0ba21d7461137f483b7a3d4efb2b680fa628058c521f6cd935894f777f9d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_typing/src/typed_ast_finder.rs:833-851 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1268-1286 \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":"rust_port/crates/flow_typing/src/typed_ast_finder.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df5a650c95f20da761ccc13bee20a3357ebb41675b6c7d4190b88062e7828eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_typing_errors/src/flow_error.rs:182-199 | rust_port/crates/flow_typing_errors/src/flow_error.rs:375-392 \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":"rust_port/crates/flow_typing_errors/src/flow_error.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5785ac12407e06d9cc1829f5a399a1a0c08c7fb64f71fbf959dcf8797ac207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 33\u002B corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:1609-1646 | rust_port/crates/flow_analysis/src/scope_builder.rs:2141-2176 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6151-6184 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10682-10714 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 33 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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f658b883298158419667a8493d1879e11f21d75d88396345eed0e72ee6de611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11929-11949 | rust_port/crates/flow_parser/src/ast_visitor.rs:12453-12464 | rust_port/crates/flow_parser/src/ast_visitor.rs:12487-12498 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11929}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb7d508199a72b081aa3a265ec4e0b3be02ecd5839434c7bba6ec391b620d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1431-1441 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1592-1603 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f00682597ded5dc81dc289db507d5445da6af9fcd6169f3ed6b4b9e65e2e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_services_autocomplete/src/insert_jsdoc.rs:128-143 | rust_port/crates/flow_services_autocomplete/src/insert_jsdoc.rs:149-164 \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":"rust_port/crates/flow_services_autocomplete/src/insert_jsdoc.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab05f28c4a4bd6f71f7ffde6301ccc277ada4fc487013d6804dabd3f9536d17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_common_errors/src/error_utils.rs:665-675 | rust_port/crates/flow_common_errors/src/error_utils.rs:679-689 \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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23698abd5d5663142bb39396aad11da83e6314e680fe960679e6221294ab03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1258-1268 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12017-12027 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12772-12782 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b21b8887394a1b5764e1102f2019d96aae6c254f55fa1233b77b8802554573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:437-446 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:610-623 \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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"513172a3518ec9b5355595141f3c00c4733cb215eff7c88637e7ef98c0eda327"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8179-8201 | rust_port/crates/flow_parser/src/ast_visitor.rs:8663-8680 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8179}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a395fa127cead4da4ea26dc585f7738c7342aba8361e44e2b4b3ec0025fcb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8858-8876 | rust_port/crates/flow_parser/src/ast_visitor.rs:18725-18744 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4736afb70ef2c092b5206375c32f2fa5f54cf0bc05a35a8e7f0f5dbb6ffecd44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15868-15889 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1248-1269 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80a83a14fdd09079585640eb7e9c7a0eb31082e97ca56e52dccb0a80107d770"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:1384-1397 | rust_port/crates/flow_parser/src/statement_parser.rs:1580-1593 | rust_port/crates/flow_parser/src/statement_parser.rs:1653-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 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f355e9d85796510b89a27723f5e608f979a255e118c3cf533cfdf5f0fdb78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:2937-2950 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4308-4320 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17bb8e1c13e23d9a28e9bfe9ff4b64578435caafea0136912964cbacfc26c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:222-238 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:288-306 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fc4e14eb5cfc670673f875fa865f3aff7f1f7004c3dd871f708ab39cb97b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:435-451 | rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:700-717 \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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4931af03fea3343dcf6af7b439221686672505192745cebf684df8e2eb3a0fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_services_inference/src/type_contents.rs:449-469 | rust_port/crates/flow_services_inference/src/type_contents.rs:488-514 \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":"rust_port/crates/flow_services_inference/src/type_contents.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1511226315499ccdc525faa3a3e6852a347ee312028a40a7f80251ef62b9717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_env_builder/src/find_providers.rs:631-643 | rust_port/crates/flow_env_builder/src/find_providers.rs:648-660 \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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"756bc5990666591f817560d4a7f624b8d5c73f54c880c5f2a918dbdeac366405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7119-7136 | rust_port/crates/flow_parser/src/ast_visitor.rs:7494-7510 | rust_port/crates/flow_parser/src/ast_visitor.rs:13638-13654 | rust_port/crates/flow_parser/src/ast_visitor.rs:16387-16405 | rust_port/crates/flow_parser/src/ast_visitor.rs:16557-16574 | rust_port/crates/flow_parser/src/ast_visitor.rs:18219-18237 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7119}}}],"partialFingerprints":{"codehealthFindingId/v1":"80563e7aee13034508675202eddaf53ea65de77ae36da1867a90d4737cd5156d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:16131-16149 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2107-2130 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e8bbd25faacd608a178be7ec2e141d37978fea0786c80abd6863d87e8d048"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:625-637 | rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:763-775 \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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b143ca735782a1f8fe424f25887c459970b5eb358c0d4ebcff79993adba9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs:240-249 | rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs:303-312 \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":"rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8430cc22bbbd5f7090fceae5039ebd7c5b9cda8969c2b235925fdfebda2805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3731-3746 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3751-3765 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d3ea4268ed3b80728a470b94c39f7adad31d04df469d37dee15d54ddf50511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:4484-4494 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4500-4510 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4484}}}],"partialFingerprints":{"codehealthFindingId/v1":"755afc88028f92523ce558995b22754ce9e7450d2c7e06fe1a731513cdb1ae10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7545-7560 | rust_port/crates/flow_typing_type/src/type_.rs:7637-7654 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd023d3f67722f111716f8efe36db6290607a272a1a528b83592dbf01cd5583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:824-839 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2026-2042 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34080748b15d4b4e85f36dd739a9d2eea205ece0007b911e03bdbc550fce9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_config/src/flowconfig.rs:653-666 | rust_port/crates/flow_config/src/flowconfig.rs:668-678 \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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"4275a4277dcbe1d0dd40235cb97cb43fda89bdb513dc4b41919c2f46635ee7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_heap/src/heap_state.rs:558-569 | rust_port/crates/flow_heap/src/heap_state.rs:578-591 \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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5307751ce706d0f19c78596545b83096ab5a08db48f87591615e0fdc87447a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:6823-6841 | rust_port/crates/flow_parser/src/ast_visitor.rs:7157-7175 | rust_port/crates/flow_parser/src/ast_visitor.rs:16604-16620 | rust_port/crates/flow_parser/src/ast_visitor.rs:17950-17966 | rust_port/crates/flow_parser/src/ast_visitor.rs:18264-18282 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6823}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d361d232ddd260e59f8e675e70588d9ddb917dead80bba9ed6fc20808c8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:2981-2992 | rust_port/crates/flow_server_env/src/persistent_connection.rs:66-75 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2981}}}],"partialFingerprints":{"codehealthFindingId/v1":"292ebe9442d1ef8be5339fa9b637af710442935293ded26c5c066dff4bbd6b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs:153-167 | rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs:173-192 \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":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3777df6bb4be54bc887bee59bc46856d348cccc60152023085c7e6fa12e25989"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4242-4262 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4272-4291 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4242}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a2f33b9f8b744caf059e70c4445216ee7eb6a3ce05bde77eebc98dbd32dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:195-210 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:217-232 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:234-249 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:256-271 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:278-293 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/natural_inference.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b1e2624fb9ce3001f0b700aa2360f38f627ec8ff8442d3d1e334f5881294ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9626-9636 | rust_port/crates/flow_parser/src/ast_visitor.rs:9655-9665 | rust_port/crates/flow_parser/src/ast_visitor.rs:9684-9694 | rust_port/crates/flow_parser/src/ast_visitor.rs:9713-9723 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9626}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e330f7bacfad113cec8cf8299bd7a1fa18a4ee771fa11e577c90b58e92f73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14764-14776 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1451-1463 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14764}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e7f5243e4dd0ff88ae9822c4f11f6bd24331fa2deef05e9dc8ba8d63c6af13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:4129-4139 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4354-4365 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2566f4acb77e7de5633ce129b4b3fd0842e9c1aa6c35a45efea94dc3c174bfab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11603-11617 | rust_port/crates/flow_parser/src/ast_visitor.rs:11996-12010 | rust_port/crates/flow_parser/src/ast_visitor.rs:17840-17856 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11603}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc9385da9e572eee68ce6727bd9ccb76217e84ffecc617b79f03facdf465eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13304-13314 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4698-4710 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bd4fa6bf953cbc4a8b3d5d658e39205c786102ad3c13b9485fe43f5dbf27ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:1638-1649 | rust_port/crates/flow_parser/src/parser_env.rs:1655-1667 \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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"4570fbd95507aa73ff61c72ceb5a80350850025aec75bfd5b86bb2f018481544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1073-1087 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2909-2923 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3270-3284 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5382-5396 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5757-5771 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5776-5790 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41cea76946dfbd12b6bb6426d04538e6371e0841ccf4cd082d687094a87a4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2282-2297 | rust_port/crates/flow_typing_flow_js/src/renders_kit.rs:63-76 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b697f5463ba12b38035a7aaafcb1644a33a0e3076a946c2c9f06be7d0a96139"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5629-5636 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5641-5648 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5653-5660 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5665-5672 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":5629}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9b3c9d2e1661de96f330c0c86d9f2b3d3c75fc3049870ebb5bcfdeaf2b8a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1208-1224 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1374-1393 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1429-1445 \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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"57312c0d3f1b327f3b73ecd89202d96e98c88eb10b4b6e2965bc72b7ac8060e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:265-277 | rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:279-290 \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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaab5740532b66d163f8a8102efec53ea5ec2231976eb4bde139e4db7113b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2800-2807 | rust_port/crates/flow_typing_type/src/type_.rs:2871-2878 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d07cce1a42fb52a28fe848bea60006060347dd8d80122cc36fb45b1bfd1bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:331-339 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:345-353 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:452-460 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:518-526 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:580-588 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:628-638 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:646-654 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:660-668 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06723c2e2bc8a3afc075074f4216fd6f928488029f2714dc094528de6ce55df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_utils.rs:428-444 | rust_port/crates/flow_parser/src/ast_utils.rs:448-464 | rust_port/crates/flow_parser/src/ast_utils.rs:553-569 \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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d013eb3330a3113fbc561e875ef0a435db08d64f480bf74b767f2c40a8fbd7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:12436-12447 | rust_port/crates/flow_parser/src/ast_visitor.rs:12470-12481 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":12436}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996777d5088b8cd3546f04747d5dacafa5e8993790461c18021dc065fb62599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:16231-16243 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2202-2218 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e549984fe4c1b4241245593a3c4bce31f2962088e2745e66ef20579e149bbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3968-3982 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5050-5064 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3968}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dec1287d7300ae8101e52481e370bf6ed86ab1bfff6bfdcfd818ce49376e80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3368-3381 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3830-3844 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffc5cf878ea4bd03ae82f32fe964820b7c6f76766cbec8f0630743e2052b2ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_server_monitor/src/file_watcher.rs:632-645 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1379-1390 \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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce61f9d320e843913990cf1e377e869008d7401de78331de6c56d66c59dbe65e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:7783-7794 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:7803-7812 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":7783}}}],"partialFingerprints":{"codehealthFindingId/v1":"67972bf540a74b2b1df9ec5e8fe8e6e4ddf6222452e846964a4a20bc8d7bc52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1728-1746 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:2388-2406 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"106d41d883a25a54aac9c117b115ecc8de448e14090be0cae88d22032dfed005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_aloc/src/lib.rs:580-596 | rust_port/crates/flow_aloc/src/lib.rs:946-961 \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":"rust_port/crates/flow_aloc/src/lib.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f1d2c21ef6858fbcd8922f496f14a8801a50847603975a143c209deb54fe98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_heap/src/heap_state.rs:509-527 | rust_port/crates/flow_heap/src/heap_state.rs:597-613 \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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d31b65982da9ef4217db2863fb9dc76aa7ae0aaefdfe9e270374e18974fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11000-11016 | rust_port/crates/flow_parser/src/ast_visitor.rs:11310-11324 | rust_port/crates/flow_parser/src/ast_visitor.rs:14281-14299 | rust_port/crates/flow_parser/src/ast_visitor.rs:15623-15637 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11000}}}],"partialFingerprints":{"codehealthFindingId/v1":"534525e40236484ac11ca7b12e2c792670f148f892d4ac002d902b2ae567aa16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_parser_utils/src/ast_builder.rs:160-178 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:189-207 \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":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0575f79ab16ae726767cbaea3e77215aacd474a0a8784b8402390c65e6a7b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2023-2041 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3688-3703 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3708-3726 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d26c92cfc0824188bd06faa3156793f527610fc717fdad21090346e0f976f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2837-2854 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5095-5110 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ac1bee5cbacf282132ddf5ac19c32b0c5b1528d7c2f901c5efc464461aa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_typing_flow_common/src/type_subst.rs:398-412 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:543-553 \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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f3d55fda85825bc033b859313d446488b604ec30f9f11317d7bc27d8da6d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_typing_statement/src/component_params.rs:239-246 | rust_port/crates/flow_typing_statement/src/func_params.rs:136-144 \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":"rust_port/crates/flow_typing_statement/src/component_params.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"735d5ec9006a76465214d857ca39a56ca48f7bcd2cb1c9c543bf7f6e017528d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_cli/src/glean_schema.rs:612-622 | rust_port/crates/flow_cli/src/glean_schema.rs:898-907 | rust_port/crates/flow_cli/src/glean_schema.rs:951-966 \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":"rust_port/crates/flow_cli/src/glean_schema.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c545fd66affcc938e208bdc2a05c8f0abef493458c2f819f503d5d012c102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:2578-2584 | rust_port/crates/flow_common_ty/src/ty.rs:2591-2599 \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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37fbe1615b3a39180690e7b7200fa56d05bb8541aa4234a03cf82603c866c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:3022-3037 | rust_port/crates/flow_env_builder/src/name_def.rs:6199-6209 | rust_port/crates/flow_env_builder/src/name_def.rs:6431-6444 | rust_port/crates/flow_env_builder/src/name_def.rs:6450-6463 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a6d0a69f69a1cb8843dad0bc5bc4344dd11c4d2ac8feb6d35e81a9187cf8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_monitor_rpc/src/monitor_rpc.rs:138-145 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1707-1716 \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":"rust_port/crates/flow_monitor_rpc/src/monitor_rpc.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e30f5efc82c22155addcf72708ed2d58a45a17fb755f5d9a60ceb427af9562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10226-10236 | rust_port/crates/flow_parser/src/ast_visitor.rs:10317-10327 | rust_port/crates/flow_parser/src/ast_visitor.rs:10416-10426 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10226}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa14367a2031df100d776bb939b12b024d2ad5c0d4d4b9baf639ec4b8220ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:2976-3010 | rust_port/crates/flow_parser/src/estree_translator.rs:4019-4053 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d72e596af617a473282a44896ad38af4e8d48bff5782f871a7fe0810002723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3402-3416 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4833-4847 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36e8b74761aad639c51aaab25e794c0d2bfd7215c1ccdac327442241ddedd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4334-4350 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4517-4533 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6328-6343 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":4334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96bd99973347099a13918d2ba222b48f801d1113a419dc19f093e54d054d19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1192-1204 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1357-1370 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1413-1425 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"377a2f8da21ce525fe242134c707d850a1f214c6743f081f79f2293541db8185"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_typing/src/env_resolution.rs:512-520 | rust_port/crates/flow_typing_utils/src/abnormal.rs:64-72 | rust_port/crates/flow_typing_utils/src/abnormal.rs:129-137 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24f931a644502e4bf0615c6388c21d1577286b60dc8e95eaa89a2d691c524f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_typing_errors/src/flow_error.rs:106-116 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2351-2366 \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":"rust_port/crates/flow_typing_errors/src/flow_error.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"66868ac1acb4989d34cf194cb69bf7ee1cfa58cf0580b0ac30000bf176954734"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_statement/src/class_sig.rs:269-280 | rust_port/crates/flow_typing_statement/src/class_sig.rs:293-304 \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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af03844c0ab7be625c0936848411494c0270946e4c08c49dc767fcbc05bb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:6070-6079 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:6108-6126 \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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":6070}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc0cb09a8d96ac8725255bd5b11eadb0d6114b8f513a708748e0d61f5715fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7333-7344 | rust_port/crates/flow_typing_type/src/type_.rs:7349-7357 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7333}}}],"partialFingerprints":{"codehealthFindingId/v1":"797be214135b1ac16909f71cbbe7aae4d04af0593629dc901e99f62dda1547e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:18769-18784 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2789-2808 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":18769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f605d8e5c74c52c74da0eb755cd38ab164ce1d87c7d1d3d82d8fe58c2f4423c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:466-476 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2923-2936 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc4841614aeefb835223d1dc344304da3dd8ca5c38a6a1beb93c96541b3bae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:6638-6659 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:6834-6853 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":6638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6762c3e23bb2b376f190b36f4154506c793935947f5ff47ca9b197a88fd38d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:6775-6795 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:6804-6822 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"b838d6609dd968f0015af7a90d95a3b25a4ce10cd1d43a8f6a1227b36643d496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_statement/src/destructuring.rs:149-160 | rust_port/crates/flow_typing_statement/src/destructuring.rs:250-261 \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":"rust_port/crates/flow_typing_statement/src/destructuring.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdd452c7cb1ce3abd5cdf22c390b11147576c411b71d9674387f2aa106cca78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_statement/src/react_rules.rs:1167-1180 | rust_port/crates/flow_typing_statement/src/react_rules.rs:1185-1198 \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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7086287e8995aedb4a1a9940658d9fa43608b01626de85ebc0937e1bd98d672c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_common_ty/src/ty_printer.rs:1848-1861 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1867-1881 \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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0c0cf0d8f1e2db189f90c686b330f130a8e8e0128a91b0bb5af318e9c49475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:6862-6872 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:883-895 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44d6ba4ef73fa14c47b09328143d4d4a47c722f8679e56a3314c19f8411f404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:1139-1148 | rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:45-87 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1011-1051 \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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7af48fcede2eb75756c2f19f4405561f360d1008ddfebe234f8d150d7748fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:1681-1690 | rust_port/crates/flow_parser/src/parser_env.rs:1833-1844 | rust_port/crates/flow_parser/src/parser_env.rs:2273-2284 | rust_port/crates/flow_parser/src/parser_env.rs:2315-2326 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe307cf8f733ed897150ef3a2eaa2abf1d803d9bcfc6e2a7a1678e16041c0099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_server_command_handler/src/command_handler.rs:2994-3003 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3005-3014 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec353c8987697e5938be0da77d12a5807521be7e5659161ef5aa4e7a4302dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:87-103 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:101-117 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cebf6935547efd532b56ec86af0240bd1b619e5064da25d83ab431878d54efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1844-1853 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1859-1868 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b1cb497a437bacd714f4e7a2cd7cac551d29b28b1927758745f20b81bcc71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:224-242 | rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:260-271 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"42464be0de00e1be48a882e275c8893dd0f9a6688937536887fa3dbf20691e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3871-3882 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3888-3895 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3906-3922 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3932-3947 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3957-3964 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3971-3978 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3839802f387c1ef199087e162b0b60088328e4b9f8f97d5f89b6d450bc2b3245"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:226-236 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:243-252 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:466-477 \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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9e0030c2f45eec929ee3e2c60268912d3aca9a563885551f3fd30a0e600dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4254-4271 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4640-4659 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4920-4934 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5225-5239 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5719-5733 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5738-5752 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":4254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35b6e79a2a2b458611f833ab93c169f1b8aa894834fcb40c8e798898d017487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6691-6707 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6711-6719 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e877f75a391a8908d6345606478e2407f50a22737aa1a77bd0ecac7bca58d9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6149-6157 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6159-6167 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6149}}}],"partialFingerprints":{"codehealthFindingId/v1":"301389ba0a57045dd841a4519fb051119d08d4ae8f472d11dfce7484e9c29027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_parser_utils_output/src/replacement_printer.rs:51-58 | rust_port/crates/flow_parser_utils_output/src/replacement_printer.rs:92-99 \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":"rust_port/crates/flow_parser_utils_output/src/replacement_printer.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c3d9dd9be3b3a84d14890284413a5c8e00fdb6089377e13a578c5e2e4789f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:159-174 | rust_port/crates/flow_parser_wasm/src/serializer.rs:239-254 | rust_port/crates/flow_parser_wasm/src/serializer.rs:259-274 | rust_port/crates/flow_parser_wasm/src/serializer.rs:282-296 | rust_port/crates/flow_parser_wasm/src/serializer.rs:301-313 | rust_port/crates/flow_parser_wasm/src/serializer.rs:318-332 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c102e03331089d71e0faa3945d2e8d386082a6b5d64b93856ce78e48a294a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig.rs:830-845 | rust_port/crates/flow_type_sig/src/type_sig.rs:882-896 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8c4e443b59867a79e2b437324936631efd7bd2d7234355cb402a905168fafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_typing_context/src/lib.rs:3495-3501 | rust_port/crates/flow_typing_context/src/lib.rs:3506-3512 \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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":3495}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d795018dc8372c88e008e296f9b8ebe221ebf153f1b53adc54164fc8a49b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_statement/src/match_pattern.rs:734-750 | rust_port/crates/flow_typing_statement/src/match_pattern.rs:793-810 \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":"rust_port/crates/flow_typing_statement/src/match_pattern.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6606fc12004bc0e0203c4d33e0c403cbf6f5ffa7e63333060a96ce95133db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_statement/src/react_rules.rs:1898-1916 | rust_port/crates/flow_typing_statement/src/react_rules.rs:1921-1934 \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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"461d8543d4746cce8f6460d351a0ecc3446121efae5d321392e297decd96ada8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_typing_statement/src/statement.rs:1191-1211 | rust_port/crates/flow_typing_statement/src/statement.rs:14384-14391 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea496c72a1cbdf34b304b1b17738a0961ee42ca899dff11a168c14bd58ac0bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_typing_statement/src/type_annotation.rs:760-772 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1821-1834 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"790f00c4a57a57d238f5bd2d3c2a5febfa0d8f95dae0d17abda41d130f11c10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_analysis/src/scope_api.rs:32-40 | rust_port/crates/flow_analysis/src/scope_api.rs:44-52 \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":"rust_port/crates/flow_analysis/src/scope_api.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c6fb2cb389ffffaec6a011835286a77a3edd6497bce3f440b57491f102216"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_common_vcs/src/git.rs:17-28 | rust_port/crates/flow_common_vcs/src/hg.rs:24-36 \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":"rust_port/crates/flow_common_vcs/src/git.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c467e0c98ae68031a3ad09b99a74952f209ad89d43ab74a43ba67627b76c30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_config/src/flowconfig.rs:1559-1575 | rust_port/crates/flow_config/src/flowconfig.rs:1577-1594 \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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02103dae4d9eef80d61eec702bb6514ae144561d31eb559e3d6ef115ec1a784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8569-8583 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:787-801 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fdef9c3217707ff87c5f0e93ebaa0d8293287d35c2cd8ec80e1cfbe85796b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1029-1043 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3995-4009 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5511-5528 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3e6bb7f27a2dfdac4b4647cd9d2b161eeff2fc33a6ab3f4687ff160ec90e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5068-5081 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6287-6297 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d998b5d2ad34af2f5ac6ba61dd8eb914a0148440989cab258658082891bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3904-3917 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3959-3968 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4050-4059 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3904}}}],"partialFingerprints":{"codehealthFindingId/v1":"13adb2114d20eb7859849e084c0688e275eda0d4155e8cc394e90486eb8e343c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3687-3714 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3922-3949 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3687}}}],"partialFingerprints":{"codehealthFindingId/v1":"b188060fd25a145b257617a7ac8fbe7c9a42550f5e5a8016ea2d61705e5afcaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6099-6109 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6778-6788 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6925-6935 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":6099}}}],"partialFingerprints":{"codehealthFindingId/v1":"290c7eceb497a0b7e4795185a25e09597b6155dc459a8646a392257e7d00a59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_typing_loc_env/src/loc_env.rs:115-128 | rust_port/crates/flow_typing_loc_env/src/loc_env.rs:135-147 \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":"rust_port/crates/flow_typing_loc_env/src/loc_env.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d006637e509bf7eee1854faa5ab16e3b6677f3f14d9b0d8075dc06d173e0b4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:673-682 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:693-702 \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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6477d56cdb3f9064d9488ddf53ed0fde1307ef1298b0656755f9d640fedb79c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_common_ty/src/ty.rs:1591-1607 | rust_port/crates/flow_common_ty/src/ty.rs:3178-3188 \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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"51819fa65b79bbf3997377bbf83f5d4c1d6453f560b0c9af297e76f9037ccf30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11263-11276 | rust_port/crates/flow_parser/src/ast_visitor.rs:12015-12028 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06eef10efb721c13e846bc743a16a792b673c7b2ef60bb960b87674f237c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1902-1919 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1952-1969 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2183-2197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a31a80b45b5c87bcc03278af61566db38b6e9a677b36b97a695a48675d0ca49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:1403-1416 | rust_port/crates/flow_parser/src/statement_parser.rs:1595-1606 | rust_port/crates/flow_parser/src/statement_parser.rs:1670-1682 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe9854143307fea881b60c03681eae4e8f3d1c508876aa0dd383ac06817b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:1205-1217 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3157-3171 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d208fde5a756a22074c917de6739726edf5281f210e7edfbffb2bfa0ffa000e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:786-794 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:799-807 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef180b7a6c04aca3e35240759770429cfd1b11b943a4b74e1379cab06db927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:550-564 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1177-1191 \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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b400c73e7ec6f2dd0120f1c9bbaba3874ba5b382b0d15fdc709cfbe7bdbb6cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_heap/src/resolved_requires.rs:188-196 | rust_port/crates/flow_heap/src/resolved_requires.rs:198-205 \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":"rust_port/crates/flow_heap/src/resolved_requires.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23fbe37b50650c392ad152b347197465b6a252ca90efa50736744ce72d71132"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7099-7113 | rust_port/crates/flow_parser/src/ast_visitor.rs:16365-16381 | rust_port/crates/flow_parser/src/ast_visitor.rs:16534-16551 | rust_port/crates/flow_parser/src/ast_visitor.rs:18197-18213 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cc915225646cebf17fffe617c1279818a8b32b4e8eabfd25503dd750e1469b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10189-10206 | rust_port/crates/flow_parser/src/ast_visitor.rs:10278-10297 | rust_port/crates/flow_parser/src/ast_visitor.rs:13733-13752 | rust_port/crates/flow_parser/src/ast_visitor.rs:18647-18661 | rust_port/crates/flow_parser/src/ast_visitor.rs:18684-18698 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10189}}}],"partialFingerprints":{"codehealthFindingId/v1":"df05d5338efb12af9cc5b472721f6dc620b94e503ee503c9ddb561e0ff61f78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:942-956 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2713-2727 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2732-2746 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4851-4865 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5961-5975 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2060e5a149d3028ff8e458b829019cf8ac8f5376b56c2f59477ee1339c3415"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser_utils/src/ast_builder.rs:2075-2089 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:2505-2519 \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":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae9fd124b158e4c25f11fa423a8dc35a177b73f701b139e9561b3d62d128377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2046-2060 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4761-4776 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cf17e4d238cd8d0d160bc38ae726769536c9258392c1a991060f6c0bd76bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:7413-7424 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:7433-7446 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8b01090334207fe27082c384e3096126584abf3ad30dc08fa953bee6077f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6306-6316 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6318-6329 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6342-6353 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1d35277dc04121d3284cf42620aa7a94e7dcb09b5ae1a8269d0452372e1fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:757-772 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:782-795 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e345287d629c7d37c94d6606a1660e8862100b49cc843a7a4e01e42de9c0558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_cli/src/autofix_command.rs:154-164 | rust_port/crates/flow_cli/src/autofix_command.rs:325-336 \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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca090fe63fda5a6d8869c33b063adbeb10d2a0c8d21914003c4e15bda05eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:188-197 | rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:204-210 \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":"rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"93660d15dd8c79e5f633b14a1f4d28fc6f282b9e51d046ddd8df1cb8882186a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7787-7798 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3288-3298 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7787}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c973787151d71c4f88d80271fda7e2706bb863cde60614557fc4ddce6754e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14909-14920 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1541-1554 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86f2ee4dd515755f78c031f2fd756c2371b5f0da4ed02a921f52dd791b0884b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15729-15740 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1974-1985 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15729}}}],"partialFingerprints":{"codehealthFindingId/v1":"309cc010f3b358123fba0d6eb87b9f9578cdd582d57fc7f8e7abcc14a8c61889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:92-105 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:865-878 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2639-2653 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6649-6662 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecd905ac7f2a536372f3a8fbd1adfd61cc2bf973ee5b671ebfbe44c8c1c48f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7230-7241 | rust_port/crates/flow_typing_type/src/type_.rs:7247-7261 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8870b305551ee4ed2a5f7a4c1c5aec45fe469d4664b0b23cd896e68db932c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): rust_port/crates/flow_typing_utils/src/type_filter.rs:839-849 | rust_port/crates/flow_typing_utils/src/type_filter.rs:898-908 | rust_port/crates/flow_typing_utils/src/type_filter.rs:957-967 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b70def1854ea27686e8c3dd3ab1062eace79e84e257876287ddb85d0beef73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust_port/crates/flow_cli/src/codemod_command.rs:367-390 | rust_port/crates/flow_cli/src/codemod_command.rs:636-659 \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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad3699a3e757dab22151e45496771bd5dbf24d6e89d9169b750abc1e200d260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_cli/src/codemod_command.rs:396-403 | rust_port/crates/flow_cli/src/codemod_command.rs:665-673 \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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"59941ba647437a7d25a34774b567f0d25017d72734224b05d60f90de78f2c7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_common_ty/src/ty_serializer.rs:111-125 | rust_port/crates/flow_common_ty/src/ty_serializer.rs:127-141 \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":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218ab31675b2d7949f57e60e613cb72cb0e7347be65dbc00a9dbdf47d1052dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:567-576 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1396-1406 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c925f80743c29c76dd234241d8cad6ad9e0e226ed409e7d1f66c69f185bbeaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13990-14000 | rust_port/crates/flow_parser/src/ast_visitor.rs:16059-16077 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13990}}}],"partialFingerprints":{"codehealthFindingId/v1":"db643dafd8261afe0539b391eb92d8fa4d858fbdcc269ee33af8ba123805ba73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:587-601 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:900-914 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:961-977 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:982-998 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1113-1130 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1687-1703 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd291ff6713a36c05b75a81bc85813ffd99b5828305edd347eb30bea6b161124"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4444-4458 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4926-4940 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5170-5184 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6488-6505 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":4444}}}],"partialFingerprints":{"codehealthFindingId/v1":"316342ac6ad5bda532159f9ec7b104f41757da262867f881fd475a8779f0a22f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type.rs:155-164 | rust_port/crates/flow_services_code_action/src/insert_type.rs:169-178 \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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaca24e8557ff51fdafcd89ff2361936803c689b81a12bd6e8eaa1095daa2335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:722-734 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:736-748 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:811-822 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecae1477300a4adeb10d6d547b84e7e0f356e398a55d22aecf4425784298871b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:937-954 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1004-1020 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9712deb5ab6786029fe19d0d76547649091db60817a21379c4cea50c66e019"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7735-7744 | rust_port/crates/flow_typing_type/src/type_.rs:8251-8257 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7ee150539858ea73e7cedec9be5f546c6df511da57ff0c9de46089f6050484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:1953-1960 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1535-1542 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10424-10433 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a0f449914326269a84aa245a1479dfb339d8bebbccf864316c54fa5443f73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_common_ty/src/ty_printer.rs:1577-1588 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1596-1607 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1615-1626 \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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1800f5fb451e8299a6781c87f8033d694874137a4349941a190117ab2e16b929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:6986-7002 | rust_port/crates/flow_parser/src/ast_visitor.rs:7025-7041 | rust_port/crates/flow_parser/src/ast_visitor.rs:8464-8481 | rust_port/crates/flow_parser/src/ast_visitor.rs:9403-9417 | rust_port/crates/flow_parser/src/ast_visitor.rs:15028-15044 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c90685454746f1f88fa1df86d5733bf5edf3e2d7e4758ef426548ea0594266c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9462-9478 | rust_port/crates/flow_parser/src/ast_visitor.rs:14990-15004 | rust_port/crates/flow_parser/src/ast_visitor.rs:16514-16528 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf53e770d3c366865dee4b5712c75e34a40d830ec2ef1b0aaa7b290fad0b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:2763-2791 | rust_port/crates/flow_parser/src/estree_translator.rs:2798-2831 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edaf65a6d5b391c8945ee3d38ef7c33c8e337b394b6ab86fd545423eeefae52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2170-2178 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2581-2592 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1448fe47087495f465fd21b8ec7cacc466fd33ff65c9837578aeb221224aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:398-413 | rust_port/crates/flow_parser_wasm/src/serializer.rs:415-425 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad2b93a2b98c2496b6fee00864806e9b5d94b4cece6eb76df84787d2c918d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1416-1440 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1448-1469 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4df6ed72da34abff966b6bf923650e4210fda47cc3c87ba83158da00d553d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_lsp_server/src/jsonrpc.rs:242-253 | rust_port/crates/flow_lsp_server/src/jsonrpc.rs:258-269 \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":"rust_port/crates/flow_lsp_server/src/jsonrpc.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ca653ea246962984a36e449c2f9db941418e40e5469c39533be64152a9916d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15304-15320 | rust_port/crates/flow_parser/src/ast_visitor.rs:16166-16177 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6baf83f4b41036c4af619c1e9a20e776caabd2689acbe523d66632f3462c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:649-661 | rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:663-675 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f50019e564f50c69841f73621d2d8b4bccff7ea47aa5d2466399e101c85864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_server_monitor/src/file_watcher.rs:665-691 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1408-1418 \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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb86afecbcd9c1312bd204005ce5e31f321d7b5842f548ea54d98dd75ec6f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:995-1007 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1197-1209 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e27a402ed0fb206737da82391a5485c1afff00e61fe867f9162738d4c6600d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:115-130 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:131-147 \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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"af36d240213087eff268cb867198308e0a47990703bf3531db41d67140337566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:90-100 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:106-115 \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":"rust_port/crates/flow_typing_statement/src/func_stmt_config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"304209ed4be6cbbebc3c60c1a875ce802024a1b6fe761aa324b49afb807163ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_common_vcs/src/git.rs:66-74 | rust_port/crates/flow_common_vcs/src/hg.rs:75-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":"rust_port/crates/flow_common_vcs/src/git.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e084b0ae244d570f3648bd61ab2f759103016a5692a68f8ba581638059d960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8819-8834 | rust_port/crates/flow_parser/src/ast_visitor.rs:12175-12190 | rust_port/crates/flow_parser/src/ast_visitor.rs:12370-12385 | rust_port/crates/flow_parser/src/ast_visitor.rs:18609-18624 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8819}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb96544c930c8ff8eeb69d2697b4876fc21bd65724ee654e52756212c2725098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15059-15073 | rust_port/crates/flow_parser/src/ast_visitor.rs:18096-18110 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15059}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c57a23c134ef800edbc119e6030a398625e81a3945883984efc484ef7f634d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/comment_attachment.rs:1507-1516 | rust_port/crates/flow_parser/src/comment_attachment.rs:1520-1529 \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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d3ea51cfdf11156c227af3357c1b19ac1d5638014c7d34acf45889cb7bcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_server_env/src/workload_stream.rs:88-101 | rust_port/crates/flow_server_env/src/workload_stream.rs:104-117 | rust_port/crates/flow_server_env/src/workload_stream.rs:120-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/workload_stream.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed7728d79c4654b0bfbc9ffc43c42411da9d2d8562c9a3db85ff39a93db884"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_services_references/src/rename_mapper.rs:50-61 | rust_port/crates/flow_services_references/src/rename_mapper.rs:346-357 \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":"rust_port/crates/flow_services_references/src/rename_mapper.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5ad1ba2006f18e45ff9ef8cfd809fc768167a4da6b63a003e81a444bb4e768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_statement/src/component_sig.rs:83-91 | rust_port/crates/flow_typing_statement/src/func_sig.rs:99-107 \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":"rust_port/crates/flow_typing_statement/src/component_sig.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdf25c9e3d95b092a44eaeb781380a445a3c49d4b6482999a0b98858a8b14a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_typing_type/src/type_util.rs:2753-2765 | rust_port/crates/flow_typing_type/src/type_util.rs:2767-2779 \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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2753}}}],"partialFingerprints":{"codehealthFindingId/v1":"b313ebc988029856c10cd3110f1b1d2d7b6bad33681d0a377f33ef2a331ac0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_utils_concurrency/src/thread_pool.rs:171-190 | rust_port/crates/flow_utils_concurrency/src/thread_pool.rs:210-224 \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":"rust_port/crates/flow_utils_concurrency/src/thread_pool.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0767b1df0315840ed7de1e2c71e8a204a84522cef2baef856c3d25dba24bec17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_port/crates/flow_cli/src/apply_code_action_command.rs:385-408 | rust_port/crates/flow_cli/src/graph_command.rs:126-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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"de105a1d26751aceedfef82f862e2fb18d4e40dcfcefaf94c5718a217a0fcf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10884-10902 | rust_port/crates/flow_parser/src/ast_visitor.rs:11909-11923 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a5d4aac51623f9d4611a03e1c854b7c183c0a4346b7795fa0e34c2a52fdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14489-14498 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1305-1314 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14489}}}],"partialFingerprints":{"codehealthFindingId/v1":"db49639d298b5007c10f9fbd6b36000e2807474db6a9cba6eb2b780cf8a53f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15659-15672 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1924-1933 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15659}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c03af4664abd3d0b28976a806341871ef13dfcd3053b81af9484f52b4612e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:404-416 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:427-440 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:448-460 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b88842a553027cca73f9b833f89d7281ace9846ff08e4cac2a1784d79f69f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_services_coverage/src/lib.rs:70-78 | rust_port/crates/flow_services_coverage/src/lib.rs:80-88 \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":"rust_port/crates/flow_services_coverage/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"780280b160bfeb4b0ff5d332cd4bcdebacae6ebe7f852eb52ac58ef8425104f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs:446-457 | rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs:472-488 \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":"rust_port/crates/flow_utils_concurrency/src/lockfree_overlay_map.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9d5e3985406eceea99096128f3903382e34d682ed53b74dfe3450cae6877f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_aloc/src/lib.rs:86-99 | rust_port/crates/flow_aloc/src/lib.rs:103-116 \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":"rust_port/crates/flow_aloc/src/lib.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8161ee7277d317a6e8adfb827bc44727241850e9555abe2e0aeda9bd72947b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_analysis/src/ssa_builder.rs:553-562 | rust_port/crates/flow_analysis/src/ssa_builder.rs:564-572 | rust_port/crates/flow_analysis/src/ssa_builder.rs:574-582 \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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2bef6794299ce6360f7c62a66fa2f711a85d919bc8e90b79b51ab91c15c526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_heap/src/heap_state.rs:912-921 | rust_port/crates/flow_heap/src/heap_state.rs:930-939 \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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa1eb40b23abd4d816a8d63a177f13b76bf0322b54a23469ce61879f6e7f94b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8012-8028 | rust_port/crates/flow_parser/src/ast_visitor.rs:8066-8079 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8012}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a89aa0bf60b8b24ca194c33bab9c8e7e6414f6ce42e4b9f2ce20b36f5b768b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8407-8422 | rust_port/crates/flow_parser/src/ast_visitor.rs:10515-10528 | rust_port/crates/flow_parser/src/ast_visitor.rs:17875-17890 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6b81d54fcf196260ff2e0564072edbf1e9db3eba68cbcc30d79d8474c77f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11639-11653 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6793-6807 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11639}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a7e0437ba58b90502a34e9ecdc35dc3f9d5b9d0db24e1c322017538c959715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:16293-16307 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2257-2271 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87cdc9e318d520dc047c05ccdce8e7421e5289e4bcba872125e688e79ef33e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:2304-2310 | rust_port/crates/flow_parser/src/type_parser.rs:2336-2343 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7cbb36aad9d3d9be28e7f376e9e7ca47a93c3224bd4d99411999f171a1ca7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:118-134 | rust_port/crates/flow_services_inference/src/type_service.rs:2536-2550 \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":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e54272045e4b9faa1823e53ee475b4701b91debddf8cd7424fb3e723e33193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:355-365 | rust_port/crates/flow_services_references/src/property_find_refs.rs:119-128 \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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"432a1840e9af62142ae694121fd9c4def49e835ab98af7efa27cf07f599bfadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:177-183 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:193-199 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e493efede0165c493435ad454600dd9abcc3d691e8c88fc57cd6a48fce3ef38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2171-2181 | rust_port/crates/flow_typing_type/src/type_.rs:2272-2283 | rust_port/crates/flow_typing_type/src/type_.rs:2366-2376 | rust_port/crates/flow_typing_type/src/type_.rs:2739-2748 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d9500361b202062d391f6ebb460a6b980fef4cb662819dc92824b84111e391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_common_ty/src/ty_debug.rs:296-305 | rust_port/crates/flow_common_ty/src/ty_debug.rs:530-538 \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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8650a220b0debf92fc4ef69489176c83f53aac575b264e5e4b32c31acc6a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_common_vcs/src/git.rs:53-61 | rust_port/crates/flow_common_vcs/src/hg.rs:62-70 \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":"rust_port/crates/flow_common_vcs/src/git.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a42df1beb4c20366fbfb7d312663d6e8e41b41b2a3366a41db104f82e14c43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_parser/src/ast_utils.rs:343-354 | rust_port/crates/flow_parser/src/ast_utils.rs:380-394 \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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcfa30106d46cec6d59e46e921b3a1c6d203105ab7757508ea3e84798ccbec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8258-8273 | rust_port/crates/flow_parser/src/ast_visitor.rs:8758-8773 | rust_port/crates/flow_parser/src/ast_visitor.rs:15825-15840 | rust_port/crates/flow_parser/src/ast_visitor.rs:15981-15995 | rust_port/crates/flow_parser/src/ast_visitor.rs:18243-18258 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3730dec21989b69be7ec34f02266e6841a2a8c00c87f8efd5bb6abb88883a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:4471-4481 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2266-2278 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4471}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ccc693d5254d9170b21fec9de950a835784255cab227a14d270075a1bf14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:1692-1698 | rust_port/crates/flow_parser/src/parser_env.rs:1866-1874 \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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8525a8e57cb38d2ccec23fcd5eecb48f0ab29b0aba0f9375cf7038dbc5e28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1288-1300 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1505-1518 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1523-1536 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6769-6782 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8d4250a67983a0cd98b69693300378d2d893603dd2c3d6631b9f050931618b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_aloc/src/lib.rs:120-129 | rust_port/crates/flow_aloc/src/lib.rs:133-142 \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":"rust_port/crates/flow_aloc/src/lib.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb17604ad7be94390520dc5bff8d4f563e18f5c516db3ccea04fd6a2265a6b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:806-818 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2007-2020 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3305dc64c2a0e1873484e6fd74d592a6d40f424e9fee2375b2225db6d66f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:705-715 | rust_port/crates/flow_parser/src/ast_visitor.rs:17572-17584 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df484f6cbaf3845cb11cb4e70825dcdebefc949007ec0416eac72b6d4ab3564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser/src/ast.rs:145-155 | rust_port/crates/flow_parser/src/ast.rs:159-169 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763fc4d2cbea1ccc66948bdf171b83c54dcf6c0a8813399d5ab19f2b0708ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/ast.rs:5425-5433 | rust_port/crates/flow_parser/src/ast.rs:5435-5443 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":5425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f523196acb2718ea3fa3dec74647ee7b4ea1f0cdb3525cf334cf1bb395f73f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10866-10879 | rust_port/crates/flow_parser/src/ast_visitor.rs:18054-18067 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2472-2486 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6368-6382 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10866}}}],"partialFingerprints":{"codehealthFindingId/v1":"4175c63a6af0e0321023bab78ed3151ff3df00062c906f6d4ecb6c3b6ad7c1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_parser/src/statement_parser.rs:5289-5302 | rust_port/crates/flow_parser/src/statement_parser.rs:5333-5346 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5289}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ed7736f231bcf16b0d714921eb72afe95fa3af11195f1f9f110f5423df59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/type_parser.rs:4845-4853 | rust_port/crates/flow_parser/src/type_parser.rs:4867-4877 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4845}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4536082eaf9dae3f92b16af66cbd5a4cd9ece106c3d39692daa5d8dcdd1ba15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser_wasm/src/serializer.rs:1779-1788 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1793-1802 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b75d70e3344edce9ea45db02ef8be3474de1f65afec9c6e9a76e11586004a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_server_env/src/server_orchestrator.rs:527-534 | rust_port/crates/flow_server_env/src/server_orchestrator.rs:557-568 \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":"rust_port/crates/flow_server_env/src/server_orchestrator.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6c5500837170e8c1beec5483d2f0cbfd7ee1ec2e7180f42ace887c110a0e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:1127-1134 | rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:1139-1146 \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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a1a4b47fcc73653591ac9e009d6cd77fa3efa30196a81c95dd4089d0a2bc32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:326-335 | rust_port/crates/flow_services_references/src/property_find_refs.rs:104-113 \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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e077bd3feda8895a4777cac1d9ad8c9c92dede64998b79d469cbf066cb2136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_typing/src/env_resolution.rs:102-111 | rust_port/crates/flow_typing_utils/src/members.rs:801-817 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a33096d75e9cccb9b91d7f3d55c264851d3ef98498d6c2ded125c34ee5645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rust_port/crates/flow_typing_errors/src/flow_error.rs:269-272 | rust_port/crates/flow_typing_errors/src/flow_error.rs:462-465 \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":"rust_port/crates/flow_typing_errors/src/flow_error.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f1d597527b2f7345122849960bfa8fc7d6125149a0b4118ae406f3c8ca48be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:577-583 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:883-889 \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":"rust_port/crates/flow_typing_flow_js/src/natural_inference.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee7fd8b7c2ec7d17bc24edbb44e1a99776fffab5e882fe084f605bf9b983d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_common/src/reason.rs:727-734 | rust_port/crates/flow_common/src/reason.rs:745-752 \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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec169c71abb11036351ddf6b12bc521a73e1dee499e9cfd3aa1390d343e6bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8839-8853 | rust_port/crates/flow_parser/src/ast_visitor.rs:18704-18719 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8839}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c9ac093d21cb6bfbe255762a4fadc98465be37579fc670840c8bb7e04a820"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10171-10183 | rust_port/crates/flow_parser/src/ast_visitor.rs:10259-10272 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02325e2f1424b8e060bbccf89f07d5fcc6db6c195c0fd34888b384d8c7ee971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:17518-17531 | rust_port/crates/flow_parser/src/ast_visitor.rs:17694-17707 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4460-4474 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4583-4597 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf43c00d5e9c663cfdedae2f9bd73a92321335de48d5aaf3dac15fbb55aaa511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:5813-5829 | rust_port/crates/flow_parser/src/estree_translator.rs:6260-6284 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":5813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e8c6c4d3fc05d77d4962321949523ec2879f3bddd986e41bd7e78cf44005c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/estree_translator.rs:6061-6074 | rust_port/crates/flow_parser/src/estree_translator.rs:6130-6143 | rust_port/crates/flow_parser/src/estree_translator.rs:6149-6164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":6061}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e16da0d9ae6637a6ffbf564508471dc99823a70ad92b01e3595b4e4e91f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:449-457 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3252-3266 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07cd4c1bfe89f91451837c1948947cd10972cfe369d7252bd593672125c3566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4511-4524 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4661-4671 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0025195c8d96076740bb55f505e8dc280951c9af6cdd6f5503f11319860102dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:526-538 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:747-759 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:767-779 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0197e8364988140033157fbf0053e5f056bf5506c8e58ab10e3c2889b039d580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:1081-1089 | rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:1099-1109 \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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cebdd5f89321b4b82ece19f34244e831544f9ca74aa8c44d0324493f4adf699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2140-2148 | rust_port/crates/flow_typing_type/src/type_.rs:2239-2248 | rust_port/crates/flow_typing_type/src/type_.rs:2335-2343 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dde56d7f57a15e36537e1e59af37ab53e5e20f82128b29992467815046a1f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:7267-7276 | rust_port/crates/flow_typing_type/src/type_.rs:7278-7285 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaa54b20ba60eec943ed32e9927fb76f71b72089ee64d1104ac8a8ff6da8d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_analysis/src/hoister.rs:60-69 | rust_port/crates/flow_analysis/src/hoister.rs:71-80 \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":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"590ff34e347adb1feeed94ef5d97a50a174ea23d22392f8d77a059b5d93dd3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): rust_port/crates/flow_heap_serialization/src/lib.rs:48-56 | rust_port/crates/flow_heap_serialization/src/lib.rs:64-72 | rust_port/crates/flow_heap_serialization/src/lib.rs:94-102 | rust_port/crates/flow_heap_serialization/src/lib.rs:110-118 | rust_port/crates/flow_heap_serialization/src/lib.rs:160-168 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap_serialization/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05decef3faf2b4b7b02d38aba62846a7b8f1572e199da7552ce6568532a4a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7085-7093 | rust_port/crates/flow_parser/src/ast_visitor.rs:8500-8508 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:462-473 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:478-489 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c0ff84ea846974299cc8c8f6b0a112b694986eadcbb54d704a6db96d40044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:7476-7489 | rust_port/crates/flow_parser/src/ast_visitor.rs:11585-11597 | rust_port/crates/flow_parser/src/ast_visitor.rs:11978-11990 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f209b52516f749e247807ab4652f7709c2bbfbd0414fd226bb51d3982945f059"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:9907-9919 | rust_port/crates/flow_parser/src/ast_visitor.rs:17744-17758 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":9907}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e886e2d80d643b0c8e1a168df6ef50b63ecaf74b349d75dc5b6fa2ab90ebbd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_typing/src/typed_ast_finder.rs:1485-1493 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1774-1783 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1814-1822 \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":"rust_port/crates/flow_typing/src/typed_ast_finder.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"274464aa336a309c64efe017c9d837d5a114a58472f4b7e80836f4506320d885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:855-863 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:868-876 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bbf3531cd434d9d88c3a00f09b439b87ea2a8c77471473747dde31b29e8061"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:108-114 | rust_port/crates/flow_typing_type/src/type_.rs:1444-1450 | rust_port/crates/flow_typing_type/src/type_.rs:3064-3071 \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":"rust_port/crates/flow_codemods/src/annotate_optional_properties.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2958f20b2bc17e986896d3064fe69a4d9030b56e7c334b40b0a0fa51baf6aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_heap/src/parsing_heaps.rs:91-102 | rust_port/crates/flow_heap/src/heap_state.rs:923-928 \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":"rust_port/crates/flow_heap/src/parsing_heaps.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"189be037ffb58a2a8569185c80757b7e66d88a1758dc58f99ae8c487e17eef36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:6949-6963 | rust_port/crates/flow_parser/src/ast_visitor.rs:10547-10560 | rust_port/crates/flow_parser/src/ast_visitor.rs:13220-13235 | rust_port/crates/flow_parser/src/ast_visitor.rs:18419-18433 | rust_port/crates/flow_parser/src/ast_visitor.rs:18456-18470 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f311b2e2a3d957d9b899d7f91c27edef2b46fb5fd86cdaed0806508fbb5ae8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13334-13343 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4869-4878 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83ac3e9071d47c97b76b4fafc707f1d3ce5938b56d25e1f799aeb5dd5df728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:15693-15709 | rust_port/crates/flow_parser/src/ast_visitor.rs:15810-15819 | rust_port/crates/flow_parser/src/ast_visitor.rs:16197-16211 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":15693}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f81a2d8ac6bb56219dd8c92ae7c463e1118645d596ba8fa9d8d3efe6c9afc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:17896-17908 | rust_port/crates/flow_parser/src/ast_visitor.rs:18750-18763 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17896}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bad5abf79e1e3aca6e47911a8b301df4c1a95be2580dbc08c01ebc767dcd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6434-6442 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6520-6528 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6533-6548 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6553-6561 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6566-6574 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6434}}}],"partialFingerprints":{"codehealthFindingId/v1":"017126d6f8bc7d206adff9b9cabe29e65d109a30d4ddb7986d2401b171ae7bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2099-2104 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5677-5685 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7e128173112fe31b43052c93783be1665afeb2a996b29d5c65a548eb3a831d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:159-168 | rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:172-181 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"093415a0619022a4cf93597ae6e7ae884007e5a48ce9d21e19b393cede30ec16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser_wasm/src/bin/codegen.rs:377-390 | rust_port/crates/flow_parser_wasm/src/bin/codegen.rs:428-437 \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":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d75565b2a837e07942e31a0cbb23f9333150fa17982d03d64e79ca9e01214c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust_port/crates/flow_services_code_action/src/insert_type.rs:571-582 | rust_port/crates/flow_services_code_action/src/insert_type.rs:652-663 | rust_port/crates/flow_services_code_action/src/insert_type.rs:669-680 \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":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a23a69cfd8f736ce05c1d795a9000614d417a15de4aa2106e23f198b0665bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): rust_port/crates/flow_typing_errors/src/error_message.rs:1162-1169 | rust_port/crates/flow_typing_errors/src/error_message.rs:1429-1436 | rust_port/crates/flow_typing_errors/src/error_message.rs:2628-2634 | rust_port/crates/flow_typing_errors/src/error_message.rs:2701-2708 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ac3b41b3a147f3075c7e68eb238572e3b189b4ea1e417ac1eb8120cf3e7375"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs:685-705 | rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs:707-723 \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":"rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"073063fc3da0303c164d1ed0ff23860b86d52212536fffec91378db5064b4b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust_port/crates/flow_aloc/src/lib.rs:230-237 | rust_port/crates/flow_parser/src/file_key.rs:353-360 | rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:59-67 \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":"rust_port/crates/flow_aloc/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5bb10faa576b20fb5b4b01befdbe41f83eafa3b6980063184c6d3e80b627d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8304-8316 | rust_port/crates/flow_parser/src/ast_visitor.rs:17312-17324 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb15709e0d0b8b6ecdb295682e90789ba17c729a01027a2a712cfd7a9b33100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_analysis/src/hoister.rs:554-567 | rust_port/crates/flow_analysis/src/scope_builder.rs:1913-1925 \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":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"814531c288a88ff8974bb02684e791febdf38e683150ec3b576b67380aef84be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_analysis/src/property_assignment.rs:42-52 | rust_port/crates/flow_analysis/src/property_assignment.rs:57-67 \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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afa7186eed5753d75cc52d9918ea7228bd67e08c233048e3f95e9cc284c1389"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 15\u002B corresponding lines): rust_port/crates/flow_config/src/flowconfig.rs:923-938 | rust_port/crates/flow_config/src/flowconfig.rs:1012-1026 | rust_port/crates/flow_config/src/flowconfig.rs:1053-1068 | rust_port/crates/flow_config/src/flowconfig.rs:1073-1088 | rust_port/crates/flow_config/src/flowconfig.rs:1104-1119 | rust_port/crates/flow_config/src/flowconfig.rs:1716-1731 | rust_port/crates/flow_config/src/flowconfig.rs:1736-1751 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"983ed3a23ffb533e209b40243e784583edaf1039a77d52294e0fd01a4877f7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11213-11229 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11248-11264 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11384-11396 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11213}}}],"partialFingerprints":{"codehealthFindingId/v1":"566ae15820cd2bf69fdfca2ed8a9dd96db9178b3efafe3e7ed357c70fc431d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10156-10165 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1092-1101 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b392a9b6abbd73df4bd93109a7d9a8f20e35412dc2fae5a77a5920b77826e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:14394-14403 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1256-1265 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14394}}}],"partialFingerprints":{"codehealthFindingId/v1":"694d9e4378e3729001a5ea1660b62e28d633d6e59a9d4f602fae709ba2aae56e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/bin/parse_test262.rs:40-49 | rust_port/crates/flow_utils_find/src/lib.rs:23-32 \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":"rust_port/crates/flow_parser/src/bin/parse_test262.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"188d8e413b508b13f0e4c3f9bdaef5a8557caf9aabed4994a2973862b3adc496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6415-6429 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6628-6637 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6646-6653 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":6415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9744a7c054fdd8bf44a8771a9524bf6ad8fe069dad6faa04225158cc6a5575d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9020-9028 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9031-9042 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9020}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aedf77f82e0cc336ea477b4ea4238f230d1ceca6c6cfaaa209bc36acc2dc212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13409-13421 | rust_port/crates/flow_parser/src/ast_visitor.rs:14953-14967 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a763a3ce9cfad8fc24bc0b89b59c8e8c2f1a558b9e6028d4e6dc1a5c7979724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 9\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:926-937 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1270-1283 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1435-1446 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2751-2764 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2769-2784 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4180-4193 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5582-5590 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac195f794dfb78a8863d9909f764753fd92eb12aa3131787553287bdfb7432e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4609-4622 | rust_port/crates/flow_parser/src/ast_visitor.rs:17215-17228 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":4609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a273f540ba175aa082b9779c8b3d56b569b4672551880e3815d7db3e3094337"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5983-5992 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6617-6625 \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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":5983}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbdca0f0a08cb6a40ac54e02e521ebd926df9d7c212b4389a07c2cb71a387c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2489-2497 | rust_port/crates/flow_typing_type/src/type_.rs:2811-2819 | rust_port/crates/flow_typing_type/src/type_.rs:2882-2890 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc7cbc96fa0eec1bdf2a884462445162e5150f245e6eb20319f1993d24c3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_cli/src/init_command.rs:49-57 | rust_port/crates/flow_command_utils/src/lib.rs:812-819 \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":"rust_port/crates/flow_cli/src/init_command.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e0e2df7c94761dae4d743d688306109c0394c9027316b7bab520a5814df411"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_heap/src/heap_state.rs:457-472 | rust_port/crates/flow_heap/src/heap_state.rs:635-646 \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":"rust_port/crates/flow_heap/src/heap_state.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5890c8b26c4ae9bfb63e9edcd55000f8d243a05534df03e32145183398657cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:10027-10034 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4162-4175 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":10027}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0758c4c636bbb151148660715431860fa96f732492720479aacf92c5af75f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:13620-13633 | rust_port/crates/flow_parser/src/ast_visitor.rs:15122-15139 | rust_port/crates/flow_parser/src/ast_visitor.rs:15364-15380 | rust_port/crates/flow_parser/src/ast_visitor.rs:18142-18156 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13620}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a78760d635bd1eee1f1acfca29688843b5cc207d12445603b8082f49fa2bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:569-582 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5845-5853 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5858-5871 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27b53bd94487f9bedfc8623c91cc7075fa6b768c74adeb70b1a5fefaee463d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): rust_port/crates/flow_parser_utils/src/ast_builder.rs:1324-1332 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:2098-2105 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:2112-2119 | rust_port/crates/flow_parser_utils/src/ast_builder.rs:2378-2386 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/ast_builder.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"88863c5098f80e35e159d7ad030202c396dbb17c452852dae7440daa0cb321f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:1196-1207 | rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:420-430 \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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727984f619b608f701d42a5753c687c4344d36ebb178dd1a285efb830bcb4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:812-821 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:889-898 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a5c5ba6c6672d25e91cb44e21ac1c4205df382437e6079847a366a8bc4fe73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:126-138 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:251-263 | rust_port/crates/flow_typing_utils/src/speculation_flow.rs:77-89 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0652f6cb53740fa4f88d01b22be50f4ecc1e2801c44ab82711ae6072dae661"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_env_builder/src/name_def.rs:3043-3052 | rust_port/crates/flow_parser/src/ast_visitor.rs:7876-7884 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"441ab4f0e5db2367aef3aa909970b130d258704bc30b1f8ad804678aafff8f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6213-6220 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4526-4538 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6213}}}],"partialFingerprints":{"codehealthFindingId/v1":"acce5918a911b23dfc8f2acc99cbfbc371ee37ddfa6fc9e8885a7ed1503fa0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4177-4198 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4211-4231 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8ff33fd357eb08f54af8f5e651613268d0baa4f43ed74f749059d5e6f72225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1170-1178 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10920-10928 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"227e4d3492e97ec0838b1548ae856591a32f179b821b890424c97c9a95907213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:6805-6817 | rust_port/crates/flow_parser/src/ast_visitor.rs:9483-9496 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":6805}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffcba0076411ebb1c64136aba5ba8476e514df5408df2e22b18ea71a0ce2001"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8446-8458 | rust_port/crates/flow_parser/src/ast_visitor.rs:15010-15022 | rust_port/crates/flow_parser/src/ast_visitor.rs:15411-15425 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8446}}}],"partialFingerprints":{"codehealthFindingId/v1":"61037b2cb4a3fca9a05ecdbf47b4121f09dbbcfd0d588dedef4ad6973addf06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_profiling/src/memory_utils.rs:51-66 | rust_port/crates/flow_server/src/server.rs:79-91 \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":"rust_port/crates/flow_profiling/src/memory_utils.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acd694a1b06913bc896d6e10630e73f963e4988ab2be1eb3afbf12fa2412432"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust_port/crates/flow_typing/src/ty_normalizer_flow.rs:165-169 | rust_port/crates/flow_typing_ty_normalizer/src/no_flow.rs:120-128 \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":"rust_port/crates/flow_typing/src/ty_normalizer_flow.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03fee67aae24ebe800b488530332608ea86052725be09bddfa02872e561c10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): rust_port/crates/flow_typing_statement/src/react_rules.rs:2288-2295 | rust_port/crates/flow_typing_statement/src/react_rules.rs:2301-2308 | rust_port/crates/flow_typing_statement/src/react_rules.rs:2334-2340 \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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"747105eca41e4701f5e6ad67b298ebaf2b855f6678a94d3c2e9574afc8a0f0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): rust_port/crates/flow_typing_type/src/type_.rs:2112-2122 | rust_port/crates/flow_typing_type/src/type_.rs:2307-2317 | rust_port/crates/flow_typing_type/src/type_.rs:2684-2693 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101150a278f37011b53ff384640e69016c58fcee35dd84bcc2ffb11e3cad9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11827-11841 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1577-1589 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1640-1654 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11827}}}],"partialFingerprints":{"codehealthFindingId/v1":"876220153b631ecce24e4eff90bcb13c3d63e2f8c13ca901b57ffdf1233083bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:8346-8356 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3731-3740 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8346}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db2ab7478175068e980883c3aa9257d594c3b353b58fde32408ac210a45225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11111-11123 | rust_port/crates/flow_parser/src/ast_visitor.rs:18549-18561 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2657b1264fa12840158dc139bd0c122788f3ee00743c118cd11593924800a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11730-11742 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1606-1618 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25aec9c088bed20da22f587e3dce7130fb60f1d4f1e1a650367c525085161e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_parser/src/ast_visitor.rs:11760-11772 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1623-1635 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11760}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb55bf3289494f3b243ec17591ca959bfbdf26f9cd74730c754483e69f01f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust_port/crates/flow_parser/src/parser_env.rs:1193-1201 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1067-1095 \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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d97cefeddf25652e84ed221d4d09de824503ae5209db26f9584c199840685a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_services_autocomplete/src/find_documentation.rs:381-810 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15473-15480 \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":"rust_port/crates/flow_services_autocomplete/src/find_documentation.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d82cfdc8c594c2bf8378a59371183f71fc839170739b43c66b92c0d9c5594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_services_autocomplete/src/keywords.rs:164-175 | rust_port/crates/flow_services_code_action/src/insert_type.rs:506-517 \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":"rust_port/crates/flow_services_autocomplete/src/keywords.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75d7ba4f521e2cfcf4442967935eb7f282c210654ba7a40526aeb39c61b3768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:498-509 | rust_port/crates/flow_services_code_action/src/refactor_switch_to_match_statement.rs:84-96 \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":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4fdb17f5c9d18205d612bf341b552055f8f1e6b337d496d982a9532b2fc022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2244-2250 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2105-2111 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe08d5853d1fa5ee5080fe43baa8bd3286aa6b8571856d3e98be7ad9cf435a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs:283-291 | rust_port/crates/flow_typing_generics/src/lib.rs:501-506 \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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74f27b9ff02342016b37fa4e0497c9d8b40d5942b1d8daaf0411634de816759"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_port/crates/flow_parser_utils/src/iloc.rs:24-33 | rust_port/crates/flow_services_export_index/src/export_index.rs:147-156 \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":"rust_port/crates/flow_parser_utils/src/iloc.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772536f0f3f0f2ccc33a9c59df6e497420ab34827a28b62611a44f86958b763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_parser/src/file_key.rs:221-228 | rust_port/crates/flow_saved_state/src/saved_state.rs:386-393 \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":"rust_port/crates/flow_parser/src/file_key.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8361528ef849c27ea6ce8ddfae53bd7a9ebdbab08156b94ddb2c3937d37a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_services_code_action/src/refactor_add_jsx_props.rs:324-335 | rust_port/crates/flow_services_jsx/src/linked_editing_jsx.rs:82-88 \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":"rust_port/crates/flow_services_code_action/src/refactor_add_jsx_props.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e554ca89d77371ac65089b3ee1d717c0581d80f4288586c26ecbee17980c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:1485-1492 | rust_port/crates/flow_data_structure_wrapper/src/multi_level_map.rs:35-42 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e341b61e8d7e026c5a7b9f78d7435345605afdfa3cf99892d470d98fa14091"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:1781-1786 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1195-1200 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f273a689160c98746f02c91754deebd5081591ee28ef7b95bd1958088e55d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_analysis/src/ssa_builder.rs:725-731 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3259-3266 \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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2c406e447c3dfaae6399495fccc027a44fdc6bc6bacaa7c3bf258109b0644d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_cli/src/coverage_command.rs:82-88 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:236-247 \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":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29ac613dbc567973377fa6e2ab24a0f4e8a20b91c7b6aeb425510d20ea240f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_common_utils/src/utils_js.rs:124-129 | rust_port/crates/flow_monitor_rpc/src/server_status.rs:728-733 \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":"rust_port/crates/flow_common_utils/src/utils_js.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"894a5a85a662307a3f039444cb941165a334787489efbc5e09077b64bdcfe944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1951-1957 | rust_port/crates/flow_typing_type/src/type_.rs:8296-8298 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"735b3f5f8f1654bc2409ced0e01eadeec3ebd735dc093e873031dac881da94a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1655-1661 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:33-38 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0735f536a6caa06022ac1a05df968f7dab7b884fe749e5a1a1b2390882d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2025-2030 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1915-1920 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cef58b237ad93c0a5fb19e9c2a96590436262a2ff06f45b87085acbe4a8032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_port/crates/flow_lsp/src/lsp_fmt.rs:22-28 | rust_port/crates/flow_lsp_server/src/flow_lsp.rs:656-662 \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":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"29808a7366dcdf9ce821cfe8a2a881d4c913f0df2b69269dbcf6a7494477f95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_port/crates/flow_services_code_action/src/autofix_exports.rs:71-86 | rust_port/crates/flow_services_code_action/src/autofix_missing_local_annots.rs:91-107 \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":"rust_port/crates/flow_services_code_action/src/autofix_exports.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"be297612f4b8521d168864be7abc3fa3656fee4d5edda445a85f9aaac6c217ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust_port/crates/flow_analysis/src/scope_builder.rs:2252-2257 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2117-2121 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3bce964188744769a7c51aa9151b1c55b324ab307e89fff72af12bb001c4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3964-3978 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1085-1097 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a60363da71a6f0628f8d93573b730c8cc09c5a89f252bdaf930a2bd61f6949b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201367 lines \u00D7 3): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8659-8684 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10067-10133 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10178-10203 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8659\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":8659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d633daa5f34eef4e76c628830221a820fe1b782ce4d0b572556b328db24d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:2072-2129 | rust_port/crates/flow_env_builder/src/name_def.rs:2320-2377 | rust_port/crates/flow_env_builder/src/name_def.rs:2429-2486 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_env_builder/src/name_def.rs:2072\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"630a29946db611b87e3af318526714ce88ce21e2417b0bf0e9d0fadbf9ec9357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (75 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19841-19915 | rust_port/crates/flow_typing_statement/src/statement.rs:20291-20365 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19841\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19841}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5e8483f28043bb73a945d2eb1abee6343d5280b02805b03c12cc889a2e0ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11269-11322 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11336-11389 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11269\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b378aeffee32a3e456331a281d7ac893ea7ba47073806eb3267760f632d5e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:3564-3616 | rust_port/crates/flow_parser/src/estree_translator.rs:3697-3749 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:3564\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0f4247a6c0a3f557737fe442a9a8b3476d533a5337a72510e57bbcfc1303e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1072-1124 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1172-1224 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1072\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb752c0ed45b5923ca79e3f504d83f45f1d7c81686a65b9750daebd878a8963b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): rust_port/crates/flow_event_logger/src/lib.rs:408-457 | rust_port/crates/flow_event_logger/src/lib.rs:831-880 \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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"075234485dc302a453429f696d587216db3735289dda2f0cb2c97b673a6f5cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201350 lines \u00D7 2): rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:422-470 | rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:524-573 \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 \u0060rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:422\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":"rust_port/crates/flow_utils_concurrency/src/map_reduce.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a6145836df51ebbfba9de5e348beabf0b8e439bd7117409d6fdbc61c47240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): rust_port/crates/flow_parser/src/ast.rs:3674-3722 | rust_port/crates/flow_parser/src/ast.rs:3725-3773 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1713d13b5c4c6153d8f0e7514ba3ab348194d4c59f1932cad4e51f4c9ce913e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201349 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:1528-1576 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1626-1670 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:1528\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d21936648e070c33e82c0ece2fd57059fbd3b097f9d825cb238477e2be54ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:7377-7425 | rust_port/crates/flow_typing_type/src/type_.rs:7582-7630 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:7377\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35017d2e3c50c521979abdbf49416b0b9d9f87dba137ef6f90a736ef61e63a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (116 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs:131-246 | rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs:267-382 \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 \u0060rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs:131\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":"rust_port/crates/flow_dev_tools/src/runtests/check_exec_file_promise.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8868cf2f9ce800c99b79f22b34e086c34d3c84f17ed52dfd0e982d593f8e6c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201347 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18383-18429 | rust_port/crates/flow_typing_statement/src/statement.rs:18559-18602 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18383\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b23a3604cc23e24a7752b9836ac59f4b681d807bd2cc2d9c24a8314f68ace08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201346 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9619-9652 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9791-9836 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9619\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9619}}}],"partialFingerprints":{"codehealthFindingId/v1":"86171c35861c5eff63212a6a9daf5c0819bda5a75ee85cb3baab444dd548e400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:5501-5546 | rust_port/crates/flow_typing_statement/src/statement.rs:5584-5629 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5501\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7120e507344aea33f56b330f4053039ad47ac9c5f7d5cc97fc29ced4cea8c63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201347 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13341-13387 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13389-13434 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13341}}}],"partialFingerprints":{"codehealthFindingId/v1":"be66c1d242cfbfed7b3d5d415395aebf5f169abd5b69dd7dc9bde3d81dc38caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): rust_port/crates/flow_parser/src/ast.rs:4964-5006 | rust_port/crates/flow_parser/src/ast.rs:5009-5051 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":4964}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcb3c9f2e1dd0299a94556d12c506fe7cbc3dbcc9889ceb7aa0cc14f4ddc317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): rust_port/crates/flow_parser/src/ast.rs:1499-1540 | rust_port/crates/flow_parser/src/ast.rs:1543-1584 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"793ccaf914649a70ce8ac12ebf53c5c97a1941c0a6789e9375ee398475124ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201341 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4378-4418 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4421-4458 \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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f765f79412227fa393e600451ead397fe716bb167f3e3290ee47bf623616124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): rust_port/crates/flow_services_inference/src/type_service.rs:1981-2020 | rust_port/crates/flow_services_inference/src/type_service.rs:4075-4114 \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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"da095eede1a9699e2466347d54a017e14148da4a53bd41f72b8a1818ab564b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): rust_port/crates/flow_cli/src/foreground_check_commands.rs:270-307 | rust_port/crates/flow_cli/src/foreground_check_commands.rs:486-523 \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 \u0060rust_port/crates/flow_cli/src/foreground_check_commands.rs:270\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":"rust_port/crates/flow_cli/src/foreground_check_commands.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6adce6a589377f8fb78eb80e6a6f62f196ed691423303efaaca1d74a9787a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:3328-3365 | rust_port/crates/flow_parser/src/estree_translator.rs:3412-3449 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d079da182ba7ab332ac586b0bd43b6458d6ebcb5642edff92339a0e189481858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9028-9065 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9109-9146 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9028\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9028}}}],"partialFingerprints":{"codehealthFindingId/v1":"58532981c894572533bcdc4cd1a4290d7b14529cce5c4e129cc43519a2a23fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:2274-2308 | rust_port/crates/flow_parser/src/object_parser.rs:2314-2348 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:2274\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8657dd58ef34180210f2d20a464cea9c6ec14fc76a421b1434a6c169ee864dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:998-1032 | rust_port/crates/flow_services_inference/src/merge_service.rs:1095-1129 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:998\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ffd3632c0a59737a6e26f6641550d48ea5a6dd90a7e1cd305edb56a1f226da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4085-4119 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4243-4277 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4085\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4085}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd83890b276918236653594fe0d1ba10e1524495e6dd481d4766848f64c472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4997-5031 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5078-5112 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4997\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a1ad45bb87cb97ee50fdd66150795465e913c556ba887823c8f9c9ec24e5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201334 lines \u00D7 4): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:4867-4900 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:4922-4953 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:4990-5021 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5056-5087 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4867}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f78d7f6607d6415101aa517f66f047b1a34536160a0c3533ca994d2ba8975a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201334 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9264-9297 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9336-9361 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9264\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9362\u0060 calls \u0060MessageAbstract\u0060 and \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9298\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":9264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7952de620f9442580f6e58f398d127fcb902bc42abb1a53fce04afe5ffe8ec7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201333 lines \u00D7 3): rust_port/crates/flow_analysis/src/ssa_builder.rs:879-901 | rust_port/crates/flow_analysis/src/ssa_builder.rs:924-946 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1677-1709 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs:879\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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f056cdcf9158bd40c25e10d82741afc87ed20aff68c0c42b4b2c32e8f2f01ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:228-260 | rust_port/crates/flow_parser/src/statement_parser.rs:281-313 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:228\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b3271d971af6dfd5b739be0ab36e87913628f829dc73753d9da428973a7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8647-8680 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9032-9065 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8647\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8647}}}],"partialFingerprints":{"codehealthFindingId/v1":"98036384e1f8e3b71f8c0a147a02dfae44cc5283ed148188ba23383967730ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1291-1323 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4917-4947 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1291\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa94bd74645b3a42d90243ffdb60e64e775d1d86b864588a900dae8824480f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201332 lines \u00D7 3): rust_port/crates/flow_cli/src/glean_schema.rs:321-347 | rust_port/crates/flow_cli/src/glean_schema.rs:466-497 | rust_port/crates/flow_cli/src/glean_schema.rs:795-821 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_schema.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d657ad8be8fe0827696fb30f9e50a3a33fc99c06150da9a1e03461436451a005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201332 lines \u00D7 3): rust_port/crates/flow_parser/src/parser_env.rs:1141-1143 | rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:46-77 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1012-1043 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/record_lowering.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30e4ad9b1b91ddd3279b8fa1acbb0c0acd18893fd4585b9da1bf1a49b9cbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1543-1574 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1606-1635 \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 \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1543\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e47ffdcd080eb34b2603d0a47b5e59adb116d6d1567d1eb0869594eae52d12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1015-1045 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1069-1100 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1015\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"739077055aba39775ada53d61b69ed43b9d7f6497e3e000b80d1ab9905e41479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:435-466 | rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:607-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:435\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1441136df850ca45ec367ebed733f2a1e7e6287827a4b01b2e373f63d4a9ba72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2243-2273 | rust_port/crates/flow_parser/src/flow_lexer.rs:258-288 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc504a515c418a38a8768fb170aa86e5c47b83fdb1023239f36155341248d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1312-1338 | rust_port/crates/flow_parser/src/object_parser.rs:1909-1939 \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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe8175fea5e06673d2af6c3f7488f6831cd89a32c4f393f2d28d4b1cef082dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:50-80 | rust_port/crates/flow_services_inference/src/type_service.rs:2481-2511 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_server_rechecker/src/recheck_updates.rs\u0060 and \u0060rust_port/crates/flow_services_inference/src/type_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"503bc28a848c045c0e850ef1bb69e4c20615211a823526e67b4b3906a3f49bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201331 lines \u00D7 5): rust_port/crates/flow_services_inference/src/type_service.rs:1489-1492 | rust_port/crates/flow_services_inference/src/type_service.rs:2256-2259 | rust_port/crates/flow_services_inference/src/type_service.rs:2920-2949 | rust_port/crates/flow_services_inference/src/type_service.rs:3293-3323 | rust_port/crates/flow_services_inference/src/type_service.rs:4119-4122 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_inference/src/type_service.rs:1489\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 before the matched lines, \u0060rust_port/crates/flow_services_inference/src/type_service.rs:2920\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_services_inference/src/type_service.rs:2256\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b356346f1681c339e0ee369ae7d9bd089bdf0f2ea185ce521d2be794dd8c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:1617-1646 | rust_port/crates/flow_analysis/src/scope_builder.rs:2148-2176 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:1617\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"22de72c1e01af40b74b8f48f883e91afdf686b7ca684d00b14487d1f2e1519d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): rust_port/crates/flow_env_builder/src/find_providers.rs:1629-1658 | rust_port/crates/flow_env_builder/src/find_providers.rs:1664-1693 \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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aec102c4265a4c1b7959f1925785e2adfcbaf81bdc1d432f8f4788802888523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3569-3598 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3620-3649 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3569\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b621d6bf077e265cf7fc0c848170561ae4479073e9e1ced3fa015bf658217a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 3): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:760-796 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:901-937 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:986-1021 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:760\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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"2802a82cc964a38cd489f88ab488d9c156ccb5555215e22f7c2178092a824114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/flow_lsp.rs:3716-3743 | rust_port/crates/flow_lsp_server/src/flow_lsp.rs:3747-3775 \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 \u0060rust_port/crates/flow_lsp_server/src/flow_lsp.rs:3747\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8926179da6486ad8fea631920b127f2791e83efbc59bea2a8d7af1c5a30d2458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3739-3766 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3809-3837 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3739\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":3739}}}],"partialFingerprints":{"codehealthFindingId/v1":"254768bf288560f06cdf643a9003f6ef244b474bbd66850cccf74f2e932b9878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4294-4322 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4376-4404 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4294\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"811fc92511a71019fd4aef98baa7813392ce9b88d17edf0f1c5313a20cdb8763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3533-3561 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3566-3593 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3533\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7043f2e0d31578b01c3ae317fb37f179fa6e52a9750df1dc3159276d224dc87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3985-4012 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4020-4048 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4020\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3985}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba545829e23f7ec5eefa664993a4c7434c215a17690560a590f9cd7f0d34fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4730-4758 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4878-4906 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4730\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4730}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2e40524f82d8fa8c3f1a7352ef156977a1540ef4b7cb1e6a71e5241821748a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3761-3788 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7790-7817 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7829-7856 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3761\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3761}}}],"partialFingerprints":{"codehealthFindingId/v1":"258217e05372618a7f7be63b006edc6c9b521b4d033e2c206e819a9a4a50e028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:984-1014 | rust_port/crates/flow_type_sig/src/type_sig.rs:1114-1144 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bd5c72aa4ad4ae05125fa7e6b53bdc4ab50efbf190fa391a4e8d715a6ce95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2112-2139 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2509-2536 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2cef8751d9abef7346fa608e834fd5f6ccbf4c8e7986d2f8ed47e796263a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4863-4888 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4891-4918 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4863\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e329bf4a2d6bc70b08705550afc210f508cee8aa34a406b2c1c9b00c076d67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1117-1141 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1220-1247 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc84bb4dd7e612e716972de7109c71417a336b0b418a512ab9a81f8f45dbf0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10359-10385 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10429-10456 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10359\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":10359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120cae4a2611839bff96a68220dc5a1b50510b982eada9093ab28dd36542d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2612-2639 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2648-2675 \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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ee77fd9d7edf711c977f340f165fd6c4efb460c76f9d3e74bd251bb9f571aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201343 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:10057-10099 | rust_port/crates/flow_typing_statement/src/statement.rs:10134-10175 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10057\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10057}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e89942812bd0945c5d991ed67a6404fa216a22c44ac89db458fd89d62762078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): rust_port/crates/flow_cli/src/codemod_command.rs:330-356 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:682-707 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/codemod_command.rs\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/codemod_command.rs:330\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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e244189214b29f6d48c84125f632d862614d1a717f5acbe956c7c758eb62054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12131-12157 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12671-12697 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12131\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4b48fcc3cc6265f0d05890c24c32a27d552fc302d36e1d2ee2d9b93b41d668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7643-7669 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7680-7706 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7643\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee9549cd6bb16975a992f649d34cdf1ed88f296a757801cca1b20b732ccc4f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/position.rs:109-132 | rust_port/crates/flow_parser_wasm/src/position.rs:197-223 \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 \u0060rust_port/crates/flow_parser_wasm/src/position.rs:109\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":"rust_port/crates/flow_parser_wasm/src/position.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5e53101af8088357eb3fd1019b755c9c25774c9558d26bb1a96a0f1d37747d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust_port/crates/flow_typing/src/merge.rs:801-827 | rust_port/crates/flow_typing/src/merge.rs:875-901 \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 \u0060rust_port/crates/flow_typing/src/merge.rs:801\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb8cf36ad46f1d554b7f3693c36ce0bca21bc48bd2c81e95fb97d70ffc728db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7864-7888 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7894-7920 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7864\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7864}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c6db608ff5e7da6025dd9ce59837b875fe23b95207a65d0bf580794b99202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201350 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17133-17181 | rust_port/crates/flow_typing_statement/src/statement.rs:17198-17247 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17133\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f22816175cb4f3fb132e7fd11c123ecc2adc917a1905e3e8a7f3a4a669d1a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4584-4608 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4616-4642 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4584\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66f4ef0c63ed05457f8921ee5810e5bcb38fdbde4a184c3971e3db872763609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): rust_port/crates/flow_services_module/src/lib.rs:1548-1573 | rust_port/crates/flow_services_module/src/lib.rs:1593-1618 | rust_port/crates/flow_services_module/src/lib.rs:1644-1669 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_module/src/lib.rs:1548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_services_module/src/lib.rs:1574\u0060 calls \u0060as_deref_mut\u0060 and \u0060rust_port/crates/flow_services_module/src/lib.rs:1670\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":"rust_port/crates/flow_services_module/src/lib.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa20b6fc175a057b16477cb8feee3e188ee24bf8f5f71271843c5c7010c4712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8719-8744 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8749-8774 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8719\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8719}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb2815a054bb87ce23e123f8b2e564f5a59dc2f8ef847ae1b0a4729a6884cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:1789-1814 | rust_port/crates/flow_parser/src/expression_parser.rs:1841-1866 \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 \u0060rust_port/crates/flow_parser/src/expression_parser.rs:1789\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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3960b5aebb448933f210c55f2767bfc09f6ce266f0e628acece478e96e5f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3602-3629 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5093-5120 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3602\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdff06296272aaf0935dfbf8fcfeeb7d25c7fb633a517a9bcffc24bf895ccdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201326 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9846-9871 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9904-9922 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9846\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9846}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a280a9ccc418bddae6cf2838c216434511b4ed0cb8b52eda9f24b3b5417cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16228-16253 | rust_port/crates/flow_typing_statement/src/statement.rs:19147-19172 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d279a38ec3b2e0025dd1c1b1c9570dec46f19203fb5c8c5c2dd73ae25f75871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18532-18557 | rust_port/crates/flow_typing_statement/src/statement.rs:18709-18734 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18532\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e683a739f3718787eb1c5276f4bb73e6209bdb0e6d388f70aadf9deb9d2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3549-3574 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3591-3616 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3549\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4472fc146a2c8e422cb401b3d4351cdaba37f656d749cace3f1e6d0eaf074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:468-488 | rust_port/crates/flow_services_inference/src/job_utils.rs:206-230 \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 \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:468\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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e84537e3fbacaeb73f27b2b399d76ec054dd5c77098a2cb6037c714ff713967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty.rs:2051-2075 | rust_port/crates/flow_common_ty/src/ty.rs:4488-4512 \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 \u0060rust_port/crates/flow_common_ty/src/ty.rs:2051\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae29845531799b9a6e956efca465f6658ed94f3156048db10248effa6c68bbc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5500-5524 | rust_port/crates/flow_env_builder/src/name_def.rs:5590-5614 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5500\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5500}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be1674fef32822706f9a9d2f0de707743a2ab4ccd56cbbf20a6c5baca0b965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6160-6184 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10690-10714 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6160\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea8a9de7934721da441faf399b72b7b2343dd4a8be473e2bcd6212daf0b3837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2537-2561 | rust_port/crates/flow_parser/src/statement_parser.rs:881-904 \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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8084573e94244c403eaf2b82b114d00efd958f1d7b943b1c5bf49441c40a29ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3410-3437 | rust_port/crates/flow_parser/src/statement_parser.rs:3542-3569 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3410\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dbded71877066fa283b5edfe22d3590ad09ac485a33c20b4bb4dc6537e79d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:61-85 | rust_port/crates/flow_parser_wasm/src/strip_flow.rs:98-122 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/strip_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5c076e01def208045974de7651a8a02b0fd78cce9501f915f5c94ed2061773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:4604-4628 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4771-4795 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4604\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b4bad73514ed9b5b755d8cd158e1ee7cd86e419d4aeba20f43708906baa196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:245-269 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:305-329 \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":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d03932cd9aa3524c4d1d6aa5184cfc85af9bca020d3a4bbabebab609d3066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1799-1822 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1896-1920 \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 \u0060rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1799\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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"838d0b078a26b716efdaa65d5715b8a62efb9d739d75f388b7d98844d7dd01cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:5347-5370 | rust_port/crates/flow_typing_statement/src/statement.rs:5447-5471 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5347\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5fa48bd407afa8f7f97880f688c03ecabb8e15907d5992c88d1a87518ca886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2148-2170 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2290-2314 \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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"000033bc0d57ced2e3046ed87ee33b89ef884d6969a574ed080be2f53f23c9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:2035-2060 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:2074-2099 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs:2035\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be6af1724c21684932e2ce07692e73a26559007be7b116d1dc6b0755f689963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:572-594 | rust_port/crates/flow_cli/src/glean_runner.rs:600-623 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:572\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3ab9a40b0122d77441642971e0310de0f3b52ec6de1d7a36ef2ad87e0540d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1526-1549 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2143-2166 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1526\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ba4ee43d4729ac8f4ae3ca9a73bcb9c5c718500839b21ff3245fa885d13402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_event_logger/src/lib.rs:1329-1353 | rust_port/crates/flow_event_logger/src/lib.rs:1391-1415 \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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dbfe0c7148b5ea497823298d48451fa59ad515229f6b1d9b31508f5e002e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1113-1136 | rust_port/crates/flow_parser/src/object_parser.rs:1185-1208 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:1113\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"12000da00c8aa4518ad1e92f0756aaaf8f51dd942bdab5ba1e803b60c46cde1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:3412-3434 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3522-3545 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:3412\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8829420542efaed6f2a4eb98e1312369978f6c1ba5d6a4298e02cb408a37582c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2079-2102 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2486-2508 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2079\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40df71f198bac939fc477c8c353c50f8fc8809352736857c56572ded3bf038c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201324 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5318-5341 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5434-5444 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5318\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbaf25749497776fba78e6e49ed3805f08b117a07995e871cec0335945b6b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1148-1169 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1180-1203 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722a71f59f1e151320a348b58f7eee1694cbf7073af5ffe32f5480db40ff877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7724-7747 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7759-7782 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7724\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7724}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d98aed64baa206761fbc74f606055a13801188379f651e94e6dabc93b62e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:934-957 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:989-1012 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee79251259955215f8b89b2eff9520b9830fa1037f53a9078c43c9f7bf0debf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4056-4079 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4086-4109 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4056\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4056}}}],"partialFingerprints":{"codehealthFindingId/v1":"20873221c069c9dc3181f782ab3c26a39f1ee084773a9673c8d2246c8ef4b9e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201324 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5206-5229 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5239-5253 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5206\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":5206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d2cec1719370ba3908a6c7b106d449008a64c5f2c4380997926c09705b06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17501-17524 | rust_port/crates/flow_typing_statement/src/statement.rs:17718-17741 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17501\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17501}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf9c8fe5cdcb08e7f026789b51e061dfc42d2398304e3742c2fedcf4d207dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/switch_to_match.rs:422-445 | rust_port/crates/flow_typing_statement/src/switch_to_match.rs:469-492 \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 \u0060rust_port/crates/flow_typing_statement/src/switch_to_match.rs:422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1490aabbfccfeceda713f987731b451ad6039310cdf58da6b74300d6068be448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7797-7820 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8152-8175 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7797\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7797}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc48aacd03c0110208dfc9cb813db88b4a1843f7ec8375c54790e8a5bb1149b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8829-8852 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9351-9374 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:8829\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8829}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b1df5cb839de4867443ec68c4df29129dad1c017dd5f43d3bbe328de6bfae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:5076-5098 | rust_port/crates/flow_env_builder/src/name_def.rs:5124-5146 | rust_port/crates/flow_env_builder/src/name_def.rs:5176-5198 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5076\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5076}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9928d301a74c76741fc28411359bf72d96f0a64468a8861c25d0b9fca1ed58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:5238-5260 | rust_port/crates/flow_env_builder/src/name_def.rs:5289-5311 | rust_port/crates/flow_env_builder/src/name_def.rs:5344-5366 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5238\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5238}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2e2c47aa681e619f578555641bee2851d84dc072276d2568ce9ca26350430"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201323 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:14779-14801 | rust_port/crates/flow_typing_statement/src/statement.rs:14807-14829 | rust_port/crates/flow_typing_statement/src/statement.rs:14831-14835 | rust_port/crates/flow_typing_statement/src/statement.rs:14879-14901 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14779\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14779}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534000441d76fe64b60bf0b36beb02a6a8fcb2a077599a67c27b1735647946d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:528-549 | rust_port/crates/flow_codemods/src/annotate_exports.rs:573-595 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:528\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e265a9db0736f1a3f7713c8d9a7303cf11c61f519003cbfb81565dcc318364e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3929-3951 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4015-4037 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3929\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3929}}}],"partialFingerprints":{"codehealthFindingId/v1":"786f8b0e787039223e798808234b6f4ea8a8dee1981170bb7b2d126a8fa2c996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:47-74 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:701-728 \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 \u0060rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:47\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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b28b29ad05e8f98fb6b2a7e07a01692380fb9c23cfb77dfdd986c6806b0b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5067-5089 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5211-5233 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5067\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5234\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5090\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5067}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36760e8079c3bcb5740a399f9c32a32e5b243f5df866db8d851b71b816525cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8511-8533 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8850-8872 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8511\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8511}}}],"partialFingerprints":{"codehealthFindingId/v1":"938a87b87da1115ec73e74cef9c351f272ce9649321f64813bf82cd84c6e4d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing/src/marked.rs:28-50 | rust_port/crates/flow_typing_flow_js/src/marked.rs:28-50 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_typing/src/marked.rs\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/marked.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"rust_port/crates/flow_typing/src/marked.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9260c899112c2298b2c9f6ed57de8f52593ce6fb64b16f593e64956f88199a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:6042-6064 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:11002-11032 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:6042\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":6042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd05afe5b8d412d4571d63849e617b28723e3c6f1e8f0e6ec2fb6b9e5d6abf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1872-1894 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1985-2007 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c6c3acc63109e2b0c550b5da274207b1454120c9694d80147a547ae3fb47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:12505-12527 | rust_port/crates/flow_typing_statement/src/statement.rs:12538-12560 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:12505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:12537\u0060 calls \u0060check_default_pattern\u0060, \u0060loc\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:12504\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2f2a9e0e8d74c07f28c921b2b8438a14413cccc7babaf40410be66ba18b89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1705-1727 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5955-5977 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1705\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a729c7ef90b170bab9010ce1ffdbd41f58a3fdcfba6cac03efb674df26bbfebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1150-1172 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1505-1527 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1150\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"694f603f78355110391ce4156e5273890b78ddf02015329bf4f20c8b02e3e9e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2011-2033 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2044-2066 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2011\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3eb3395f8d927a3900e23128996b71b4d1fd74a2286a0375c7f938248897ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2571-2593 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2599-2621 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2571\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"30686c26205fcf97d01d8976aea77576d4a349220dc43586bec8c343693202e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_common/src/hint.rs:216-237 | rust_port/crates/flow_common/src/hint.rs:285-306 \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":"rust_port/crates/flow_common/src/hint.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29b128f0079e2f277fb687d135cbbd9eebccf6754a3a52d7809ee43f32bf2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_printer.rs:100-117 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:505-526 \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 \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:100\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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1293e43b431e37e68c88d2501ae41e508d377ffe7bf37d6e6f5a0208d4ef6861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_env_builder/src/find_providers.rs:2137-2158 | rust_port/crates/flow_env_builder/src/find_providers.rs:2180-2201 \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 \u0060rust_port/crates/flow_env_builder/src/find_providers.rs:2137\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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"545915dd5070ecbd5ff30e90c4c1255925ea7267da1e72b434a26914dee0cb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2060-2081 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2110-2131 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2060\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2261fd40ecbb566c593efe4eac8ee3d54953fc07dc3f0eef1c9403266806ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6107-6128 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6362-6382 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6107\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3398df1734da2463a6d4df2cd49463ca2d1b72d2dc3495f828d382df21196a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs:183-204 | rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs:235-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs:183\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_match_syntax.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffa3b43452213fee5c507cd7d848bf0934644be51160e20b2c9bc8735a454da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_services_inference/src/type_service.rs:3825-3846 | rust_port/crates/flow_services_inference/src/type_service.rs:3934-3955 \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 \u0060rust_port/crates/flow_services_inference/src/type_service.rs:3825\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":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa63d302bf25ccacd41fa5e015f2bd997bca8757bcaf7717c975d7d6f760ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3517-3539 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5238-5260 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3517\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3517}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e0c8d924a5106b736a533727492e3dcf3c529be6169b66f16d7840621a2708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5344-5365 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5428-5448 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bbdcce1e8c4ef107e07388a04122e1fdf17ad42c48a4242553e511a221326d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10700-10721 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10836-10857 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10700\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":10700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7366ec0ab5eb3e938de8dca63185534edc3184bf2467084a7afbc5acb07b54c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10025-10045 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10047-10068 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10047\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":10025}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bfa812613a62a3f592a6632ac638da0af3f53a03bb5da2a850f7c949e0e054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/react_kit.rs:469-489 | rust_port/crates/flow_typing_flow_js/src/react_kit.rs:510-531 \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 \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:469\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab8c45d57443db4056f030045db370f66a4913da7e87f0524048699ff73cec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/renders_kit.rs:836-857 | rust_port/crates/flow_typing_flow_js/src/renders_kit.rs:893-914 \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 \u0060rust_port/crates/flow_typing_flow_js/src/renders_kit.rs:836\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":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a08d286838c6993ea1de0f6b704ecbc6cde288b7ed6e1c34b6c51dcbab90bc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:5785-5805 | rust_port/crates/flow_typing_statement/src/statement.rs:5812-5833 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5785\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5785}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdc29dcb10391efddc88db6c3bda999d86d3761661e0ad49c2a3623fd75debe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9859-9880 | rust_port/crates/flow_typing_statement/src/statement.rs:12664-12678 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9859}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf5d15a7d10c30bed517697bff6154ef14ae7d607da8ff18d522b62f6395f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17265-17286 | rust_port/crates/flow_typing_statement/src/statement.rs:17594-17615 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17265\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17265}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbe596b46fcc9e35b21aed232b186f0a05b7dc9971efb17e193c8ab2eef7eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18434-18455 | rust_port/crates/flow_typing_statement/src/statement.rs:18607-18628 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18434\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5715b5006668c581bbe2bd61374ece4817cc9636db4c75b55b2533a2947eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:21264-21285 | rust_port/crates/flow_typing_statement/src/statement.rs:21387-21406 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:21264\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":21264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8113243c5fbd030a8a0b510b8a243b60be4d8bd872ff921dd891b5fb6727e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:9736-9757 | rust_port/crates/flow_typing_type/src/type_.rs:9829-9850 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:9736\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9736}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0eafac7d88f8ab2aeaf67441b2899bc04f81d89e5f1b382becd59753fbc49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3813-3834 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3886-3907 \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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"28388ac6ac633c0a8c89cd4f2d6f6e57e83adbbd76ce32a3d9b3351e4819c155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:1092-1113 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1139-1160 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1092\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"0575bfd01a178521df84efb06c181a26282d44e08830ac60eb913d53b86c6217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:1186-1207 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1239-1260 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1186\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b05dad997bbe45919317470a5f45402b02cd58da19c4ca7c7e53087edc4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:1316-1337 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1363-1384 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1316\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5f031be5a967125394ea6e844806e11808c4feb5eec03169fe29e74fbfca29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:1412-1433 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1459-1480 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1412\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5fa987c48ffde83bb2c77efbd39bed59b9b732a821f414b6d105af57ed1182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1705-1726 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1763-1784 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1705\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc172bf5995a1aa494eba742a54392fcc2b66348f34b19c9bfcdd12cfdb52ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:11355-11374 | rust_port/crates/flow_typing_statement/src/statement.rs:11444-11463 | rust_port/crates/flow_typing_statement/src/statement.rs:11486-11506 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11486\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11444\u0060 calls \u0060expression_inner\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11486\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9d514ec086d14c0448a07804ac66c5eac22160c79db273d0a9b5be7bd3bb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:11560-11579 | rust_port/crates/flow_typing_statement/src/statement.rs:11599-11618 | rust_port/crates/flow_typing_statement/src/statement.rs:11641-11661 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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 before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11640\u0060 calls \u0060add_condition\u0060, \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11559\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc482adbb98edf02b494652fed07ef5e8493028c2af89b78fdf48f7c03a944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:17450-17493 | rust_port/crates/flow_typing_statement/src/statement.rs:17616-17659 | rust_port/crates/flow_typing_statement/src/statement.rs:17820-17863 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d25bb9e118d4919d99ae955ed21f94eae8bbc8b3affac313520cda6aeda9571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6467-6487 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11302-11322 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6467\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11324\u0060 calls \u0060pop_back\u0060 and \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6488\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3197e3bce974c012842e201d2665208c7a71e091c075a02efa561f2a11d5744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:676-696 | rust_port/crates/flow_parser/src/estree_translator.rs:2939-2959 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fa2670f584c6ca27c4d3af124791f0cb53983b7df284b717ad501c397f63e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:387-407 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:431-451 \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 \u0060rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:387\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060\u0026\u0027ast expression::MatchExpression\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026\u0027ast statement::MatchStatement\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7052d4792b8ee995c07963fff182021bf58e9e774c451c2400dab6daef71af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3322-3342 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3373-3393 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3322\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"22493651799b26430fae6ad9e61a52d12926bf98ddf4822a816c75375103e1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3335-3359 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3372-3396 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3335\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f49db50b95e19d25ae86bdbe7a91a48c5a070b05bef8ce5db5df1e151625ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1537-1557 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1595-1615 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1537\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8834042d98801dd58876f209e38a387f484163e015fc05dd51ccdde59bf0d97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1908-1928 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2019-2039 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1908\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"568fde12004c55b323e3341c0c93483e782d09c060e7b46976cba31c96902ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1762-1782 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1800-1820 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1762\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1761\u0060 calls \u0060unwrap_or\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1799\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6e01ea2c0a6908d7ce0e496382d74bedf28ad95e63b45cdca58450acb5209c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1856-1876 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2150-2162 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1856\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f218dc1d91702851afa0655bde1dfeb13c67631cedd34509b01a9818186e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:772-792 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:971-991 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:772\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec199e1aef85e28f83259456777367a7b7b5b2f13b2b6aa8a1477c5dd813c579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2624-2644 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3447-3463 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2624\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"44929b295091814dcaa38acb57ae8fb1f8b1311830efbac6757cef922b05a670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2807-2827 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2832-2852 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2807\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"52110738f0c7250dfef274b18a973cdf90ae6dbc60746d0b9962d99e77c5412d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1650-1669 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2153-2170 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2188-2205 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1650\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"af513ee75e56d2f4d11d841701ce798e20dcb4df5a2b8d67f85cf7e04609ccb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:193-212 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:243-262 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:283-302 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:193\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, \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:242\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:192\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"de95a6601a278fe4cde331420363911576f18f7212173c44b1dad74e3d61a8d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5094-5113 | rust_port/crates/flow_env_builder/src/name_def.rs:5252-5271 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5094\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5094}}}],"partialFingerprints":{"codehealthFindingId/v1":"0655d3ba5a3e799e20893de2db6836908131c50316fd9eaef00f6d5a9906ccf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10113-10131 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10158-10177 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":10113}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1fe01e05a0272191c605003d740e8b04cd94bbe0513b3cc41787c5ebc5a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12577-12596 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12605-12624 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12577}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e15b011925b0965fac4459e9ba909366ef0e86e738f4018b9a34228ab508db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2680-2699 | rust_port/crates/flow_parser/src/type_parser.rs:1050-1068 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/expression_parser.rs\u0060 and \u0060rust_port/crates/flow_parser/src/type_parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/expression_parser.rs:2680\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c1bf1e11aef28e4c83d24625f7ad2ea4179a3ad5bb727d33d83798fbe06ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3313-3332 | rust_port/crates/flow_parser/src/statement_parser.rs:4161-4180 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3313\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2692785e2c5994de27a8961d3799113de31ef8f0ff7866511f52703dcbea26d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:2897-2916 | rust_port/crates/flow_parser/src/type_parser.rs:3198-3217 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:2897\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f508e5d9b72a5d423f7607f1355b256aa0dd6d3c28ca5fd524ce9f3d2e15af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6071-6090 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6142-6161 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6071\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060c1\u0060 to \u0060\u0026ast::match_::Case\u003CLoc, Loc, expression::Expression\u003CLoc, Loc\u003E\u003E\u0060 in one and \u0060\u0026ast::match_::Case\u003CLoc, Loc, statement::Statement\u003CLoc, Loc\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6071}}}],"partialFingerprints":{"codehealthFindingId/v1":"861c98d76077a511e939aa6f91a0cd873c078d054e5f0e2548a62b03b87bfa9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:806-823 | rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:836-855 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:806\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab79111d5ee76bc79a2572b4a6216e2aa2e8cfa82eff94f8ec5ee53351d7a396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:209-228 | rust_port/crates/flow_parser_wasm/src/strip_flow.rs:183-202 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/strip_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:209\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e2ada3711456949e8a00377dbfdb2bbf88b3be2d899d006a6b29444a6646be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:2225-2263 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2393-2431 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e9331ebfd851149600e4b5b61a1fe41ce91bf067256619e5509cdb6ac0a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12183-12202 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12206-12225 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12183\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12183}}}],"partialFingerprints":{"codehealthFindingId/v1":"74754e971d5f70c3eb572a29c5ce2c24ca3d2cf9c1705306778656300dcf8ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:3429-3448 | rust_port/crates/flow_typing/src/env_resolution.rs:3450-3469 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8f57163ca26b411a6301d14e1f14271e697f9b0f61e2e588ea351fa4d8d5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): rust_port/crates/flow_typing/src/ty_members.rs:261-277 | rust_port/crates/flow_typing/src/ty_members.rs:290-309 \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 \u0060rust_port/crates/flow_typing/src/ty_members.rs:261\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ef3f84227dc7d63255490394ee58c30b97a30889530773f103b2fda0c39aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1494-1513 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1588-1605 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1494\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"512bcd6f8a5818aab1a8e5842438ac7e2abb88559698f247c8f3a000d1d8872d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3265-3284 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3288-3305 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3265\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec42822c1622c859dae765166b4c778a6302394597fa14cca48bfbd77b9514cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3132-3151 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3162-3180 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3132\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a65dff32f5784521e9c61909c54ed7abc47c8aab26781a3579271ca760f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6491-6510 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6531-6550 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6491\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":6491}}}],"partialFingerprints":{"codehealthFindingId/v1":"39462855551c1cfd2a6987b0473f37a1a1be503955c1bf6f04c5f6dd135a8981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9680-9699 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9709-9727 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9680\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9680}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37f342ea3f0db18b25baed8f60698f463e86bc40b5456fbc4c465c2d4f44099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1884-1903 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1930-1949 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1884\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164790469c008510041ea52a9d188d161f852c3cb87a2dbfa45961c56ca3b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16408-16426 | rust_port/crates/flow_typing_statement/src/statement.rs:19306-19325 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16408\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14fb86ace9c762e716896fae9d446da53ba1a68c1d733c1ac64569f2d5d06d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19003-19022 | rust_port/crates/flow_typing_statement/src/statement.rs:19061-19077 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19003}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3aa5ccdf1f6ef71693a2717c838788265eb091b088de3c03ede9071f6d8b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:4702-4720 | rust_port/crates/flow_typing_type/src/type_.rs:4799-4818 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:4702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4702}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e36b648e839ecf3ffe887507aa5a43cd6405689d08418ebaee63949300e6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:4939-4957 | rust_port/crates/flow_typing_type/src/type_.rs:5038-5057 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:4939\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4939}}}],"partialFingerprints":{"codehealthFindingId/v1":"5764f786eaf94a8f28626e836d1ad2a48b236171378076ccd53ceddf822db0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:504-523 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:524-543 \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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3d1c6e9cf6b3b1d8332df86a7455fe2d464f90cc97fbe6c5c8da005a1db1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201320 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1343-1346 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6133-6151 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6158-6177 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1343\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab07bccf1bc6ce1080b88bbd6a803a6e81c789d59088b3c5d6807d1244540b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): rust_port/crates/flow_analysis/src/property_assignment.rs:538-556 | rust_port/crates/flow_analysis/src/property_assignment.rs:664-681 | rust_port/crates/flow_analysis/src/property_assignment.rs:702-719 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:538\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, \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:663\u0060 calls \u0060for_in_statement_lhs\u0060 and \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:537\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2af719ad8bd6c9570e3605c5a62b552f50fe1946a01fedecb9d0f5a1e8be1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): rust_port/crates/flow_config/src/flowconfig.rs:505-523 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4642-4659 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4825-4842 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_config/src/flowconfig.rs:505\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, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4659\u0060 calls \u0060push\u0060 and \u0060rust_port/crates/flow_config/src/flowconfig.rs:523\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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec6178ca892808b6bd04df2bdcb861891b252688914ce488639ac004f60585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1265-1282 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2319-2337 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3901-3919 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ccb25269f3ce73d3221e7fbf393cc539168f65f8a16be331825c48a7e95e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_cli/src/autofix_command.rs:356-374 | rust_port/crates/flow_cli/src/autofix_command.rs:526-544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/autofix_command.rs:524\u0060 calls \u0060get\u0060, \u0060truthy\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/autofix_command.rs:354\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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5316479abf55dd97b864b5f71fa85b0c217b838bc245365141409a64f154d5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:994-1012 | rust_port/crates/flow_cli/src/glean_runner.rs:1184-1202 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:994\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"779e3ee4b4b7814a2cd343fd1280308e0604f84e163fa75fc2b2d06fc2154eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_common_vcs/src/vcs_utils.rs:78-96 | rust_port/crates/flow_watchman/src/lib.rs:556-574 \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. 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":"rust_port/crates/flow_common_vcs/src/vcs_utils.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb1ce0add57166db4ec7aa66fb52a1771bf446c229747516a042140e85060d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5144-5162 | rust_port/crates/flow_env_builder/src/name_def.rs:5305-5323 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5144\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5144}}}],"partialFingerprints":{"codehealthFindingId/v1":"108d3fc6b022f88845b3221087e3f760240887f39b5b20b78bc09ab209cedb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1237-1255 | rust_port/crates/flow_parser/src/object_parser.rs:1380-1398 \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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb2502d913fb8ec3b1cbdd4eba6b73f11563e38ab35ee6b2f3a5ddc72f9dd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7417-7435 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7452-7470 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7417\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc2dfc055f1720077137e555f7292934f2c0b697ab7ffdddde0e84986566bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6412-6430 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6461-6479 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:6412\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6412}}}],"partialFingerprints":{"codehealthFindingId/v1":"568e477a13d5715588a20e4d2ecffe64dd165f74801b4268a1e299df37bf7e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:2812-2830 | rust_port/crates/flow_type_sig/src/type_sig.rs:2833-2851 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig.rs:2812\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6db483b1040a230a494bbbacd2b323f1bff56d242f5922baeacad8fa184adf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2593-2611 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2955-2973 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2593\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f387288520e81760be0712abe0a70b656a45ee9ad0841b48285ea5f90c17a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12553-12571 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12596-12614 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12553\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12553}}}],"partialFingerprints":{"codehealthFindingId/v1":"480c4d9f6d0b0dac83e63f3e6370a5c55739b235214f7a94bcf0ce5d76ca83b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201319 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13191-13209 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13220-13229 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13191\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd969270bb2b0b9a7a47642fea07ba11c4250afd318257fba2d3bb9f3a7889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9114-9132 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9146-9164 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9146\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":9114}}}],"partialFingerprints":{"codehealthFindingId/v1":"04174c2455a6cab6a1f792bc68b76042dbbbba68ad05e97002e50aea4208265e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4448-4465 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4499-4517 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4448\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b37e1815bec2268b9f909a2a847ae8f9a1c1d883649533f79485c2248f6f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1432-1450 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1488-1506 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"194cdc1d307796ac57682cc5f19b5fbbdcffb3a48e85b63a5c0e7ab1baaa8486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3902-3920 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3937-3952 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3902\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7dceaaddaf8abdd8bcb1ef923fc5715eb63446af9558e0dff290f6246a21ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:915-932 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:965-983 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:915\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"830800571a6f2761c79e3e92a9ef807ed69c0387e63664fd098fd8074e7f27ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:581-599 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:601-619 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:581\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6102db9738fac611663429003741d8285ef0cdd59df2544a22156d4adbb81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:229-247 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:286-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:229\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f56757886127f70b959178dcb5aedb9b395a2c73359e47bedec06bc911d107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3815-3833 | rust_port/crates/flow_typing_statement/src/statement.rs:4042-4060 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3815\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4bdb8d8ad66ac5cdc984781b8bf009f6deff4d6b23b6c724b714bb3cf320ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6753-6771 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6777-6794 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6753\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6753}}}],"partialFingerprints":{"codehealthFindingId/v1":"3409156b272d8f326f6be1a87cd056653a40ac59c6ca3ed3c1f71a81702dca9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/exhaustive.rs:2516-2542 | rust_port/crates/flow_typing_utils/src/exhaustive.rs:2576-2601 \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 \u0060rust_port/crates/flow_typing_utils/src/exhaustive.rs:2516\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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae2952f24cdf9d01db31587bbe70ceed6d93f935c37922391174210348b2f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:752-770 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:954-969 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:752\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f340599db655d3cd6d06e7f2d87994ec05057f02dafaed023ea5e1ce02e4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:590-608 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:620-638 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:590\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94b2a6ebbbd82480320b6db1273e89193d4c4eb00d54063808867aff6362f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4964-4982 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5758-5774 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4964\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4964}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccbd0faf99a2f2508fecd70b14a34b5d72afa138168fe72ce8e829e1f11fee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 5): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3778-3795 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7737-7753 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7772-7788 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7807-7823 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7846-7862 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3778\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b751253ea1b74ba8a09eeb1b496221f3d269f74d346bc18c62c518682ff5119b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): rust_port/crates/flow_typing_errors/src/error_message.rs:10024-10041 | rust_port/crates/flow_typing_errors/src/error_message.rs:10044-10061 | rust_port/crates/flow_typing_errors/src/error_message.rs:10064-10081 | rust_port/crates/flow_typing_errors/src/error_message.rs:10084-10101 \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 \u0060rust_port/crates/flow_typing_errors/src/error_message.rs:10024\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":10024}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d596609da5681841fd352cdd72f50b3870dc62c723fc515c1eed6f4988b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3371-3388 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4003-4020 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9179-9196 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10043-10060 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3371\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3186ba3e04a53d981a1066b6c8dacceb654c23d1d554a8383c170dfb4b00325e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4542-4559 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4564-4581 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5694-5711 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5716-5733 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4542\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d6d2559cd2245e7e14c115c3c5c47f4c715cca4638028c4b4d7760ff7c32b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): rust_port/crates/flow_parser/src/token.rs:38-55 | rust_port/crates/flow_parser/src/token.rs:60-77 | rust_port/crates/flow_parser/src/token.rs:82-99 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/token.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07659a3bb01bc1b0fc848dca1ec4cf5117bc8bd28fd618ef2500c6b6600375c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): rust_port/crates/flow_parser_wasm/src/serializer.rs:1569-1586 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1594-1609 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1665-1680 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:1569\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bcb16f5bf11cd73ef1f0597578dd9d319627710ec7f2c5cbac4af1609d66d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1229-1246 | rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1274-1291 | rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1319-1336 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"755aa76fb47790d2eff8fc54b964baa21fc8a3b1bf1fa9ac174584b65ed204a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9465-9478 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9502-9519 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10663-10677 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9502\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae474b2c28e786a68230840ffab39e87e3e1d6002ed3033a0c05977b74554377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_cli/src/codemod_command.rs:312-329 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:663-680 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/codemod_command.rs\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ac237038cf5fe70b07551cd71c81d378ae782efe5386e3d7d5c1444936ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:814-831 | rust_port/crates/flow_codemods/src/annotate_exports.rs:858-874 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:814\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1684980f59c2aa9864f4bab7f12be1371f05246a6ef2332f00b1b642d8be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:1421-1438 | rust_port/crates/flow_parser/src/file_key.rs:156-173 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_common/src/files.rs\u0060 and \u0060rust_port/crates/flow_parser/src/file_key.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_common/src/files.rs:1421\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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dc678cc0ba263be40484b2ef3fe4af5c478d416cca49f2ab82e5a1acc75d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_common_errors/src/error_utils.rs:2217-2234 | rust_port/crates/flow_common_errors/src/error_utils.rs:2235-2252 \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 \u0060rust_port/crates/flow_common_errors/src/error_utils.rs:2217\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"36494ae72fca752c56c5eba59ae908f7a398c05852021fdfeecba8ab166a7eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_config/src/flowconfig.rs:521-538 | rust_port/crates/flow_config/src/flowconfig.rs:554-571 \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 \u0060rust_port/crates/flow_config/src/flowconfig.rs:521\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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"857e0fad52dc194ea685ba7f063556a42829f71ae5976fc1262441e51acdc9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5469-5486 | rust_port/crates/flow_env_builder/src/name_def.rs:5557-5574 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d007b46a70b585814b7db67e0b76251798a32abf6377330b9e726134bea2db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7425-7439 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7465-7482 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7425\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5465799a35568d5547a95d76a5ffb336846348ca91aaf3fd43397a487d9a37fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_heap/src/transaction.rs:1151-1168 | rust_port/crates/flow_heap/src/transaction.rs:1215-1232 \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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7082915ba602a4c90d25b33e068e26c14aa8213fbe4ad8561ef2c2b0686826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_hh_json/src/lib.rs:128-145 | rust_port/crates/flow_hh_json/src/lib.rs:162-179 \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 \u0060rust_port/crates/flow_hh_json/src/lib.rs:128\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":"rust_port/crates/flow_hh_json/src/lib.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc4851d295c1f76e20ba16a17da8ea5773ca5fb2edbf74c7a27bc8f188d96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_parser/src/ast.rs:6019-6036 | rust_port/crates/flow_parser/src/ast.rs:6039-6056 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":6019}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a490f66befa877aa0b4a549024cc2aa610a555f026765c47a01941c5490b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:265-282 | rust_port/crates/flow_parser/src/object_parser.rs:323-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/object_parser.rs:265\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09fe132c1eee8f4db05ea88079bce409ee5584e7b08cf968a869628ec80c215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3266-3281 | rust_port/crates/flow_parser/src/statement_parser.rs:3515-3532 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3266\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed4c7a9d3464de4e99b9b9cf5727263e529d6eeb48baedc9ec078632b54e177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:3853-3870 | rust_port/crates/flow_parser/src/type_parser.rs:3926-3941 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:3853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3853}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebfdcc407542796c8aa7e64361010f526b40d382a405762e2444c2a62a293b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:4326-4343 | rust_port/crates/flow_parser/src/type_parser.rs:4425-4442 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4326}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d28e59dcc313768ec6cee47aa0e126893cd76bca4a1ab832e3e6f72a36530c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1767-1784 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1901-1916 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:1767\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bed19df7272feb17c85e3db24f3e0cee518e896e27dd7cbc80bb5f27645836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6392-6410 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6441-6459 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:6392\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6392}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ef861c9b59c1a4ac14f3e8a28187b6711efc398a9bb4a44d9bbfb4e1f4414d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1119-1136 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1144-1161 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1119\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35772c29e1c2e770711621476941fa8e9ef267a2c794ce1f9118562ee8affb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:1743-1760 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:1777-1794 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:1743\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b884ff71626ff1e07167d4a2c372ebda11b1670bce4334b8f784433405f07e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1070-1087 | rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1127-1144 \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 \u0060rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1070\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, \u0060rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1126\u0060 calls \u0060extend\u0060 and \u0060rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1069\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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"badb6266eb76d540ef5afe874eed706b1501bf680ed3b25b0f836599f989cdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_services_inference/src/check_service.rs:486-503 | rust_port/crates/flow_services_inference/src/check_service.rs:526-543 \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 \u0060rust_port/crates/flow_services_inference/src/check_service.rs:486\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1c66a04f7aa26847d9d93c69cb084542d9962c46c24641a7993fd5f453dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:2625-2641 | rust_port/crates/flow_typing/src/env_resolution.rs:2648-2665 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:2625\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"770edad6ab09c1aac47a1de15afff5beb68cbd4d806162ed9de16adfbfd2732c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2867-2884 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3272-3290 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3272\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd84c701d2cf7fca67e40592b908382f7858a99867734fc4d90c098e94bda938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4654-4671 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4690-4707 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4654\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c137c85163bb46efdb125bb3086c9176d7a54b498a16a586bc336382c5bdf50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7108-7125 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7666-7683 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7108\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7108}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c9c352bc40a5da212677eb66d6da39465880f1c9f41aee70a48a359625495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9499-9516 | rust_port/crates/flow_typing_statement/src/statement.rs:9600-9617 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9499\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9499}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a11a5865c397ee665d515665297ae832d41c19475704717dac89c102ba4c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14616-14633 | rust_port/crates/flow_typing_statement/src/statement.rs:14667-14684 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd1adb65e4fb8d68c7716fe44140bc7d67ef261f6ea7937ca53ea0afb58a329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7879-7895 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:7997-8014 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7879\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff1d33e3148e50a43cd790fe7373aee36728bef55f8f764265d8d65691db822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_util.rs:2190-2208 | rust_port/crates/flow_typing_type/src/type_util.rs:2211-2229 \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 \u0060rust_port/crates/flow_typing_type/src/type_util.rs:2190\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3399d7447c8e1808d0dfb9a4b2f028fb6af16fffadde0e66f982edee907fd277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2283-2300 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2336-2352 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2283\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0ea23686dcc412936c30a4f49dcdf7895c08d9bf378c97d3934d95779ef271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:901-918 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:931-948 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:901\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd71043d4d19639499a6e512e4b34d6f7063a4324aad22668a8a28879b89b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2442-2459 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2489-2501 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c2626bb73d42fd147282a6b53e32b6254feca06aadc856b34355faa8dcb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 4): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:785-801 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:926-937 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1010-1021 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1120-1130 \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 \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:785\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4bc607fa44a540bdb1be0c2babaf5f9625d80bebd087432c9402a8f6278585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust_port/crates/flow_cli/src/apply_code_action_command.rs:103-119 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:208-224 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:307-323 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:102\u0060 calls \u0060get\u0060, \u0060truthy\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:207\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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a14762b91e0c818e153b3c9f962126d9e4defaa2f95d6d6e428a9c2b63e933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust_port/crates/flow_parser/src/statement_parser.rs:1081-1097 | rust_port/crates/flow_parser/src/statement_parser.rs:1108-1124 | rust_port/crates/flow_parser/src/statement_parser.rs:1130-1146 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/statement_parser.rs:1081\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a93e9a6cdce463249ba25debb5fd5881f52661cd06c11fb9bbbbe19f090610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:12481-12497 | rust_port/crates/flow_typing_statement/src/statement.rs:12513-12529 | rust_port/crates/flow_typing_statement/src/statement.rs:12546-12562 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a789472a579b63785814963b3a5f9063e925991d548a42338cda9014b0ac3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:17496-17512 | rust_port/crates/flow_typing_statement/src/statement.rs:17713-17729 | rust_port/crates/flow_typing_statement/src/statement.rs:17866-17882 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17496\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17496}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13ec7b0768589e42fbcf5c064b54d708bf2195cf334180b295d627448a2fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:847-863 | rust_port/crates/flow_analysis/src/scope_builder.rs:879-895 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:847\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b7968c48a869e15a60f57610d3803eedc6ff71b917d83d92bd7aff36a0aecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust_port/crates/flow_cli/src/apply_code_action_command.rs:67-84 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:174-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d657f04c01e31be729412522e8eccd944f02185c9d24d18c7bc29e75adc13aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_cli/src/codemod_command.rs:437-453 | rust_port/crates/flow_cli/src/codemod_command.rs:707-723 \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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"604da02451fa899413c254aea785ed79994de94fcbb9909fead32e455140012c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:333-349 | rust_port/crates/flow_codemods/src/annotate_exports.rs:372-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6636fdccaf14ff3edd5e52968233e7104f7382c4f5fec7fe3e801d94a1dbe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_common/src/lock.rs:64-80 | rust_port/crates/flow_common/src/lock.rs:98-114 \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 \u0060rust_port/crates/flow_common/src/lock.rs:64\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":"rust_port/crates/flow_common/src/lock.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcef44b0774762dddf2368461fe055de16fea559b3891abfbcce4f16aa05001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_utils.rs:647-676 | rust_port/crates/flow_common_ty/src/ty_utils.rs:699-728 \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 \u0060rust_port/crates/flow_common_ty/src/ty_utils.rs:647\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":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2131e2a242925c639370c56a1768faa406624b746d1bd088b30172a2e16d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_lsp/src/lsp_fmt.rs:1270-1286 | rust_port/crates/flow_lsp/src/lsp_fmt.rs:1357-1373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_lsp/src/lsp_fmt.rs:1356\u0060 calls \u0060CodeLensResolveRequest\u0060 and \u0060rust_port/crates/flow_lsp/src/lsp_fmt.rs:1269\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":"rust_port/crates/flow_lsp/src/lsp_fmt.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d21427dfde6fc03e3ea246bb383d63af54a479d369d091ab6739222070c85b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:2336-2351 | rust_port/crates/flow_parser/src/statement_parser.rs:2385-2401 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:2336\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc59417986f726e1ad83017500603f6d89591a70feac59c7589b4829f576160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/type_param_analysis.rs:57-72 | rust_port/crates/flow_parser_utils/src/type_param_analysis.rs:214-230 \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 \u0060rust_port/crates/flow_parser_utils/src/type_param_analysis.rs:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/type_param_analysis.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e110795471942bf5560883750c37f83a0e83e6774668aeea57534e155737315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2271-2287 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2475-2490 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2271\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad8a8a4932e32067e9828fe630787996807b406f68ce0a2b13eecd2ef257ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:311-327 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:344-360 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:311\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0ed2bc201ce2b5e04143492b5a44a0f72ab7655093407d057bfad07478041e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/lsp_import_edits.rs:44-60 | rust_port/crates/flow_services_autocomplete/src/lsp_import_edits.rs:229-245 \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":"rust_port/crates/flow_services_autocomplete/src/lsp_import_edits.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"893b90e07e6147eae62e6ed7c824ec80cbef35049350fd22eda1cc158a063301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:751-777 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:798-824 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:751\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e88b61535a161a90797437495df273b042746243920cb92bdf82fa8a6880ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_extract.rs:701-717 | rust_port/crates/flow_services_code_action/src/refactor_extract.rs:1004-1020 \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":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"402bdb16f4d8f52daf6d47d64bd1e528fec88efec2ff8e74171c786632a4d628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:2748-2764 | rust_port/crates/flow_type_sig/src/type_sig.rs:2767-2783 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig.rs:2748\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"523597b12d06b123d1e48e71c7b0c4dbd74c3147fe36140bbbdeedc005264197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:929-945 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1064-1080 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:929\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1081\u0060 calls \u0060namespace_member_polarity\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:946\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3d16fee8c3c5a1e2751743a6fe23e1a7e00f60c315cf0796c080b2f9cadf00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12645-12661 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12688-12704 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12645\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12645}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c4a4c8179fb417f3968fc1fce274bc1c567b270049fe064e4fe1c9e14eb594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1048-1064 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1104-1120 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1048\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3534fec074ae97a1334804615fc917e57e4ce3d725525f6046d41d8cc36b6250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8976-8991 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9000-9016 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8976\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":8976}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac75164b1befae2293ef916d527b5f572a5fe9cfa869e1005eed9714bd87e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3541-3557 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3577-3593 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a09e9fecb9a5ec47077af98bab411bc3fbe798cf28becabdeb7298398ac67b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4319-4334 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4346-4362 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:4319\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":4319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fc03babf1e4a73e334c0d55e06ede6fc8587e4d7eb7349f701615d1cd1b3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5581-5597 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5664-5679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4912c46cb8da2157dd78d214a0c65d047e3eeb71f2f4bf9a89e88701fb7cf8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9166-9181 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9182-9198 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4469b02b3843e24e676221b3a689c4d5361f9a7bc51e1f302bcb2c692bbe818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:237-253 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:298-314 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:237\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a788273d9d9a64436c485d2b4594b269be255774a8727ded989e8b4987b778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4880-4896 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4922-4937 \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, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4938\u0060 calls \u0060Some\u0060, \u0060continue_\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4897\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e6cb2e702dd8dad25d3c6735f12bce0159f546a5105104a072e529815991b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:224-240 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:242-258 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:224\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31469829f8ba5fa1d46c31526c880947717fe6f5cf8fe797b6d88b0b1108497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:763-779 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:834-850 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c682de3fb15fc5f7f7ec4a82021de2a1e177acd9d6ed9b807245c38cb862de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2794-2810 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2858-2874 \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 \u0060rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2794\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0f493e30b9caaf008b2dcef6d9e34bf40e03367df6fdba91e55f58f14a79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6594-6609 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6660-6676 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6594\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6594}}}],"partialFingerprints":{"codehealthFindingId/v1":"154bf9f9a51932327921e0c5af54a069ee2f7a4212b5a219eb0e98b6f6d8de11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:54-70 | rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:156-172 \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 \u0060rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:54\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":"rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c5fb9e956c6f07bf061523f3a67fd9253416319d5fb31f4c75828633f2534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:590-606 | rust_port/crates/flow_typing_statement/src/class_sig.rs:631-647 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:590\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9f3ae8a4cee3fa33b5707da9ad8aafc60c4bc8f82a1aabf2419ce745dfcf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/react_rules.rs:1725-1741 | rust_port/crates/flow_typing_statement/src/react_rules.rs:2102-2118 \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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"28320906bd7466dab0969de4a9ff7157aa9980dbb36a82d8788030f5ae6c73d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4372-4387 | rust_port/crates/flow_typing_statement/src/statement.rs:4489-4505 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4372\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4372}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e64f04b5cf2a98c2d10d5f58640e043e13f75f5e87d9abb2cacd2f62159d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17336-17350 | rust_port/crates/flow_typing_statement/src/statement.rs:17664-17680 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17336\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17336}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3af7ec55952351b84abbd70f71d6b10d8b35f552f4c63c339d8e21de10c1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3422-3438 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3464-3479 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:3422\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34eeaf409f4c121025f25bb1cc3b89abd38130d81d25f654a2ab47f8bbcc08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7929-7945 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8299-8315 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7929\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7929}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cb2068085679a321915ac79e921d9f9ea5ff1b317b947faee9c5614d77da9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8367-8383 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8429-8445 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:8367\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28bb95152d7e994643adb65ea00fe60e5247a46fc357f8cc8d982dc4c675fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:6147-6162 | rust_port/crates/flow_typing_type/src/type_.rs:6233-6249 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:6147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":6147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ed71720d951e27fef7cf2403e9833e356cd67908d35ae0c454935143c1a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1222-1237 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1248-1264 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"568bbc64c806713d364f39b49be5166add0ecb463e0551af271141ee4c0786ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2882-2897 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2908-2924 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2882\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":2882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ebdaeb269149e32319493d0067a7deef9ce8b06a340b7a3c1efe52bf541f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/exhaustive.rs:2561-2577 | rust_port/crates/flow_typing_utils/src/exhaustive.rs:2602-2618 \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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a948d02baba8e253f9c0c3529e1c6504fa4e3b5562936f474743177206444f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2900-2916 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3169-3184 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2900\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2900}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb33df05b9098fd1edc5e9f9b96d560ac9efa655e4155e0087d17ea54491b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4824-4840 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5551-5566 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4824\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4824}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc706c753ea58d98d0afeb69fbe6873d088751aee341b3d1cee82578d177d300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:473-489 | rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:590-606 \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 \u0060rust_port/crates/flow_utils_concurrency/src/map_reduce.rs:473\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_concurrency/src/map_reduce.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"950521f4eef7c337b5e52bb6321fb74a3e4d04b3936972117252712ee0f22f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_watchman/src/lib.rs:650-666 | rust_port/crates/flow_watchman/src/lib.rs:696-712 \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 \u0060rust_port/crates/flow_watchman/src/lib.rs:650\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":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9e3634ee4d1571496ed34f64642d28f5d2a9aceb7141fe369e703df93ef733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3868-3883 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3896-3911 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3925-3940 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3943-3958 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3968-3983 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3868\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5575bf44bda8ff5ff4c3cb4365d3ac273deba804d87b26cc161ed646c73f8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_filter.rs:1155-1170 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1255-1270 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1379-1394 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1475-1490 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1155\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d28f0cb0604adc4bc0d2658b64fc7e57930f049be448a5fd1e6b72321e889fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): rust_port/crates/flow_parser_wasm/src/serializer.rs:2279-2294 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2483-2494 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2536-2547 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2495\u0060 calls \u0060write_bool\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2295\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"321f92f31effac4703fa096fc51e2e1cde881252cbef48ba51155f0975a6e1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9343-9356 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9369-9382 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9393-9408 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9343\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d37b729a663fcbfc27f6b6034ffa8f8c3e73a4cad82d23605e51d3dd1f48ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:1975-1990 | rust_port/crates/flow_typing_statement/src/statement.rs:2000-2015 | rust_port/crates/flow_typing_statement/src/statement.rs:2023-2038 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1ba11f1bcf2bd560515662f9d19d601c582bc5555b24197ff3143f12b54f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:7249-7264 | rust_port/crates/flow_typing_statement/src/statement.rs:7280-7295 | rust_port/crates/flow_typing_statement/src/statement.rs:7304-7319 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7249\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85fd9c092f8a00c61088ca0d08fedf1d5d359fd1c47016b43dc0e1a449df360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5006-5025 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5054-5073 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5776-5795 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5006}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca6fb6be36b4b2a51c21410d808e58eb2d23c5e9b790357baf75c5ad9133710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:618-632 | rust_port/crates/flow_analysis/src/ssa_builder.rs:829-844 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f04461f4131cdc4d36bc2ae8163816712be24da5d237b44933edcb93900e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1826-1839 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1850-1865 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1826\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"14297ac1e5191be53441dfaadfd603a2eb41a3bd184f9a68874f9838cb618580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust_port/crates/flow_heap/src/transaction.rs:1116-1130 | rust_port/crates/flow_heap/src/transaction.rs:1192-1207 \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 \u0060rust_port/crates/flow_heap/src/transaction.rs:1192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de55f3f12829bdfe89c8a4984988116b4c06e0df3f1f79be9cd90f37ba2b5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:713-728 | rust_port/crates/flow_parser/src/flow_lexer.rs:730-745 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:713\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99b234c2765363c7125e2df470a7b556dfdba38a654d8bde8a7ddd28f580f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:926-941 | rust_port/crates/flow_parser/src/flow_lexer.rs:992-1007 \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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0065423353f25d0cfb62509b1a376a2ab63ebe85914be0a20076b9b7e264eda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:2489-2516 | rust_port/crates/flow_parser/src/flow_lexer.rs:2681-2708 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:2489\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21e48d650ea24e2aaf029da6ec6024ed8d7d77daad99ed1cf6f31724a5e8ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201348 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:222-269 | rust_port/crates/flow_parser/src/object_parser.rs:1260-1303 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:222\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6033590fc63d49498f25d18ed5fc483fe2da846a2c2bc1d6774c3790ac05919e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1072-1086 | rust_port/crates/flow_parser/src/object_parser.rs:1149-1164 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:1072\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser/src/object_parser.rs:1087\u0060 calls \u0060should_parse_types\u0060, \u0060error\u0060 and \u0060rust_port/crates/flow_parser/src/object_parser.rs:1165\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a2c3cfedcfe53cb546bc408eb792cc4d84fa29126d924b943caa04f1d4c346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/parser_env.rs:1926-1941 | rust_port/crates/flow_parser/src/parser_env.rs:2014-2029 \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 \u0060rust_port/crates/flow_parser/src/parser_env.rs:1926\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fc369b4044f0384692b151caebc3555b0a2ca94e3dd625989b547aea09d23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/parser_env.rs:2393-2408 | rust_port/crates/flow_parser/src/parser_env.rs:2411-2426 \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 \u0060rust_port/crates/flow_parser/src/parser_env.rs:2393\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3322da09769a81813efd685502a41bb1f62fbfe4fbeb9d1369a7f5995247ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3769-3784 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5692-5707 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d2f750521444751baa5611603c66da42f1fd0f8cf88827a2c1467282398c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3753-3768 | rust_port/crates/flow_parser/src/statement_parser.rs:3774-3789 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3753\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3753}}}],"partialFingerprints":{"codehealthFindingId/v1":"368b389c583f8a4b02af8411893821b570e6bc5810e0e8978093b918b516387c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:3793-3808 | rust_port/crates/flow_parser/src/type_parser.rs:3820-3835 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:3793\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d078c850d21d563522c35247c8f593b4dc5df84f8fcdb6e35459089bed0c62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5354-5369 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5378-5393 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5354\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060t1\u0060 to \u0060\u0026ast::types::Union\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::types::Intersection\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":5354}}}],"partialFingerprints":{"codehealthFindingId/v1":"254da5bb40b784b2def04a9dce952e236757de09be930c5f3d94f52046e0baaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1159-1174 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1203-1218 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1159\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde157a5c2acc8519fd653726d5d87fa02b207f9f5a0cf015683025adb48b5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2766-2781 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2794-2809 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3598d68297b3fedb251803d741a003a9b3dc8af7456514c69b4f0c66ab1e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:4214-4229 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4272-4287 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4230\u0060 calls \u0060map_err\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4288\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd78aaa3e7631625ba0969fef1b083e7ff0f1ddc76a160bd4f97b1829df384b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:3254-3269 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:3295-3310 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:3254\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c7812fddd8302152482897bc9981b41706fa5b59723b454a31c2050061f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:228-243 | rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs:288-303 \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":"rust_port/crates/flow_services_code_action/src/refactor_match_discriminant.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9fddac0c1119a19debb38d8cd42da6f98857ce5c0afe84bf1fc2d7a75643cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:374-389 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:392-407 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e9a3f92a3685a6cc5fc320d8f978367b0fcd160f5f114e90a6efc05915b672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1078-1093 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1151-1166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1150\u0060 calls \u0060collect\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1077\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c4646146269cf25c56be257e55fa3a94111bcef8fb9082b31dc348673ca56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5034-5048 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5174-5189 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5034\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5192\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5051\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5034}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0a3fc72aad3d836c6a051898891e041c04f99ace2fef635c85b60f9388947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8598-8614 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8945-8961 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8598\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8598}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a037a2e81231aa22b08b23d5b7d9c1c38d6e123d30c4216530da38cc409a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2930-2945 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3131-3146 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2930\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1cbd5833bf2f0b9c42e408677b68b36cd5eabc005f6355edd12585a3a50554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3304-3319 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3355-3370 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"261c7b506876573bb0fd3b5b4ac7181729bbb7904c6e289ca2526daafbdebc45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:957-972 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:6363-6378 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda8e62d1b40bcc0ee83a487e9f1d73f1fbd3021f539e03711aae4853a276ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8532-8547 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8563-8578 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8532\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0370c98d1f5bc1e83fc1355bca15cbe29b619e3952297bb72f3875bd0b3d804c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9886-9901 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9907-9922 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9886\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9498a84e162dfa0fcf0dcd262d675fdd50e4784d329ae8202b6e355b92d2953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:773-788 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:803-818 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:773\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0060f0e1adee7bda60d634c69ee15a7ed1b0d9e36a5c5d56d1a8a4dd0f75ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1930-1945 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2041-2056 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1930\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"53973e01a7aa462c54bffd09d1dddfe28cd5de02f858382312d23d7bc62016c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2746-2761 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2776-2789 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2746\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"070be529a0208ae51bc5dc16980cc7fdc6817e44f342ef6c49a8a46fc8670f90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs:457-472 | rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs:474-489 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/get_prop_helpers.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8e0621b634e9fac9f4f30091106bc0c6fe60ed4c9e250c984c3ee693af817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1729-1744 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:2389-2404 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7fea05e6a328a9498b999b5e8ae8e4c7659ed2a7762a5a6ed839951041255d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:452-467 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:471-486 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:452\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99b0b18ce9e2b1f73aabfbbf2ccd14f823324f830f94f5f606c2ba3696060f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1165-1180 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1204-1213 \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 \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0af274ab5de91eb799d08260f3039dbdb6b6d4333fc359b0c484727481276a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:472-487 | rust_port/crates/flow_typing_statement/src/class_sig.rs:518-533 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:472\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f77809190577db41ca98cf073a09f72145490546ce60d544ef43494c19b29a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:644-656 | rust_port/crates/flow_typing_statement/src/statement.rs:683-698 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:644\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:643\u0060 calls \u0060into_iter\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:682\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"233e17d5338121050f85d205312163c5b7af9b9c7f97d7d4284859dfa510cc0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:21231-21246 | rust_port/crates/flow_typing_statement/src/statement.rs:21358-21373 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:21231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:21247\u0060 calls \u0060clone\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:21374\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":21231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3417e44add3081cb34f8c7e1497c8298cf2605272a7c7c2a8dfa965c8f16f2d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/switch_to_match.rs:303-318 | rust_port/crates/flow_typing_statement/src/switch_to_match.rs:325-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/switch_to_match.rs:303\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":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfc115547b95e056a79458580c7af09d98c78816e9b18b660b865af4eedb41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2380-2395 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2977-2992 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2380\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abc3928b0c3e8ab7bf5c1ca706c96babee6a7f0684e3c8b4c9e4d48f4bfedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2665-2680 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2689-2703 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2665\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2665}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a92b176c1cca80fc10346b82ea0ce4c85da26f8a3ba272a89db18a63806f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:5216-5231 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:7335-7350 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5216}}}],"partialFingerprints":{"codehealthFindingId/v1":"54da7bc9bac0c1bd6e55678685be8f926e2859a41f7974befbfb8e30c082ba86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/members.rs:356-371 | rust_port/crates/flow_typing_utils/src/members.rs:472-487 \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 \u0060rust_port/crates/flow_typing_utils/src/members.rs:356\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":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69a022e230683ed77c83e4e31beb4294c0d14a80f67bd76fdaefb9380e867ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1704-1719 | rust_port/crates/flow_typing_utils/src/type_env.rs:1749-1764 \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 \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:1704\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e66a91f71deb94f9ce8ab97a812a7a3cc77603b5e4511ae40bdce45807210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): rust_port/crates/flow_server_command_handler/src/command_handler.rs:7384-7398 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7418-7432 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7513-7527 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7576-7590 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:7384\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7384}}}],"partialFingerprints":{"codehealthFindingId/v1":"278f61acdd453e4a2e825a8a8b6d4be4146f678ebb95b68df413ae63398eb263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:4493-4507 | rust_port/crates/flow_env_builder/src/name_def.rs:4509-4523 | rust_port/crates/flow_env_builder/src/name_def.rs:4525-4539 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c22fb7f28f716c3f2f07d45aca89965753abddc5369744133ce7cb269992f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): rust_port/crates/flow_parser/src/statement_parser.rs:3201-3214 | rust_port/crates/flow_parser/src/statement_parser.rs:3231-3244 | rust_port/crates/flow_parser/src/statement_parser.rs:3481-3495 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3201\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6675804d62396fc8d23b9c61f1ce892705e01cd641dbd562d2b9133d753f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1526-1540 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1581-1595 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1641-1655 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4963ebdc77ed57624dbc5f55da6abf27516f2b3815485daeba628877bcdbcadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8525-8539 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8556-8570 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8592-8606 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8525\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8525}}}],"partialFingerprints":{"codehealthFindingId/v1":"47252e4e89ba595f7b50014da9e6de422d3c314b0005fc3c4e3c4a854d15b31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2128-2141 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2185-2199 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3284-3297 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f0f0d57fd878214451dfde7b50a018248efe2b7d3ed8a00f26f6e1b30c9f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/func_sig.rs:705-719 | rust_port/crates/flow_typing_statement/src/func_sig.rs:732-746 | rust_port/crates/flow_typing_statement/src/func_sig.rs:759-773 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:705\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ffbf7ac2aad8737588490bd9ef3ebd0334884ec70541bcdc8ec62465f60783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1397-1410 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5446-5460 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5931-5945 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc805aa5a5a20802978b9d9ddab56bd0d28a3816582c8e939908728896bc5c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:1321-1335 | rust_port/crates/flow_analysis/src/scope_builder.rs:1400-1413 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:1321\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836af8eb7bcee60c540903b315bb41b7e4b1484c74696ba575976218a86260a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): rust_port/crates/flow_analysis/src/ssa_builder.rs:1116-1142 | rust_port/crates/flow_analysis/src/ssa_builder.rs:2057-2083 \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 \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs:1116\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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1038b4c42ce29d4e322396525ee63941e8e55e360bcfe15213dc5f9de97d2dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_cli/src/apply_code_action_command.rs:125-139 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:228-242 \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 \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:125\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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a4ac1b2bbd192ce201b43aff8b3cf283c0b87fd76b41d211c8e88cde27a4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_cli/src/lib.rs:110-124 | rust_port/crates/flow_cli/src/lib.rs:192-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060\u0026flow_server_monitor::DaemonizeArgs\u0060 in one and \u0060\u0026flow_server::server_daemon::ServerDaemonArgs\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":"rust_port/crates/flow_cli/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc8e5ddcd1cbad36169e01591a78ba57aac2d08e1d6f45f773010835a0622c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:619-631 | rust_port/crates/flow_codemods/src/annotate_exports.rs:781-795 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad178df9058901f042f92360ffacbe203ec63d2140c1aec0406fad845d9bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:648-662 | rust_port/crates/flow_codemods/src/annotate_exports.rs:686-699 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:648\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8eb18c44a98648f96fda5af7681534b69bef7a11aff917091a4cdd9ad9216f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:272-286 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:307-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust_port/crates/flow_codemods/src/annotate_optional_properties.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc639a551b44ae5aa8b5899cf7ba9f16dbc3f0a250fab9cea653dd0359fccde6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:954-969 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1028-1043 \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 \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:954\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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a019300e9caa5f7bd4ebcfc92db06cbd79296748a47a669dda8df17596f122a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_config/src/flowconfig.rs:1457-1471 | rust_port/crates/flow_config/src/flowconfig.rs:1495-1509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3650da4e1fce0cc365ba7c8b8aed3e0bf78bf02cb2bed75572705052d2af26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2937-2951 | rust_port/crates/flow_env_builder/src/name_def.rs:2953-2966 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"4121f79ff8a8ce66c478e8fdd79d78f331a24216bc4f518204c95c0e6bebe683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2792-2806 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3086-3100 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d8983cf5dfedb63bccd3da9c4b5f33cc4d44dc9bb50aa8681cac2f84e36446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3748-3762 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3806-3820 \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, \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3821\u0060 calls \u0060check_static_type_param_read\u0060 and \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:3763\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b18589386802f5dc5a915579e468b537513f2d8ebc1010a36a00216ec6509c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:8537-8551 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:753-767 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_typing/src/typed_ast_finder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8537}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54f63442911f4efdf2cefad6bc24d71712be6e35e33f81e12e5fa428e8905d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:8926-8940 | rust_port/crates/flow_parser/src/ast_visitor.rs:9875-9887 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:8926\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8926}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde215ef0e62b59f57912e731c39a14c869240a2a1a2187d5f630dfe27b87e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:13487-13501 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:1750-1764 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_typing/src/typed_ast_finder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":13487}}}],"partialFingerprints":{"codehealthFindingId/v1":"24641a7acbb8115f4fed4239002ff293afd8f4c8e1b24c2bef9b515d13edea7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2660-2674 | rust_port/crates/flow_parser/src/type_parser.rs:1030-1044 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/expression_parser.rs\u0060 and \u0060rust_port/crates/flow_parser/src/type_parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/expression_parser.rs:2660\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"7239fe578248092d4a351606b51286d076493080e00d77763f1557733eb3e815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3043-3057 | rust_port/crates/flow_parser/src/statement_parser.rs:3099-3113 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3043\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c8c87ee8003b0fa2c9b286d75378f86041b390609a3a9a0a9fd8df8e6a1e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:4613-4627 | rust_port/crates/flow_parser/src/statement_parser.rs:4631-4645 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:4613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4613}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e493ff931b908a6f88665677ed51cc134d5ef473088db50e115bd5fc88a5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6617-6631 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6638-6652 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6653\u0060 calls \u0060atom\u0060 and \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6632\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69ea52e98aebbc489383309173e051b4909c925224091ba0ccc90e41b267621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2620-2634 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3295-3309 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2620\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fff312de546fdc7101eae9247ac21c2173458a534aadfa7f2a470b9e7ad8a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:162-176 | rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:297-309 \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 \u0060rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:162\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":"rust_port/crates/flow_server_monitor/src/socket_acceptor.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5541a682b6871195735d9c7ea92e0246992a74a7a2f1d7677a3f57469e10aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:270-284 | rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:293-305 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:270\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a12b764b65a7b5fc09eb59bc1936f6814c75c502abb25fc84fe1b4118c33a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:680-694 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:766-780 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs\u0060 and \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:680\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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"569340054d78ecfb84a62d6dab28dc61213255b589f19e95af279e8a3a0f1d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:851-865 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:886-900 \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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f48bb9a721ad24381831d19ccb48307247d9433dfc6fb9c841b6ca58c732df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2642-2656 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2662-2676 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"01acc8b52899353d5cdbd40d8fdf33bad94d345a31b7144cbd1264f1d5350038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3477-3491 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5160-5174 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3477\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3477}}}],"partialFingerprints":{"codehealthFindingId/v1":"3992d48c61a266489cb73708e4b20d745c3b0a9d99b7b1e9c9973eeffddb6da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing/src/merge.rs:1115-1129 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:882-896 \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 \u0060rust_port/crates/flow_typing/src/merge.rs:1115\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde9daa90175ad041c25b923b647c214733ec519b350643c1b8543ed7f9736c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:1002-1016 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:1021-1034 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:1002\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51617e2fa5b866d80a828b5dd3465f968f53f052aa895cacfcf3cfc6185d322"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1757-1770 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1829-1843 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1757\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1756\u0060 calls \u0060HooklikeT\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1829\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedfe89148b0d1ce753e2e09ba6e7dcc243ef0dd41238d4c382658791872fdc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1966-1980 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2066-2079 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1966\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2fd51bce96e900c6f7d2d0c74e280177c1b733dc30fca943b47035adddc1d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5528-5542 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9427-9441 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5528\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5528}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1eebcd97f96f0702e3b40e77193d70fa987b949179d87af81ed40d9c797509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6649-6663 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6666-6680 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:6649\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":6649}}}],"partialFingerprints":{"codehealthFindingId/v1":"add031a383c9962d2eef0af57973924471257fa468cb80611187ef9eda15e312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs:624-638 | rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs:665-678 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9c20f268809f4f88fa11907415f1f42e42cf97f38ad6f9e90421b929ca9fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4127-4141 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4171-4185 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4127\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e803b63ce5757fbf184c91aa5d37b57301711296b09289b216683f145515e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:603-617 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:716-730 \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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1bba38b358cc67a72e09aa0a6134b980332255b9c90d45ff11b973a4243927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6761-6771 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6796-6810 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6761\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b09e952d947482528e95d9c7670fa31464e50645cbacc392eb08c72c0dbf3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:436-450 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:494-508 \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 \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:436\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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c79ac9a95000c965e1493f40e9b427399728e386597fd0b28c0e3cc1ae05c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:602-616 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:624-638 \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 \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:602\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1c053faa20b54999ebb34ad5b5744e49285f99ff88adcf86c75df653079e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4200-4213 | rust_port/crates/flow_typing_statement/src/statement.rs:4445-4459 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4445\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbea89c1c6f90f8f458ca707349c36b43d29d4315f259e4df5c56776347263a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:8750-8764 | rust_port/crates/flow_typing_statement/src/statement.rs:8779-8793 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:8750\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8750}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c6e667b8df818006dde18f702b775333e22827b4dfbbc8157e28845c72a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:10400-10414 | rust_port/crates/flow_typing_statement/src/statement.rs:10736-10750 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10400\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47ab36183ba5774c8c866709165ef20b506f5c4764d3dc1e511a407c5dc07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16378-16392 | rust_port/crates/flow_typing_statement/src/statement.rs:19277-19291 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16378\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff2fb77656d56bb5fb190600bf532580946c7382a109eabfa6639ec4b57f326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2573-2587 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2927-2941 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2573\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c90fb9abed0d66450f4589bc9ad40f013adebaa9c39508f0bd18b25a98941d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6818-6832 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6837-6851 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6818\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6818}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e260b7bd745327d5c7fde1f0aba097f7a4f929026afdbbfa5327a8a8cdc7fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8393-8407 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8470-8484 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:8393\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8393}}}],"partialFingerprints":{"codehealthFindingId/v1":"48190093008d254a5f5af7715e639238bd60fb0982f46f38dc3e5ff609daa8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1174-1188 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1529-1542 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1174\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc523ffbce3341928bd26d115f6ce81f9718f96938415c8a614b8cec7f3e65a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2884-2898 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3153-3167 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2884\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"40741f4920e59a87d55e77e5209f3206595d92378fdd36937db08d277a0021c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2957-2971 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3005-3019 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2957\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"58657b6d02041717124a4aa28cfa8b22b647b1f2ea501359ec91cf3f4cd4e67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3037-3050 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3061-3075 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3037\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d94f462d8c60692d19b67cfc70cbe3f9b6edacf03c26989f585900bf3ba99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1132-1146 | rust_port/crates/flow_typing_utils/src/type_env.rs:1185-1197 \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 \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:1132\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb563f6669fc07b4503e463b2d04fa9c904932c432d334f8473d43c5f352d88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1681-1695 | rust_port/crates/flow_typing_utils/src/type_env.rs:1813-1826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5a3fe93c6f3679d53ad48f16317394d1b6aedb16f82123285f38fb7a6f69c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 6): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2893-2905 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2935-2947 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3030-3043 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3084-3095 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3136-3148 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3176-3187 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2893\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b8024257e1a25db0ca16597628778b8c59e38ba55b8f4b279226adbfb06802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): rust_port/crates/flow_typing_statement/src/statement.rs:17142-17155 | rust_port/crates/flow_typing_statement/src/statement.rs:17207-17220 | rust_port/crates/flow_typing_statement/src/statement.rs:17295-17308 | rust_port/crates/flow_typing_statement/src/statement.rs:17459-17472 | rust_port/crates/flow_typing_statement/src/statement.rs:17625-17638 | rust_port/crates/flow_typing_statement/src/statement.rs:17829-17842 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17142\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c36639948ebbea04cae8fab68473a67ac9a4c4daa6de3c58d94d7940cf002be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): rust_port/crates/flow_parser/src/statement_parser.rs:3901-3914 | rust_port/crates/flow_parser/src/statement_parser.rs:3925-3938 | rust_port/crates/flow_parser/src/statement_parser.rs:3955-3968 | rust_port/crates/flow_parser/src/statement_parser.rs:3980-3993 | rust_port/crates/flow_parser/src/statement_parser.rs:4003-4016 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3901\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7900c97cccb0e88ed1a864279c6db659218d99616b58fb07ce38e9a7c1e66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): rust_port/crates/flow_server_command_handler/src/command_handler.rs:3857-3870 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3988-4001 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:5373-5386 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6557-6570 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3857}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cac89c591c79ca97e0d1a6882679b78a36be04217acc1baa0cd968f5fb0d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3901-3914 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3948-3961 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4002-4015 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4069-4082 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3901\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3899\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4067\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c387892af442ceb3d0077bf50f484a7c87e0043d3bc55511f62d230fc55122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7763-7774 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:7880-7893 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:7998-8011 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8017-8029 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7763}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d635bc4c33119f9adb482720074ad64f6275236a7fa68b7cefa45790b8b4869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:822-835 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:958-970 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1032-1044 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:822\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1046\u0060 calls \u0060extend\u0060 and \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:836\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":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3893ac912fbf88381f6e9a1ab115230c5ea9f976db25da1a22a4bb5f45ef10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7627-7640 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7664-7677 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7701-7714 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7627\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fc52b52e41df758b2f697ba68a682b8565a842f2cd715d89099fec7ee53f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2746-2761 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2776-2789 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2820-2833 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2746\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce70a293e1f62967edbb0229cf384dfab6d64a4848faccfe154b316e10d680b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7108-7125 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7666-7683 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9450-9463 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7108\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0f705d7e193f2c40c95753fff0012a9b3321b990b18dd227e1bf81898411e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:10024-10037 | rust_port/crates/flow_typing_statement/src/statement.rs:10107-10120 | rust_port/crates/flow_typing_statement/src/statement.rs:10181-10194 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10024\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10024}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95816f10c5de92f5dbaf70bc206299d15cc0ec093aa41cf42aa7ad24d0fff8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4697-4709 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5001-5014 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5082-5095 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4697\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bf0d0cf3972e47d42d4b1db29bbefe0a65a8bd4beea321a2fbf3d2575d0721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_filter.rs:1112-1125 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1336-1349 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1432-1445 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1112\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf431550f0a5cd3a77df2ca891c065582a7e54eec85617ec1c01c5598939a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1315-1327 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1330-1340 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1343-1356 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4432b783e441fad3b2dbe1f2e4aebaf045d33575137bd04d6bb4c9bc77c0ee95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:600-613 | rust_port/crates/flow_analysis/src/ssa_builder.rs:809-822 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:600\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026\u0027ast ast::statement::For\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026ast::statement::For\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs:823\u0060 calls \u0060fresh_ssa_env\u0060, \u0060merge_self_ssa_env\u0060 and \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:614\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b62a4246f407289f3512b608426a6b5840423fb8e46911a2dcb6277e64f143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_cli/src/autofix_command.rs:299-314 | rust_port/crates/flow_cli/src/autofix_command.rs:449-464 \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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebbb7d10bdd8784f258ca973c843052590569d382e04a7021ed1da794318494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_cli/src/check_contents_command.rs:59-71 | rust_port/crates/flow_cli/src/status_command.rs:319-332 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de191929a50108513fa00f855a7b058c3406bb0694db354d288a93f8dc0bc3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_cli/src/server_command.rs:54-67 | rust_port/crates/flow_cli/src/start_command.rs:68-81 \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":"rust_port/crates/flow_cli/src/server_command.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5527fe1213083ff1e909ca275fa1c6a946f112efedc9dbb0805fbf4da097b45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:489-502 | rust_port/crates/flow_common/src/files.rs:518-531 \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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d608aa44ccb9afe448a0e065b86f1f8a011f35576a518b1160c7051b9d6f31a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_config/src/flowconfig.rs:1562-1575 | rust_port/crates/flow_config/src/flowconfig.rs:1581-1594 \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 \u0060rust_port/crates/flow_config/src/flowconfig.rs:1562\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, \u0060rust_port/crates/flow_config/src/flowconfig.rs:1580\u0060 calls \u0060escape\u0060 and \u0060rust_port/crates/flow_config/src/flowconfig.rs:1561\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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9538be164e18863563fbfdc4b390a0e2fdc2d62647de853583fd1d38ab212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder/src/find_providers.rs:1241-1254 | rust_port/crates/flow_env_builder/src/find_providers.rs:1276-1289 \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, \u0060rust_port/crates/flow_env_builder/src/find_providers.rs:1290\u0060 calls \u0060is_some\u0060, \u0060enter_possibly_polymorphic_scope\u0060 and \u0060rust_port/crates/flow_env_builder/src/find_providers.rs:1255\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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf1aa0978d58cadac7a69b73a0db5fac561ae1d77cb541da0d6cac9fdaf23c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:4651-4664 | rust_port/crates/flow_env_builder/src/name_def.rs:7282-7295 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:4651\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece771d4b36bdb125487eb1ce6856de0fe158909c36f5e8c196480d69a8b589b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:6075-6088 | rust_port/crates/flow_env_builder/src/name_def.rs:6104-6117 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:6075\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6075}}}],"partialFingerprints":{"codehealthFindingId/v1":"50010db943e03b4652807cb1f1e271b242f2acef2e7362087b2c95e574cef146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:6283-6296 | rust_port/crates/flow_env_builder/src/name_def.rs:6333-6346 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:6283\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7345291935c4439eeaf7d6f246a1cf54a44d5bdff69ef69473b0e9a66ed484f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6130-6143 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6386-6398 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:6130\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":6130}}}],"partialFingerprints":{"codehealthFindingId/v1":"141e7101fc14c54b793f7d8a379600cbdcb8833e15c49c1e4df390cfabc24694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7464-7477 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7534-7547 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7464\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7464}}}],"partialFingerprints":{"codehealthFindingId/v1":"362daea78cfade69f1fb28f0bd9463731280ed34812d3aa590de59967901725b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:7858-7871 | rust_port/crates/flow_parser/src/ast_visitor.rs:7957-7970 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:7858\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7858}}}],"partialFingerprints":{"codehealthFindingId/v1":"746053e07029900c6380235038835b5eda51c99467dd96dbcac0335a9a1c1e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:3818-3831 | rust_port/crates/flow_parser/src/estree_translator.rs:4218-4230 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:3818\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060\u0026ast::statement::component_params::Params\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::function::Params\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3818}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b3c45aace387aa9def25ca47014c2f69084a2dde551e773da343f317dee950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2703-2716 | rust_port/crates/flow_parser/src/type_parser.rs:1072-1083 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/expression_parser.rs\u0060 and \u0060rust_port/crates/flow_parser/src/type_parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/expression_parser.rs:2703\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7521db7cd6577f9d77296ade10e72f5b7a8357b2a1040aaec52b064792042800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_parser/src/main_parser.rs:226-238 | rust_port/crates/flow_parser/src/object_parser.rs:2595-2608 \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":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf4ccca8620d1eec7fbdf33ee03598ce8923bee1897cca79b859eb44cafef7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1763-1776 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5422-5435 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1763\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc2221efb99ef761f5513584c87b1c2bddc953ae18782b9776f6b599703753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3174-3187 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3235-3248 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3174\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aae2fb7e06d2ba6f986d1adb127e531670074d460e968071eca573c4951cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:5256-5268 | rust_port/crates/flow_parser/src/statement_parser.rs:5269-5282 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:5256\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2a4ef76b6794c720a26df76bbf6e2a4e14e012431e0bd28d9d04093d7fdeaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6096-6109 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6167-6180 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6096\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6096}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9493e850c304352c76c69c2741535ee41a975ee440fab301cf941767021ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:556-569 | rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:375-388 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:556\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d8a6ce6ebea14101f64bedd5c7c2242f657bd7a41025776c8cada0e3998a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:194-207 | rust_port/crates/flow_parser_wasm/src/strip_flow.rs:161-174 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/strip_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:194\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd73a86a7ad6758756ec489f25e958870356ecb577c75055c81e458f3eb554d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_server_env/src/server_env.rs:507-520 | rust_port/crates/flow_server_env/src/server_env.rs:569-582 \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":"rust_port/crates/flow_server_env/src/server_env.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa0af0578241915bc924591f223c15da631ec62ab39a72c7b934e79bfb11083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs:332-345 | rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs:349-362 \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 \u0060rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs:332\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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f6a83bb0383a287d9c191c42e57e8473eebf74a70d3c4b508d8e6719384e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:524-537 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:605-618 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs\u0060 and \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:524\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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38b6ab9c2f40f08554d37acd5ca58fe3e76b0d83329b961ac96ffc7c86921e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:238-251 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:385-396 \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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2470ce2035964fff6a54203881c92a0dda66a28e0b350d511a025af0a42d892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:955-968 | rust_port/crates/flow_type_sig/src/type_sig.rs:1067-1080 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig.rs:955\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3e45df15a8d252ae63da7b17afdf48ac0564c7f46bcfda15dec77b7e759f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:1689-1702 | rust_port/crates/flow_type_sig/src/type_sig.rs:1707-1720 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fab461338e751a6e038bc70419f03e84b64409f90477d44029c182bb759b4bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2336-2349 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2394-2407 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2336\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8e1f82a85fdfd1b99fbddf0dca251559c9089da3796587dd44961a626f6082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3575-3588 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3755-3767 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3575\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dfc811adb8b40f05bac238d513bf8ce7c8303c265df13507e61ed870d5d6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4246-4259 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4275-4288 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4246\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80dfbe3f5119f41ff8bcf28e39b6e0ba29ad1867ce6d66b6c4bc139b5e64b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:1505-1518 | rust_port/crates/flow_typing/src/env_resolution.rs:1521-1534 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:1505\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a8ad931a47fc43e638e27d8749a1649b04a11db12f8cc652c04f42b06b923b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9575-9588 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9593-9606 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9575\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":9575}}}],"partialFingerprints":{"codehealthFindingId/v1":"377607844668d6305ccbe38c51af6b3d1ffe1fb29e1fa4f5f6f3cb0f5d638712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9890-9903 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10117-10130 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9890\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9890}}}],"partialFingerprints":{"codehealthFindingId/v1":"201d12464c560c135ddb1217daf8821fe88650abf502bdeb73ce72f1bdef67ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4513-4526 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5472-5485 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4513\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4513}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b2bce0ad5626694e56e70af07430dd28cfa60d5ca86c3a91f843755ac8265"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7541-7554 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8157-8170 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df96f2eedc619a690866112929259e9feef3671992e21398755eb1c3a22f85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7627-7637 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8175-8188 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7627\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd56f9246f959c22512a4070125b1b4564f2d598b1a6f64b036c2f9b3b145a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11123-11136 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11167-11180 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11123\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":11123}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c7031dae290b8a196cf3c08a8ccde440afa41376d0e3fadd95207a1e6600fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4630-4643 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:5666-5679 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"941e7dfb27cd2acf2150cab7230dd32d4f0ac2a53b7742bbfefa0da637aecd6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:779-792 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:799-812 \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 \u0060rust_port/crates/flow_typing_flow_js/src/object_kit.rs:779\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf7c12ae1fb769dd065e708cba002ff2dc74563a6aade2f76748581faf0292d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/react_kit.rs:390-403 | rust_port/crates/flow_typing_flow_js/src/react_kit.rs:807-820 \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 \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:390\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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3a34748fe9a6bea15a4c4af0639b63a4ba09d5db70dab7ceb14958e2a03c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:724-737 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:746-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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:724\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcf946c0b6dd25364da97e55adc92f98edb0559d8df329459984fd013606899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4997-5010 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5107-5120 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4997\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e139329ad39ac2a818dd8113b565e0610a508d544b89dd4737687cd317794515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:93-106 | rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:201-214 \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 \u0060rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs:201\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":"rust_port/crates/flow_typing_flow_js/src/tvar_resolver.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ce74360da29ca391a94776149ba0d851b12c36700f2a89836ce082a76532e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:492-503 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:683-696 \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 \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:492\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa2af0fc4199450aa46b64dae421a7990c1034f45878c45c6aba6364da051e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/react_rules.rs:777-790 | rust_port/crates/flow_typing_statement/src/react_rules.rs:793-806 \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 \u0060rust_port/crates/flow_typing_statement/src/react_rules.rs:777\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":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"602ad7baf4cc759fd36703a967b69eac29e11d3581b855676c35015ca191fb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:2776-2789 | rust_port/crates/flow_typing_statement/src/statement.rs:7112-7125 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:2776\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ec8cb731335926461fcba50b6b4aaf32b338e69107d5b67f108d7237ea784e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3475-3488 | rust_port/crates/flow_typing_statement/src/statement.rs:3569-3582 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3475\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"598afaeb94c26e8050d93e508b3bf498ae5b20eea5c72c964449cf3704c068a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9041-9055 | rust_port/crates/flow_typing_statement/src/statement.rs:9101-9114 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9041\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98204630d624451b943a2aec0ba854f47ed26cc4d25c3a85951015a46d61bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:13171-13184 | rust_port/crates/flow_typing_statement/src/statement.rs:13192-13205 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:13171\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbd7b328876cc63772a213a8a8718d5c4f65bdc00e18b3268acd397ac18cb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14691-14704 | rust_port/crates/flow_typing_statement/src/statement.rs:15004-15017 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14691\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14691}}}],"partialFingerprints":{"codehealthFindingId/v1":"25248a787440dd28ec1d1f58572ca39121ae97a420e114af3b8972ef403ef9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17351-17364 | rust_port/crates/flow_typing_statement/src/statement.rs:18014-18026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17351}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ced6bb09188b2d14a53cbb91744b5a02c9afe20a4689e95276c092844fd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19596-19609 | rust_port/crates/flow_typing_statement/src/statement.rs:19660-19673 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19596\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19596}}}],"partialFingerprints":{"codehealthFindingId/v1":"61635b9dbdfa9e08b36c1d7cb150f87656ca8b0a7900d69728d8691c9daddfb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2526-2539 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3572-3585 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2526\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"97557cce3e39dbdbc1b3d4e874074ea3a7e963cbea273369b49430ac8f02f8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4750-4763 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5286-5299 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4750\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97823308194bf9cf0b238b730504e143f829c20dda2c5829c1bb5845996579b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8947-8960 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9623-9636 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8947}}}],"partialFingerprints":{"codehealthFindingId/v1":"33af7325ef2421eed037deaad94e3326b6418c8c79cf14824e976de6555c872d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5809-5831 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5992-6014 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:5809\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a474cfd71e0cbcdb250883913d7511da4e545f800ce4f0664c7c095dd70118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:10404-10417 | rust_port/crates/flow_typing_type/src/type_.rs:10472-10485 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:10404\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":10404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4d4ae79b06d1a09c97826db2b5bb2fc7c9c2231b1eee41b9350e5dab2acd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/exhaustive.rs:632-645 | rust_port/crates/flow_typing_utils/src/exhaustive.rs:647-660 \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":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bdd5da2f260b73fb48e577380f19d8904a5c83be6823a7b89c8ec484426e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:137-150 | rust_port/crates/flow_typing_utils/src/type_filter.rs:196-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:137\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e50e34f014354f36f0ee65436be114b3fb62588ccb38a07880541e1ba3863b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1623-1636 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1742-1755 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1623\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96d42773462196a5d40f4777d2f14b5e94d6af868d2a70726ffe3c21f716ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 7): rust_port/crates/flow_parser/src/statement_parser.rs:3881-3893 | rust_port/crates/flow_parser/src/statement_parser.rs:3905-3917 | rust_port/crates/flow_parser/src/statement_parser.rs:3929-3941 | rust_port/crates/flow_parser/src/statement_parser.rs:3959-3970 | rust_port/crates/flow_parser/src/statement_parser.rs:3984-3995 | rust_port/crates/flow_parser/src/statement_parser.rs:4007-4019 | rust_port/crates/flow_parser/src/statement_parser.rs:4031-4043 \u2014 all 7 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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3881\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3881}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab57d68a0a55bc75e1fec90899f2f1cafa9a2d94827ea617ea24dd0ca904100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 7): rust_port/crates/flow_typing_statement/src/statement.rs:17145-17157 | rust_port/crates/flow_typing_statement/src/statement.rs:17210-17222 | rust_port/crates/flow_typing_statement/src/statement.rs:17298-17310 | rust_port/crates/flow_typing_statement/src/statement.rs:17462-17473 | rust_port/crates/flow_typing_statement/src/statement.rs:17628-17639 | rust_port/crates/flow_typing_statement/src/statement.rs:17832-17843 | rust_port/crates/flow_typing_statement/src/statement.rs:18073-18085 \u2014 all 7 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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb7498a7f2541c32ab041fc1c69ef671b9e9c204ef1b17a386fdbab41ef71fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 5): rust_port/crates/flow_codemods/src/annotate_exports.rs:325-337 | rust_port/crates/flow_codemods/src/annotate_exports.rs:517-527 | rust_port/crates/flow_codemods/src/annotate_exports.rs:637-647 | rust_port/crates/flow_codemods/src/annotate_exports.rs:803-813 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:264-275 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs\u0060 and \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:325\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a290e8a04f72be3e331203649f5a38608565a5c72deb37b7c54c93f81fde86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2251-2263 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2368-2380 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2397-2409 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2479-2491 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2251\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3906eeb411872bf7fa8d90f09608307d4b1b5d034f1b1a6e88dc5f8ea50f2c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12548-12560 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12591-12603 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12640-12652 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12683-12695 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12548\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0266b32f6f8f2720f82788842e8984b0003f045f9d19fff4c2b1b481a83a4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_filter.rs:1108-1120 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1202-1214 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1332-1344 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1428-1440 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1216\u0060 calls \u0060unchanged_result\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1121\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0409c84e4cf0759861afcdcbf221a85a8f32a34ffe95220f388d3f03181f951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs:149-161 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2240-2252 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2408-2420 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac9f338451fecb2994f3e0a2620db2f3e65f9ad4c60b1d2b7c769ccfe960e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust_port/crates/flow_dot_js_wasm/src/lib.rs:817-829 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1145-1157 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1184-1196 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dot_js_wasm/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fca6208f699845e7e51eed8b406db29599709232ab7780579b417777b969c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): rust_port/crates/flow_parser/src/statement_parser.rs:3741-3752 | rust_port/crates/flow_parser/src/statement_parser.rs:3755-3767 | rust_port/crates/flow_parser/src/statement_parser.rs:3776-3788 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3755\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b80c9f7f20ced31232ad62940e6162fc6a9e47ccfe267ffa0b273cac63dd90c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8373-8385 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8687-8698 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9089-9100 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8373\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d8fbc7722abeff65e76e953f133540b2337affc015cca23baa86d523bb7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9890-9902 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9911-9923 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10117-10129 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9890\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9890}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e81b1c886c094375bbbb1112aa0368bd71abf86099c894cb0a9bc7a59e40f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201313 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:740-752 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:754-766 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:768-780 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:781-787 \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 \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:740\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca76873f6a9d06eadc20a803ddd4a5e0a8026bd4df354280a5c3d6b30fcbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:4373-4384 | rust_port/crates/flow_typing_statement/src/statement.rs:4490-4502 | rust_port/crates/flow_typing_statement/src/statement.rs:7909-7921 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b696045f4480db041b0ff6429c6e945e0b9d26a99d89db06cae22533554b2da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:5462-5474 | rust_port/crates/flow_typing_statement/src/statement.rs:5534-5546 | rust_port/crates/flow_typing_statement/src/statement.rs:5617-5629 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5462\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5547\u0060 calls \u0060extract_getter_type\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5475\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5462}}}],"partialFingerprints":{"codehealthFindingId/v1":"258641dd338a3ed1227a3e4ae4a18879e76177caaa200b92dcf79d7e1387ca23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:568-580 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1736-1748 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs:1749\u0060 calls \u0060assert_ssa_env\u0060 and \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:581\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b9ee4cdc189e806e4c0c2566881e6eaf438d1ffd045194119e0ba81bb7e426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_cli/src/apply_code_action_command.rs:44-56 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:157-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:44\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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c5f43a18154d456ca56fdce74a9b0c7bb5604b024d6d70d6cd83ef7210ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_cli/src/check_contents_command.rs:131-143 | rust_port/crates/flow_cli/src/status_command.rs:139-151 \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 \u0060rust_port/crates/flow_cli/src/check_contents_command.rs:131\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":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6deb1494d14a69670fffb6b2bc94966064bca62d791002af573848e03a40f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_cli/src/coverage_command.rs:415-427 | rust_port/crates/flow_cli/src/dump_types_command.rs:216-227 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/coverage_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/coverage_command.rs:415\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:215\u0060 calls \u0060content_of_file_input\u0060, \u0060ok\u0060, \u0060guess_root\u0060 and \u0060rust_port/crates/flow_cli/src/coverage_command.rs:415\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":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a67d3e081970f3d13c90385e27e321806df7d73ef37969b3c434b3e07ba1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1071-1082 | rust_port/crates/flow_cli/src/glean_runner.rs:1136-1148 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1071\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5564a46ce10ac7f460763597da497918b04fcf161df12be1d5efd46d51c3e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1086-1098 | rust_port/crates/flow_cli/src/glean_runner.rs:1151-1163 \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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1df6e188ace6cf48b6f94cd6a5451fa0105fd64325693f92ae5c49494ddc8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:631-643 | rust_port/crates/flow_codemods/src/annotate_exports.rs:669-681 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:631\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e1638621132db1490b208d1321e6cf08236a81a58e92f8644e6dfb80c975e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_env_builder/src/find_providers.rs:856-868 | rust_port/crates/flow_env_builder/src/find_providers.rs:1323-1335 \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 \u0060rust_port/crates/flow_env_builder/src/find_providers.rs:856\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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"db74ae80c59135377aa9088a562c02901d969c7f869cb16670a2de67af6eeed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:597-609 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:616-628 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:597\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"fead3b4f64018d5cf5462dc763726c45b50d136864917cea9e548898b371de25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1563-1575 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1577-1589 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f514d0e42bdc91f43793ae99c2ec9ec07702469fae0d75b15549a31e7b0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2279-2291 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2320-2331 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"af03878211adfd7a2c25ce71e7833a73f8defff6848c3d381ae59f5d55254ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11121-11133 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11343-11355 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11121\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11121}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab7eff6eb222b788225478c7962315a94fd82ef7a6140924c7bf955243ecda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_heap/src/transaction.rs:1257-1269 | rust_port/crates/flow_heap/src/transaction.rs:1669-1681 \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 \u0060rust_port/crates/flow_heap/src/transaction.rs:1257\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b6ec15e7ed81eec55d8ea7764a5b8a12640ccb684fabc154c463063a21870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_packed_locs/src/packed_locs.rs:178-190 | rust_port/crates/flow_packed_locs/src/packed_locs.rs:220-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_packed_locs/src/packed_locs.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_packed_locs/src/packed_locs.rs:219\u0060 calls \u0060read_int\u0060 and \u0060rust_port/crates/flow_packed_locs/src/packed_locs.rs:177\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":"rust_port/crates/flow_packed_locs/src/packed_locs.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b66bff78f2dcd84e47848f4576da5f8387cd1c55f8fae09aeabe4973127de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:4064-4076 | rust_port/crates/flow_parser/src/estree_translator.rs:5708-5720 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:4064\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4064}}}],"partialFingerprints":{"codehealthFindingId/v1":"398ca6a07a68642630256ba88784f22d0999a0c5dac6445fa93a8fe4fc370ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:68-80 | rust_port/crates/flow_parser/src/expression_parser.rs:394-406 \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 \u0060rust_port/crates/flow_parser/src/expression_parser.rs:68\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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5cee28dd0c742e6d453b3ca4b2b2286038688c8ffd6e8b79f6e83fa9928e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:1134-1146 | rust_port/crates/flow_parser/src/expression_parser.rs:1150-1162 \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 \u0060rust_port/crates/flow_parser/src/expression_parser.rs:1134\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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf3f0e481f84bcebaecc9c241e72cbcba5792c222519dd7a1769eeffa64877e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:516-528 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:534-546 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"758b05524f72c61b7f373e8c243fb249e04e0fcbd6def83b7372387eec23a900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:552-564 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:629-641 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"18768c8b6a5b89a85b544ffde2b1c2fc8b57055ddd517ba59842cc2ffdd56433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1743-1756 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5279-5292 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1743\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5b34fcdba5d5f8bdf400f4c8dc0a18e51cabddd26fccf610c84f91262b903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:1912-1924 | rust_port/crates/flow_parser/src/type_parser.rs:2044-2056 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:1912\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9159b18c4e89ab16486f783444fb63751e8f758c7c7eedf49f5e10f294e872d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/enum_validate.rs:236-248 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:284-296 \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 \u0060rust_port/crates/flow_parser_utils/src/enum_validate.rs:236\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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5c8f095a3d370f6d7c4e4864d3d5c0448066a4be5efd3c06f1f9ab7b35ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3991-4003 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4171-4183 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3991\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3991}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3d70ddf12b1e39dff8ecbafec6d36355450cb7c99f4bea623a8ff63538038c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:3059-3071 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4021-4032 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:3059\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1f5861262b44bcb966cc4db2690905137219da6979a29f3a9bdcfb7e5776df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1212-1224 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1381-1393 \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 \u0060rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1212\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3be1ee80b7de56674c853983c95ad4d048b6dfbb824d8979fa82284cc67519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:238-250 | rust_port/crates/flow_services_inference/src/type_service.rs:2558-2570 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_server_rechecker/src/recheck_updates.rs\u0060 and \u0060rust_port/crates/flow_services_inference/src/type_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"425854a204bfcf279d76aeca5dd3aec398712b3c7e32e4a14475095fd5972f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/autofix_imports.rs:336-348 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:359-369 \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 \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs:336\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ec27b278f31dbc03d85b6bbfb39cba58a6ff3a93ab2f8deedd7e93c5da4d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1383-1395 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1603-1615 \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 \u0060rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1383\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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf0f2d44c10c094431ed323fa400f9d67776a4ff827b11c3984dd53daeb9ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_type_sig/src/ts_enum_sig.rs:169-181 | rust_port/crates/flow_type_sig/src/ts_enum_sig.rs:183-195 \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":"rust_port/crates/flow_type_sig/src/ts_enum_sig.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"401f5b81add61df0cfb737a6ca69ecc422d258b061d95f689484302e9be050b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4416-4428 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4570-4582 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ad5edafb2c08d712d97889d7cb6e39daabb971e276cdfa2863c88002cdb095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5740-5751 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5861-5873 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5740\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"979083dd36cb2cd2927cc20e04b0aa809fb1be8ee05e34898c6e49688c56b1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11850-11862 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12929-12940 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11850\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11850}}}],"partialFingerprints":{"codehealthFindingId/v1":"27afb2db84ec24f419e0c40cc7b2147a965fa5b32e97d4156001034dd0e50fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11993-12005 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12018-12030 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11993\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12006\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12031\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11993}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eab27572cbd2c2be71ffda7dc36cd308ea5c3880deda0ea9dcf47ae04c410f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:1679-1691 | rust_port/crates/flow_typing/src/env_resolution.rs:1694-1706 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:1679\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d536f78103df123421d662e12f285dca7959ff7087769abea6e1fbbb76539ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:695-707 | rust_port/crates/flow_typing_debug/src/lib.rs:709-721 \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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9b0fe2b59ef5deb0f6b9df3f0897b214e28bff3d36ae29642490f1db8788c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:2234-2246 | rust_port/crates/flow_typing_debug/src/lib.rs:2258-2270 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:2234\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0ba8382cc4b3edb0bb87a0ff8556c32327535e50279ab907e9711e0c36a379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:737-749 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:779-790 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:737\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb7fad946af89921ab4dd19a251550d3a7ab3fee0e7259b1d03da5cd0723158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10730-10742 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10880-10891 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10730\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10878\u0060 calls \u0060msg_with_locs\u0060, \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10730\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":10730}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b705d7edc9098dea62c3c778ad0e53003ebba2e1ef5c7992113570f4b4d8f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1421-1433 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1486-1498 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c1fadba029b4eb69c91f99ec59d212493da14c5de51a27f14cf21e7c52d09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8140-8152 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8156-8168 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c494387d38cf89a7e667b84845c9cd47e996b4ee82f102cf6fa45805ff9c41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:403-415 | rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:596-608 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d88ad1d74de806666ca404f80c82409a2a1c574d1464d4724a8fbff95c33c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2252-2259 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2518-2530 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cb902a3a7395863e6074b76d9d6261a4bd248894753654c54a513cc6f03d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5336-5348 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5405-5417 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5336\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b4f4e1a8426541f36ebc6a06b08eea62b744ed96619a15a955840bc63ae6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8379-8391 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8438-8449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8377\u0060 calls \u0060DefT\u0060, \u0060ArrT\u0060, \u0060GenericT\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8437\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":8379}}}],"partialFingerprints":{"codehealthFindingId/v1":"06af720301a0cb8e2ff93e66586a4240196b9663ffe2eede3d5cbb795215b56a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10866-10878 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10883-10894 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10866\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":10866}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb646a4e6a5c2339bb4f487f2acd05d00df816a0c8052df8dca6889a68bbc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1014-1026 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1039-1051 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:1014\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c78f1c0e0724e2ff30490879afdcd408f11edb9f29989f07c7452ab0c4b712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2499-2511 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2702-2713 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2499\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"889b1158b20582c11c48802f998442a784b0682c1f294d765ea080f65a8cc487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3093-3105 | rust_port/crates/flow_typing_statement/src/statement.rs:3235-3247 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3093\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3093}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea58d390971bf03ed865965eec5b43df89637b626a94c9e4ee830cc531b119c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14750-14773 | rust_port/crates/flow_typing_statement/src/statement.rs:15048-15071 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14750\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a841eabc51dd93f12fad032a17759acd44bd5c52bf1463c4099a8f8a754800d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17372-17384 | rust_port/crates/flow_typing_statement/src/statement.rs:17693-17704 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17372\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17372}}}],"partialFingerprints":{"codehealthFindingId/v1":"079bf4748b172daa2602038c0b6c347b1924b870ba1e34acf8d42a579d18576c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19945-19956 | rust_port/crates/flow_typing_statement/src/statement.rs:20425-20437 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19945\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882939ed4d95965acb4384447d860af428947f810239c34b7fdfb990d226bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:10421-10433 | rust_port/crates/flow_typing_type/src/type_.rs:10489-10501 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:10421\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":10421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b01091b914076bdab285de16720acc294247a8ccc9bbe6f9baf390366bc35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3742-3754 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3818-3830 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3742\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3381af017b896205379e96ed1ffa62b75da6edd5448598210b6aebc450a7cb9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:406-418 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:876-889 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:406\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fd4a5f060d693e92dc2e06ac5200186d813f763b6539e042d8670666785a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:812-823 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:825-837 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:812\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b0569cf17609b61c6be9d220bd524281badb268b59887f0d39e0a05d8c0eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2886-2902 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2993-3009 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce87eb1292d71b642494496145067baa0a209388e04fd10010418b688f851da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 8): rust_port/crates/flow_typing_statement/src/statement.rs:17154-17164 | rust_port/crates/flow_typing_statement/src/statement.rs:17219-17229 | rust_port/crates/flow_typing_statement/src/statement.rs:17307-17317 | rust_port/crates/flow_typing_statement/src/statement.rs:17377-17387 | rust_port/crates/flow_typing_statement/src/statement.rs:18045-18056 | rust_port/crates/flow_typing_statement/src/statement.rs:18082-18092 | rust_port/crates/flow_typing_statement/src/statement.rs:18543-18553 | rust_port/crates/flow_typing_statement/src/statement.rs:18720-18730 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17154\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b784655a5080ddbc4136bd9fb15dc6fee74e2a18cf8e543f33526f486efaa0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3498-3509 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3778-3789 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7737-7748 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7772-7783 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7807-7818 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7846-7857 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3498\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7439043754b31b464b53328dd31104aaed7edb28bd0c2bb6bb7aece45fb2c538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 5): rust_port/crates/flow_codemods/src/annotate_exports.rs:363-374 | rust_port/crates/flow_codemods/src/annotate_exports.rs:560-571 | rust_port/crates/flow_codemods/src/annotate_exports.rs:675-684 | rust_port/crates/flow_codemods/src/annotate_exports.rs:847-856 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:299-309 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs\u0060 and \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:363\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"231372059249d14ab12f16165170b52a341e6cdad79794a0888794b4a86478f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7282-7293 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7350-7361 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7413-7424 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7448-7459 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7282}}}],"partialFingerprints":{"codehealthFindingId/v1":"69beb29d163d20263c0ff813cae106224f75a02c73ee5ec8ea13644f2551bd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 4): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11277-11288 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11344-11355 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13370-13377 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13417-13424 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11277\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11277}}}],"partialFingerprints":{"codehealthFindingId/v1":"436d37b62bd27b7e710aa163a83dfe0ebd912605b8344a7302ce2eb43480330d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:9976-9987 | rust_port/crates/flow_typing_statement/src/statement.rs:10398-10409 | rust_port/crates/flow_typing_statement/src/statement.rs:10569-10580 | rust_port/crates/flow_typing_statement/src/statement.rs:10734-10745 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9976\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6237385319bdf13ac9e81f9d92df4d896096e2db7d6155496366762edf26f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8229-8240 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8323-8334 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8415-8426 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8492-8503 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:8229\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac7f364f4b5844859919811e701f606429303e28cf3609e73a02b48dea78ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:1099-1112 | rust_port/crates/flow_parser/src/flow_lexer.rs:2497-2510 | rust_port/crates/flow_parser/src/flow_lexer.rs:2689-2702 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6478afac2f5db37c5ec80ebd2913a4b33d0e928bc75623e9ac4a8ff8b8d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8085-8096 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8610-8621 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8957-8968 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8085\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8085}}}],"partialFingerprints":{"codehealthFindingId/v1":"3274c12c3ccda96cbed7774aafa08b0103046792d32e343fcf237efee4f7232d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8125-8136 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8521-8532 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8860-8871 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8125}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c9b50cffbea23a2ac5625c7fff097d504d77b975e04695a1f717e61aed67aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1973-1984 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2072-2083 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11200-11210 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1973\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a023295dce76e482cac170721889d8b7c4cbbb82120397b007fc97557df7f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5815-5826 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6074-6084 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6141-6152 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5815\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":5815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb6c3a131044241efd737daad5c43d0699505fedd2e205de438471700fbe17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6524-6535 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6542-6553 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6560-6571 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6524\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6524}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56ce1722802b5f8dfc1428f96893a7c34bf72c529fcb48cba648a7060390e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2569-2580 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2600-2611 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2923-2934 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2569\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ec8e7c7bf4dff89bef244b3edb984b0fda87f92a38ba38689e2509bdbed7dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:688-699 | rust_port/crates/flow_analysis/src/ssa_builder.rs:908-919 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:688\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026\u0027ast ast::statement::ForOf\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026ast::statement::ForOf\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc0b101d5f94fddfa52062715cc3d75812354447e939b76952146fc4a9c199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_cli/src/inlay_hint_command.rs:107-118 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:268-278 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/type_at_pos_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/inlay_hint_command.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc52b081def4e0b5d269a774b807b58067a80ac81f133bec27de1943e18b697c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:308-319 | rust_port/crates/flow_codemods/src/annotate_exports.rs:502-513 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:308\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6234d9a7df5450e74a55309411d311044b7506a80cd130dd9fe146bcc7a63a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:259-270 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:294-305 \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 \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:259\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":"rust_port/crates/flow_codemods/src/annotate_optional_properties.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da6c4d31cb43a534cb3df420d30693229f7fc97cdc97407133ab809fdd6d099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_common/src/reason.rs:1735-1746 | rust_port/crates/flow_common/src/reason.rs:1823-1834 \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 \u0060rust_port/crates/flow_common/src/reason.rs:1735\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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a61df56c7e2657cd06203d70e34fae75add37e610a232a1802f422b2bdd6adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_common_errors/src/error_utils.rs:4636-4647 | rust_port/crates/flow_hh_json/src/lib.rs:21-32 \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 \u0060rust_port/crates/flow_common_errors/src/error_utils.rs:4636\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026Value\u0060 in one and \u0060\u0026serde_json::Value\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4636}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d42eb553e3434f8ee99678c68740e0f6fe93abe847926a1c281b85ebd4b49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_env_builder/src/find_providers.rs:832-845 | rust_port/crates/flow_env_builder/src/find_providers.rs:1292-1305 \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 \u0060rust_port/crates/flow_env_builder/src/find_providers.rs:832\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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3904fba1df9d8f9c60c2c7969828d6539b55dff4a9b38152ef9dd962b7ca5716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2048-2059 | rust_port/crates/flow_env_builder/src/name_def.rs:2304-2315 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:2048\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"489c4325a70f46ede96f7d1cbec060fcd7870a3cb85e01585618ae20696feda2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5822-5833 | rust_port/crates/flow_env_builder/src/name_def.rs:5838-5849 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5822\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5822}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6599e981942188a8e4398ac9de7c142e432251d9cab8a4a7c27fcb009356bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2316-2327 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2342-2353 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2316\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cdf2326606e66f3c9957901f7121c608de9fa19dd79ab94cdab5eb545c4f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2038-2049 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2064-2075 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2038\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3053db558ffe6a7e9b2d65e6482c6b8c612bdc32bb359eccfd5d05b99b4d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4669-4680 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4813-4824 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4669\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f02c4503ede4b4cabb99987da5ab696a3322b0c74dd2e36b57c46c5ab063928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7790-7801 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7867-7878 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7790\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7790}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2f51b1d0f4d148e3d8f47281cc1284fb0f1e5d61509a20fde89ff2a6884c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12831-12842 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12847-12858 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12831\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3784267f90fc9102a7fcb4430a6aef864bb1eb70c82a995a9be3ea8196c98c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_event_logger/src/lib.rs:899-910 | rust_port/crates/flow_event_logger/src/lib.rs:927-938 \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 \u0060rust_port/crates/flow_event_logger/src/lib.rs:899\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060LoggingContext\u0060 in one and \u0060fb::LoggingContext\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":"rust_port/crates/flow_event_logger/src/lib.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c429fe3613509fe5cdc7a98a6d29310fa8a07d4e7a775d5b92a61558e9388659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:8902-8913 | rust_port/crates/flow_parser/src/ast_visitor.rs:9847-9858 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:8902\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8902}}}],"partialFingerprints":{"codehealthFindingId/v1":"54221f0fff126f2b8ce1a64d1771148dae5b77f67247b883216ba762024753f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:17602-17613 | rust_port/crates/flow_parser/src/ast_visitor.rs:17645-17656 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:17602\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b348a090bf2092fd0b0617a3f7b718e9709e4a56c2df9926dbe4c70e27a21a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:543-554 | rust_port/crates/flow_parser/src/declaration_parser.rs:1436-1447 \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 \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:543\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c21680f2790e76cc1998e87011a254ebd2e5cda8613353e4c0b9f36b1e7e0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:1277-1288 | rust_port/crates/flow_parser/src/declaration_parser.rs:1299-1310 \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 \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:1277\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:1275\u0060 calls \u0060token\u0060 and \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:1298\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c751906cec8fd176368cd6d080dca6ba5b4847a48b1820d576d7c11bc092a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:718-729 | rust_port/crates/flow_parser/src/object_parser.rs:735-746 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:718\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ba76f2e26fe5e896be9b210a10fe69619092cc4f94c84de801da2a749bb932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1456-1467 | rust_port/crates/flow_parser/src/statement_parser.rs:138-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/object_parser.rs:1456\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"693d5a253620de79806acdaebf00d4c397ecc3644b193c8ce50d16293e57c719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:2147-2158 | rust_port/crates/flow_parser/src/object_parser.rs:2163-2174 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:2147\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b32dbcaffe0732383172e408498151453926b362d5f4f4bdcdf7a981f1b1134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:2618-2629 | rust_port/crates/flow_parser/src/statement_parser.rs:2637-2648 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:2618\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35c8c2e97b667f3ce1d2a141ce25808c5df778825c8e5a1a4afdf7c05421f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:142-152 | rust_port/crates/flow_parser/src/type_parser.rs:169-180 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:142\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 before the matched lines, \u0060rust_port/crates/flow_parser/src/type_parser.rs:140\u0060 calls \u0060strict_error\u0060 and \u0060rust_port/crates/flow_parser/src/type_parser.rs:168\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8974ada91502557e613c8f8ba937498c5ca98a2a55f7f4b56186f92ad8e7e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5847-5858 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5877-5888 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:5847\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":5847}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc130809c400b51452b44944a6460d61a9639d3aac00412f87904c21e82180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5383-5394 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5743-5754 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5383\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5383}}}],"partialFingerprints":{"codehealthFindingId/v1":"786b16a8ab3034192273da2441a0c826e57eab57cb01fabc69fd869886e803b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:172-183 | rust_port/crates/flow_parser_wasm/src/strip_flow.rs:129-140 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/strip_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:172\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"91261a6d897ef1c79e77c47806c9e6b87453d9a20b301104187c76c6932acc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2361-2372 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4252-4263 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc47f6297ecefae78077c5d5157d29cc8f697876af3869e1b1a41d650e5edaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2431-2449 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3905-3922 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2431\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1cc4c0136bd417811e84294896aa477587a7638a5272ac3fb2e34280bd5e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2454-2465 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2511-2522 \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, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2466\u0060 calls \u0060write_bool\u0060, \u0060is_key_computed\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2523\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d217f0b4a45ae956e62b0f0d297b77baa59a90683a8bbfe62dc593e6969fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:2003-2014 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2865-2876 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:2003\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a60e6477862a2bbfeb406bdd943bc3424cf311adb5c940dcd66a64bf2e2fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:7797-7808 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7835-7846 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:7797\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b686c41a3c289d38bce8d42d53f4dea5cc14f429cf5fb629320abf17c061c72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs:510-521 | rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs:532-543 \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":"rust_port/crates/flow_server_env/src/server_monitor_listener_state.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"de35d10583d6430f376240b6d3d9f54ad71bd7bac491aea7a3e2ed7b3974cbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:210-221 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:226-237 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060flags\u0060 to \u0060cli_output::ErrorFlags\u0060 in one and \u0060ErrorFlagsWire\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2152461b0c080b41d288eee5b0cb385248a30627886f413a00c932c463f0aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/file_watcher.rs:1702-1713 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1715-1726 \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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec83f27d9a4fcb3e85bdc0df295b96a291b2e80d0fb1d2b73f924189f3496441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:441-452 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:528-539 \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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1347126721574bc18149abe3015e7e818e85ac34a5c2b04163d501eb05efa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_services_inference/src/init.rs:162-173 | rust_port/crates/flow_typing/src/merge.rs:2423-2434 \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":"rust_port/crates/flow_services_inference/src/init.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08f9740850ea769c2637619b87f397a00e781761e2b802182c5209825e3398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:121-131 | rust_port/crates/flow_services_inference/src/merge_service.rs:146-157 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e10581ad7c5ba29675963403ae35a406d6cbd91868212b82763529c32e8097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:301-312 | rust_port/crates/flow_services_inference/src/merge_service.rs:417-428 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:301\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:415\u0060 calls \u0060edge_import_ns\u0060 and \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:300\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e32e7b5899b8032a3efc4eedd5406e741b13f6c314c4d3d70170f583e32d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14766-14777 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14781-14792 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14766\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8725b057a5f5524708d73f0695128394136a59380d9c659e90d419224e632fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:664-675 | rust_port/crates/flow_typing/src/env_resolution.rs:1547-1558 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:664\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing/src/env_resolution.rs:1546\u0060 calls \u0060mk_reason\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing/src/env_resolution.rs:663\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6e970235522abfeaaf1242d16b70654fb3b7471ec31384ab199d4e6cfd8397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:1641-1652 | rust_port/crates/flow_typing/src/env_resolution.rs:1655-1666 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:1641\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3670fb3e7d1e54f976d12ae140453ef7df06c56f6b1b45dfb5566f8b706ee014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1522-1533 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1597-1607 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1522\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbf9ad8cc61947d751ccfe3fdec6281804a2d0801754ddaabf5caa8b26ff05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7927-7940 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7942-7953 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":7927}}}],"partialFingerprints":{"codehealthFindingId/v1":"693acbefd5fe8a8e1e7c00215ed97184bd8c065b3dc2400e53f46d29345beda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:11252-11264 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:11281-11293 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:11252\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":11252}}}],"partialFingerprints":{"codehealthFindingId/v1":"460aced4df9ad6aca06e898de919150e779160d4c98befddffd217f2bc4412ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1376-1387 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1509-1520 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"19066609578256e7b95fa5d5c081d718a24979913ca9922f5b5ae1f044651b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1448-1459 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1476-1486 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1448\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca16390b7972a4e67b82f382aaff9eae29be689679dc0d2fe8bb675beb60a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3447-3458 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:412-423 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9225d18af4d7bc7554f99f3e378ceb5aa1af019e83252961aaca173acf01a02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11196-11207 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11276-11287 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":11196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2df74ec4400e313467ff9871b9552106e58d9bc61700b35fd2fe8071c8e2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1541-1552 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1679-1690 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1541\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e68c45f7534e8168b69237045ea7c7fb5d61386a33ef76186647e2d374449c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:484-496 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:516-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:484\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b9bd009d6333a0928d6188f02438914eee67a2978b5777e182072cb9e52d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:498-509 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:531-542 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:498\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d038b2434f2046d9a9c80b149ac4ecb155dd82516d50dfb2500eeaf68573d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3616-3627 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3652-3663 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3616\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"25922ed2ba029c7dde0c86e43be74f6adc48af25034b0b43d541bf941a1e05af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:794-805 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:814-825 \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 \u0060rust_port/crates/flow_typing_flow_js/src/object_kit.rs:794\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff99f9d95baf5d06ae6016d02ed186b96c37a9cca09c1e40a87444bb9226b951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1671-1682 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2726-2737 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1671\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a93186651725e6c2b4ec8a24d071732b0b2ece71b8a9c4991ca35b3c0d682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1071-1082 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1403-1414 \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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"893bc0d5dc88a21e33fa8f866aec301ccee6e1bcbc9c23e77edfdb58ad5e479c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:987-1000 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1003-1016 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:987\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c5c57a7bedee2a130a330d498458c212477cc76b761dcaabbb1c1a7d7fadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1833-1844 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2127-2138 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1833\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"722f897cb11cbb3856e8c3f334dfb79813e54797e826d21c18ff52425136b10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:138-151 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:187-200 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs\u0060 and \u0060rust_port/crates/flow_typing_statement/src/func_stmt_config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:138\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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd1cc880fecdb948a634c8dd829122272c9ea8e59180df1bec0110217f7182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7377-7388 | rust_port/crates/flow_typing_statement/src/statement.rs:7481-7492 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7377\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7377}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dfae6263a2a697ebafa8caa99891fabb56d52204e5e5c0406f481521f3769c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7392-7403 | rust_port/crates/flow_typing_statement/src/statement.rs:7497-7508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7495\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7390\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7392}}}],"partialFingerprints":{"codehealthFindingId/v1":"055e9e62f1b4b068a5fac7a1b4c28e2599ea1a0e8c43fca4b97fd969b248be85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:10256-10264 | rust_port/crates/flow_typing_statement/src/statement.rs:10513-10524 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10256\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10256}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b353d68769596f423eced1e5e5b4bf2b693838500a6d368078b0e0633b8514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:10984-10995 | rust_port/crates/flow_typing_statement/src/statement.rs:11045-11056 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10984\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92f8a48c7edd04687204db03f8a976733d045e0a9072bc5f5aed2bf3763bc83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:17541-17552 | rust_port/crates/flow_typing_statement/src/statement.rs:17760-17771 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17541\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17541}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a0f46092fdbdc03d06e846e31e73c8301388b1cadf404e42bc0c4a7b563519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18979-18990 | rust_port/crates/flow_typing_statement/src/statement.rs:19045-19056 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18979\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d5e31a443b0ccb125e82239432559710220a7c641d7849d0a0cef52b198ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2342-2360 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2950-2968 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2342\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, \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2949\u0060 calls \u0060unapplied_type_identifier_opt\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2341\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27267fc349295f6968bb5a06b986490270261c731d7afdd830077a05fcb8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4953-4964 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5034-5045 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4953\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4953}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f525d44d32ccbd5e042ea98bbb3ac450e88e3c397d5467ebe391afbe3d7b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:9118-9129 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9184-9195 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:9118\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":9118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7737ccfcd95a30ded7c4bee9585f48edfdfb0b4680cb3809d593bf8d5b3f89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_hint.rs:1022-1033 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1472-1483 \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 \u0060rust_port/crates/flow_typing_utils/src/type_hint.rs:1022\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"708e809cf4f4d604e2bea68fa603ef01c0d3602ee34c6f431671c8c823b63cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:450-460 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2997-3008 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:450\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57fb3927c35e1efff20375a653368e83b5b23a6a0d46ae9e61bb7b637d153b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:783-792 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:794-805 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:783\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"4337da4acda975e6d79d625d6ee654d548aa271cec2e700127bb892feb3b7b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1385-1396 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6208-6219 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1385\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b405d1523129beb741caf6893ee6736c44ccf7b16118834e3f78cbc17092f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4994-5004 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5039-5050 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4994\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8326a42d8c37266e8f7efea36fda3fd73d0f70f43c236a6049c391ab70eda83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:678-689 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:697-708 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs:678\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"20668f24b126d48b6891c9fe111ef0e0a993923460126f67a0f506f5bb7cd360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): rust_port/crates/flow_codemods/src/annotate_exports.rs:525-534 | rust_port/crates/flow_codemods/src/annotate_exports.rs:645-655 | rust_port/crates/flow_codemods/src/annotate_exports.rs:683-692 | rust_port/crates/flow_codemods/src/annotate_exports.rs:811-821 | rust_port/crates/flow_codemods/src/annotate_exports.rs:855-864 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"0657d6f605f9fd00e96ee744450012004d51efe27a5e177f409b3034603df0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9886-9897 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9907-9918 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10026-10037 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10048-10059 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:10146-10156 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9886\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":9886}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c005abbf1d703c9a0ab45b9ca084561326d6f52a7fe136d35fb7dfc0abb3e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:773-783 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:914-924 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:998-1008 | rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:1108-1118 \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 \u0060rust_port/crates/flow_codemods/src/utils/codemod_runner.rs:773\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5db4e04bb470a4bcff7cd5e4b8aabc74eebb6219b40661eca0786625da6347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_env_builder/src/name_def.rs:5092-5102 | rust_port/crates/flow_env_builder/src/name_def.rs:5140-5150 | rust_port/crates/flow_env_builder/src/name_def.rs:5192-5202 | rust_port/crates/flow_env_builder/src/name_def.rs:5382-5392 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5092\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5092}}}],"partialFingerprints":{"codehealthFindingId/v1":"026a64152f1d1247a62161e409f8bcffde9cf7e70bd5042c62dfa726171456c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3025-3035 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3157-3167 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3216-3226 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3778-3788 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3025\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spread2\u0060 to \u0060\u0026ast::jsx::SpreadChild\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026expression::SpreadElement\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"def5136539a3cacdc9e1b37bc20668ea8fb353f33a6e9b554cf717cc83593879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2687-2697 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:2901-2911 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3039-3049 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:3091-3101 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fca0181b9bc42c9d0236f3b9af0682fd67caa18e9b36502fcad9eab57c9cc8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1236-1246 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1254-1264 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1284-1294 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1302-1312 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1236\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"be829561a7ed6fae70fb60a79a3103a36de62ed4877c96840d3248e3721491f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:764-773 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:778-788 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:798-808 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:818-828 \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 \u0060rust_port/crates/flow_typing_flow_js/src/object_kit.rs:764\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d453fc0190c70828eb950aedcc8a1d76df6df28350bb177eb0ab0af625292a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2439-2449 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2486-2496 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2542-2552 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2675-2685 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2439\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2553\u0060 calls \u0060object_like\u0060, \u0060Ok\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2450\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"be77f2bede91aeb566045e95d386a5b52bc5aa4d2219b08cd20977002fca3d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_cli/src/apply_code_action_command.rs:202-212 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:301-311 | rust_port/crates/flow_cli/src/autofix_command.rs:350-360 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/autofix_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:202\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbfc6a459037785c2606fd606eb25db4d1a605ade2ba3d8c472d2d14abc1da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_common_ty/src/ty.rs:1158-1168 | rust_port/crates/flow_common_ty/src/ty.rs:1658-1668 | rust_port/crates/flow_common_ty/src/ty.rs:3238-3248 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_common_ty/src/ty.rs:1158\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec3a00717537a3338729bc286e55f0baaca6c06474b407e9f477fdf6bef36b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:279-289 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:342-352 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:373-383 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:276\u0060 calls \u0060to_owned\u0060 and \u0060rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:340\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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e6aedb49bb37717143b1a3036fbb88048d3d450fc8ed1949a877af67c64351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1645-1655 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:704-713 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:719-728 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1645\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8289ca81a165c0d14f602b2ee02358d973c7f44bed2cdc482b16fc5757114d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5582-5592 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5601-5611 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5665-5675 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5582\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9da07dc660a4659f60eda10447525f93341fdab99f54ec82fffeaa2e12f91eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:224-234 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:242-252 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:283-293 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:242\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"879da5a30ac6bc65f5a3d20031d924dfa40aa4c4bd4ef765626b0ba2a1769247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:811-820 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:829-838 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:858-868 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:811\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e42ecef030193d6e322ede395797fdfed02c5091212158036c1f681069e472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1872-1882 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1920-1928 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2749-2757 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1872\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"05072042d675704a4962bce1a8f15a6be7b1bc65101b803f4b9ec65d6ceb267e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/component_params.rs:222-232 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:1115-1124 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:1175-1184 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/component_params.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/component_params.rs:221\u0060 calls \u0060generate_id\u0060 and \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:1174\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":"rust_port/crates/flow_typing_statement/src/component_params.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2cd96f94b7fdc599c4f1f513f25fbf9250d7033a6f785bc11ff2ed398c97d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1771-1781 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1783-1793 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1795-1805 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc0311ba94fc76b7fda85f8e79d1ba6ea3bf690e5281da30fe8ef3001de5714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2149-2159 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2264-2274 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2293-2303 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2149\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3c434e5f2522c894bd7aa71bdd2c5774eda35b71e1600877c8480c11c35fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4860-4870 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4894-4904 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4913-4923 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4860\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8c45e1d06de841819242afe819c3058cc0f3e300b14fc226cd2c45f1b42ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:104-114 | rust_port/crates/flow_analysis/src/ssa_builder.rs:751-761 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf85dfaf4648d3de9057484f0a9000cfd6cbdcca4570742d9e4832ce2721e7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:651-661 | rust_port/crates/flow_analysis/src/ssa_builder.rs:864-874 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:651\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026\u0027ast ast::statement::ForIn\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026ast::statement::ForIn\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4238a88b3345333616a24fd13d3d49c532f376134b1da89f9a201b530de4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): rust_port/crates/flow_analysis/src/ssa_builder.rs:828-836 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1675-1685 \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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9c3dd984d7c9c529a423d0b192c4f4b5572300320c985e8d230e272f234baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/apply_code_action_command.rs:161-171 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:262-272 \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 \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:161\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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6363a6e1cd5e7597a4554275a4bdc1f32958659df22acd3f826c9f3e53561ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/ast_command.rs:136-146 | rust_port/crates/flow_cli/src/env_builder_debug_command.rs:52-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef9472d12b28f21cad8346929d09b0923806dfbbb2bcb4adbb05c56471b06dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/ast_command.rs:283-293 | rust_port/crates/flow_cli/src/env_builder_debug_command.rs:133-143 \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":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da4b2072ef75e653a67f22c6b209284dcd02e1caa047ad27e7dad956ab6abc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/autofix_command.rs:275-285 | rust_port/crates/flow_cli/src/autofix_command.rs:419-429 \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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"153805e4624ef7f0016f7829c37e8ad071383fb949e6bf7d9c08c5467f5f28ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/codemod_command.rs:821-831 | rust_port/crates/flow_cli/src/codemod_command.rs:940-950 \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 \u0060rust_port/crates/flow_cli/src/codemod_command.rs:821\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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a85c2235875cdeb8856aecbb32bd7a4d54aa88c145c397aa336ea2443ef67b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1318-1328 | rust_port/crates/flow_cli/src/glean_runner.rs:1367-1377 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1318\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, \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1365\u0060 calls \u0060get\u0060, \u0060name\u0060 and \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1317\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"409dceb6d08f09d34e9a97b3704812e8d899c25b412f4c6a98781d78553a76bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:513-523 | rust_port/crates/flow_codemods/src/annotate_exports.rs:556-566 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:513\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"22477855cf809b8aa206639818de3f5d0d940aa62ee0047b83213034d9c2607a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_commands_connect/src/command_mean_kill.rs:74-84 | rust_port/crates/flow_commands_connect/src/command_mean_kill.rs:100-109 \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 \u0060rust_port/crates/flow_commands_connect/src/command_mean_kill.rs:74\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":"rust_port/crates/flow_commands_connect/src/command_mean_kill.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa9e5c99de21d37bc87fdb57d0ad595d4aa3bdf6ed1908c78e1cd6426053e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:1409-1419 | rust_port/crates/flow_parser/src/file_key.rs:139-149 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_common/src/files.rs\u0060 and \u0060rust_port/crates/flow_parser/src/file_key.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_common/src/files.rs:1409\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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8315b7d0bbc79d343240d5a130cd0e590747aa17eb50d232f43aa63549417af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_dot_js_wasm/src/lib.rs:270-280 | rust_port/crates/flow_services_references/src/rename_module.rs:136-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dot_js_wasm/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"226a76427723326227c5a2c67ee435cef93f2df44325015f2428e78dfefbe7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:4614-4624 | rust_port/crates/flow_env_builder/src/name_def.rs:7261-7271 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abe591b7708a846318bbe545119e66300c558b3bda57d4e4ea468cb1232b854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4652-4662 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4682-4692 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4652\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a811190815df4a1c8d9ce75abe7d78125e0266e3ef62cb34d0df513df4f24ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_heap/src/transaction.rs:1030-1040 | rust_port/crates/flow_heap/src/transaction.rs:1138-1148 \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 \u0060rust_port/crates/flow_heap/src/transaction.rs:1030\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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316c58cd46bb5d714599d36e0fbb3a6c9c960e3d02c6034c500c3ad800fba6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_heap/src/transaction.rs:1109-1119 | rust_port/crates/flow_heap/src/transaction.rs:1144-1154 \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 \u0060rust_port/crates/flow_heap/src/transaction.rs:1109\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":"rust_port/crates/flow_heap/src/transaction.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4bff8a325a13df7cada89f88619f99431a45f5f4c0bb5631fa98424662e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_imports_exports/src/exports.rs:526-536 | rust_port/crates/flow_imports_exports/src/exports.rs:667-677 \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 \u0060rust_port/crates/flow_imports_exports/src/exports.rs:526\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3354e7f9aa9f3915aa7ea2c7de42f575745089db8fb2acb3984eb964fab490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:11462-11472 | rust_port/crates/flow_parser/src/ast_visitor.rs:12278-12288 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:11462\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":11462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a163c9b39dfc50baa88f4c51748c4799e111502dadd13e144531965d51c46f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:6441-6449 | rust_port/crates/flow_parser_wasm/src/serializer.rs:941-951 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":6441}}}],"partialFingerprints":{"codehealthFindingId/v1":"819503731621ab93b6d74f86ec5f253921c387758ab051965aaffea384775463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:2646-2656 | rust_port/crates/flow_parser/src/type_parser.rs:1016-1026 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/expression_parser.rs\u0060 and \u0060rust_port/crates/flow_parser/src/type_parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/expression_parser.rs:2646\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060part\u0060 to \u0060TemplatePart\u0060 in one and \u0060token::TemplatePart\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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d95729a5573a0a2d76b755971430fc0e5bae48ea7b80ef692128cf87cf36db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1858-1868 | rust_port/crates/flow_parser/src/flow_lexer.rs:1898-1908 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1858\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1857\u0060 calls \u0060source\u0060 and \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1897\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8014388d1318c26ba5319a622f5750e67fec887bf399840b787fa15d4e39759"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/jsx_parser.rs:209-219 | rust_port/crates/flow_parser/src/jsx_parser.rs:286-296 \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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98dd250d7eac528c0891dd2e3b9bf637e55db861cfa834f910c3701437910b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4053-4062 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4976-4986 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4053\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7f82cafcf1135da80aad785a4d73a9d6087478ffff1b8b93e36507fb7b8c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:2315-2325 | rust_port/crates/flow_parser/src/statement_parser.rs:2354-2364 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:2315\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b80cc5ec9256e0fd7357e0f605ad65583d6c53c2a96629d1e7343afe7ecd937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3254-3264 | rust_port/crates/flow_parser/src/statement_parser.rs:3504-3513 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3254\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbce46a8aa394bfae4e7781521e179dd2ded0e0725aa678058c7aef4c5d4e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:2319-2329 | rust_port/crates/flow_parser/src/type_parser.rs:2364-2374 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966ea34ccfb90c1e0c107081c077411ac67e96d44255a7bd9dbb808cb0d2af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/enum_validate.rs:255-265 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:271-280 \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 \u0060rust_port/crates/flow_parser_utils/src/enum_validate.rs:255\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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"10df2794ca57a7a729376bf3d31ca958e9512bfbaf54b1b9b7639729165d313e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/package_exports.rs:143-153 | rust_port/crates/flow_parser_utils/src/package_json.rs:132-142 \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":"rust_port/crates/flow_parser_utils/src/package_exports.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e494b3575cfb0bbdd9ca0747ec2d6feb0a20ac240e020b1a16402344e1f05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5356-5366 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6985-6995 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5355\u0060 calls \u0060type_args\u0060 and \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6984\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3df82a3c0fa23faca93e7f8e0b6da78e58fbfdc7e8289a0fb272a3a4acb38f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:577-587 | rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:293-303 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:577\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6839c4d041427cc532c2f6195177f613055e3e2e9ce8d3a4940af5b129640b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:729-739 | rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:768-780 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:729\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed115c0bc99c63aa3a9a345b9d5b3a877adfdbc945e5b93d02252db115742e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:363-373 | rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:517-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:363\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaadad96671ba46bb7c5c159b67e66575790bbe88b1ec83e6cc2a50c1aea4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:1207-1217 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3162-3171 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:1207\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ef0406434159fa5ba888495be580efb21c735b2816ad1cf044dbea5d752dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:4671-4681 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4853-4863 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4671\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b987a11eeed5f87b0a1a4f0cdeb1a9d69f9aff96947b55772112ffbced92ea9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1795-1802 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2025-2035 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:1795\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6ba227e3888e9890eee2c015bac73622bfc3987ede7122db409bf7b8873e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:7452-7462 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7898-7908 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:7452\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7452}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccbb283f77fb097bedf32f891c5d0ea983ba3eed115c9d298f4f461ef34d75e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/file_watcher.rs:508-518 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1222-1232 \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 \u0060rust_port/crates/flow_server_monitor/src/file_watcher.rs:508\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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aacd82d7d9eda2ad158c44df88bb73122adbd2b4507aa932e0c037f18a538f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/file_watcher.rs:635-645 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1380-1390 \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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a4efe6965a84ed32a46cce2834e354e832665f73d0d2ceec6cd9add73dd6d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1705-1715 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1806-1816 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1705\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a761c6f2c615dca74cd221f7adb41414d90281ce3d5f175bbabbf69994b4b45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:325-335 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:390-399 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs\u0060 and \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs:325\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":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ec14fa438d42142546194f97065313bd5e302dbbce84ce64afa8545cf59316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:676-686 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:688-698 \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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"2741d6e588d3de09df3c675b9538c83e1fbc1a78e7151782babcfe4d06e4431f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1166-1176 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1181-1191 \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 \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1166\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d12a84a545c67fe886740ce1a845525a6837060bd8c9dc1da8e756088f0025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1214-1225 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:249-261 \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 \u0060rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1214\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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c27a450326f64350b02cba895a09b066e8eddf43b426d53bfcf97ac8e1d8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1449-1458 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1495-1505 \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 \u0060rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:1449\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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8c9ef687d9cd3fbea48f7b7db6739aa7a3019f8d5774bbd7552658395b68ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_services_inference/src/check_service.rs:537-547 | rust_port/crates/flow_services_inference/src/check_service.rs:549-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_inference/src/check_service.rs:537\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":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a002d8f9a0e178968825bd7496c42bd67763bfd7e6260e57bb48ecb3ff27d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_services_references/src/rename_mapper.rs:303-313 | rust_port/crates/flow_services_references/src/rename_mapper.rs:324-334 \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 \u0060rust_port/crates/flow_services_references/src/rename_mapper.rs:303\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":"rust_port/crates/flow_services_references/src/rename_mapper.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14846f4b4710e59b950db05f97425722b71cc1a5cc97e070f96a0c509d87915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:1547-1557 | rust_port/crates/flow_type_sig/src/type_sig.rs:1560-1570 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc0d553f115ba168f4272a0c6402fa065b9f82bca24b88b79aa7988ffe4116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:300-310 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:319-329 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ab73d4f8c07a68117c293ee4e882635cdc90865b5a834b482f502fbb1d6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:873-883 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:886-897 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:886\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5774e8b8ad86b091ea7d5f5751f9d4baaafc2ba10dd2d4329fa495f66aa2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5756-5766 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5875-5885 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1794e81186e87c3ff18d7719f047c5e42388ca969105c16207da58053fc86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9299-9309 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9327-9337 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9299\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeb64bacb1aca7bee034eae9baeb2deea9b221c43123ef36e135e6b734b3394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12425-12435 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12455-12465 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12425\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":12425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61abf6caaaabdb6089f79939cc06c4cb0ac77f7c108b4b9483d1ab200c68b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15189-15199 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15216-15226 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15189\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":15189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ceed43e58fc5732d0d4f31cb8f11e40e9f01648325b4aca6d9e0c356591a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing/src/merge.rs:1164-1174 | rust_port/crates/flow_typing/src/merge.rs:1176-1186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc831703abf444f1a06896ebe2a6c10c707795631214f10336d75b8f421794d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/flow_error.rs:189-199 | rust_port/crates/flow_typing_errors/src/flow_error.rs:382-392 \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 \u0060rust_port/crates/flow_typing_errors/src/flow_error.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/flow_error.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1f6d4b161ab6a0cadcd50e5f6db41f70456c8b986e1ff6518fc8326f67f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5028-5038 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5094-5104 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5028\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":5028}}}],"partialFingerprints":{"codehealthFindingId/v1":"afab4c16c5d20eedd0a81aad4e640e53a21b80233e30a56b9dfc7ac96f1bafd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5554-5565 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5762-5773 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0affe773f970c9b87387af807d37a2e78827e70336971bafd26045849699ad89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5619-5629 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5638-5648 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5619\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ea6808af5241bf72dcd6b7a8b5e9f7092b606047f778e179143bda5db3d928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8113-8123 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8127-8137 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8113}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1a3aa42b2ea579b92aa771d08c96535ca9742e37b66bd187431a2a6920de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1179-1189 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1584-1593 \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 \u0060rust_port/crates/flow_typing_flow_common/src/type_subst.rs:1179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56589614acdcbb7d1b33a8934230b98774fc2c9a814e3fee0ede6356611b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2740-2750 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2837-2842 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2740\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e0b5d0e1f13c090399acfaaa855e572ec3688f3771c852873b7b81d86d811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3684-3694 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:10170-10180 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3684\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"968e619295eaeb62d6707985be51d884b01afb08d4e49db010d7bc087c05709c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4426-4436 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4439-4449 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4426\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d0ccdb252b53b90fb30d92b2f54a0bb6c526ffd4b7dd18dfcc428f3fffeee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5250-5260 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5380-5390 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5250\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d879aae7f94b4527a5a1584cca04cc8b32d54a8858745bad5053fe9a6b9b831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:359-369 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1516-1526 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:359\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5d670d1b595dfc09045183695454cb40ba6a2e5bdb613e48029ac32a594667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:312-322 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:389-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:312\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"91aa02d9961d86212584ce1c011d3dccce35939781df3ac419ae3e29e5440b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:378-388 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:411-421 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:378\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"47200da3ee259cad2327f1fffb99a14832d77094cf5137d8f8bb733f782d0f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:336-346 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:371-381 \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 \u0060rust_port/crates/flow_typing_flow_js/src/object_kit.rs:336\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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb278c65c2b7a7df92bade4bf1a41cef81a6e0ea89fcc3e2301fa850944a1ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/react_kit.rs:420-432 | rust_port/crates/flow_typing_flow_js/src/react_kit.rs:851-863 \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 \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:420\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:418\u0060 calls \u0060Ok\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:848\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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"31676635285be453eac44e64b63610b448b6ab9b4b422f3254a4bb3591649f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1624-1634 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1741-1751 \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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a882a37449641971f748ff1e059873cc99fd6d83b46e67249db9b4eaba924d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2694-2704 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2717-2727 \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 \u0060rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2694\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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61520baed274d862913c7e5096b2d33ee4005e9d7e416019697e47e8be8982c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2845-2855 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2903-2913 \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 \u0060rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:2845\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2845}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c763f0bb95fe045ab16c10af120d20c3e463491022984324eafde222fe81b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1111-1121 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1162-1172 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a1eff0375ad20f6e2b179a902246049abaa6b4ac6581f99d7d220d9d216aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1779-1789 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2340-2351 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1779\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fe17a68fa3a895ca73eaf989e238223d4249a597b90f6011d0214f4b1adf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5256-5266 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6265-6275 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5256\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb561a1869dcf857d5d3bb2c41a74143c269566d7937e84ed00bb237178cd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1360-1370 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2682-2691 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1360\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3200891620156326a252c90d22a2b378c4072331a6d706ee60f542a93575c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3840-3850 | rust_port/crates/flow_typing_statement/src/statement.rs:4066-4076 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3840\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00316a8142f78f1370dbcf7d7a5ae1b1392f0de5eecb0d603464bc8c65a80d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4663-4673 | rust_port/crates/flow_typing_statement/src/statement.rs:4725-4735 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4663\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4663}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399a89fb1fd1d29a8bcb81e04d1bd96c39353810f16366e88168c5542cfd4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7986-7996 | rust_port/crates/flow_typing_statement/src/statement.rs:8071-8081 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7986\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7986}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f90ea23db220cc4cc79b039738026ef5096ea90155b946b2f26a3ca0d965f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9992-10002 | rust_port/crates/flow_typing_statement/src/statement.rs:10592-10602 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9992\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9992}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe13d5872c0d45725836778d6910a88a9e35a40bdfeec44250ea5f0d303a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:11121-11131 | rust_port/crates/flow_typing_statement/src/statement.rs:11182-11192 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dc79b5925a6c65981ae94f48c5418f93e856b6289685e984dce1ae23438104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:11229-11239 | rust_port/crates/flow_typing_statement/src/statement.rs:12616-12626 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11229\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd35982ab0ec4bbdcb6441ce5532b5251d6f3fcccf7d7395d41e323afc73fc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:12094-12105 | rust_port/crates/flow_typing_statement/src/statement.rs:12109-12119 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12094}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e05b193ab73db233032289c8a97d05cc69b64dfd11d93b7c0f3e2ae82ca4431"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:12261-12271 | rust_port/crates/flow_typing_statement/src/statement.rs:12378-12388 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649941e3158e91d391e2c7b27f70eac2cc5948fe979841efa89466b2093e0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:15532-15542 | rust_port/crates/flow_typing_statement/src/statement.rs:15731-15741 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15532}}}],"partialFingerprints":{"codehealthFindingId/v1":"602c8dd35c041af122cea1ea17a432ba736c847da5160f2765f4fe3892153b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18140-18150 | rust_port/crates/flow_typing_statement/src/statement.rs:18193-18203 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18140\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c46685692fff2440ff1422162b889a52dbc03fb548d6aa762a45f602e6d7058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18792-18803 | rust_port/crates/flow_typing_statement/src/statement.rs:19714-19725 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18792\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18792}}}],"partialFingerprints":{"codehealthFindingId/v1":"922e31e4cfdf74cdead5d9fbf0e8a9ec9f8026d49112e4c4fbb856501cdc3114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19958-19968 | rust_port/crates/flow_typing_statement/src/statement.rs:20439-20449 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19958\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19958}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdb22dc04933ac8163998a74b2c8db2dfea38728628c5ebc32abb274caca713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:9077-9087 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9235-9245 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:9077\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":9077}}}],"partialFingerprints":{"codehealthFindingId/v1":"5993782e0bb2bde3be0af84faa493214d3d65a4b49798f5816202063c6ce0ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:2918-2928 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:2952-2962 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:2918\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:2936\u0060 calls \u0060string_of_ctor\u0060, \u0060Err\u0060, \u0060terr\u0060 and \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:2963\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31301a4821291899a51cf7dd6e2097a6c26d1c200f80273786a5edd7de6027e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:7777-7787 | rust_port/crates/flow_typing_type/src/type_.rs:7811-7821 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:7777\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7777}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8113ef1f21fdbc1a571acc19ecf19778e750d96d60b8eaef893ff23ac8f1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_util.rs:845-855 | rust_port/crates/flow_typing_type/src/type_util.rs:867-877 \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 \u0060rust_port/crates/flow_typing_type/src/type_util.rs:845\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2962d180ee88c287ee09b93429025342150bc599d3303f9df7cc5aa5d15a19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/convert_types.rs:1078-1088 | rust_port/crates/flow_typing_utils/src/convert_types.rs:1364-1374 \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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"89df46dcadb0045c9c7dcc700be9408a46d562f249524a09efdb0c3d6500915b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1131-1141 | rust_port/crates/flow_typing_utils/src/type_env.rs:1159-1171 \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 \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:1131\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89a0dab681715c4e90b3c4da36630ae865cfa73c52a1ecd023fb4e7d5936f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:599-608 | rust_port/crates/flow_typing_utils/src/type_filter.rs:754-764 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:599\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1039621252dd74bb4aa7b8d59118e1d06e93fc91e72a4609b56c5413cdcf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:613-623 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:924-934 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:613\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b00a5dfeebfe5784ddb7fc58a82632f86d179d02a862b1e61bcf08bed63da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1590-1600 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1630-1640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1590\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fec4dbdf65d07e027535c800520990cde01963e28bfdca7bf80ffd311fdb563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6759-6771 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6773-6788 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6759\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":6759}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaa745830c621b6b1c61e9d33a2f382e4a6f0a2b9ac2dcf601be60d4d7caa9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:612-622 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1186-1196 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs:612\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd680078b95a7fc2831a023744139a28d70faf99e348f703a0b031ea8d3ee28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 7): rust_port/crates/flow_typing_statement/src/component_params.rs:195-204 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:1367-1375 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:1588-1597 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:1749-1758 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:1865-1874 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8665-8674 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8683-8692 \u2014 there are 7 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/component_params.rs:195\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":"rust_port/crates/flow_typing_statement/src/component_params.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad381e4a7719e8d592d608d82f7dee497bf489dad5ebc3489a5255dee1d346d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7869-7878 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:7958-7969 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8229-8238 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8323-8332 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8415-8424 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8492-8501 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7869\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7869}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac726207487720760d2689093913f9a91a1bb34b1e08e718a950ae2b798aca1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3078-3087 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3115-3124 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3162-3171 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3223-3232 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6193-6202 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3125\u0060 calls \u0060as_ref\u0060, \u0060variance\u0060, \u0060transpose\u0060 and \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3088\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3078}}}],"partialFingerprints":{"codehealthFindingId/v1":"56612a10a43b2e424d83f363738d6f42f7c7d1df98396ef3a023a5715a88c43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): rust_port/crates/flow_typing_debug/src/lib.rs:2164-2173 | rust_port/crates/flow_typing_debug/src/lib.rs:2181-2190 | rust_port/crates/flow_typing_debug/src/lib.rs:2198-2207 | rust_port/crates/flow_typing_debug/src/lib.rs:2215-2224 | rust_port/crates/flow_typing_debug/src/lib.rs:4193-4202 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_debug/src/lib.rs:2164\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa985cae7c24df9df4efff5d374ea67e0263c5ee7430e84ce6ba9d505e82852e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): rust_port/crates/flow_typing_statement/src/type_annotation.rs:1464-1473 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4087-4096 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4108-4117 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4245-4254 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4266-4275 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:1464\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:1463\u0060 calls \u0060mk_eval_id\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4107\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cf615c70a67b97a498eb6d4b836951afa9286b01253a0d32bfd6636546e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): rust_port/crates/flow_typing_utils/src/type_filter.rs:798-807 | rust_port/crates/flow_typing_utils/src/type_filter.rs:884-893 | rust_port/crates/flow_typing_utils/src/type_filter.rs:943-952 | rust_port/crates/flow_typing_utils/src/type_filter.rs:989-998 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1041-1050 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:798\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9279ed2e25ed2d6c116448bc439042db5d841ca02cdfd61f502ec337966a16ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): rust_port/crates/flow_cli/src/autocomplete_command.rs:165-172 | rust_port/crates/flow_cli/src/batch_coverage_command.rs:160-169 | rust_port/crates/flow_cli/src/coverage_command.rs:380-387 | rust_port/crates/flow_cli/src/find_module_command.rs:48-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/batch_coverage_command.rs:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autocomplete_command.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e447842a007a92fa4d0afe0ef0d75e40afb31bf8c736a524506283edc655bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2765-2774 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2783-2792 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2804-2813 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2847-2856 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2765\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28d8d31d27da0124f29a8a3988e1958a77550f31fa0866c480ef0b93afb614c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rust_port/crates/flow_parser/src/flow_lexer.rs:1101-1110 | rust_port/crates/flow_parser/src/flow_lexer.rs:1948-1957 | rust_port/crates/flow_parser/src/flow_lexer.rs:2499-2508 | rust_port/crates/flow_parser/src/flow_lexer.rs:2691-2700 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11528a1ba03320ed3ef91035ddabc65ad2b6a0e32c65aa54ca65b6901702df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:238-247 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:385-393 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:660-668 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:673-681 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060collector\u0060 to \u0060\u0026mut FunctionMethodCollector\u003C\u0027_\u003E\u0060 in one and \u0060\u0026mut ClassCollector\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b58ad9758ef407d4c14b93893dd7b47f49ddee3f67c02f3e4697b9af8621465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:1698-1707 | rust_port/crates/flow_typing_statement/src/statement.rs:1718-1727 | rust_port/crates/flow_typing_statement/src/statement.rs:2179-2188 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:735-743 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:1698\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d632e32126766ede9ae39730b374a524900d3ab3a7c8a15857cf79845d282c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:4221-4229 | rust_port/crates/flow_typing_statement/src/statement.rs:5980-5987 | rust_port/crates/flow_typing_statement/src/statement.rs:12800-12809 | rust_port/crates/flow_typing_statement/src/statement.rs:21092-21099 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4221}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bb1e9b3ff50e71d2942ffe10bc1287ab6d50e4d11f3ace7c0d57b204618f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:17472-17481 | rust_port/crates/flow_typing_statement/src/statement.rs:17638-17647 | rust_port/crates/flow_typing_statement/src/statement.rs:17699-17707 | rust_port/crates/flow_typing_statement/src/statement.rs:17842-17851 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17472\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17472}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd38c4dbeff18b9539dd1ff0b7b6b75501f498aa512110ea73077885b80bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_cli/src/apply_code_action_command.rs:89-98 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:196-205 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:295-304 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:293\u0060 calls \u0060get\u0060, \u0060truthy\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:88\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":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f676d272bf4b998f99381fda57b0e34ffe88be74b54fcb74154f7a8bfd48414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_cli/src/coverage_command.rs:418-427 | rust_port/crates/flow_cli/src/dump_types_command.rs:218-227 | rust_port/crates/flow_cli/src/get_def_command.rs:84-93 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/coverage_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/coverage_command.rs:418\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:215\u0060 calls \u0060content_of_file_input\u0060, \u0060ok\u0060 and \u0060rust_port/crates/flow_cli/src/coverage_command.rs:415\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":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d865553caba46a9270ebd9be5ef29418971c793b75c0b305e9bdcb6193f40c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_codemods/src/annotate_exports.rs:322-331 | rust_port/crates/flow_codemods/src/annotate_exports.rs:634-643 | rust_port/crates/flow_codemods/src/annotate_exports.rs:672-681 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:322\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8e2b02d91ee5226f98922052573151f75251dc87875b6e7e693a864a6a53f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:2052-2061 | rust_port/crates/flow_env_builder/src/name_def.rs:2308-2317 | rust_port/crates/flow_env_builder/src/name_def.rs:2417-2426 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9f4dc258cd2ed5dbc05669bc8e1311b895a649e45953387f2dc209a387f32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_parser/src/type_parser.rs:2847-2856 | rust_port/crates/flow_parser/src/type_parser.rs:3185-3194 | rust_port/crates/flow_parser/src/type_parser.rs:3226-3235 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/type_parser.rs:2847\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dd220740cb9e87c6675f866524401c561210dc183c2f474734b41d17b84f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5047-5056 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5063-5072 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5207-5216 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5047\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5c5f3cf85613ff55b3d4add101c6fe80acc1a4f319c3077e9546d03b282b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5348-5357 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5431-5440 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5549-5558 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5348\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fba67274fdd4fc18cf3c6ac4953cdf05961e7257d7652a1fb5b9d5c371c5ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1550-1559 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1579-1588 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1608-1617 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1550\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bdb7fe48548dd813c2b3de913403c529cdaff91592cf31594dd0217bbd72d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1729-1738 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1757-1765 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1830-1838 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1729\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1756\u0060 calls \u0060HooklikeT\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1829\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"add13f289c19b957b8ac1ceb30c1f114a08d488d4037132ef94e84de0caadac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:895-904 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:939-948 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:994-1003 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:895\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd952ba6f31927a279df1ea2baec3f847423e5b3baef5bcb65616229a55636e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:610-619 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:758-766 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:874-882 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:610\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a4bcf0be93ad7827c2d5cffbe7093712e9daebfb90ed744e6266ef7a0d896e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:196-205 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6595-6603 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6662-6670 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:196\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18a825e381faf4ea29d805e84c2e4e984f62c83609c736ab5dd31d66174d545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:215-224 | rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:308-317 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:239-248 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs\u0060 and \u0060rust_port/crates/flow_typing_statement/src/func_stmt_config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:225\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:318\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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d8e8447ce4984f117140f00a90f2f5a99517300328d28134c13363b0bcdff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:10984-10993 | rust_port/crates/flow_typing_statement/src/statement.rs:11045-11054 | rust_port/crates/flow_typing_statement/src/statement.rs:11152-11161 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10984}}}],"partialFingerprints":{"codehealthFindingId/v1":"af156b346c85c6abc3be99d94c631fc53263c6c812e8561010e196e21a2ade89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_cli/src/config_command.rs:33-42 | rust_port/crates/flow_cli/src/config_command.rs:124-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/config_command.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/config_command.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae20d60afe3a69765c3cd5c8883fd2e456d3b0b6f490d660a741b7e50456c8ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:627-636 | rust_port/crates/flow_cli/src/glean_runner.rs:642-651 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:627\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae249ad7be0eba628f25fcc626e15af09e358f351b87a65da80a167efdc9e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1038-1046 | rust_port/crates/flow_cli/src/glean_runner.rs:1206-1215 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1038\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c4f45c45de33b6d3e56214d9bd12509c5db9a1a80798f8ad2eb25830bb6a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_cli/src/server_command.rs:172-181 | rust_port/crates/flow_cli/src/start_command.rs:239-248 \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 \u0060rust_port/crates/flow_cli/src/server_command.rs:172\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":"rust_port/crates/flow_cli/src/server_command.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d61ebfbeacd2d9ecbe162b8978f9dd4863af5b8271681315f2b2818f5d1b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:419-427 | rust_port/crates/flow_common/src/files.rs:434-443 \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 \u0060rust_port/crates/flow_common/src/files.rs:419\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9dcb7b44bce0bdbfed86d0921aa637125bae84edf35805318d39edd72117af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_common_vcs/src/git.rs:19-28 | rust_port/crates/flow_common_vcs/src/hg.rs:27-36 \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 \u0060rust_port/crates/flow_common_vcs/src/git.rs:19\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":"rust_port/crates/flow_common_vcs/src/git.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f19f1f62a5e5b031c05cae44397e59fb11330415c374b8b2037a0d88ae9645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_config/src/flowconfig.rs:1510-1519 | rust_port/crates/flow_config/src/flowconfig.rs:1538-1547 \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":"rust_port/crates/flow_config/src/flowconfig.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d9aebe67a16915dd9d09d48a9c118273342c0d269cc301d27910f5f78df8be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2919-2928 | rust_port/crates/flow_parser/src/ast_visitor.rs:7416-7425 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a64df6bf91cb90ab6f47b78cc3ae962c3949d75984916af53474af08f2daeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5488-5496 | rust_port/crates/flow_env_builder/src/name_def.rs:5576-5585 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5488\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5488}}}],"partialFingerprints":{"codehealthFindingId/v1":"403707449c09db8eb15d27e95b0cdd6b52e72db8e5e5db7863c734e3c41ba9b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:601-610 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:614-623 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:601\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d31919194caac0f3ae88297b100963d001e21ec5fcc2c9741b7d8f9038470c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8178-8187 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11476-11484 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8178\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060loc\u0060 to \u0060ALoc\u0060 in one and \u0060\u0026ALoc\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dcac8ce9fe8d7eecd871a8d0223f9dabb97e172aa765a35792866379eabca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 3): rust_port/crates/flow_parser/src/ast_visitor.rs:14097-14104 | rust_port/crates/flow_parser/src/ast_visitor.rs:14129-14143 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5114-5128 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:14097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":14097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b1bea5900e9e6a58c98ab10ac430acd6301fdf83ca3e194f7bacefd06816f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:16708-16717 | rust_port/crates/flow_parser/src/ast_visitor.rs:16726-16735 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:16708\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16708}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7bd75be9b121cfcc81640baf22df5e8eb06fb8e6a9929c6eb1297bde4b020f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:17952-17961 | rust_port/crates/flow_parser/src/ast_visitor.rs:18267-18276 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:17952\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:18278\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:17963\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6347ea26cf4c3851c17a00e684e5cdb31eb46b5045b04911e30baee0e630287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/comment_attachment.rs:401-410 | rust_port/crates/flow_parser/src/comment_attachment.rs:617-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060t\u0060 to \u0060\u0026\u0027ast ast::types::Intersection\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026\u0027ast ast::types::Union\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb156c42731a88ad8e25f5ebb2cc0290df4ec5ef0d1c2e91d765999b8897f3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_port/crates/flow_parser/src/object_parser.rs:2093-2102 | rust_port/crates/flow_parser/src/object_parser.rs:2109-2118 | rust_port/crates/flow_parser/src/object_parser.rs:2119-2127 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/object_parser.rs:2093\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d21aae3d3f116f5e9bf8a2710e9bf373278c5baded276c85b84dbc23b250f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2994-3003 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3036-3045 \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, \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3004\u0060 calls \u0060try_map_vec\u0060, \u0060class_decorator\u0060 and \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3046\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"317ab5315afa85342f1894a5763357ee14c9dec210e28ed23c003b90edab4efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:3553-3562 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:4042-4051 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8972789964e4775638d9856ef7ad525b47dced4914d9e742c02e51be08e61ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:1258-1267 | rust_port/crates/flow_parser/src/statement_parser.rs:1293-1302 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"de54c8a7f1327cfb1b8149b7b6a8b2124c887c3cc9072f36cf5862d019d08afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:810-819 | rust_port/crates/flow_parser/src/type_parser.rs:823-832 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:810\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"072e9145a50030eda48fa07fafab4180cce67948cc2979814712712c0c566fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:2108-2117 | rust_port/crates/flow_parser/src/type_parser.rs:2137-2146 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca40755a2ff2314ac52a3c9027a302ec568fd0e92d50e2311722b6a1e1cb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:4351-4360 | rust_port/crates/flow_parser/src/type_parser.rs:4445-4454 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9bfb413ab5ee41b7135fc468a1ba3c24ef12f1b87e2f0d595153836244ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/enum_validate.rs:533-542 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:605-614 \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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7bbf1b5526c65f2949756948e394d603fa5014fdb57b0c69ce31ce35186677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6051-6061 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6123-6132 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:6051\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060m2\u0060 to \u0060\u0026expression::MatchExpression\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::statement::MatchStatement\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"841b5a505d57680f709463390b68b6a64a9eb44327661486b537fc2346d38131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5379-5388 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7007-7016 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5379\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"081067a553fc12f643806dcffff7038ab8b45357c95b63218b27ce3c77363ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5806-5815 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7244-7253 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5806\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf83588d9d397caf556cbbe4934beeb138c36b3ce60c0041529dafed3bde18d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:78-87 | rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:108-117 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs:78\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/enum_lowering.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2fddbeed4e892e292ef880a3bfcbef11d0e488f214369cc38d09b49645b27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:813-822 | rust_port/crates/flow_parser_wasm/src/serializer.rs:831-840 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:813\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9f022c87e3831739f0716480c32d54a81a9a4ebca05245c62d05f0cf3b1be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2152-2161 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2204-2213 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e00cf49d5556ce254857ff1b869cc436fdf12f511437c4799ebb364f4c515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_profiling/src/profiling_js.rs:1060-1069 | rust_port/crates/flow_profiling/src/profiling_js.rs:1155-1164 \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":"rust_port/crates/flow_profiling/src/profiling_js.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"607c729f60d155f29f52858fc260fb68ed0af46dd8071be3ba26217f4707853d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:4642-4651 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:8079-8087 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4642\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4642}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0da24423a45df2fd4778579686e147429ddec9728f5d2609cb4ff152862b6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:5125-5134 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:5144-5153 \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, \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:5135\u0060 calls \u0060extend\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:5154\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":5125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ab1161af089d2199b682c1989058d6f1b1cf3ef5de08f6cd086971e7c8f0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:424-433 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:437-446 \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 \u0060rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:424\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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb216737bde6c75eda9ccf25f12c3d35f3750a63bca15ac27f49e59b3309482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:476-485 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:886-895 \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 \u0060rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs: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":"rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"598db9c9ab0cd9059eee8b218b13d322522f04199f9d0f6ec20a08c6e575c5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:212-221 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:2414-2421 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:212\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f67b6cdbbd033dca27f33f2737fd8ad3a283d8bf56e25165fb1f40a5ab4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:2976-2984 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:3317-3326 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:2976\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":2976}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a13d3dd98bd878d363e4adbb25229355883b268b797346440530cac280f368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:143-152 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:165-174 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:186-194 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:143\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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 before the matched lines, \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:143\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:186\u0060 does not \u2014 after which the two agree again for 5 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":"rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9487bdc4c28d503bb9a91670450fbde65be004f33e48d6580a1ec896c91bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:759-768 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:778-787 \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 \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:759\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0671eedb2208ee6ed20fc8fa5f3e13a98731abf263f15e2234ebee7fd932ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:883-892 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:940-949 \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 \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:883\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"9074e674d55c2c323f994f6a12ade0c8aef03d1ff4f338f699b8c44095119325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:723-732 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:737-746 \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":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1cd698209b28e45cb16836e5db8824fd79c6fb5fda4bb4e67791af62dce50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:390-399 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:401-410 \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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d9368c0d68159dd7685d34ce14cdf8fa1e6c2e2f486eb81a17e61625e613a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:241-250 | rust_port/crates/flow_services_inference/src/merge_service.rs:324-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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f25b26a75399e8783fc3f737ff1dfa4fe1390f444883dc33df00953c7da775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:344-353 | rust_port/crates/flow_services_inference/src/merge_service.rs:364-373 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:344\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e6e4da98f2b19b34d70677a5b3ca87cb8d7621b1db22c2b8464eac93c506d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:1035-1044 | rust_port/crates/flow_services_inference/src/merge_service.rs:1132-1141 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:1035\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc9c4d45d56dad2c418981fd7d7aa454187251d3247837b542b6b5ade7156e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:1084-1093 | rust_port/crates/flow_type_sig/src/type_sig.rs:1191-1200 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"319fc27010d2fa62922923a502b2e153449829b91b2704a720ce26434ea67c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3984-3993 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4034-4043 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3984\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3984}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01c0feccf776fce8466dc4bf88b7183d4898acf3e67e6101879539abee9d7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5768-5777 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5887-5895 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5768\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5768}}}],"partialFingerprints":{"codehealthFindingId/v1":"816f4fe131d8f58c99941084b3b3135c04bdb9fdbd8cbd2e4a2a428091228e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6576-6585 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6763-6772 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:6576\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":6576}}}],"partialFingerprints":{"codehealthFindingId/v1":"79843df890a0dd61aafc4c7b126601b027506bf99e9a68827cdeb41541a47105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11012-11021 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11023-11032 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11012\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11012}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a67aaf58b9297610ab0acf50bed2b5863ddd084b00a7b6825cb615a39fc827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_utils.rs:186-195 | rust_port/crates/flow_type_sig/src/type_sig_utils.rs:373-382 \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":"rust_port/crates/flow_type_sig/src/type_sig_utils.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0a9f69fe308a8692cf242a61906768d9747385d507ef073eded9d240368f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:1429-1438 | rust_port/crates/flow_typing/src/env_resolution.rs:1600-1609 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cd42609d5bf7f1f68ab544beb5514cd2004d898e0c6a05b5c5ea180bda406b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing/src/ty_normalizer_flow.rs:319-328 | rust_port/crates/flow_typing_ty_normalizer/src/no_flow.rs:170-179 \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":"rust_port/crates/flow_typing/src/ty_normalizer_flow.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1369d997d04e7fdb43a9b1608d1fd69dd4819ff1efa1e27366747aec1b44569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1257-1266 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1277-1286 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:1257\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385c73538c958f5e380bc17eb4e152feb60d1d1a6c93988af6e225db96455aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5568-5577 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5775-5784 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5568}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e90f721060ca41fa8de711de4718d2ccbbfda4b672fa79bd295f8589fd783a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs:334-343 | rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs:379-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs:334\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":"rust_port/crates/flow_typing_flow_common/src/string_case_transform.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e55b792b124db026e59b3fe0d36401311c19b3e3764070e388e955e2fc9bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/type_subst.rs:916-925 | rust_port/crates/flow_typing_flow_js/src/natural_inference.rs:667-676 \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 \u0060rust_port/crates/flow_typing_flow_common/src/type_subst.rs:916\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":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99bd01e350bdb10b5dad2c1feed6d9ba07da9a34fc59fd94ad3c859d33fc11c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:373-382 | rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:563-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:373\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"461b4d00b54d0954cfed4dcc077ab88e9601da56f01b3a8b516e831b9229b767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1808-1817 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1849-1858 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1808\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917f1f2a411e6e5b1cf1c1c7990daec3b9557659fa2d7dbea3e539b6851d2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:675-683 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:686-695 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:675\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b447f78dc6ff73640c5a0de2cc4829fb620db9d7dbf8fb35d9333029fac5b865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4866-4874 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:5440-5449 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b80d173e2ebbced274f285210d71c5e953e645b162ba5a5a5d5be1c8268fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1087-1096 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1120-1129 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1087\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f33fdb9b377ec3592b318d5e7755e2aa3d6fc4d95d22a5277950b8bff8cc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6178-6187 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6201-6207 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6178\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6178}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca81bcf5cab2ac18c285e11fa2877d6f23c63e666bb207b2452087979c4a77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:873-882 | rust_port/crates/flow_typing_utils/src/type_env.rs:973-982 \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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d9514fa51bede496741ce29909e33c0947a5c0cb8f318774b279060fd5d36a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:489-498 | rust_port/crates/flow_typing_statement/src/class_sig.rs:542-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:489\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b263dc0a12ec34357db56d5f3a1bd77a79e345b33c4631314d9d90ab23fdaf76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1327-1333 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2654-2663 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1327\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b33d8ca3f5e22e883df3fc4824dda4ab69d97232445ccc16f6e5c3007d9cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1609-1617 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1619-1628 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1609\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc409ea815b0587d7a4e74e5961f50de3f17c269b9f7ec79dddd83ba0942e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1881-1890 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2165-2174 \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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bcba5b85c6d0c7b7b71a05313a073ed2ab7f5269cd856807816d6233eb9e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:2740-2749 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2762-2771 \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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0199c266f41a45624c27b70e9ba40a96781e9c2f48d0501253dd16a58d513b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:2546-2555 | rust_port/crates/flow_typing_statement/src/statement.rs:3929-3939 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:2546\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2546}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d9026bbf19024c959b96fe02d61974ce28d89ea1a76bab167ce8af88304de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:8312-8321 | rust_port/crates/flow_typing_statement/src/statement.rs:8327-8336 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:8312\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3990d1f8904b02c18edd5ea15f1d462195d37fde95da0f1e416986b24267b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:8372-8385 | rust_port/crates/flow_typing_statement/src/statement.rs:8922-8935 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8372}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bebc4a28ef3ff654f5d8dd20dd6512691e9cd2ab374f606bd274f8440ba59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9079-9088 | rust_port/crates/flow_typing_statement/src/statement.rs:9182-9191 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9079\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9079}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eebb8345249f91b1e5fd9d713055687332f846872dd41f6e5c9540f4b7e5b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:13778-13787 | rust_port/crates/flow_typing_statement/src/statement.rs:13931-13940 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13778}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd546a3b851afe377cafdfe6033b50cdf9cd9cedda313e38a020b63e5d95e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14953-14962 | rust_port/crates/flow_typing_statement/src/statement.rs:15025-15035 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14953\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14953}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78e0ba2e3dd3a168b1d84411c603546c2541ba0439a91b5fb3a18fa45e0e3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2297-2306 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2944-2952 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2297\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3959b9a99ca2b6fc66c7cc072fbb10b814f23f166026e8a6f0b4707c48e312f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2854-2863 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2888-2897 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2854\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f3971d17fa6926f5ee7f916788f74c156544a8cad8435ef27a441d1c84ae28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4185-4194 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:4226-4235 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4185\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2771c15f56dcf24c67bc51dab3a119157c9f2c7d2a5256935d4f92850c33f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4986-4995 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5067-5076 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4986\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde090412ad1a0776bddb71512bd56f59962b826366f2d00c111d10a009f7fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:7918-7927 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8288-8297 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7918\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:8298\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:7928\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":7918}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1c5291d9e9081ad328d30f09e488fa1e26a92adbf10de351c1ceae4d343b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:4814-4823 | rust_port/crates/flow_typing_type/src/type_.rs:5053-5062 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:4814\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4814}}}],"partialFingerprints":{"codehealthFindingId/v1":"07803d1b7abc7856d947e05979e5d0723f318bf4e5963e817d1f4e8399f199fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:845-854 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1977-1986 \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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0003b0afa6f328cd438cbdce28370dbc18ee6fec2e1ca7154418848ac736e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/convert_types.rs:528-537 | rust_port/crates/flow_typing_utils/src/convert_types.rs:741-750 \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 \u0060rust_port/crates/flow_typing_utils/src/convert_types.rs:528\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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"51485177ee17de5e70aefec13bea8ce2402beccd377737c087084fac5934d758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3099-3108 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3116-3123 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3099\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee7a75195980d69016c9770c9ff7699b963829e59eab525698c0f94455c47b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:148-157 | rust_port/crates/flow_typing_utils/src/type_env.rs:183-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:148\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d247fe3ac46e22feb661d56d724e60efcba7454ef88f96a6f22c0ab9722fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:590-599 | rust_port/crates/flow_typing_utils/src/type_env.rs:644-653 \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 \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:590\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf611bba678afcfa9d41e4c28766db5bba77e88e4f371038974ee923dc8e3c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:431-440 | rust_port/crates/flow_typing_utils/src/type_filter.rs:443-452 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:431\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c70c0a54975b5e9184a1c962a5db6aec48c7a67875a0c33d54c086b410aef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:834-843 | rust_port/crates/flow_typing_visitors/src/type_visitor.rs:418-427 \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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9684fe31e35c8f464b5732a42597dbc84255b34246d01a66b8b890d55b998a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1847-1856 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1897-1906 \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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5444ab10024647168e6eb4a6a05c7de1acc7bdb2e098338c496aed1b434cdb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_watchman/src/lib.rs:1010-1019 | rust_port/crates/flow_watchman/src/lib.rs:1401-1410 \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 \u0060rust_port/crates/flow_watchman/src/lib.rs:1010\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":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9d14db80f3333a2285272c917248c842e183fe33374cdab4b774a7823eb9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 15): rust_port/crates/flow_typing_statement/src/statement.rs:17275-17283 | rust_port/crates/flow_typing_statement/src/statement.rs:17471-17479 | rust_port/crates/flow_typing_statement/src/statement.rs:17604-17612 | rust_port/crates/flow_typing_statement/src/statement.rs:17637-17645 | rust_port/crates/flow_typing_statement/src/statement.rs:17698-17706 | rust_port/crates/flow_typing_statement/src/statement.rs:17841-17849 | rust_port/crates/flow_typing_statement/src/statement.rs:17963-17971 | rust_port/crates/flow_typing_statement/src/statement.rs:18352-18360 | rust_port/crates/flow_typing_statement/src/statement.rs:18372-18380 | rust_port/crates/flow_typing_statement/src/statement.rs:18391-18399 | rust_port/crates/flow_typing_statement/src/statement.rs:18419-18427 | rust_port/crates/flow_typing_statement/src/statement.rs:18567-18575 | rust_port/crates/flow_typing_statement/src/statement.rs:18592-18600 | rust_port/crates/flow_typing_statement/src/statement.rs:18744-18752 | rust_port/crates/flow_typing_statement/src/statement.rs:18762-18770 \u2014 all 15 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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17275\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adbb4318a8436e62532c8e826f9bb06a4c7aa70f0831e4b45186479b2bf9ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 12): rust_port/crates/flow_cli/src/agent_helper_command.rs:252-260 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:92-99 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:199-206 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:298-305 | rust_port/crates/flow_cli/src/autofix_command.rs:175-183 | rust_port/crates/flow_cli/src/autofix_command.rs:347-354 | rust_port/crates/flow_cli/src/autofix_command.rs:516-523 | rust_port/crates/flow_cli/src/dump_types_command.rs:156-164 | rust_port/crates/flow_cli/src/get_def_command.rs:70-77 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:99-107 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:257-265 | rust_port/crates/flow_cli/src/type_of_name_command.rs:166-174 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note 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, \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:99\u0060 calls \u0060unwrap\u0060, \u0060get\u0060, \u0060truthy\u0060 and \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs:260\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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"64472da466fe1505b1549acdfe72186be47bf421c2e2d1dec57edc79bbc77d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): rust_port/crates/flow_typing_utils/src/type_filter.rs:713-721 | rust_port/crates/flow_typing_utils/src/type_filter.rs:888-896 | rust_port/crates/flow_typing_utils/src/type_filter.rs:947-955 | rust_port/crates/flow_typing_utils/src/type_filter.rs:993-1001 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1045-1053 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1550-1558 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1601-1609 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1657-1665 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:713\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1655\u0060 calls \u0060ArrT\u0060, \u0060unchanged_result\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:886\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"91833172c9d91702e8f8b2e5c4973f4aabb0aee3e1517aaf346d81a989002a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2172-2183 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2283-2292 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2697-2705 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3360-3369 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3979-3987 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4624-4632 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5031-5040 \u2014 all 7 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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a124c29a598d3dde10782fdff81220f62b99999ab158680dda82d964aa708668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2283-2291 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3360-3368 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3979-3987 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:4624-4632 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5031-5039 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5042-5050 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2283\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2352fdcd71eb44174ded863e104b06197bd8ffb9978a0773cc3990032da343b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): rust_port/crates/flow_typing_statement/src/statement.rs:9974-9983 | rust_port/crates/flow_typing_statement/src/statement.rs:10070-10079 | rust_port/crates/flow_typing_statement/src/statement.rs:10146-10155 | rust_port/crates/flow_typing_statement/src/statement.rs:10396-10405 | rust_port/crates/flow_typing_statement/src/statement.rs:10567-10576 | rust_port/crates/flow_typing_statement/src/statement.rs:10732-10741 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9974\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a547490839ced9894411b2dc00c63ad2e261b3695393c3420605e1990645646f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1019-1027 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2440-2448 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2487-2495 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2543-2551 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2676-2684 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1019\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2553\u0060 calls \u0060object_like\u0060, \u0060Ok\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:2450\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"117e15dc43e613e845d7d3a6ed78aa2c1ddbe9bb30ffad20e078735d2f8e1e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_analysis/src/property_assignment.rs:568-576 | rust_port/crates/flow_analysis/src/property_assignment.rs:618-626 | rust_port/crates/flow_analysis/src/ssa_builder.rs:829-838 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1736-1744 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:627\u0060 calls \u0060Some\u0060 and \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:577\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744f268cecce3891fce88437c2ff3028aaf619cfeb35f3b97c6d116c9f3d95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): rust_port/crates/flow_cli/src/autofix_command.rs:32-40 | rust_port/crates/flow_cli/src/autofix_command.rs:271-278 | rust_port/crates/flow_cli/src/autofix_command.rs:415-422 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:27-35 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/autofix_command.rs:32\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3501c86e2b71719e78720ed35bdea035c7cb3b90b93e7fd40bcb029552ae30a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_dot_js_wasm/src/lib.rs:821-829 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1033-1041 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1149-1157 | rust_port/crates/flow_dot_js_wasm/src/lib.rs:1188-1196 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_dot_js_wasm/src/lib.rs:819\u0060 calls \u0060i32_arg\u0060 and \u0060rust_port/crates/flow_dot_js_wasm/src/lib.rs:1032\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":"rust_port/crates/flow_dot_js_wasm/src/lib.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e6a9d5e4de68413ae7ddab87578062fde2d3a02c1f9736bfcc6fa428d94c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1565-1573 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1579-1587 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1596-1604 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1635-1643 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"5638eec4d3a7f2be8d4d143d7af1cf11c9c7d36f1c96f464580283d2783d06f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_parser/src/flow_lexer.rs:1188-1196 | rust_port/crates/flow_parser/src/flow_lexer.rs:1216-1224 | rust_port/crates/flow_parser/src/flow_lexer.rs:1229-1237 | rust_port/crates/flow_parser/src/flow_lexer.rs:1257-1265 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1188\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"26356aa3956b30d904357a6f3c154bfdb58bbe6f1ad529980acc2f10d37c1779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_server_command_handler/src/command_handler.rs:7697-7705 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7874-7882 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7951-7959 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:7975-7983 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:7697\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe59fc52e08637354029441549825d7974b97d738de44726048aaa211f04d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:459-467 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1295-1303 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1811-1819 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:1909-1917 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/object_kit.rs:459\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":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5b40a71ad0b5dafe22f8f10d86c20ec5f734c03d7cf782c9070b04969369fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_env_builder/src/name_def.rs:1285-1293 | rust_port/crates/flow_env_builder/src/name_def.rs:1310-1318 | rust_port/crates/flow_env_builder/src/name_def.rs:1330-1338 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc27b573d75cc0c538b38156c0caf489d7784d11a7e068a1f3d41fa958a2714f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:1090-1098 | rust_port/crates/flow_parser/src/flow_lexer.rs:2512-2520 | rust_port/crates/flow_parser/src/flow_lexer.rs:2704-2712 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1090\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10c310f43d702106db7297c30c36c79b204ba6c81b28337839723f8b16a0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_parser_utils/src/enum_validate.rs:310-318 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:335-343 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:430-438 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_utils/src/enum_validate.rs:310\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"915094e712c70f6a4088dadbf9092f0d2fe5e0344a8b8fcb576fcbbd6bdabe14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_server_command_handler/src/command_handler.rs:3856-3864 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:5581-5589 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6556-6564 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:3856\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c290b8f7ff109108a46c96d6fe0082238ca17b08b13fc6cb615eca953a211da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1703-1711 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1804-1812 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1840-1848 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a193df9ffeb0a560464b525b5e8a9945368e8e6dd8ecc2c12aea4be850fee066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:326-334 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:402-410 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:434-442 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:326\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, \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:323\u0060 calls \u0060mark_loc\u0060, \u0060get_forced\u0060, \u0060mark_fun\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:433\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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"061162a7cbe72b4e4f842cd3c7f51ddce9b61cc5d04a06623a50c82b456cb7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8411-8419 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8724-8732 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9126-9134 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8411\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e00f3dfaa87687b5f8950ab8f1907ecb8e3b0ac713b20b857cdaab35cfe10f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:251-259 | rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:339-347 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:272-280 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs\u0060 and \u0060rust_port/crates/flow_typing_statement/src/func_stmt_config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:260\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:348\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":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a3322175439c2ca081bafba69634c0aed9794e8e4d27aa790c3b30f2994ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:6921-6934 | rust_port/crates/flow_typing_statement/src/statement.rs:6948-6961 | rust_port/crates/flow_typing_statement/src/statement.rs:7004-7017 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:6921\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6921}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eaa0bf3d150488c6903d441b648169280d39fdd130992a81ea131c60ee0774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:17376-17385 | rust_port/crates/flow_typing_statement/src/statement.rs:17697-17705 | rust_port/crates/flow_typing_statement/src/statement.rs:18044-18054 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17376\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1512e3bb1126c55f01176a0a848d0ce9a56e0282aeb51e7eac80149676e1405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:979-987 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1030-1038 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1047-1055 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a514694e6a7ed1743d4791af5966e651b1e45c630ea27a2dbfc01ad19314a9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3747-3763 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3784-3800 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3823-3839 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3747\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbc9789261bd4fd1fdaa3fe407114aadcc38a7b4b6e06f769aed01f4c951e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:527-535 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1661-1669 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:527\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026\u0027ast ast::statement::While\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026ast::statement::While\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d5ed72f24ee11a0c82301914b638dd2460990a282882212ffe7807a56c751e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:663-670 | rust_port/crates/flow_analysis/src/ssa_builder.rs:878-886 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"703e16b7636b4a91ddb9c287fbf1e52cb270309d48833872d74f4a8ee399e46d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:701-708 | rust_port/crates/flow_analysis/src/ssa_builder.rs:923-931 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ac7c87699b62d6d2ce9af3a8d7e404d9f71cff590f71961e6389bdf2a2962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_cli/src/agent_helper_command.rs:112-119 | rust_port/crates/flow_cli/src/dump_types_command.rs:26-34 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs:111\u0060 calls \u0060add_reason_flag\u0060, \u0060add_base_flags\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:26\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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d0524cfd2b866a9d51976d0d22e0f242fbb5dd6d290a4fff546196d4db60c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:599-607 | rust_port/crates/flow_cli/src/glean_runner.rs:876-884 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:599\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36e690101849e2304e35d60bab135f35aa89473520784bd0850034e4c01727d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1023-1031 | rust_port/crates/flow_cli/src/glean_runner.rs:1364-1372 \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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"492185df9f45ae2d0e3fd64f849a17f3883b3c8e0512ca6333b19e74eb78d80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:1061-1069 | rust_port/crates/flow_cli/src/glean_runner.rs:1126-1134 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:1061\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c099983a497f93e64024727d486320b87d78e8943c153136046a61c5138fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/inlay_hint_command.rs:27-35 | rust_port/crates/flow_cli/src/type_of_name_command.rs:22-30 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/type_of_name_command.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs:27\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":"rust_port/crates/flow_cli/src/inlay_hint_command.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b4ab9cab30000a3be2dc672970404e377a99d2be1b9fb59e56e2d04b82614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/inlay_hint_command.rs:117-125 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:280-288 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/type_at_pos_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/inlay_hint_command.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fadcd4929cc3f8ede7d3da5d6a71018ad188ce90558a0393c57bcd9d52a0d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/ls_command.rs:357-365 | rust_port/crates/flow_command_utils/src/lib.rs:1635-1643 \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":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdd2e2bfc535aa53f6ff64182ce952483195a0bb405a41b6610546f9bef4947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_codemods/src/annotate_exports.rs:498-506 | rust_port/crates/flow_codemods/src/annotate_exports.rs:618-625 \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 \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"3900fb217d6c03815e5f56936a5c79fbc7fd096b4989c8848b1da63117a87cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_command_utils/src/lib.rs:828-836 | rust_port/crates/flow_command_utils/src/lib.rs:856-864 \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 \u0060rust_port/crates/flow_command_utils/src/lib.rs:828\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0b57bc5b7c9365cd537872a4d2acfb206936bf0f416af423ca5cbc708f7b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): rust_port/crates/flow_common/src/reason.rs:1752-1758 | rust_port/crates/flow_common/src/reason.rs:1840-1848 \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 \u0060rust_port/crates/flow_common/src/reason.rs:1752\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5ab4feceb12cd69b0d7396fb93cee1c9798a8676389e36cfcaeb9bd6b02a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_common_errors/src/error_utils.rs:3162-3170 | rust_port/crates/flow_common_errors/src/error_utils.rs:3174-3182 \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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c679a424a91ddcb859fefad75db62198fe515d100ffccca2b32c2b5f2f3ca51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_printer.rs:839-847 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1095-1103 \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 \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:839\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:836\u0060 calls \u0060is_symbol\u0060, \u0060atom\u0060, \u0060to_string\u0060 and \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:1094\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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"096669d47de4eda8be9b8b789fc3744e3410870e3869678a94c4a7cb7ee59d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_printer.rs:1642-1650 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1674-1682 \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 \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:1642\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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e1ee1daa105192955d6c6f145fe1ed5d91b84c2a0533536af28f48d645489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20139 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:305-313 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:423-427 \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 \u0060rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c568d379ec2b40d085f65334f350a62567627d7920075d31a97be70968adc3e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2277-2285 | rust_port/crates/flow_env_builder/src/name_def.rs:2398-2406 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:2277\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e98a8f4348af7d23bbe0bab4b90c559f780d987594194163cc05c60873a195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:3920-3928 | rust_port/crates/flow_env_builder/src/name_def.rs:3946-3954 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:3920\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ebac5b38f98ac16986338d1d9b3528846b264201ddca9ffcc82662ccd1a1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:4290-4299 | rust_port/crates/flow_env_builder/src/name_def.rs:4310-4319 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"41615794e5b06321c8991b788dc30abb18ee52ae42d39cd093e2b8ba23165a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:6065-6073 | rust_port/crates/flow_env_builder/src/name_def.rs:6094-6102 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca032f5ad59cbca48ed1b8ef815057aef9a97708643736061a9fd816968bcfb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2991-2999 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3153-3161 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f287b22d66c691294d3544dcdf50fe451e45d65453b4c693095bd474669ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:1698-1706 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:8886-8894 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7388f82eaf241c9acf0f3b8ffd5c41ca46777ff649a9d37f58fcc338bb2621f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7716-7724 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:7824-7832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":7716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e56d6a930946b8e21ebadc3fdc1476b569424af4c569eb97536f42ab163f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10101-10109 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10148-10156 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:10101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":10101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e562dec980a626bf6f6580f567eeef50a663537d94cec7e186d58b73a5b416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/flow_lsp.rs:1058-1066 | rust_port/crates/flow_lsp_server/src/flow_lsp.rs:1409-1416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf02e44f6b1539cdd011d175b414720bcc476490f3e136c2bcb449163ed741a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/flow_lsp.rs:2514-2522 | rust_port/crates/flow_lsp_server/src/flow_lsp.rs:2527-2535 \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 \u0060rust_port/crates/flow_lsp_server/src/flow_lsp.rs:2514\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d406de31ec41921d13a4a66d56bb5d5b07720cdc9d4fcd0065684296d77f7a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:7819-7827 | rust_port/crates/flow_parser/src/ast_visitor.rs:7918-7926 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:7819\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7819}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9079f6318aa2348b5627b614a073a80431efd991c633d9a6f86806f2321d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:8556-8564 | rust_port/crates/flow_typing/src/typed_ast_finder.rs:772-780 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_typing/src/typed_ast_finder.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:8556\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":8556}}}],"partialFingerprints":{"codehealthFindingId/v1":"243528700b67fe42d97000b407fcef5354e318a6a4542b3abb7d3e09bf9dc3ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:12439-12447 | rust_port/crates/flow_parser/src/ast_visitor.rs:12473-12481 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:12439\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":12439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4450bd7338e4e98fbc59edeedbb86743df9a67d891c5a63e611784d26a3e5f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:16334-16342 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2530-2538 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:16334\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":16334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7299da18a5b38245b803a7bec07b505bac3abf4db25471a2057f10c21c776bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:17592-17600 | rust_port/crates/flow_parser/src/ast_visitor.rs:17635-17643 \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 \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:17592\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":17592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4a67946587356b933d2440c93819babfacc53e242a8f8aa3fa98e2db90b7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:2917-2925 | rust_port/crates/flow_parser/src/estree_translator.rs:3998-4006 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:2917\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"268e9bfd637fe8cb43ca7662792440333415648c066466091a16eef9058aa667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:387-395 | rust_port/crates/flow_parser/src/parser_env.rs:1400-1408 \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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"43535ba3c0148e1b3367be6b111c277314fbdb105d2b67c1b8f3256f5bd0fb6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:170-176 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:522-530 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:170\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8f2914b8693a9b06f9e775630704bbd239252bcca33f7345f47219383ba10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:1343-1351 | rust_port/crates/flow_parser/src/object_parser.rs:1949-1957 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:1343\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da5d8ddc18013f0a3447a201ce175afaaa28bf81f4d00039f9c17eb0496f286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/pattern_parser.rs:62-70 | rust_port/crates/flow_parser/src/pattern_parser.rs:377-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/pattern_parser.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17f2ae5628e7ff139c9d67d642fab0fa2a8540d3605a1a0d043bd29a71c52a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1717-1725 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:5253-5261 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:1717\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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec56841972fb69b1db262e7a0bba35e0347f3ebcdc8705f229f076f6acf583d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2398-2406 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2415-2423 \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 \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2398\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae88332262aa44137cf3ad9538f12a304bc9282fbf3b866baf040153f7f9a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:2949-2958 | rust_port/crates/flow_parser/src/statement_parser.rs:3387-3395 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:2949\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c37ac16ddc6e2c99d21220c6160f9e36d1420050f621adc6903694abe97981e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3013-3021 | rust_port/crates/flow_parser/src/statement_parser.rs:3643-3651 \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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa0431735d59f4fe8162be99afeba629dec56578560472101c939e7a159fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:4761-4769 | rust_port/crates/flow_parser/src/statement_parser.rs:4822-4830 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:4761\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4041ed9e360f1f91057f26a7c11f7a7c932dccb070eef830b43da8bcaee2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:3649-3656 | rust_port/crates/flow_parser/src/type_parser.rs:3658-3666 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:3658\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdeaed65e922b2f20fd24dfc1926bd4224d257bf6bd8374df39a094fc268132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:4515-4523 | rust_port/crates/flow_parser/src/type_parser.rs:4525-4533 \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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1b2b411a8afe4accd6e65b706a4726f796717ed1530f34876c6c9369367797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/file_sig.rs:230-238 | rust_port/crates/flow_parser_utils/src/file_sig.rs:244-252 \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":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e71ea09140d540d9cca9cbe92d7f7c2150a54e8edc09ca5d178e6047b32ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1122-1130 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1133-1141 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:1122\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cae18a03688847d5eec74b9fcc7613664263d46292c5c2cb97ef165399f5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:4378-4386 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6844-6852 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:4378\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":4378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e921001d80f95e2c1dd8571012084a83243cfa9f9fccdf719b8ab0238da3d2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2083-2091 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4547-4555 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d42d26456c20178a874097ce8f9841eeb7d8c03ff157800d61a9b6315780e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:3713-3721 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4530-4538 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:3712\u0060 calls \u0060AvailableRenders\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4526\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"7324103eb71c5080180520d62fbaf5c31b857468a8c2810b3e67a767e72b5ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_saved_state/src/saved_state.rs:1177-1185 | rust_port/crates/flow_saved_state/src/saved_state.rs:1188-1198 \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 \u0060rust_port/crates/flow_saved_state/src/saved_state.rs:1177\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":"rust_port/crates/flow_saved_state/src/saved_state.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb09888296024bffae0f0b01ee4b8cf71df6d10186f81e0124fc38930411c534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_server/src/server_daemon.rs:92-100 | rust_port/crates/flow_server_monitor/src/flow_server_monitor_daemon.rs:288-296 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_server_monitor/src/flow_server_monitor_daemon.rs:285\u0060 calls \u0060clone\u0060, \u0060get_from_i_am_a_clown\u0060 and \u0060rust_port/crates/flow_server/src/server_daemon.rs:91\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":"rust_port/crates/flow_server/src/server_daemon.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1828c08b5331655b95ae0ba7bf0dcac0984aca3b1393ef8b0b2f09631d2feb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_server_env/src/collated_errors.rs:88-96 | rust_port/crates/flow_server_env/src/collated_errors.rs:231-239 \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":"rust_port/crates/flow_server_env/src/collated_errors.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"522055f4bffafeb6fd21e9a69d16f10bb8c5b4eb13317434e0b2a8b09002fe48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1196-1204 | rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1362-1370 \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 \u0060rust_port/crates/flow_server_env/src/server_socket_rpc.rs:1196\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":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff9fa2ea99147128864adf3b404526514b9a7912e89a1c40de5c846d589f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:152-160 | rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:287-295 \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 \u0060rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:275\u0060 calls \u0060add\u0060, \u0060clone\u0060, \u0060notify_new_persistent_connection\u0060 and \u0060rust_port/crates/flow_server_monitor/src/socket_acceptor.rs:144\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":"rust_port/crates/flow_server_monitor/src/socket_acceptor.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d565a752ac5818b64690573fa81dac26631f8bbec52485f9f64c1bda6d91c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:967-975 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1058-1066 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea4617d827c54161999627ee3c337be59e05c515f4ba761b62f2dcc3c87926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1454-1462 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1478-1486 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1454\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ef3c8cedf7f60ce52c37d79e074fdc6fbed3d561a5cf099a2e9af82962b565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:3031-3039 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:3044-3052 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:3031\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d44ccbe163fbcfb1ba54ec52e31a59f6e13fccbb6d5c43e4962db090fe4ff63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_services_inference/src/type_service.rs:3094-3102 | rust_port/crates/flow_services_inference/src/type_service.rs:3128-3136 \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 \u0060rust_port/crates/flow_services_inference/src/type_service.rs:3094\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9ff1a16efbe24cab642642dbfb857a813dedab1b1f21cf7c65639acc75f338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:70-78 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:81-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a5909a7ae746b7845d7f5d9072e2fd1c6435093a73f94d05b0cb421d443aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:983-991 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1019-1027 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_pack.rs:983\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":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab4c05e85b7639d1faa45d6bcdd0639ba34dc431a733b934ec7bd56ea917752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1730-1733 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1991-1999 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:2006-2014 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd9fb22d40960d7e6c470490da9f276b6779db5fa6d92fcada03cac49cbb5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11829-11837 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12907-12915 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11829\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68fe35b0856ff0e8585b25ec48a71fae173a0f7a9334ba85fb6525599bdbe55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20139 lines \u00D7 4): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14667-14675 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14695-14703 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14799-14804 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14823-14825 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14667\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, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14677\u0060 calls \u0060as_str\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14705\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14667}}}],"partialFingerprints":{"codehealthFindingId/v1":"badff8090d4f61bdbbc319c586d4c3ac6e1750731b04dff2c2acc5b467ff42f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:2538-2545 | rust_port/crates/flow_typing_debug/src/lib.rs:4320-4328 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:4320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0b2fea57d37772312acac64a51974b1d25bf25a63385b3917bc8d296e8c5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:2603-2611 | rust_port/crates/flow_typing_debug/src/lib.rs:2776-2784 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:2603\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"265594570b3acb7e3c272902f56f1afc5f6bb46f8857af910cca379ffa86a2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/error_message.rs:6474-6482 | rust_port/crates/flow_typing_errors/src/error_message.rs:6501-6509 \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 \u0060rust_port/crates/flow_typing_errors/src/error_message.rs:6474\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":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":6474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475834d00c059c512d9cf4598da412be8ee815f7e6be29d64903300cd2db97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7362-7370 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7467-7475 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":7362}}}],"partialFingerprints":{"codehealthFindingId/v1":"85de41e24e7d6b664d667bc20edb76613a3aa3ae24f1236faf86f51c252b8209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs:27-35 | rust_port/crates/flow_typing_type/src/type_util.rs:1782-1790 \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 \u0060rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs:27\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":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2985bf7ee2d06f2351f522c956bca2dcd5b6848c29971d815856b4d322cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2694-2702 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1395-1403 \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. 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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b70852e3114a7ca666c9c3cc149eb14fbc3f49d039102554d33b0c2995abe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8675-8683 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8798-8806 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8675\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3450a5508750a70348b16c59a6bc59672404cf336807e1d57a2540e76196915e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8970-8978 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:9000-9007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8968\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8997\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8970}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd391401f3a021644406c28444bf8b0a47ccb005608dab19c5fdd4123f5492f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1525-1533 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1562-1570 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1525\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1534\u0060 calls \u0060dupe\u0060, \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1571\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce3bfde81bb8f03c5b2f8ae13f74be9876905f3e111b01832ebd5660571ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:350-358 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1485-1493 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27343347ed1f04165a23eda0c6f6d97602de83e89a52525170cf601bcedbad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:673-681 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:697-705 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed5a2c0907ad1ebe4851e0bf1547fd6de4ae93264b7e97254c8706154e5e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:1473-1481 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:1488-1496 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:1473\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f419b478d7ffef8eb6042066f8a2d3f1c82b114e0d90132378e570da2991994c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1657-1665 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2252-2260 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1657\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b3bcb3e76cfd0f94d60d0eb765d0d5143977b1a413f6d4e26bb7172e4557e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3719-3727 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3733-3741 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f34e95a1f5c364b47e644d82c32963b5bdea5df3841a9a92cadea6dfa70066b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3752-3760 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3766-3774 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3752}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad21f9034723d19437740d6cd910bc085d459e59682abb2b580e748953991cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3783-3790 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3797-3805 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3783\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25dbe696f82b1ed7663853cefd824006b1df0b2d5f256bb23a06b140755c3d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3813-3820 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3827-3835 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:3813\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3813}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bc7807efabb4670d46fbcdb23b0837cee1a004dc336fc1c0360896bdb7c1dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5638-5647 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5682-5690 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5638\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":5638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc56498c1f74c7c1c0c4799ce44599d8484e19eb1b7e680f0d21dee1b04b29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:165-173 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:120-128 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630b9f827ae7a0f63711639b95e2b845c5fc676f6b169db6a14b0cf8cd7ac1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:5266-5274 | rust_port/crates/flow_typing_statement/src/statement.rs:5284-5292 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5266\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796dc93ae3ee8cef8ef589cef0549c145e26cadcb6f7aac6ffa1c7cb49d9988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:6849-6857 | rust_port/crates/flow_typing_statement/src/statement.rs:6860-6868 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:6849\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6849}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddf52d2691faa0a42cf91beb03b884b25036b139aa91771362b187f7da52054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9628-9636 | rust_port/crates/flow_typing_statement/src/statement.rs:9681-9689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9679\u0060 calls \u0060expression_inner\u0060, \u0060loc\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9621\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9628}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa256e0e2754f33e89dc94a8007ee6d1405ebe6316c3a3e00c2890d4db340f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14657-14667 | rust_port/crates/flow_typing_statement/src/statement.rs:14989-14999 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14657\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f479b6bb59c4e3382c5cbef6fbd635f098a05b2594194134906cdb1ac40ed1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14711-14721 | rust_port/crates/flow_typing_statement/src/statement.rs:15019-15027 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14711\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14711}}}],"partialFingerprints":{"codehealthFindingId/v1":"452ca723da946edf956309b0aef68f4bb8efcb910e88100fb7e2f03f13d7a4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16695-16702 | rust_port/crates/flow_typing_statement/src/statement.rs:19466-19474 \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, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19475\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16703\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16695}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aaacab769b0745617d6e04e0e53ced5575e3324686906f4b6cae1ca30f40ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19926-19936 | rust_port/crates/flow_typing_statement/src/statement.rs:20405-20415 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19926\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19926}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ba9a8c3d16a9236199dcbd989ceb9601b42e57039b090612bc9a839b5478f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19992-19999 | rust_port/crates/flow_typing_statement/src/statement.rs:20473-20481 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19992\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19992}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc0888ed06d03b528329bbdfd93a6524998c7b135d0a359d8ddb54eaeda7065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:20118-20126 | rust_port/crates/flow_typing_statement/src/statement.rs:20606-20614 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:20118\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":20118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab292f6f7578c3eeb8a83aad6bd995c61e00ba50d3f639443503e5c053fa7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2411-2421 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2437-2447 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2411\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e866da4c0aaf460f0d36c064721fc1bd9d4efa8231b2e7d408a1b371aa2889c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3861-3869 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3877-3885 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3861}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dfc5212db7078caef07e51b8ecba9c57ba701f96850f107411bde80b74abb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6679-6687 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6702-6710 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0945ab0811025552077bc0d50c8a969e8e4f09044e8cebcfedcee3e8edb8b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:7761-7771 | rust_port/crates/flow_typing_type/src/type_.rs:7795-7805 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:7761\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7761}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b61dd04d32784a5bd1fbb2472b7e38a1ef67b5a0c9aadfb81fcf38a7287313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:9230-9238 | rust_port/crates/flow_typing_type/src/type_.rs:9327-9335 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":9230}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a34662f2c157da83f21c04eb9eddade3bce3b0cfabc63d023e83b50dd4fd86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_util.rs:2166-2174 | rust_port/crates/flow_typing_type/src/type_util.rs:2179-2186 \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 \u0060rust_port/crates/flow_typing_type/src/type_util.rs:2166\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20ffd7f97152ab741d9e91166b67028d02518366f2f4522ebf0a2cfce50a7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/convert_types.rs:245-252 | rust_port/crates/flow_typing_utils/src/convert_types.rs:260-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe2b0f5db8c8cf2315d4a4365023ec96c5f659530170eb65abcef9178f3288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_hint.rs:656-664 | rust_port/crates/flow_typing_utils/src/type_hint.rs:776-784 \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 \u0060rust_port/crates/flow_typing_utils/src/type_hint.rs:656\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8137957ebd98bbf81a171160f12b4526989ab98012a9a1d79d3858c674e548f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:384-392 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:533-541 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:384\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c494154c32ab6bc920d9a9d62542f4a88590bb4e5e1479b32e03270b6d5a0b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): rust_port/crates/flow_services_inference/src/check_service.rs:629-632 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:189-197 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6449-6457 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_inference/src/check_service.rs:629\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f2508141bf8e02984653eeaefd5ea2f81c70d4bf472c0d65f40b6e1db84eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_watchman/src/lib.rs:583-591 | rust_port/crates/flow_watchman/src/lib.rs:597-605 \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":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c416d1359bf96cd064bcd6fd2a16770e57cd6aa65c1cae3e35d50ebedb572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 23): rust_port/crates/flow_typing_statement/src/statement.rs:17154-17162 | rust_port/crates/flow_typing_statement/src/statement.rs:17219-17227 | rust_port/crates/flow_typing_statement/src/statement.rs:17275-17282 | rust_port/crates/flow_typing_statement/src/statement.rs:17307-17315 | rust_port/crates/flow_typing_statement/src/statement.rs:17376-17385 | rust_port/crates/flow_typing_statement/src/statement.rs:17471-17478 | rust_port/crates/flow_typing_statement/src/statement.rs:17604-17611 | rust_port/crates/flow_typing_statement/src/statement.rs:17637-17644 | rust_port/crates/flow_typing_statement/src/statement.rs:17697-17705 | rust_port/crates/flow_typing_statement/src/statement.rs:17841-17848 | rust_port/crates/flow_typing_statement/src/statement.rs:17963-17970 | rust_port/crates/flow_typing_statement/src/statement.rs:18044-18054 | rust_port/crates/flow_typing_statement/src/statement.rs:18082-18090 | rust_port/crates/flow_typing_statement/src/statement.rs:18352-18359 | rust_port/crates/flow_typing_statement/src/statement.rs:18372-18379 | rust_port/crates/flow_typing_statement/src/statement.rs:18391-18398 | rust_port/crates/flow_typing_statement/src/statement.rs:18419-18426 | rust_port/crates/flow_typing_statement/src/statement.rs:18543-18551 | rust_port/crates/flow_typing_statement/src/statement.rs:18567-18574 | rust_port/crates/flow_typing_statement/src/statement.rs:18592-18599 | rust_port/crates/flow_typing_statement/src/statement.rs:18720-18728 | rust_port/crates/flow_typing_statement/src/statement.rs:18744-18751 | rust_port/crates/flow_typing_statement/src/statement.rs:18762-18769 \u2014 all 23 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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17154\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bcbff8d76e1fbab957873672afc397241ef29f85e2c3504a139842468f8839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): rust_port/crates/flow_type_sig/src/type_sig_pack.rs:943-950 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:985-992 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1021-1028 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1087-1094 | rust_port/crates/flow_type_sig/src/type_sig_pack.rs:1160-1167 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"e539c202f78c487cb98440fa3a3c7f7d88e1f7a38873a434f7aaec4283848f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): rust_port/crates/flow_command_utils/src/lib.rs:2394-2401 | rust_port/crates/flow_command_utils/src/lib.rs:2403-2410 | rust_port/crates/flow_command_utils/src/lib.rs:2412-2419 | rust_port/crates/flow_command_utils/src/lib.rs:2421-2429 | rust_port/crates/flow_command_utils/src/lib.rs:2430-2437 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_command_utils/src/lib.rs:2394\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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 before the matched lines, \u0060rust_port/crates/flow_command_utils/src/lib.rs:2394\u0060 calls \u0060expand_project_root_token\u0060 and \u0060rust_port/crates/flow_command_utils/src/lib.rs:2430\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":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66861d1b259d0d21cef2d88e868d3356178de090bc310865c04d4c6baf29cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rust_port/crates/flow_services_get_def/src/get_def_utils.rs:412-419 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:421-428 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:430-437 | rust_port/crates/flow_services_get_def/src/get_def_utils.rs:439-446 \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. 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":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb12053541b9eafb9fc9ca782fdeaf6cdec3d749b016d9493884619b9a49ba77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/func_sig.rs:683-690 | rust_port/crates/flow_typing_statement/src/func_sig.rs:706-713 | rust_port/crates/flow_typing_statement/src/func_sig.rs:733-740 | rust_port/crates/flow_typing_statement/src/func_sig.rs:760-767 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc7551d81e06b0aefd8db31b71e63086dc16bfd008bfe80aa2ad9661440aa1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/type_annotation.rs:9089-9098 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9126-9135 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9174-9183 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:9192-9201 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":9089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d037075fd181a7c4696411090e4625ba4916f876bde1729fdbaf2b633f83a8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_filter.rs:1137-1144 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1237-1244 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1361-1368 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1457-1464 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1137\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"58babc90cdd1617399c6a5d44c4c5c0a000d454b0cf849bfe8a8cbb56092d901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1876-1883 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4861-4868 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4895-4902 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4914-4921 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1876\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1996c2dd7104e82f7758ce253b71818e70400c55f25a9a23648490c4f6b0ebc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_parser/src/ast_utils.rs:429-436 | rust_port/crates/flow_parser/src/ast_utils.rs:449-456 | rust_port/crates/flow_parser/src/ast_utils.rs:554-561 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/ast_utils.rs:429\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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4da6abb81f81d1831b9a8cef4c89391a043b484a8b9d3520db1895b0e1622e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_parser/src/enum_parser.rs:119-126 | rust_port/crates/flow_parser/src/enum_parser.rs:196-203 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:583-590 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/enum_parser.rs:119\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":"rust_port/crates/flow_parser/src/enum_parser.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddacd00be243879283d6f246997890087996c5e9449eaed6a8f97479061e2be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_parser_wasm/src/serializer.rs:2270-2277 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2453-2460 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2474-2481 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2278\u0060 calls \u0060write_bool\u0060, \u0060is_key_computed\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2461\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dd67e49c52da4f00381a6a36f8d3d7437ca05fe69121bb8f57ad171dfa01ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_parser_wasm/src/serializer.rs:4095-4103 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4107-4115 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4286-4294 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inner\u0060 to \u0060\u0026ast::statement::ComponentDeclaration\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::statement::DeclareComponent\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4095}}}],"partialFingerprints":{"codehealthFindingId/v1":"280fa2f329b27c6743407e5afb2dffd517c0c04aa97fe0aaba67a6b7ec0d02b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_services_code_action/src/code_action_service.rs:758-765 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:805-812 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:851-858 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:758\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":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b24fe0fccfec2b5cf9f0d887d75cf04433a460aad1bdb9ac2774294dc1d7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_debug/src/lib.rs:2578-2585 | rust_port/crates/flow_typing_debug/src/lib.rs:2601-2608 | rust_port/crates/flow_typing_debug/src/lib.rs:2774-2781 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ca41fd11d56bca94a6c097c56a1bb83112cd0a85de6ef8469aac24b967e6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8522-8529 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8553-8560 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8582-8589 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc142861b8cbabd4be05ce2a7a609134abcf1a97f5ead8b5a9a5f72702605ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9666-9673 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9736-9743 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9754-9761 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:9666\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9666}}}],"partialFingerprints":{"codehealthFindingId/v1":"de91df7d07b991b86f6027c1cecab9a6cb917ea14947b93ec3c8d29fe5d415d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:10990-10997 | rust_port/crates/flow_typing_statement/src/statement.rs:11024-11031 | rust_port/crates/flow_typing_statement/src/statement.rs:11051-11058 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10990\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccdf21f7d8bffca705955a0cfc3aacd41de473fbd897d3c453868ef0c6573d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:17542-17549 | rust_port/crates/flow_typing_statement/src/statement.rs:17761-17768 | rust_port/crates/flow_typing_statement/src/statement.rs:18675-18682 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17542\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa30e5d95ad623622abbe20ebdbaa9962868a9913d259f47d8ce09bf1da9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_filter.rs:230-237 | rust_port/crates/flow_typing_utils/src/type_filter.rs:251-258 | rust_port/crates/flow_typing_utils/src/type_filter.rs:280-287 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c20d9f9d8ddf01d952e55b0e1c9a5d77a8f5f97c711c55587909bf77000d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_hint.rs:1020-1027 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1436-1443 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1470-1477 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_hint.rs:1020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fbff575ac526993d092cc8bc4cb102b60d6270a66c84e3b96c0930084e2538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:537-544 | rust_port/crates/flow_analysis/src/property_assignment.rs:617-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d0e6920def8d87966aa11dff4933be6219c201ed87cffff4116b2d4b7854e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:1122-1129 | rust_port/crates/flow_analysis/src/scope_builder.rs:1255-1262 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043ec07d777176fb8d6fa8d88095c31764f0a748146a92fea0e1a70316d0986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_cli/src/coverage_command.rs:28-35 | rust_port/crates/flow_cli/src/find_module_command.rs:24-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/coverage_command.rs:28\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/find_module_command.rs:22\u0060 calls \u0060exe_name\u0060 and \u0060rust_port/crates/flow_cli/src/coverage_command.rs:26\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":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a14a42a4769529cc1ac637ad40f894d7d1ff026d9e3c00923a837b139f1961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_cli/src/coverage_command.rs:217-223 | rust_port/crates/flow_cli/src/coverage_command.rs:262-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/coverage_command.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f56e2ba472604b6cd859c777d227f1f34fab9ee2620fe5814845e698c3a8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:919-926 | rust_port/crates/flow_common/src/files.rs:953-960 \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 \u0060rust_port/crates/flow_common/src/files.rs:919\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":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"872961c4ccfc8f915cd6935905ce4ae48ed0a46763bf9cc84207404ee27dbdff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_common_errors/src/error_utils.rs:924-931 | rust_port/crates/flow_common_errors/src/error_utils.rs:1113-1120 \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 \u0060rust_port/crates/flow_common_errors/src/error_utils.rs:924\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a42b314cc22e2af692902f6b11b5b6da7e932d96667faab2ea65766e6c210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty.rs:3019-3025 | rust_port/crates/flow_common_ty/src/ty.rs:3032-3039 \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 \u0060rust_port/crates/flow_common_ty/src/ty.rs:3032\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_common_ty/src/ty.rs:3040\u0060 calls \u0060Some\u0060, \u0060plus\u0060, \u0060on_t\u0060 and \u0060rust_port/crates/flow_common_ty/src/ty.rs:3026\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef62a2bd520ecbb95f3e6672d1b0c89f4e7784dfd72d00446c2a7726e126404f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_printer.rs:992-1000 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1233-1240 \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 \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:992\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:1001\u0060 calls \u0060property_variance\u0060 and \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:1241\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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b2fd44272f78e775249150225d5b3992c5bc55bf3b89d529b7f6ad1931dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:132-139 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:183-190 \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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7707842c8d285806f9e9e28c54e851aacb61a2302a3f1b6c190c7d32dedaeee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2030-2037 | rust_port/crates/flow_env_builder/src/name_def.rs:2290-2297 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:2030\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"52876bde5f94c5a0603f7911fbdccf92749c12fe52c83f4116851c2b4bc3c751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:3762-3769 | rust_port/crates/flow_env_builder/src/name_def.rs:3790-3797 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:3762\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ac26a6dbe061053737a15e8fd920c605a65e2e95b24e172dc2493b7d536047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:3893-3900 | rust_port/crates/flow_services_code_action/src/ast_extraction_utils.rs:1162-1169 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:3893\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3893}}}],"partialFingerprints":{"codehealthFindingId/v1":"296b777d283c8046a5f13841eb40ef21206bb9271e78a3f75a1f851554b593b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1261-1268 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12775-12782 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1261\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9493f3eb06127684867fa95a5ad536ba7e7714c9f4342536aad66f82ab972e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:4251-4258 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:4360-4367 \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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":4251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c38ea553e5d95bcbbfae8465b32f40664eedcf624e43a29e417464717bf7e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2817-2824 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2838-2845 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb6e7ef3d3d5a22ea62b1a2adadf8840c798b66d1e2d2e2214e795a463774a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2824-2831 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2869-2876 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2824\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7157f09567449bb74bbc18d51361971c5bf0977567b584859118862eadc1da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2909-2916 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2931-2938 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2909\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de07f61d21effc7d26e4432a59b774ac097103034276b5c78116d7b4a68c965"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_heap/src/parsing_heaps.rs:730-737 | rust_port/crates/flow_heap/src/parsing_heaps.rs:776-783 \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":"rust_port/crates/flow_heap/src/parsing_heaps.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30ff9fcb244138c40ce7e791e873f3f0fc500dfae3d7b629a8a0adeb5d6816b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/ast.rs:5426-5433 | rust_port/crates/flow_parser/src/ast.rs:5436-5443 \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":"rust_port/crates/flow_parser/src/ast.rs"},"region":{"startLine":5426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3483a77bb21c069fd556b98f129c9c27d25e27a6cc66483039e99be97817e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:868-873 | rust_port/crates/flow_parser/src/expression_parser.rs:2110-2117 \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 \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:868\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b616602ac5b508470b3f94a0df98e016cc62efce43f674b4a96ec75f34a2a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:4099-4106 | rust_port/crates/flow_parser/src/estree_translator.rs:4123-4130 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:4099\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad9b61ea6cd5ba71fe93e69662f3e49f14b4a39c7961cb6ba3bcf05960da54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:6641-6648 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2872-2879 \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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":6641}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c796b6ce9614f573b8ccb5a4d8d829aca547ca0fbbf52d4cf8f25300af07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:351-358 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:603-609 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6aa86276ae329a1196e6a8334248694b40abb14398b53925f755647c29d9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:371-378 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:620-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b92af8666fc0622f5907ceca70ca4dd5ad3750da1605903744ea5d38647a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:665-672 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:723-730 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:665\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"facd63e26b68d2b2d687fc5e08cc50bd5af309016cc14886c6e8c00d4bc55b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:756-763 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:813-820 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:756\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1a38fc1d6875605fcb56be8a61514d0ee93792a2553f1a48dc02c2a4d2ae33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:1152-1159 | rust_port/crates/flow_parser/src/statement_parser.rs:1183-1190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd51d687122ac3468990d730cc5f3d0c45d7a9ec0da9745e49fa6444cac43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:2885-2892 | rust_port/crates/flow_parser/src/statement_parser.rs:2911-2917 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:2885\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca8f4ba482de10965613d098b59e2f66264652ccfac957a29913b98b55a325e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/file_sig.rs:515-522 | rust_port/crates/flow_parser_utils/src/file_sig.rs:640-647 \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":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d93231cbffe6e7a941093292e6333d0dd6db98ea7117445385035f2dfc9a005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1484-1491 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4323-4330 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:1484\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6f90523dbc803179869e4d28a3db884ec0fc5535b78aa52c59741560a9e516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2510-2517 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2527-2534 \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, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2535\u0060 calls \u0060write_bool\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2518\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"7510ca74d7b90f1163ca12d5a1f1747981d9917be5fc6ec698a881ae39adea7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:3006-3013 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3081-3088 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed12e4c50327ca2f12c8ca45bc0feae4dd80e39173bba1ec96af8f26b92f9e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1254-1261 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3888-3895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8eb2b9faeb710e0ece8ee59eb3bc4758193cc314769f73a05a4de816420623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:4904-4911 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4999-5006 \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, \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:5007\u0060 calls \u0060refinement_info_on_hover\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4912\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0879c02f10b4187c8c0a5f81b946c793929b5e14f25db0b7a126ef6b49f50e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:6507-6514 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:6790-6797 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:6507\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":6507}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c6855f0188c3b65ec27a5525c8f47e0b4c9126ee4eb8bf155b0fc74d86eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1168-1175 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1327-1334 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:1168\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c82720e021c10e5b33aac32cdd9f5e9256f400a44a204a691db7d39126e213c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:349-355 | rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:564-571 \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 \u0060rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs:564\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":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1532ab8d2d882b421e9aa745c190ea964e75feda5239d0094b2501d8b6d6217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:523-530 | rust_port/crates/flow_services_inference/src/merge_service.rs:565-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5035cf8f000a2899d803f0360a95b0f20115761b979e6b5b015608af908bb6db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_type_sig/src/compact_table.rs:364-370 | rust_port/crates/flow_type_sig/src/compact_table.rs:379-386 \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":"rust_port/crates/flow_type_sig/src/compact_table.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab076c4be8262d7a938baa84ec824a3bb844a27e6b26e35bb02c6e2305e29c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:635-642 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:4915-4921 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6fcbfa27ccbc9e0cfc6b3583192475451b915e1258195f5077d0e013893f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5592-5599 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5617-5624 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5592\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":5592}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad2829a2fc54083e118be6cce71785802ef1486e0226fa8a3bc8d294a1f052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:7357-7364 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:7373-7380 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":7357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0621702897f7e7a8199fbb3cba309289fe0dcee1c8cec447ff08b4c5354d52ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11260-11267 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11327-11334 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11260\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11260}}}],"partialFingerprints":{"codehealthFindingId/v1":"604051593963cb91ac6a7ee7559e209a5d9fe1414f88160d7f351eaa2e278712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13794-13801 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15203-15210 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13794\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13794}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d3dc8ea5f9070774f5cbb1785582e1bca70082d48c0d87a6242b763054194c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:1637-1644 | rust_port/crates/flow_typing/src/env_resolution.rs:1675-1681 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:1637\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47a93deb90d6c9bbd55763d6674b65860edc386e2b63f4a9447112b1faf5688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2652-2659 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2677-2684 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8cbd653f88d0c60c561a8a8f5f7bd89e23205b8be3d99eac91b38ab6c7f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2689-2696 | rust_port/crates/flow_typing_type/src/type_util.rs:2691-2697 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2689\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"6085b23167527babf6c2b33dcccba131c9f74402a3d882d965b2d95d7c05a046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5426-5433 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5787-5794 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a49be903de6eb0b91a48365bf254902eb9e43c44ab415a100dcc6c1a16ee9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1898-1906 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2010-2017 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1898\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"887bfcb090607ecdfcc0f0e08b17da832cd439a5ff7578d8a5da9e9719ef468c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5130-5137 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5169-5176 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5130\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5342c53927ee922de19121aab7cfadec1b275e09f21fc8140bfb491907f7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5269-5276 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:1247-1251 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5181947d5666a69a5119164e8559420e4e43b94375ccb6a345ec9dbcdd03ef07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5262-5269 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5392-5399 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5262\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5261\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:5391\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":5262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5cba5f6ede836979888cb4ee239c82c618e604b2c17a44453d96d2f857e491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:551-558 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:563-570 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:551\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ba85b7eb0b06fa7fff6288d22bb4d9775e52b1b2475a3e3358ecb2def719b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1159-1166 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:543-550 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1158\u0060 calls \u0060Resolve\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:542\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7156bbaac32d3e798c71f657f33fb9476fbf0d2ec72fde09a28bd3051bc51428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:610-617 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:858-866 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:610\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:620\u0060 calls \u0060Ok\u0060, \u0060UpperNonT\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:867\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e00d5bb7b80cbec83356b3ec8c7af2860a5c7795ab817208dd32e41ff87f71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:829-836 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:874-880 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:829\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb47360abcd5332a49839b935bc45c5379b14a82aedce655587149ff4ebb32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3007-3014 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3058-3065 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3de2bdbab95d2797b472bafd9d86592dad0d0f099f1a40d71b2b7fa330f63c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4196-4203 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4205-4212 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ecdb8b59506f2bc6e73bc6e00142ce2256c736a232d98ebf47786f831f7c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6813-6820 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6822-6830 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:6813\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6813}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ef0a5ff2f2403eaa27c094eb2352a8eeb220d88a3c65814d292ded379ff32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:608-615 | rust_port/crates/flow_typing_statement/src/class_sig.rs:649-656 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:608\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c212b010989cfeea218c7dc4b1fe3ea29dfdbb964dc1f179c4c46671e121cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1198-1205 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4628-4635 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1198\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c9b3cdde1d58ad054ab65a17939928d94196b49bdd1ed0a7bbdb6ef26da9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:2587-2594 | rust_port/crates/flow_typing_statement/src/class_sig.rs:2607-2614 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:2587\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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b4f5c31b7529073756b93c8f1a33ecffa1f0b9664b582c312ee663511fe0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:208-215 | rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:244-251 \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 \u0060rust_port/crates/flow_typing_statement/src/component_declaration_config.rs:208\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/component_declaration_config.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafe12df7777537370efc0900fd66169a5283db45780d089e86c18434176440b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/func_sig.rs:116-123 | rust_port/crates/flow_typing_statement/src/func_sig.rs:244-251 \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 \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:116\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"28738604f6e7c786bd29471411ea3b5da392839ee58e2307e67e2e4ed3975106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:232-239 | rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:265-272 \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 \u0060rust_port/crates/flow_typing_statement/src/func_stmt_config.rs:232\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/func_stmt_config.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c1815c79518a23d23cd0c09d7c6440614baeb5bdbbd51e0ec04ffd084d63cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3499-3506 | rust_port/crates/flow_typing_statement/src/statement.rs:3604-3611 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e02f3b64e3f61206a3d4a872264c1dca2caa3ea1be6d088bd0390e7ea1534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4389-4396 | rust_port/crates/flow_typing_statement/src/statement.rs:4507-4514 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4389\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bf4c62e0d245ce832af6239442c171f168318f8cefd35dfbbadc5a6cee0444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:9136-9143 | rust_port/crates/flow_typing_statement/src/statement.rs:9226-9233 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:9136\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8141388d5678f2355f0be736fbe90f9a26ba92aeba366becba338ea75aec7cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:11953-11960 | rust_port/crates/flow_typing_statement/src/statement.rs:12122-12129 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:11953\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11953}}}],"partialFingerprints":{"codehealthFindingId/v1":"351f6f7016e9d061b38c55c50a896916eebab86f3fd2bc30b37da288287d8b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14043-14050 | rust_port/crates/flow_typing_statement/src/statement.rs:14059-14066 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14043\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14043}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c3207504a53673429316f166d4bcb5d5efafbf9ba1aaee76eb4b0ebea437e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:117-124 | rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:154-161 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:116\u0060 calls \u0060unwrap_or_else\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs:153\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":"rust_port/crates/flow_typing_statement/src/type_annotation_cons_gen.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727acc7226389899361131cf6ee50a862dd0411b686eae08545ef86cfe971a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3527-3534 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3539-3546 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:3539\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7230e938d5eba141ad09a44386658a040c59cd1c2b76ef6e28893501bb495e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:3550-3557 | rust_port/crates/flow_typing_type/src/type_.rs:4364-4371 \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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3550}}}],"partialFingerprints":{"codehealthFindingId/v1":"344499e21f37d533eabbc2f326e0f7ef2ec5dfc623f374f35dc02a249a85be69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:7568-7575 | rust_port/crates/flow_typing_type/src/type_.rs:7638-7645 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:7568\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf289432a2340e41be92edaec257a7d510c3507a1381b00c2e552d07710d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_util.rs:2563-2570 | rust_port/crates/flow_typing_type/src/type_util.rs:2582-2589 \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 \u0060rust_port/crates/flow_typing_type/src/type_util.rs:2563\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4d878041d86bf8a1419606fa07609e70416196bc20135378dcbcf1add7b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1703-1710 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1720-1728 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:1703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2c15c2a3cbc3b10f53147120c368b5eb27528ed3e0ebbb6d7cb25e0ccfbb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2258-2265 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:2314-2321 \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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae6ec919f1759020d6214e52c63e2ab8021c13a2044bec3e8b0513dd858cc91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2934-2941 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2986-2993 \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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3633ecff3ebc746db55abccd5d82e3b65c855d8608fdb541fe56870dfea2bfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:2778-2785 | rust_port/crates/flow_typing_utils/src/type_env.rs:2802-2809 \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 \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:2778\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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6045fd81bce1139926f1c7b2f0e546d0485297deb73cea45c819a0126f7337b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:430-437 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:675-682 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:430\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"575db97163b9bc3f28b6f8ac6613d3ae0cf30930feec94f31adbde462d72744e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:512-519 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:3059-3066 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:512\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:521\u0060 calls \u0060MixedT\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:3068\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc209ac9aabf88509027d92c475398be81a68b5a3b7a7f0e9312ce4d594ec9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1130-1137 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1265-1272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1130\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8d5c31adc2f6802a0e21f520167a2113b1b6325d65b5c3eab14695dd6eb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:3020-3027 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:3057-3064 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:3020\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5212195e60afda9d04a5e4b28d229f22a9cf392b733f091c7d5f9a45421c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3119-3126 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3138-3145 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3119\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"606dd85a138158f187b62101cfbe48351b734f7ff5364a49ab12b75137768cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3905-3912 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3956-3963 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0428afe1bdbba9b836b0b12253f631d4f5751e9f2e16a412d25f54684376154d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4842-4849 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5568-5575 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4842\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e600634ccb62359fa84b13513ac5b07357b9d1a285666b5630a4dee064f69b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_watchman/src/lib.rs:487-493 | rust_port/crates/flow_watchman/src/lib.rs:495-502 \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 \u0060rust_port/crates/flow_watchman/src/lib.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_watchman/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"377575a7b32a7eb3436ed9b103c95f6644a49f8129d36437fbe9d154fb067cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 9): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2373-2379 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2390-2393 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2394-2400 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2421-2427 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2495-2501 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2509-2512 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2554-2560 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2632-2638 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2784-2790 \u2014 all 9 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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2373\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 before the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2371\u0060 calls \u0060Reason\u0060, \u0060dupe\u0060, \u0060merge_impl\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2390\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f640e200423270a97773817ee755ecd80ec8550927c16305337b770460db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): rust_port/crates/flow_cli/src/autofix_command.rs:36-42 | rust_port/crates/flow_cli/src/autofix_command.rs:274-280 | rust_port/crates/flow_cli/src/autofix_command.rs:418-424 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:31-37 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:31-37 | rust_port/crates/flow_cli/src/type_of_name_command.rs:26-32 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/autofix_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/autofix_command.rs:36\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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"47797667899a02b180a8c425d2decc6aa2e0970ee21a2f747cdce76ad3dc581a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): rust_port/crates/flow_cli/src/lib.rs:386-392 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4222-4228 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4280-4286 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:4641-4647 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:8078-8084 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4230\u0060 calls \u0060map_err\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4288\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":"rust_port/crates/flow_cli/src/lib.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3178dab6b5a916d8d7958b06ee0de017173bc7c3be8c871f621cfe3ff9b632b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_analysis/src/property_assignment.rs:664-670 | rust_port/crates/flow_analysis/src/property_assignment.rs:702-708 | rust_port/crates/flow_analysis/src/ssa_builder.rs:879-886 | rust_port/crates/flow_analysis/src/ssa_builder.rs:924-931 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59e061d66bd6d38b718eb3806640d633875477037c67b42fe57ac7d96b1f0a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4586-4592 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4601-4607 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4615-4621 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4629-4635 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4586\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4594\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4609\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"51116a7346aaeae6f187b6b926f4204375262196739eea8575c2cd2b2e087a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:3116-3122 | rust_port/crates/flow_typing_statement/src/statement.rs:3257-3263 | rust_port/crates/flow_typing_statement/src/statement.rs:3499-3505 | rust_port/crates/flow_typing_statement/src/statement.rs:3604-3610 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3115\u0060 calls \u0060at\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3256\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe5bd7978e4a7854c315df3fea7838fbafbfc54727fac3fb31656bcf471b7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:17544-17550 | rust_port/crates/flow_typing_statement/src/statement.rs:17763-17769 | rust_port/crates/flow_typing_statement/src/statement.rs:18501-18507 | rust_port/crates/flow_typing_statement/src/statement.rs:18677-18683 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:17544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18676\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18500\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":17544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dfc4d0a24367f1763e5bc8d58e7752a9ebb04cb2ae16d23ec365d91435bb40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_typing_type/src/type_.rs:4493-4499 | rust_port/crates/flow_typing_type/src/type_.rs:4502-4508 | rust_port/crates/flow_typing_type/src/type_.rs:4511-4517 | rust_port/crates/flow_typing_type/src/type_.rs:4520-4526 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:4493\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"957590217bd2e1888a5722ed3b80c55440e0c5b9e65101189ebeef6181093b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:588-594 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:618-624 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:899-905 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:929-935 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:588\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"629961814b408d00123ebc42f28592da90ceb5e068692ca53548bef03972c5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 6): rust_port/crates/flow_cli/src/agent_helper_command.rs:247-250 | rust_port/crates/flow_cli/src/autofix_command.rs:167-173 | rust_port/crates/flow_cli/src/autofix_command.rs:339-345 | rust_port/crates/flow_cli/src/autofix_command.rs:508-514 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:95-97 | rust_port/crates/flow_cli/src/type_of_name_command.rs:162-164 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/autofix_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note 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 before the matched lines, \u0060rust_port/crates/flow_cli/src/inlay_hint_command.rs:94\u0060 calls \u0060get_connect_flags\u0060 and \u0060rust_port/crates/flow_cli/src/autofix_command.rs:167\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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b383a986f89c1228513b1d8caf9737bbdac221c4a225080d76c769da0949a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:9028-9035 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:9048-9055 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:9072-9079 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:9028\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9028}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b314a66f0c141dada65f25c3f312d9f30572ee2d1dca104a301e91ef3ce6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_parser/src/object_parser.rs:1091-1097 | rust_port/crates/flow_parser/src/object_parser.rs:1166-1172 | rust_port/crates/flow_parser/src/object_parser.rs:1860-1866 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/object_parser.rs:1091\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3b52b367a820ba7c6672c0141262b18a8a676979eba26e79181a41bbbb6bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_parser/src/object_parser.rs:2080-2086 | rust_port/crates/flow_parser/src/object_parser.rs:2096-2102 | rust_port/crates/flow_parser/src/object_parser.rs:2112-2118 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/object_parser.rs:2080\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"74412c069d559d1c3e1ec7f63bdf6b906f4462b0e793383e3c394b09451cdc26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2339-2345 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5357-5362 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6986-6991 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5355\u0060 calls \u0060type_args\u0060 and \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2337\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44d1b6b932c045aa964d3bc905f259792e19cf8c2e4aa26ca9cd05444cc64da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8871-8878 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8896-8904 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8912-8920 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8896\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40cded5012dad1f883119c4dc212aaa823c3e3fabed360174fa01810f30a9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14998-15004 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15010-15016 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15022-15028 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14998\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14998}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9819af670550aac010d40a4cfc864df571475a34b5bd819da5c2c695041303b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): rust_port/crates/flow_typing/src/env_resolution.rs:3410-3416 | rust_port/crates/flow_typing/src/env_resolution.rs:3432-3437 | rust_port/crates/flow_typing/src/env_resolution.rs:3453-3458 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing/src/env_resolution.rs:3410\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"16de31814a1f3a4168de401270bc9d59e799abbae11c7b141d28f07c6f15b8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 4): rust_port/crates/flow_typing/src/merge.rs:359-365 | rust_port/crates/flow_typing/src/merge.rs:378-384 | rust_port/crates/flow_typing/src/merge.rs:397-403 | rust_port/crates/flow_typing/src/merge.rs:414-418 \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 \u0060rust_port/crates/flow_typing/src/merge.rs:359\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 before the matched lines, \u0060rust_port/crates/flow_typing/src/merge.rs:359\u0060 calls \u0060DefT\u0060 and \u0060rust_port/crates/flow_typing/src/merge.rs:414\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":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef36823039882ce3f35b6bd6cedc149dc677798e2b64667341d8ca0464cf4191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing/src/ty_normalizer_flow.rs:97-103 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1112-1118 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1051-1057 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_normalizer_flow.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afd9e1afc880c0e35bd344765e16f4d5298e12db24a0f966928ee5eacde2132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8540-8546 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8571-8577 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:8590-8596 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":8540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a137503fc7466e10c5aa7306d7f0b6e958f8f512bb8af72092e2a4e998cb7f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3304-3310 | rust_port/crates/flow_typing_flow_js/src/intersection_kit.rs:117-123 | rust_port/crates/flow_typing_flow_js/src/intersection_kit/objects.rs:199-205 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3304\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90684c1fc1fa62b504eb7c1a372b11da4ff67766f3d856c85ddf5af10f9f69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:7898-7904 | rust_port/crates/flow_typing_statement/src/statement.rs:8376-8382 | rust_port/crates/flow_typing_statement/src/statement.rs:8926-8932 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7898\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7898}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54bd9dbf0fb7f4f99f7aecb3e3af5664631f7ce27e554d9e621792fdb803ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:14587-14594 | rust_port/crates/flow_typing_statement/src/statement.rs:14615-14622 | rust_port/crates/flow_typing_statement/src/statement.rs:14666-14673 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14587\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77113aded7be8d77707b106bd1372548681dc2f7eb5467cde4e2f819658fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:275-281 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:617-623 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:928-934 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:275\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb8ff04573a11333a71ceb4f2513aef529d9e319517b2f2a64c060377ee3648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1130-1136 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1187-1193 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1265-1271 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1130\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d6fa130ef50dc9458b81afa8c0991109eb6bc617ba17ce67c47ea4ec94eef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5602-5608 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5690-5696 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5712-5718 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5602\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5f3f404759464e62fd70ff05c5ac431bf6f2c245977584749c3303e4445948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:217-223 | rust_port/crates/flow_parser/src/ast_visitor.rs:17602-17608 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:217\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"31931ce7f7cbe5f8962a37155358093bdc31cc5fdf5f187ebd0b2fd45bb3313d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:992-998 | rust_port/crates/flow_analysis/src/scope_builder.rs:1077-1083 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:992\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7b85d730b2780f44f9dae406458456ae6e5f3d5e9908d74743fc206756b56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:1991-1997 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1903-1910 \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 \u0060rust_port/crates/flow_analysis/src/scope_builder.rs:1991\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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea692e43ecb36db3ecfdfc94b8a77a6a187adda5641b799ea5651d1defd424a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_errors/src/error_utils.rs:4752-4758 | rust_port/crates/flow_common_errors/src/error_utils.rs:4772-4778 \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 \u0060rust_port/crates/flow_common_errors/src/error_utils.rs:4752\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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de29dc25b8f438c96b207cdfc439fd4b9f82cdd3a510f74cd07bd6e6ed42f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty.rs:4979-4985 | rust_port/crates/flow_common_ty/src/ty.rs:5037-5043 \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 \u0060rust_port/crates/flow_common_ty/src/ty.rs:4979\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":4979}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1ab658aaaff6c2c996130ae62122601f1c9f535c9ea7a229f023a8c257c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_debug.rs:1501-1508 | rust_port/crates/flow_common_ty/src/ty_debug.rs:1510-1517 \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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c18041cdfe420fd4662f17746c2882cd6b488688f28bc52c8b06b1624bec75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_utils.rs:676-682 | rust_port/crates/flow_common_ty/src/ty_utils.rs:790-796 \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 \u0060rust_port/crates/flow_common_ty/src/ty_utils.rs:676\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":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b530c525e2eecd6a8c61b487b03bf22820599898b09ad01228c37de2f749825c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_utils/src/list_utils.rs:50-56 | rust_port/crates/flow_common_utils/src/list_utils.rs:102-108 \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 \u0060rust_port/crates/flow_common_utils/src/list_utils.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_utils/src/list_utils.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a64541f155484c0b7c7c451172cd4c2b36bc87ac42ff0d458d7bf8c90e288bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:124-130 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:158-164 \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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"596ecfb43107d46dfdd36dbe41f5c711c5cf479d449a66f0a5c88eb0ea1213c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:3397-3403 | rust_port/crates/flow_env_builder/src/name_def.rs:3422-3428 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:3397\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cea72fda0380f0683dbd9c1eec86f74adecb05c679156e6c95ed502ec4935c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:4365-4371 | rust_port/crates/flow_env_builder/src/name_def.rs:4375-4381 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8a6e7c1037bc3a4b62a08f1614018ad22afce4f1b58a5cbd6040d06fab7cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5456-5462 | rust_port/crates/flow_env_builder/src/name_def.rs:5538-5544 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5456\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd79dc7e2b080b2d1ecb85c084d1c7a5a9209c5c6a248a243c7e86b1b7b6397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:390-396 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:401-407 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:390\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28628900f4e69a8df4b0ce75543c2e328314572c7ee9393dfdd75fd883c663c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:911-917 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:929-935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060prop\u0060 to \u0060\u0026ast::class::Property\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026ast::class::PrivateField\u003CALoc, ALoc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe7cf9f423e039c4bdcd5375530a2d0d8a0254f3f0743f2d720c1e6e2bdbe36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3114-3120 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3271-3277 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3114\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0278a2122e8add3e46d456d5b599125a6ad66200c012d6f97c8b6caace7db74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:376-382 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:386-393 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:376\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f84a317c77ee6b17bba60c4d5cb81ed891689a9fd70a5f3d2b5a43f7349277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4697-4703 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4726-4732 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:4697\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4697}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ac5699f8648a8018db04daf6861d8a54ffa29ff7523a64a04ddca192bac51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11922-11928 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11974-11980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060m\u0060 to \u0060\u0026flow_parser::ast::statement::DeclareModule\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026flow_parser::ast::statement::DeclareNamespace\u003CALoc, ALoc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11922}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d81345774a99e16579b89828c35bed76862b844b1ada675e58fa0ff7f4899c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:227-233 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:467-473 \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 \u0060rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:227\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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ccb1a79276c6aee3d948fffa58646eb2a418ba63f8688bcb4e5aa1af4cf6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:308-314 | rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs:316-322 \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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edc61161eff2c2f17db3f0af9a659b3ceaee031fca0910bce0a31e9c61cbe85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:7198-7204 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:2500-2506 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_parser/src/ast_visitor.rs\u0060 and \u0060rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/ast_visitor.rs:7198\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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7198}}}],"partialFingerprints":{"codehealthFindingId/v1":"977c3c5054353d9ac4a918a2cb90dee5227bc1b2da420857e135d2fce8e1d832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:7849-7855 | rust_port/crates/flow_parser/src/ast_visitor.rs:7948-7954 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8d478b890c2d8ede50f46a62c1a407b2f09f17bff40817406219856bd46997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:715-721 | rust_port/crates/flow_parser/src/declaration_parser.rs:723-729 \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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded2a4ec78e96d94f7830ab1ca7213ab56f384d9759e82474c48f024b01790f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:919-925 | rust_port/crates/flow_parser/src/object_parser.rs:1859-1865 \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 \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:919\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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ad1fdd9cfcf9e4264da9accf66363a1913a07c5377e08090aa021eb6a6cd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:1983-1989 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:5424-5429 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:1983\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"f782684b3a13dc1091550b7c181b33c5de445e11f9a9b190d99976068ca0f33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:523-529 | rust_port/crates/flow_parser/src/flow_lexer.rs:534-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:532\u0060 calls \u0060Some\u0060, \u0060strip_prefix\u0060 and \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:522\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cdd3722430eaf0cbc3f59f1770f1c0d191d8166e8debcdbc87476e2f146a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:803-809 | rust_port/crates/flow_parser/src/flow_lexer.rs:2444-2450 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:803\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"71464f9f93e23f025986eda538286ec1254c24c2823c3a159be713d13163ba81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1205-1211 | rust_port/crates/flow_parser/src/flow_lexer.rs:1275-1279 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"44219fe6708f757e9ad76ed4dfcd71106c717ee7bd25d31403293fad8dbc95e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1548-1554 | rust_port/crates/flow_parser/src/flow_lexer.rs:1566-1572 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1548\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bbc8f262ad2f85d8e25f2815e00aa3f1efb56b82043f2cb1e40d644d259b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:2382-2388 | rust_port/crates/flow_parser/src/flow_lexer.rs:2455-2461 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:2382\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a2a1dfd16eb11afc04a65b2ccb426c8df867082251674f7ca5cec813586015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): rust_port/crates/flow_parser/src/match_pattern_parser.rs:119-125 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:133-139 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:221-224 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:119\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 before the matched lines, \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:132\u0060 calls \u0060loc\u0060, \u0060dupe\u0060, \u0060token\u0060 and \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:221\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"88eeca3f076196f1cd1810641695669038e5a033790377887a796ca7d9431d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:153-159 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:507-513 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:153\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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"98664da7e9dc5b27b5abc41ee029ce000d5a1a346bd70fb5fbd25281b0df68f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:784-790 | rust_port/crates/flow_parser/src/object_parser.rs:2189-2195 \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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a50e3dbb1a0cee5853555e1f7bbc0011cbfe37a5f83285741afc4333b88199"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:320-326 | rust_port/crates/flow_parser/src/object_parser.rs:1724-1730 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:320\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":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"683c2be930433aa79d072574de58a91ba813abfc6955ae8bb9964578c722121b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/parser_env.rs:1834-1840 | rust_port/crates/flow_parser/src/parser_env.rs:2316-2322 \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 \u0060rust_port/crates/flow_parser/src/parser_env.rs:1834\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":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd700cd03c46763f02c33786ebf078d86b3f42e6929808ede5049ce2474ab771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:4355-4359 | rust_port/crates/flow_parser/src/statement_parser.rs:4411-4417 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:4355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3d2fee980d84a29508758183592c950b12930b297a86272e95ff68f30281c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:3785-3791 | rust_port/crates/flow_parser/src/type_parser.rs:3812-3818 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:3785\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":3785}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7625460cecc3fd89afbb4906815ee1b3db0416b0ea2da3b3d00d99484634f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/enum_validate.rs:498-504 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:508-514 \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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b0fc98a95bb813439ce2f1bf7e04ee9d39155e06f20c90d2552c8e8a2961b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:3645-3649 | rust_port/crates/flow_parser_wasm/src/serializer.rs:3673-3679 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:3645\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2283a14cf5191c448860532e11750d6e9b9cc5e3ac803765ba33bf405240b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:4487-4494 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4503-4510 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inner\u0060 to \u0060\u0026ast::types::Union\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::types::Intersection\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa94e665a1e73cb85e12c779634a191195b7cbd39c44c11edcaad23fe295c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:96-102 | rust_port/crates/flow_services_inference/src/type_service.rs:2520-2526 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_server_rechecker/src/recheck_updates.rs\u0060 and \u0060rust_port/crates/flow_services_inference/src/type_service.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_server_rechecker/src/recheck_updates.rs:96\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":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"830fbee169b04537f0b418215b5c06777142d968bfa83033a3d2bbdc46e686fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:681-687 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:720-725 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:681\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"96702de73d801601388f4a40a4c2b356eb69772be15b085db619934ac112617a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): rust_port/crates/flow_services_inference/src/merge_service.rs:257-263 | rust_port/crates/flow_services_inference/src/merge_service.rs:340-346 | rust_port/crates/flow_services_inference/src/merge_service.rs:357-360 | rust_port/crates/flow_services_inference/src/merge_service.rs:377-380 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:257\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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 before the matched lines, \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:255\u0060 calls \u0060downgrade\u0060, \u0060Fn\u0060 and \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:357\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5aa31293948eab622dd9b7039278523feee594a00ca0d8883a2f371f74f73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:1524-1530 | rust_port/crates/flow_type_sig/src/type_sig.rs:1532-1538 \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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa97fda82aaf3dfc423639636950317d3a568e88c879a08f6f3e83ae686f3250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13487-13492 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13544-13550 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13544\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13487}}}],"partialFingerprints":{"codehealthFindingId/v1":"e656c295112e7e23653c0b6c68b6a0e66a50c447ea0317cb22939d308cf52b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14673-14679 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14737-14743 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14673\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14673}}}],"partialFingerprints":{"codehealthFindingId/v1":"209398454b36256f4c9399b90e50459032325c141f3a06e6901d8c49e6a5b32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:2445-2451 | rust_port/crates/flow_typing/src/env_resolution.rs:2499-2505 \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 \u0060rust_port/crates/flow_typing/src/env_resolution.rs:2445\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a7e65bb40b18eb14b9577b3a4d3dc3ca8f2b1dc65d2293d79d0f3002f67a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing/src/type_inference.rs:964-970 | rust_port/crates/flow_typing/src/type_inference.rs:1220-1226 \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 \u0060rust_port/crates/flow_typing/src/type_inference.rs:964\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b8002b14081f1fea16200d22f9f3d402ffb08f72b013596fe6ab14364c67c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5599-5605 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5636-5642 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5599\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5599}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bedf22b65e43f2e2e16586dace1844fa49bfda725230455f05abea2650e671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1361-1367 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3514-3521 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1361\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e0e19a2969197385274614f2bc2a6e21108da5b79bfc8259cf89fe6b0cd2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2994-3000 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3102-3107 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2994\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf2a5acf1a49862b8d883ae021e1722cf4c59b602f5f89d970ddd4d02c9e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:651-657 | rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:659-665 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:651\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8ffef80d3b550215d281c06fc1dbf824eac26859d0cf2e268f2e9c67ad92b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:620-626 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:652-658 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:620\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9ecedb04a556cdf15a143d5d841ab7a928d719d155b45d23f0168ea5d48165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/object_kit.rs:512-518 | rust_port/crates/flow_typing_flow_js/src/object_kit.rs:1290-1297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"533327fc194cd7b83bbd3bfbd85772d5865ebce867d0eaaa01dd331c683a7fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:956-962 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1021-1027 \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 \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:956\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c4aaa2d5140241643b248b0d9bd13c446943a763e5f070f5273cdaf3dbec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1239-1245 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1586-1591 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dcda8212f95507ab4cd32d4ed376d59f60993706ec8c67b7a4971884306c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:624-632 | rust_port/crates/flow_typing_statement/src/statement.rs:752-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:624\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b21c31839333c51dff3118387ce5f4b10fd44dfefc99b089b4e987dff59d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:10259-10265 | rust_port/crates/flow_typing_statement/src/statement.rs:19471-19477 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5c46e56e9b328c90604486c78feea9d656e4810450b9c5ff758974d57dfe01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:12917-12924 | rust_port/crates/flow_typing_statement/src/statement.rs:15080-15087 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12917}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fdf70501b817aef464ff25f772c6c3ab0d29a39fafce036c407c5c62f822ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:14446-14452 | rust_port/crates/flow_typing_statement/src/statement.rs:14471-14477 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14453\u0060 calls \u0060dupe\u0060, \u0060replace_desc_new\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14478\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14446}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c642c3ea4891c096f0139af8565ba14a9d5608294f71ed2e43a43efe260df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:15987-15993 | rust_port/crates/flow_typing_statement/src/statement.rs:16015-16021 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:15987\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15987}}}],"partialFingerprints":{"codehealthFindingId/v1":"5226b221adb3626a245a609c15a679a5f2526e37d52df7fe603c83a07fe2d76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:3851-3856 | rust_port/crates/flow_typing_type/src/type_.rs:4461-4467 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:4461\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ccb3d8b19a6db0d365f2a3fec1d24a61a0777f8729d2403a683cef9142acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:7363-7369 | rust_port/crates/flow_typing_type/src/type_.rs:7546-7552 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:7363\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":7363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5dfc0c028c9a1a879e9ca9f24329dd53e868516db0119c7f920181f001ae7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:340-346 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:445-451 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:340\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"793684467e01ea139720028bd0f937feb04cd5f80e242836c44b0bf7dfde9ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2870-2876 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:3140-3146 \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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"4038020b8ebac455f060ac50156dd7743478fd4747c151dbee7915f2f6fa003f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:601-607 | rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:633-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs:601\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":"rust_port/crates/flow_typing_utils/src/strict_es6_import_export.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c9b587630d3bca6039cdf1ee6dbfc3d5abf63527f446e7a2337a08c02ec2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_hint.rs:709-715 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1655-1661 \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 \u0060rust_port/crates/flow_typing_utils/src/type_hint.rs:709\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"77100c39cd38deb505f6acdd8608f81479d4ef064804180fb4de4b48a1f6a4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_hint.rs:1364-1370 | rust_port/crates/flow_typing_utils/src/type_hint.rs:1499-1505 \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 \u0060rust_port/crates/flow_typing_utils/src/type_hint.rs:1364\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":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7541abd3cd5121f67e1740c02b5fb17aa6d42aced60cb4a92b8a3f3baf94ed34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1112-1118 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1171-1177 \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 \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1112\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14cbfd41f89d2e70c8be3399f34d739eee0d71773a726fe457973ca6286efd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:679-685 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:719-725 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:679\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037290ef24f8a7ea8d6bba151de137c7ba3b664750bfe7a6cc7ad0a039aeb87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1846-1853 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1895-1902 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8606a0651defeb389a03140ad5837bf27fc0ef86561ad48d111df3fd7a8d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3193-3199 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3227-3232 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e005633cc35e62b33302fa778ade66eb4e09d0caaf7cce33351e9a740fb4aec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5373-5379 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5467-5472 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5373\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":5373}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af787a7806ae79a941abba1b8992e6d23a245cb0061b6d33551cb367f0b8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): rust_port/crates/flow_cli/src/codemod_command.rs:823-829 | rust_port/crates/flow_cli/src/codemod_command.rs:942-948 | rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs:154-159 | rust_port/crates/flow_codemods/src/utils/codemod_annotator.rs:481-486 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1276-1281 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2245-2250 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2330-2335 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2413-2418 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3912-3918 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/codemod_command.rs\u0060 and \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/codemod_command.rs:823\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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"e317b78f46ac8b20976956e57a14b874b96808a323996b30f7e515ae39abf0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:279-285 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:546-552 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:561-567 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:576-582 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:591-597 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:606-612 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:621-627 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:636-642 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:279\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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6366d55304561cc6baa13f767ced29a4a51a103872d3584e981459c02c91435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 6): rust_port/crates/flow_typing_type/src/type_.rs:3780-3785 | rust_port/crates/flow_typing_type/src/type_.rs:4470-4475 | rust_port/crates/flow_typing_type/src/type_.rs:4502-4506 | rust_port/crates/flow_typing_type/src/type_.rs:4511-4515 | rust_port/crates/flow_typing_type/src/type_.rs:4520-4524 | rust_port/crates/flow_typing_type/src/type_.rs:4529-4533 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_type/src/type_.rs:3780\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_type/src/type_.rs:4476\u0060 calls \u0060then_with\u0060, \u0060cmp\u0060 and \u0060rust_port/crates/flow_typing_type/src/type_.rs:4507\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3780}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6dc736c9dc25e0f28f4e6f0edeb5959314aee7015536420c8475ed341fb3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): rust_port/crates/flow_typing_utils/src/type_filter.rs:1139-1144 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1239-1244 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1363-1368 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1412-1417 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1459-1464 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1139\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8afaae18ea85f2642c73788315cd2df1adbdb57f7c188dd0f07a0384828011c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_cli/src/batch_coverage_command.rs:155-160 | rust_port/crates/flow_cli/src/coverage_command.rs:375-380 | rust_port/crates/flow_cli/src/dump_types_command.rs:149-154 | rust_port/crates/flow_cli/src/find_module_command.rs:43-48 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/coverage_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:157\u0060 calls \u0060get\u0060, \u0060optional\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/batch_coverage_command.rs:162\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":"rust_port/crates/flow_cli/src/batch_coverage_command.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aba147fdb539c7de0b08354e297d03dd27eec71ede3e4ac98ff05102d582e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_parser/src/declaration_parser.rs:920-925 | rust_port/crates/flow_parser/src/object_parser.rs:1091-1096 | rust_port/crates/flow_parser/src/object_parser.rs:1166-1171 | rust_port/crates/flow_parser/src/object_parser.rs:1860-1865 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"167445da73801be0fb643b1452f7786057f3bc7291461f0b6ddfeb758131c5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_services_inference/src/merge_service.rs:245-250 | rust_port/crates/flow_services_inference/src/merge_service.rs:328-333 | rust_port/crates/flow_services_inference/src/merge_service.rs:348-353 | rust_port/crates/flow_services_inference/src/merge_service.rs:368-373 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:245\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"111ae5e4b9a77d1f153051f5a89ae24ac69598f35b975ca9211a7debb723b51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1128-1135 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1155-1162 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1187-1194 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1232-1239 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1163\u0060 calls \u0060annot\u0060, \u0060in_implicit_instantiation\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1136\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9381489410edfe1f0cc1b41423698b312678da04f35e5782979025ce5ee79fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:5344-5349 | rust_port/crates/flow_typing_statement/src/statement.rs:5444-5449 | rust_port/crates/flow_typing_statement/src/statement.rs:5505-5510 | rust_port/crates/flow_typing_statement/src/statement.rs:5588-5593 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5344\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5344}}}],"partialFingerprints":{"codehealthFindingId/v1":"3742e2a6c0b3a2423a358e70ea2a5b80043f11863f69e562895ca701a4e02280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:756-761 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:778-783 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:955-960 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:977-982 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d176112102b68a7dba6ebc0e2ccd9d4e12277b8e463bc5fb226faa8ad1ff872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_typing_utils/src/type_filter.rs:427-432 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1092-1097 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1186-1191 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1316-1321 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:427\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eacc4eaa31009c5546fd55c120dd04c2e1ab97d675f1490913277d283ebb1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_cli/src/agent_helper_command.rs:113-118 | rust_port/crates/flow_cli/src/dump_types_command.rs:28-33 | rust_port/crates/flow_cli/src/get_def_command.rs:23-28 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs:111\u0060 calls \u0060add_reason_flag\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:26\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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7339ff39b826f8dfc125ec400f3837161d0208ecd9f18fa3817488f2c538f821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_cli/src/apply_code_action_command.rs:75-81 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:182-188 | rust_port/crates/flow_cli/src/autofix_command.rs:328-333 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/autofix_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/apply_code_action_command.rs:75\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/apply_code_action_command.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a484c34a72e41667833485ae272c5f82ee88507a62f4627a6425fd9b11155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_codemods/src/annotate_exports.rs:315-320 | rust_port/crates/flow_codemods/src/annotate_exports.rs:627-632 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:254-259 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs\u0060 and \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:315\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e409ba8962f02c61fbdc2bbd5e7977da376c77c7f8e1f7e8c6ea7061af681b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_common/src/hint.rs:238-244 | rust_port/crates/flow_common/src/hint.rs:245-251 | rust_port/crates/flow_common/src/hint.rs:270-276 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/hint.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9ce958915d9653b40650d41aef26a2399ae0c092da59f3c615af8eaf72a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:803-808 | rust_port/crates/flow_parser/src/flow_lexer.rs:1853-1858 | rust_port/crates/flow_parser/src/flow_lexer.rs:2444-2449 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:803\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d9932de59aa7a008a69772b8c38935c8ee89094c49576d5c0e83d078845407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_parser/src/statement_parser.rs:4079-4084 | rust_port/crates/flow_parser/src/statement_parser.rs:4100-4105 | rust_port/crates/flow_parser/src/statement_parser.rs:4120-4125 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/statement_parser.rs:4079\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8b7c423ae3c70889feda70b88a4c47115b113da0fa0c28f91b5bb9318d9506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3197-3202 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3442-3447 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3526-3529 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3816-3820 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3197\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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 before the matched lines, \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3440\u0060 calls \u0060diff_if_changed\u0060, \u0060expression\u0060 and \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3195\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20ac6e54b4e73f3e9bfb05c3f1ff68059854d4fa9942c4adb3958b469ffcb0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:136-141 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:158-163 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:180-185 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:136\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":"rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ac6c6dfc7a2457c7fe5b16f44f34916b1bbec374a541f902759c73c3287703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8034-8039 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8055-8060 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8067-8072 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8034}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b8edd761c938d2f40b73417763464956f50a5942dc644af11533e80363538c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8493-8499 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8504-8510 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8592-8598 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47b0a437f1e5215b999371ceed3be4f768cf3b198fa094fb9f586f11fbeb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8804-8810 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8842-8848 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8939-8945 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8804}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4e34a51aa5d8a8b909217f2723e4b3975ff1e5143c1cbb0e0f003030d086a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2693-2698 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1313-1318 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1394-1399 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2693\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac2976ea71679306d765e2be49dc5b3b4de99bc184474a341e88ee1b9c46a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1659-1664 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1686-1691 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1709-1714 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1659\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"260a2f5aca4c1376c5c0344ffcf41a6b042e6979b97fc3d250cad12387247b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4196-4201 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4205-4210 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4251-4256 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d1814920462018b76cee56d1e6df5e1a0cc2d661970ef951349dd990da4ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:462-468 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:471-477 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:480-486 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b617b25d5939fe4a17aa59ba69c03793107c0b0b2a44a791e73af82c42c7378e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:531-537 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:539-545 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:548-554 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a1b7410e68cb31705b7e3fac444168f72ddd59cabef325ac137d1a492d4f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:4273-4278 | rust_port/crates/flow_typing_statement/src/statement.rs:4390-4396 | rust_port/crates/flow_typing_statement/src/statement.rs:4508-4514 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4273\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b5997e805e17836b6fb3677d7e1971a760bdb45cddcb9fb1efdabb2003ce34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:10007-10012 | rust_port/crates/flow_typing_statement/src/statement.rs:10083-10088 | rust_port/crates/flow_typing_statement/src/statement.rs:10159-10164 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10082\u0060 calls \u0060Ok\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:10007\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f985a7ba951892f1b5fc94c06109c2ff9e41fdc54d3f1294b2b2d1c417ff7683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:10259-10264 | rust_port/crates/flow_typing_statement/src/statement.rs:18138-18143 | rust_port/crates/flow_typing_statement/src/statement.rs:19471-19476 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":10259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0445dea0621134066c1a55d3fe40e8f32d57034e59fb1e6eaf948b8fd7ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1112-1118 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1171-1177 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1224-1229 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:1112\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":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ebc1b5573ab8c9a8de89b99ded37543dabfe5289fb7675173e59435e452afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:650-655 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:679-684 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:719-724 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2975ce5aef408fa4a136348dd5dec8d746da9d64a6d7d8cf2d87b4b9d3ca7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_analysis/src/scope_builder.rs:1954-1960 | rust_port/crates/flow_analysis/src/ssa_builder.rs:1536-1542 \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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb7e1cd898888bf19dad4c6bdccb4c04770b51a154970441ce1f6e1fa66cc18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:423-428 | rust_port/crates/flow_cli/src/glean_runner.rs:1034-1039 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:423\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ee3ec6048c501ace3e3ce3c526c814fb86c48db342ea850128c9c4b621d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_cli/src/lib.rs:163-168 | rust_port/crates/flow_server_monitor/src/flow_server_monitor_daemon.rs:303-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_server_monitor/src/flow_server_monitor_daemon.rs:302\u0060 calls \u0060Some\u0060 and \u0060rust_port/crates/flow_cli/src/lib.rs:162\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":"rust_port/crates/flow_cli/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded7e608fd1085ec94df141dd79b7ccf220c9bd7a158a8ce162980610787f5d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_common_utils/src/list_utils.rs:53-61 | rust_port/crates/flow_common_utils/src/list_utils.rs:77-85 \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 \u0060rust_port/crates/flow_common_utils/src/list_utils.rs:53\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":"rust_port/crates/flow_common_utils/src/list_utils.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3049c165a9cc3ad1d2c59c02cb75b533078ad0b3e59ebf9cfb1b0b949daff4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2967-2976 | rust_port/crates/flow_env_builder/src/name_def.rs:3111-3120 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:2967\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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"04880d9a0d957da6ac0107fbef967ed2687965cfee1c72d759c4951ce1bb4e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11108-11113 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11335-11340 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:11108\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":11108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ed27875d883e6a277c2e1a52f4654ae2cdb10239ad5e1836da24b1db86df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/enum_parser.rs:195-200 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:326-332 \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 \u0060rust_port/crates/flow_parser/src/enum_parser.rs:195\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/enum_parser.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7461a312d8e4f53bbcd1320ca6af5568e3609b6a25e2989ff663b430c5c8f36e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:4911-4916 | rust_port/crates/flow_parser/src/estree_translator.rs:4927-4932 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:4911\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":4911}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1d0b373bd7daf5ecaac33250aeca2d478fd28cbbea02b34cfa9f09eb09d12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:2482-2487 | rust_port/crates/flow_parser/src/flow_lexer.rs:2674-2679 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:2482\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e91404f4c7b6fabd24d707be46935dd7565b36a79a10f9b2abda8afab55e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/jsx_parser.rs:188-193 | rust_port/crates/flow_parser/src/jsx_parser.rs:223-228 \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 \u0060rust_port/crates/flow_parser/src/jsx_parser.rs:188\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":"rust_port/crates/flow_parser/src/jsx_parser.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab36c2e47b9dd6c47a0aaf09962b6004a571d6959aa355eb813ee5c8ec0674bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/parser_env.rs:1413-1419 | rust_port/crates/flow_parser/src/parser_env.rs:1424-1429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_env.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87d90ce8939f2fa326024b19189906fb61a88c7aee3ad6ecdeaf16d32bf6050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6473-6478 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6752-6757 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6473}}}],"partialFingerprints":{"codehealthFindingId/v1":"32801b72d4cfe0ef4c209f38e4be47077366175ed396d5a6c3e0a228480259d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/enum_validate.rs:126-131 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:182-187 \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 \u0060rust_port/crates/flow_parser_utils/src/enum_validate.rs:126\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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23a60d0622103080d3e1fa7c943fc77a5ade664d6aa2b54e5700f700a8edbfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2765-2770 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3862-3867 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:2765\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53ae1461f0ae6d6099db25ce8817c111d9364f96c3ce8c120934558a15bfef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3961-3968 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:4052-4059 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3961\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"004db607340ce64cf1937827f9afcff0da248d0b445d03bb99fa50b442c115a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6894-6899 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6985-6990 \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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6894}}}],"partialFingerprints":{"codehealthFindingId/v1":"372d1e22262e1ba3ad8d16290588c26c63a84da374ecaa8400616760c60ba1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:548-553 | rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:367-372 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:548\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e0db4c51b183741d9c2e214bbd8512c411e37a2a67f382ed8edc42af6f8167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:996-1002 | rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:1088-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060match_\u0060 to \u0060\u0026expression::MatchExpression\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026statement::MatchStatement\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2ddfc2d9853fdde977b0da46601fbe1a7933d17b1b9546a8eaba55784813e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:4733-4738 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4739-4744 \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 \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:4733\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":4733}}}],"partialFingerprints":{"codehealthFindingId/v1":"af039680be8e36333e06895584c0359d21d40b9b09178d23c033a48454148cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:751-756 | rust_port/crates/flow_services_type_of_name/src/type_of_name.rs:633-638 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"071610315aa1b9c736fef2333937a037b6f454ee72ba05ac6fd9f787b582a30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:4640-4645 | rust_port/crates/flow_server_utils/src/file_content.rs:150-155 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:4640\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00387ba6c08bc23836b0bddd9ea9d9b98d61bb4a9951f3cfca4356653b91055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:227-232 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:254-259 \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 \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:227\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":"rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"51572919d04652482e664392a90a7b3a58ab18237bbfef70d856f5fbc5eff019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_export_index/src/export_index.rs:189-194 | rust_port/crates/flow_services_export_index/src/export_index.rs:261-266 \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 \u0060rust_port/crates/flow_services_export_index/src/export_index.rs:189\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":"rust_port/crates/flow_services_export_index/src/export_index.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df44f03f15331541949a5cb84f299660e0ea633f9a35d7f37cc2148e4aec834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:274-279 | rust_port/crates/flow_services_inference/src/merge_service.rs:576-582 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:576\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a52768bda11b152f9d38aa1a464300d3b0aec3fbf439a6a8ca78c693f9c2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_inference/src/type_contents.rs:371-376 | rust_port/crates/flow_services_inference/src/type_service.rs:1625-1631 \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 \u0060rust_port/crates/flow_services_inference/src/type_contents.rs:371\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":"rust_port/crates/flow_services_inference/src/type_contents.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc6082f6b7706f220b48875b8290ace852d7f2f3e0ee76d8d122afd8a7ce144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig.rs:1654-1659 | rust_port/crates/flow_type_sig/src/type_sig.rs:1698-1703 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig.rs:1654\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":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f518ef76af398b6551014407719f21de2e210d8b703e2baf7ab75dbb9ef02e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:661-666 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:727-732 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:661\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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae667db598396861e6c1371b18dcd4af825dd21b0a46fc69d7d7522937e44f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 5): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8106-8109 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8568-8573 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8631-8635 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8891-8896 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8985-8989 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb7454081aa3ca5e9588cc149046a39127b2ab7ab3b9c6d182b4adad828684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8591-8596 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8938-8943 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8591\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a49fa462392ba08b7739546f7a56bae938b2ac1d3fd68e2e31b2b35adcb21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13607-13612 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15604-15609 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf9f261e283ee764c7ac73b150411d8f3f65639360018220ce08a1c5348de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15381-15386 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15404-15409 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:15381\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":15381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48e87630572db9b596af82f98cdf69747de67d9e39850b5e65783fb3fb956aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing/src/env_resolution.rs:2571-2576 | rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs:121-126 \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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"6390d222921c33976fcf0f63bc1f5cf4a7f2ebbdbe2fc02bd30f30f7812582fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust_port/crates/flow_typing/src/ty_members.rs:345-359 | rust_port/crates/flow_typing/src/ty_members.rs:429-443 \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 \u0060rust_port/crates/flow_typing/src/ty_members.rs:345\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"42edbe7a8dc9b5c14b278f6c86f4ffec67457b83c40f7bdb93f718834c0e66c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5581-5586 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5618-5623 \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 \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:5581\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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57dc8bf5c4468b736b872f80cdc03a976c81e25a341895ebce3bccae457fc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:85-90 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:597-602 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs:85\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cd3d74ffe63d21ec87edac84f3a1e5ab9db49aa4632ef8f958a0f08df812e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:940-945 | rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs:950-955 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/constraint_helpers.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebae819d9c49589db5ac013ce860c4e6aad9b442b5ad55748879493dbfd700b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7201-7206 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7250-7255 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:7201\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":7201}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad00756e90e25db8050955dbf894ba3747449d91cc18190fa699e044cd2d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8642-8647 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8700-8705 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:8642\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":8642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce2fa84a333baf84205e129b3b9afc2882644751770196ee46a66f0e01597a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1014-1019 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1039-1044 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a710f565bf957bbc226c7ad0181abdd8ebaf494a96cc8b71643306cc8bfffd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:80-85 | rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:101-106 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:80\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"80878209e3bcedd47ef4918f2c55c87898024c24567bcadb965c0e3f1acde787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs:484-489 | rust_port/crates/flow_typing_utils/src/members.rs:179-184 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ec8d2e3800ba140a5650c87db72120e30eb2aa0710593a39ef33f0d9b3614e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3994-3999 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4029-4034 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:3994\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3994}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0773d37b42a68b95c757dc675c160d2a4b6abf74bf33440f01b37e2faf279a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4097-4102 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4150-4155 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4097\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa71f32eb940de8903d0bd7c5aaad266dfe0cfe1699e28d592eec8e07940e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/react_kit.rs:882-888 | rust_port/crates/flow_typing_flow_js/src/react_kit.rs:902-909 \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 \u0060rust_port/crates/flow_typing_flow_js/src/react_kit.rs:902\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":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"17715a947749fe23f03c7127c53aa3df0b56ea632e1536781aac267976d254da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:924-929 | rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:1002-1007 \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 \u0060rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs:924\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":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ba8eda5d154b98fe1dba9bf493cb39c416210f9a5e446bb537534eff716812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1284-1289 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:4910-4915 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1284\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1404a57865b4f07c4aa1062b28373b6ea86c576ce803097dfb08e718ca7bcd89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5377-5382 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:5384-5389 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":5377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e74a7450ed89d3ee3d10bdaa24b8f2dbaff1f3ca230a826d1e977ccf1549d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1335-1340 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1358-1363 \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 \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1335\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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d465f51c9083e417dfccd8c29518454967364c8e365c81bf577c5b051e7f0a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/class_sig.rs:1586-1591 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1609-1615 \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 \u0060rust_port/crates/flow_typing_statement/src/class_sig.rs:1609\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de2e194bbdaea280db9adf975419d5fee16778ec367e8adc187b8ee9230955e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:1811-1817 | rust_port/crates/flow_typing_statement/src/statement.rs:4635-4641 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:1811\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"243beeb20604640e218edc7ed327e473e966788ac5cf657a671498a97043c26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3128-3133 | rust_port/crates/flow_typing_statement/src/statement.rs:3269-3274 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3128\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3128}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aebae1c75cbfebbaea71fb2f64d2d4a5f7ab97725fa1eaecf33c83560e37b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:3922-3927 | rust_port/crates/flow_typing_statement/src/statement.rs:4300-4305 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:3922\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5c66837f9d8e4ea4f9c91289a24562b664986663c239f19b460de18e78f320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4854-4861 | rust_port/crates/flow_typing_statement/src/statement.rs:4879-4886 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4854\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d437c3140591a292d56d15d9ed153162df036d4099eddd5f01dce81422150878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:6931-6936 | rust_port/crates/flow_typing_statement/src/statement.rs:6958-6963 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:6931\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":6931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7700dcddc00d8556cfb03e764a9c2cd8772abf6309ffd8e26f2b161d0f3bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7438-7444 | rust_port/crates/flow_typing_statement/src/statement.rs:7468-7473 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7438\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7438}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fdcb2b69209b3bc40cdcece66003fe90b41349dc14483a471119b1e40a59ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7931-7935 | rust_port/crates/flow_typing_statement/src/statement.rs:7955-7960 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7931\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7931}}}],"partialFingerprints":{"codehealthFindingId/v1":"80500bd4aa05bb57611432a4e2e55adcf45cd2c3d336a00beb79998513971ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7951-7956 | rust_port/crates/flow_typing_statement/src/statement.rs:8948-8953 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7951\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7951}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e020b560654ebb7fdc09a59705d606428ff74f7d1d82ee9f520da53a557f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:7973-7978 | rust_port/crates/flow_typing_statement/src/statement.rs:8014-8019 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7973}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a3f56de4bfdd7a3ff55b01b505134eb699775f324c94b3e1b22cc0a19a0957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:8243-8248 | rust_port/crates/flow_typing_statement/src/statement.rs:8266-8271 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:8243\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb84b9fbfd679bde428c71688dc6613aded53930c57f000876d23ec0b2bba456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16716-16721 | rust_port/crates/flow_typing_statement/src/statement.rs:19484-19490 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16716\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16716}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ef0d3138988c24f41ef9d34e810fb557356b92b9c37e326f0fb73951519181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/switch_to_match.rs:90-95 | rust_port/crates/flow_typing_statement/src/switch_to_match.rs:106-111 \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 \u0060rust_port/crates/flow_typing_statement/src/switch_to_match.rs:90\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":"rust_port/crates/flow_typing_statement/src/switch_to_match.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"390242ba86b4db773c0d39a1a1f46d417f235ed0ed70adf1182a6a723fdb7302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3129-3134 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3180-3185 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84e4414eca55d4785f66d96a432af8be402c17e494e369730e12e768a4bc53f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:5662-5667 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8780-8785 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:5662\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":5662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47de80677ca88c5479b9ad568206a1aff21dea1cf72d573a330363781ad7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6050-6056 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6073-6079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6071\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6049\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"654d7bc6de4364c19dafc1617d13d191eb712da2a3310bc28fd28274a77d95f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:6954-6959 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:8929-8934 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":6954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75e7d8219b5913d7ba0dcf45aaf354d58f6eb232edf425715e0ce4928d1a3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:8624-8630 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2438-2444 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8624}}}],"partialFingerprints":{"codehealthFindingId/v1":"6354edffe5c9eefeb338e92ebbbd769c87c80c9477a0967003d5b5e11fc233e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4078-4083 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4108-4113 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:4078\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4078}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea1baf55a4397b6ed7734da3632c8d34264025bb01f157659ddc710f638e2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_filter.rs:1565-1570 | rust_port/crates/flow_typing_utils/src/type_filter.rs:1616-1621 \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 \u0060rust_port/crates/flow_typing_utils/src/type_filter.rs:1565\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":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bdb709299da1f392c44b3ba6fb84b0e51bebf36bb097efc6c171b1ecd10d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:484-490 | rust_port/crates/flow_typing_utils/src/type_operation_utils.rs:711-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f607803a76055005a54835185d9f27d08591da3fbc12bc4b851277337290838e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1767-1773 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1796-1802 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:1767\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47a66f6d5c9d249ddfca49d2bc491b3846f64553619859daf191c8b8f7eff17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 31): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1457-1462 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1484-1489 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1518-1523 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1557-1562 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1590-1595 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1710-1715 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1744-1749 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1978-1983 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2006-2011 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2085-2090 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2135-2140 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2174-2179 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2212-2217 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2244-2249 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2308-2313 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2335-2340 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2361-2366 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2390-2395 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2430-2435 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2472-2477 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2505-2510 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2545-2550 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2577-2582 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2674-2679 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:2841-2846 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3058-3063 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3112-3117 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3178-3183 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3269-3274 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3316-3321 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:3360-3365 \u2014 all 31 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73513b8f362741026094ba85cb0e5be7813a5c8908d3079cbcb2eccc2904c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): rust_port/crates/flow_common_ty/src/ty_utils.rs:678-682 | rust_port/crates/flow_common_ty/src/ty_utils.rs:730-734 | rust_port/crates/flow_common_ty/src/ty_utils.rs:792-796 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:2691-2696 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1312-1316 | rust_port/crates/flow_typing_statement/src/class_sig.rs:1393-1397 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5421-5425 | rust_port/crates/flow_typing_type/src/type_util.rs:2693-2697 | rust_port/crates/flow_typing_utils/src/type_env.rs:749-753 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2954-2958 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4476-4480 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5855-5859 \u2014 there are 12 copies across 7 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 12 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_common_ty/src/ty_utils.rs:678\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_common_ty/src/ty_utils.rs:791\u0060 calls \u0060Bot\u0060 and \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2953\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":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb5b3f43ed9e0a6bf1c518b02498c60d67b0d15de38cf094f27b26504b8258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): rust_port/crates/flow_services_inference/src/merge_service.rs:248-252 | rust_port/crates/flow_services_inference/src/merge_service.rs:266-270 | rust_port/crates/flow_services_inference/src/merge_service.rs:282-286 | rust_port/crates/flow_services_inference/src/merge_service.rs:331-335 | rust_port/crates/flow_services_inference/src/merge_service.rs:351-355 | rust_port/crates/flow_services_inference/src/merge_service.rs:371-375 | rust_port/crates/flow_services_inference/src/merge_service.rs:390-394 | rust_port/crates/flow_services_inference/src/merge_service.rs:545-549 | rust_port/crates/flow_services_inference/src/merge_service.rs:587-591 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:265\u0060 calls \u0060as_ref\u0060 and \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:388\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6740c7f77f11208b32483bf6bf8b922981f857946a4852c9d9e5f109635c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rust_port/crates/flow_parser/src/match_pattern_parser.rs:930-934 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:938-942 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:960-964 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:984-988 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:992-996 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:1000-1004 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aff69b5191bb424da9094ce4f6472d723a7278d983bd1d7da9aece51dd96fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rust_port/crates/flow_typing_statement/src/statement.rs:5958-5962 | rust_port/crates/flow_typing_statement/src/statement.rs:7050-7054 | rust_port/crates/flow_typing_statement/src/statement.rs:7323-7328 | rust_port/crates/flow_typing_statement/src/statement.rs:7752-7756 | rust_port/crates/flow_typing_statement/src/statement.rs:11013-11017 | rust_port/crates/flow_typing_statement/src/statement.rs:11539-11543 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:5958\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":5958}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d037e4f02ab7b7b5633ffcb37e7e68003e6c1f8d210be84ab580b85edcc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4546-4550 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4568-4572 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5610-5614 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5698-5702 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5720-5724 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:5856-5860 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4546\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4d9a590bab984dea93ed21ea098b6c4fdd0a6064b0951132fad3f8be7a24a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 6): rust_port/crates/flow_typing/src/env_resolution.rs:506-510 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1938-1942 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1465-1469 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1478-1482 | rust_port/crates/flow_typing_flow_js/src/flow_js.rs:1531-1535 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:1413-1415 \u2014 there are 6 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing/src/env_resolution.rs: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. 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 before the matched lines, \u0060rust_port/crates/flow_typing/src/env_resolution.rs:506\u0060 calls \u0060Err\u0060, \u0060TimedOut\u0060 and \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:1413\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":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb597953ec05e0da5cd33a63b5a5585b851aa605c77a0ff0fa783ef36d0deb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): rust_port/crates/flow_typing_statement/src/func_sig.rs:683-687 | rust_port/crates/flow_typing_statement/src/func_sig.rs:705-710 | rust_port/crates/flow_typing_statement/src/func_sig.rs:732-737 | rust_port/crates/flow_typing_statement/src/func_sig.rs:759-764 | rust_port/crates/flow_typing_statement/src/func_sig.rs:807-811 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:683\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e061fad779145e257de61262c7da7982acc78e6af81ec2b3c97b203689a67f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2336-2340 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2371-2375 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2566-2570 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2631-2635 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2656-2660 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2336\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a317b10a52d9fb67360e222b77abc6a84b69b3d71e3a65c262373758eb81438c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_codemods/src/annotate_exports.rs:314-319 | rust_port/crates/flow_codemods/src/annotate_exports.rs:627-631 | rust_port/crates/flow_codemods/src/annotate_exports.rs:788-795 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:254-258 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs\u0060 and \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs:627\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3713d7b1dd1340d2c20b63083884e747978d8f21596ef77599900b69808dc9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_parser_utils/src/enum_validate.rs:95-99 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:114-118 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:124-128 | rust_port/crates/flow_parser_utils/src/enum_validate.rs:180-184 \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 \u0060rust_port/crates/flow_parser_utils/src/enum_validate.rs:95\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":"rust_port/crates/flow_parser_utils/src/enum_validate.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdac63d81e5b9e99515ac9095d0f2b7a881a4122579caf3603fc35744eea43f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1872-1878 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1920-1924 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2286-2291 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:2749-2753 \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 \u0060rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:1872\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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc22afa9bdf8e993a5d56d8db34aa9b39e586fdc231334245653a596a2a4cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:4346-4350 | rust_port/crates/flow_typing_statement/src/statement.rs:7900-7904 | rust_port/crates/flow_typing_statement/src/statement.rs:8378-8382 | rust_port/crates/flow_typing_statement/src/statement.rs:8928-8932 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4346\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec23df5f2947f27029b98864e6f11694517e7e9ed819818b7c1111c0d923225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:7928-7932 | rust_port/crates/flow_typing_statement/src/statement.rs:7952-7956 | rust_port/crates/flow_typing_statement/src/statement.rs:8394-8398 | rust_port/crates/flow_typing_statement/src/statement.rs:8949-8953 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:7928\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":7928}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8523980d4f0e5e87137bb9176cf6e580e836591854191916a2c5fa1ad91841b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/statement.rs:19925-19930 | rust_port/crates/flow_typing_statement/src/statement.rs:19991-19996 | rust_port/crates/flow_typing_statement/src/statement.rs:20404-20409 | rust_port/crates/flow_typing_statement/src/statement.rs:20472-20477 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19925}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57b7add5cbb5f8b3d12a1ed30aeb9dc631c65b5c5d37da7eb840ccfd886defe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3130-3134 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3181-3185 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6051-6055 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6074-6078 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6071\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:6049\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3130}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cddb8681f41c1fdd55f67f71d9a8cd83999faa7e5f2c219023d44d5ca5bd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_cli/src/autocomplete_command.rs:161-165 | rust_port/crates/flow_cli/src/get_def_command.rs:64-68 | rust_port/crates/flow_cli/src/type_at_pos_command.rs:250-254 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_cli/src/get_def_command.rs:71\u0060 calls \u0060get\u0060, \u0060optional\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/autocomplete_command.rs:167\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":"rust_port/crates/flow_cli/src/autocomplete_command.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e681e2198ec086240419db7b10398a6cefdb2afb45ac0915f01537bd332f8275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:601-606 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:620-625 | rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:656-661 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:663\u0060 calls \u0060Ok\u0060, \u0060type_annotation_hint\u0060 and \u0060rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:607\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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8677a9d6294c2c615c95ba0314e3e5963c1483a294781dd64e39f10d7113cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs:1260-1265 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12019-12024 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:12774-12779 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060patt\u0060 to \u0060\u0026ast::pattern::Pattern\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026\u0027ast flow_parser::ast::pattern::Pattern\u003CALoc, ALoc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5cd9bbccebd79407447422bade43dd7c4d2a2b724254822ded23b93064d5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_parser/src/ast_visitor.rs:7714-7718 | rust_port/crates/flow_parser/src/ast_visitor.rs:7851-7855 | rust_port/crates/flow_parser/src/ast_visitor.rs:7950-7954 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":7714}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b16ef633e10b37b242055a6ad4bcb6a543228d61e3d6e01aab29d1f6b3b916d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_parser/src/enum_parser.rs:196-200 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:327-332 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:582-587 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/enum_parser.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/enum_parser.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb376f0a1e3b9fb7603d14befd27c958acd557e381d9041448f32a55ea2d2f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:1205-1211 | rust_port/crates/flow_parser/src/flow_lexer.rs:1231-1237 | rust_port/crates/flow_parser/src/flow_lexer.rs:1275-1279 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccb36db5128c19aa8a7743723bc32246b9bd83fd63bad9aba17c3b021c57e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_parser/src/object_parser.rs:318-322 | rust_port/crates/flow_parser/src/object_parser.rs:1258-1262 | rust_port/crates/flow_parser/src/object_parser.rs:1833-1838 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0414fc5ea0d6c9673b73cc87e40e4f3bdb49dd64c676e56217934ee712ba40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_parser_wasm/src/serializer.rs:3996-4001 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4134-4139 | rust_port/crates/flow_parser_wasm/src/serializer.rs:4515-4520 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:3996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inner\u0060 to \u0060\u0026ast::statement::Interface\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::types::Interface\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"a506e8e201519d9e63483da251c24dca27660da3db0dcc91c4fb097b29b0e418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1795-1799 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2025-2032 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:2156-2161 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:1795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ea167bcbf29b166718206f07e2a2d3587d91fec1c9a89ba147ea29ddb3cc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:878-886 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:935-943 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:1402-1410 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:878\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:931\u0060 calls \u0060Union\u0060, \u0060on_union\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:877\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":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b37adf6d1f51306e2cc23b1ac6c9436a33f62addf3bdc5320ef9090a707ebef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8390-8396 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8703-8709 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9105-9111 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8390\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8390}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5adef0078b03800b4bea1c7ea079979cd94d7464e0f25ce5bf11e487cd95b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13155-13160 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13190-13195 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13219-13224 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13153\u0060 calls \u0060push_lex\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13217\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13155}}}],"partialFingerprints":{"codehealthFindingId/v1":"def39f1e6449989f132587f4044a7c990252c7bad50d0ad09edd6c6383faa6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:794-799 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:822-827 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:844-849 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:794\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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b7b77d42d3e54453faa81711b0fe05c94f390f3238792b0d02e066cdf48cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/destructuring.rs:115-119 | rust_port/crates/flow_typing_statement/src/destructuring.rs:176-181 | rust_port/crates/flow_typing_statement/src/destructuring.rs:227-231 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/destructuring.rs:115\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":"rust_port/crates/flow_typing_statement/src/destructuring.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a614259ef6f16114264571407fea6a8e9bf6b0c749e1ad128dc3f3c12e52db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:8219-8223 | rust_port/crates/flow_typing_statement/src/statement.rs:11204-11208 | rust_port/crates/flow_typing_statement/src/statement.rs:21742-21746 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:8219\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":8219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d80acd1376abeafd23dba266336c7485980e9995fb2842c583dabeb9031d0c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2079-2083 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:2100-2104 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4690-4694 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ba1eb2297290c3d6bafbae4ee6c213339493acd26e51c74e10b284ad8ffc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty.rs:5018-5022 | rust_port/crates/flow_common_ty/src/ty.rs:5026-5030 \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 \u0060rust_port/crates/flow_common_ty/src/ty.rs:5018\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":5018}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf0139cda4843828aaa962168d222fd13f8fe82e15c96e23bfe7836277f4492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_debug.rs:843-847 | rust_port/crates/flow_common_ty/src/ty_debug.rs:855-859 \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":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed92ec6bedd8f62f6fa5e0f45d5d346258f268d6bee553f34905572ca4bb83b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:6276-6281 | rust_port/crates/flow_env_builder/src/name_def.rs:6326-6331 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:6276\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":6276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6768b4b9065ee71f0ac4ec49c342d3e617863975d59951879e96ac0aee1eafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2704-2707 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2759-2763 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2778-2781 | rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:2798-2802 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea2ee3c9c615deca6779be6a1e7d524e7c227de6fff67c67c60ad0286733fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:334-338 | rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:355-359 \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 \u0060rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs:334\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026ast::statement::ForIn\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::statement::ForOf\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/super_call_in_derived_ctor_checker.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a54ffd83a439dd332c5bbaaebc0cc6e65048bab21e1d352285ab808014c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_utils.rs:76-81 | rust_port/crates/flow_parser/src/ast_utils.rs:121-126 \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":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"194762aa5d08bbee7194c9a3e1d9ee0e7353a9550be5de52f7e4d736a6924131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:1474-1478 | rust_port/crates/flow_parser/src/statement_parser.rs:1820-1824 \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":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e925e0146866dbbec21f1fc4c6380fff33569769ac8e9e1b733a2676e117ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/expression_parser.rs:934-938 | rust_port/crates/flow_parser/src/expression_parser.rs:1011-1015 \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 \u0060rust_port/crates/flow_parser/src/expression_parser.rs:934\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":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f1c2f8fc1d40aa7ddbee81d75822b7543110fd59a5a70aa962e9c712f2aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1634-1638 | rust_port/crates/flow_parser/src/flow_lexer.rs:1645-1649 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1634\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f732ba99286680dca30e5fda87bc60565c12a580898171aaa6448b98d2b722"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1707-1711 | rust_port/crates/flow_parser/src/flow_lexer.rs:1829-1833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1826\u0060 calls \u0060is_valid_js_identifier_start\u0060, \u0060slice\u0060, \u0060chars\u0060 and \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1706\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d83b83efd15aeb97674eb336ce0ffa603c530d83bef6c038b61ef6be6143606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:2287-2291 | rust_port/crates/flow_parser/src/flow_lexer.rs:2303-2307 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:2287\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0992e40dfb423f81131707e0024487e793cedbef519a23cb8407aac8ff263e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:194-198 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:588-593 \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 \u0060rust_port/crates/flow_parser/src/match_pattern_parser.rs:194\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c772a95e75d5d471736e4a3894a5eb26ec474c9ccf469abfc3bdf1785efc365d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/match_pattern_parser.rs:968-972 | rust_port/crates/flow_parser/src/match_pattern_parser.rs:976-980 \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":"rust_port/crates/flow_parser/src/match_pattern_parser.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8da52b9ba449cd57e0bfe78eb37559b05fd928ef9e9bb623ec577cc4d56e9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:981-985 | rust_port/crates/flow_parser/src/statement_parser.rs:1365-1369 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:981\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc55a7486b1df53f07c643ef44f22a0a086d82d8b755d48313e8438ec22764c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/statement_parser.rs:3358-3362 | rust_port/crates/flow_parser/src/statement_parser.rs:4046-4050 \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 \u0060rust_port/crates/flow_parser/src/statement_parser.rs:3358\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":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b0afeafbe1f4f6de919533db7e64f6a6bdbeea7462d9be232d26bf4c08f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3436-3441 | rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3520-3525 \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 \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3436\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3526\u0060 calls \u0060diff_if_changed\u0060, \u0060expression\u0060 and \u0060rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs:3442\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":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":3436}}}],"partialFingerprints":{"codehealthFindingId/v1":"49835a4e48f8bb4815af396d882465c992032ffd2940275ff93329d0c7bf1c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:2715-2720 | rust_port/crates/flow_parser_wasm/src/serializer.rs:2750-2755 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060name\u0060 to \u0060\u0026ast::jsx::Name\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::jsx::attribute::Name\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2721\u0060 calls \u0060MemberExpression\u0060, \u0060serialize_jsx_member_expression\u0060 and \u0060rust_port/crates/flow_parser_wasm/src/serializer.rs:2756\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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5060c873f23096b7839cecf43d2918d2f9c531785cc3c0eed038e6d205528898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1744-1750 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1981-1987 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:1744\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"caae33a1e1901fcf1e529bd17c0035919295c6bd6d155002a56e3577a93869fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_server_env/src/error_collator.rs:73-77 | rust_port/crates/flow_server_env/src/error_collator.rs:118-122 \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 \u0060rust_port/crates/flow_server_env/src/error_collator.rs:73\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":"rust_port/crates/flow_server_env/src/error_collator.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"75698670faa3a5fc3f2b1558fb945a80b020589778823efb8abed3995878e97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/autofix_imports.rs:845-853 | rust_port/crates/flow_services_code_action/src/autofix_imports.rs:1071-1079 \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 \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs:845\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs:841\u0060 calls \u0060is_empty\u0060 and \u0060rust_port/crates/flow_services_code_action/src/autofix_imports.rs:1070\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":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1587b8b6f94e59a3a5b8abeebf35240b082ce4ef1e648f6395fe43ad9d441bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_inference/src/check_service.rs:689-694 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6493-6498 \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 \u0060rust_port/crates/flow_services_inference/src/check_service.rs:689\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":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb469342e16bce617c2a7db511dd9339ab71e10b81cdda59b7b4674c10f854ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_inference/src/merge_service.rs:291-296 | rust_port/crates/flow_services_inference/src/merge_service.rs:401-406 \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 \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:399\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_services_inference/src/merge_service.rs:289\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":"rust_port/crates/flow_services_inference/src/merge_service.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d116bc2b9cad3b194a2a83238d4d1270f2b333e5f3bbf7d8e85c72039c9d2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_mark.rs:358-362 | rust_port/crates/flow_type_sig/src/type_sig_mark.rs:373-377 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_mark.rs:358\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":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d321c0c71ad99b59bd832a6ce5a0e3309922912390cc597948f9afb1a2320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1618-1622 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1662-1666 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1618\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae483d3efa5f048a21b93e3933467e3c0e79382ac0c9f527e32ea2b91528c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1617-1621 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1797-1801 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:1617\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8622499cce381d8dbafca81ef29d3f95a1fbc8082d879594a1a56bc41e42409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8250-8254 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9649-9653 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a5aa952c595812e7b54e257d0a087fb111a4096cf41cb1cfe4fdbfb6a3422e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8394-8400 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8707-8713 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8394\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8f359d2b18e3b1d360b4dd79983279dcb955d8bf01cfa68defe9f8611bb91b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8154-8157 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8908-8912 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8996-9000 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8154}}}],"partialFingerprints":{"codehealthFindingId/v1":"842676dd888b3eedc5478b4f1157c3e5bbb435b9e48945f36a6e01ad06693956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:10447-10453 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:10484-10490 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:10447\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10447}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096b10765bc77f2d42e10e453ed4ac14e5e90ae39d3e94eb39f93ad97577cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11864-11869 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12963-12968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:12961\u0060 calls \u0060push\u0060 and \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:11863\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":11864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ad8d48ef46b5bc1986d2fc90c5b5f2cc3447a17029d1161782d4705c59ce64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13078-13082 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13929-13933 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13078\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13078}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcc39c0dd5ff19953a4d005514e05349f6191e00aff3d2a544cb19cb187cf68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13217-13221 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:14075-14079 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:13217\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":13217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1838b7e2e7a2f5770ab066c55ae80fdfa4d1c06b34a225215833af198c200c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1629-1633 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1661-1666 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:1629\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"2524c8e441716e5c4f4a86c3d267e4b5ca74d19c4c11aae3b9f62faa990bef6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2946-2950 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:3073-3077 \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":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe42568cfffba04e20b4a887a2f81ace16413af13839b7849d82182d357035b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:385-389 | rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:1537-1541 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:1412-1414 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs:385\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07ecceb1d1bbf8866e8b4b1ca3a9cc8ae0c2699db0c4bb868110bbd380dd33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:3124-3128 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:3884-3888 \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 \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs:3124\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58707bd9c4d6b04e94ba732310a0cea32c04cee0e7b4aaf659bc2029cd17ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:3466-3472 | rust_port/crates/flow_typing_flow_js/src/slice_utils.rs:3491-3497 \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":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ba12003d3221fbce3f09bf3421ace0c44b525b1691193ff5f723b1da6038a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:99-107 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:602-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"050415311b850225e5907589101258c72794be383c5493e7bf0ad23c91de7878"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/destructuring.rs:116-120 | rust_port/crates/flow_typing_statement/src/match_pattern.rs:81-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/destructuring.rs:116\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":"rust_port/crates/flow_typing_statement/src/destructuring.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"847537c7d71cacd39bd20824fe8edd0af67788556243cb9efd8a0b1c862a6be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/react_rules.rs:2290-2295 | rust_port/crates/flow_typing_statement/src/react_rules.rs:2303-2308 \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 \u0060rust_port/crates/flow_typing_statement/src/react_rules.rs:2290\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060stmt\u0060 to \u0060\u0026\u0027t ast::statement::ForIn\u003CALoc, (ALoc, Type)\u003E\u0060 in one and \u0060\u0026\u0027t ast::statement::ForOf\u003CALoc, (ALoc, Type)\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9745d3c88ac067d561ee5baad3a2aaae0ceb903a9311852c75b4fbcde6c11832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16205-16209 | rust_port/crates/flow_typing_statement/src/statement.rs:19124-19128 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16205\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16205}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c9c187f3d08e374f120af1f3fb684bbb8fc4691a7eae287264fb95ca561b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18875-18880 | rust_port/crates/flow_typing_statement/src/statement.rs:20938-20943 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18875\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7724199bceaef5efc36e3c85d64f05d7fbbea6f83a5ee8120374ee2dcfa11390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:18919-18924 | rust_port/crates/flow_typing_statement/src/statement.rs:19777-19782 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:18919\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":18919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3adf2f2d6670af059749e7a2079e59d87ccde5c56830852dc206539ee7f9710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:19939-19943 | rust_port/crates/flow_typing_statement/src/statement.rs:20418-20423 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19939\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":19939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eb8750404d1ea56ea9546ed05615f409d8a4fc0cd73f3908583197d1e6d5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:745-749 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:766-770 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24c1b512c48090a6b526f435caea9aa4b29a64f4880fa258a1c80df3d342caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2339-2343 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2862-2866 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2339\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"55084d11080cb2037ad54e292abc2e411a30dc2dd2c473d888bf2cdf316434bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_util.rs:2694-2699 | rust_port/crates/flow_typing_type/src/type_util.rs:2716-2721 \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 \u0060rust_port/crates/flow_typing_type/src/type_util.rs:2694\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":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fed9d530f2fc64720c37edf1fc7b600931657a2469fef6e9265315f2fa95b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3599-3605 | rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3849-3855 \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 \u0060rust_port/crates/flow_typing_utils/src/annotation_inference.rs:3599\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":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":3599}}}],"partialFingerprints":{"codehealthFindingId/v1":"544282c35357767f792402723effa6e9d8bf9df0e6ecb293733bc8ed7605c201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2230-2234 | rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2259-2263 \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 \u0060rust_port/crates/flow_typing_utils/src/predicate_kit.rs:2230\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":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b7c342c98dd3700a5466aca5091e7c4c0435f4cee8737710a556ba36be42e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): rust_port/crates/flow_services_inference/src/check_service.rs:674-676 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:220-224 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6484-6488 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_inference/src/check_service.rs:674\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 before the matched lines, \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:220\u0060 calls \u0060loc\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_services_inference/src/check_service.rs:674\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":"rust_port/crates/flow_services_inference/src/check_service.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3bad2b840c4e47ea095a0c63db8c2ded77801d4bbb3a4dbdc169f2efe1e563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3032-3041 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3699-3708 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:3032\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e171c9d2356aa88ffddb0dfbbc5cd7f743ac5e12edc1603b3ffb8cbce901083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4886-4897 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4905-4916 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:4886\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":4886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f646b5165294baa5e37a0906766fbf2bfb5f4723897bffe42e6bae1eb3f053d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6191-6196 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6201-6206 \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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":6191}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c5ebb7f4217af81e62800fef95dfd4d77ff08d843ec2f0b4be2f15e751c682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1978-1982 | rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1987-1991 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs:1978\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":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b344f0b72e02a0eeb12ba77e27dfc8721e3c1a5ead2a83825ddcbdc10529fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_visitors/src/type_visitor.rs:339-343 | rust_port/crates/flow_typing_visitors/src/type_visitor.rs:1015-1019 \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 \u0060rust_port/crates/flow_typing_visitors/src/type_visitor.rs:339\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":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bd66e3c85bc2cbf002b61dde4e966b92ff2fc1954cb7f8f9a94160f984609a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust_port/crates/flow_codemods/src/utils/codemod_ast_mapper.rs:20-36 | rust_port/crates/flow_codemods/src/utils/codemod_ast_reducer.rs:20-36 \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 \u0060rust_port/crates/flow_codemods/src/utils/codemod_ast_mapper.rs:20\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_ast_mapper.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c726bc77b7d2423c703d0c9db4c820d302c773e88d1c4b808c7bdb33ba34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:159-170 | rust_port/crates/flow_analysis/src/ssa_builder.rs:695-706 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_analysis/src/property_assignment.rs\u0060 and \u0060rust_port/crates/flow_analysis/src/ssa_builder.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:159\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":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"942c92b4f2acf70d534112547e2576c264eb357bd9fe38a47ed22fa402876b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_analysis/src/ssa_builder.rs:365-370 | rust_port/crates/flow_typing_type/src/type_.rs:7724-7729 | rust_port/crates/flow_typing_type/src/type_.rs:8228-8233 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"410d750efe0949bc862496d56f9a69f10798aaff410f49c96d813a448133d3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_cli/src/glean_runner.rs:142-151 | rust_port/crates/flow_services_inference/src/dep_service.rs:135-144 \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 \u0060rust_port/crates/flow_cli/src/glean_runner.rs:142\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":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"085839d994c6cba82b67a02f68fcd01eeb10ec2e78ed4c0cefc2bad1836a9ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): rust_port/crates/flow_codemods/src/annotate_exports.rs:35-47 | rust_port/crates/flow_codemods/src/annotate_literal_declarations.rs:23-35 | rust_port/crates/flow_codemods/src/annotate_optional_properties.rs:71-83 | rust_port/crates/flow_codemods/src/remove_react_import.rs:90-102 | rust_port/crates/flow_services_code_action/src/insert_type_utils.rs:62-74 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_codemods/src/annotate_exports.rs\u0060 and \u0060rust_port/crates/flow_codemods/src/annotate_optional_properties.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060i\u0060 to \u0060usize\u0060 in one and \u0060i64\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":"rust_port/crates/flow_codemods/src/annotate_exports.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c32f6681d1a89bc3c74428363e082b6a39731d8452b925169b8201bde5fc511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common/src/files.rs:1383-1389 | rust_port/crates/flow_parser/src/file_key.rs:96-102 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_common/src/files.rs\u0060 and \u0060rust_port/crates/flow_parser/src/file_key.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b88d4709ef1c395ba1597d6fab109852ca417b7204d26711bb9ecdcbb78a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common/src/reason.rs:559-565 | rust_port/crates/flow_common/src/subst_name.rs:155-161 \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":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbdccfdc04e3bc643a144fcf1d52b53e6de251617fea15f549771ce2adb1280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:58-69 | rust_port/crates/flow_parser/src/jsdoc.rs:76-88 \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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d8c20f306457d182bd9cd96c07a079cecefdd882b97c76c2085da54206d990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:27-33 | rust_port/crates/flow_typing_statement/src/match_pattern.rs:68-74 | rust_port/crates/flow_typing_statement/src/statement.rs:153-159 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:108-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57ba6adf49c34584bd184c0162b67464755c9541a2ab2e0a941be4569303d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:530-535 | rust_port/crates/flow_parser_wasm/src/babel_adapter/match_lowering.rs:125-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e5f383835257bbb856a240dec769de1d487f57dd33d4dff261c0c9778afe55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:720-726 | rust_port/crates/flow_services_get_def/src/get_def_process_location.rs:306-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060prog\u0060 to \u0060\u0026\u0027ast ast::Program\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026\u0027ast ast::Program\u003CALoc, T\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e918aea00c2b211736e9ae73157f82726c36ff63dd91e0b006ac27f2f35fb3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:8440-8448 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:6915-6923 \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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":8440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7bf226d3624481923e09f246204097f3be8ebc61262188d048f386b18d12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing/src/marked.rs:56-61 | rust_port/crates/flow_typing_flow_js/src/marked.rs:56-61 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_typing/src/marked.rs\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/marked.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/marked.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89a069818f61fb880a674627db77edc1790d0e864a172523ec2045c8f4c2967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): rust_port/crates/flow_typing_errors/src/error_message.rs:1684-1688 | rust_port/crates/flow_typing_type/src/type_.rs:1485-1489 | rust_port/crates/flow_typing_type/src/type_.rs:1524-1528 | rust_port/crates/flow_typing_type/src/type_.rs:1563-1567 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7706d1498cb2fe0066db597c440a5a1b20de67f4e5574b619b006d04e8056af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:1979-1985 | rust_port/crates/flow_typing_statement/src/exists_marker.rs:40-46 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9a4dddeb8123fd24f503a6d5afac644a2a7df25560e553adb7d030c5d40dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs:130-135 | rust_port/crates/flow_typing_ty_normalizer/src/env.rs:212-217 \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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e737e705d486ea549d06055e1f026a113dbf600b239e7a3a77f8cb9ec1c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs:537-542 | rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:393-398 \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 \u0060rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs:393\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":"rust_port/crates/flow_parser_wasm/src/babel_adapter/component_lowering.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6baf45a302c5e7a927d971e74a91d6eb574414754c5097890c5d031de1a888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:1915-1921 | rust_port/crates/flow_typing_utils/src/type_hint.rs:202-208 \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":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7dcc7a58f0b8aa2ae9a43fe3b042905519505b252d8d7dd46698577020d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:2980-3009 | rust_port/crates/flow_parser/src/estree_translator.rs:4023-4052 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:2980\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37fcd588ceacab2706c9beb70f6e19952108a7b08a8878f76608774d494339e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_cli/src/codemod_command.rs:372-390 | rust_port/crates/flow_cli/src/codemod_command.rs:641-659 \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 \u0060rust_port/crates/flow_cli/src/codemod_command.rs:372\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":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8005cee5d753ba750fb1679d847d6fcc141050811ef4814f6b649e5005603b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8670-8688 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:10344-10362 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:8670\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":8670}}}],"partialFingerprints":{"codehealthFindingId/v1":"97655c58427da19bfd990e452450721770f8947765ff5ac43a780abf7c8ed663"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1461-1476 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1478-1493 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1495-1510 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bc8e64554dd9082a259e03592a23c8325c31654a3429e53e805c6275d7f2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3025-3040 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3046-3060 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3065-3079 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:3025\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3025}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1959b68cb41c8d64e5405223d0a46599eaae5c99373d16765ad70689120dbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1427-1442 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1444-1459 \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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"27080c90b79f73c51a6175f0886fb749bc6363d08c9ff2b1f68bfe065a0d2f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1529-1544 | rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1548-1561 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs:1548\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":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1c4b68e57761663864de9ecb72f951d21c58b68f4d6e3f56ae5ffb2c8b1228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): rust_port/crates/flow_typing_statement/src/type_annotation.rs:3006-3020 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3027-3041 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3048-3061 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:3067-3080 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:3006\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"d973c0b7354ad9db0871a7345f2c3afff69975628002362a85e9bc295879f021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7927-7940 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7942-7953 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7955-7969 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":7927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d31a823868b18ac87022e0ef26f60242a01d04636563620f6b3b78f987e4cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust_port/crates/flow_parser/src/estree_translator.rs:828-841 | rust_port/crates/flow_parser/src/estree_translator.rs:867-880 | rust_port/crates/flow_parser/src/estree_translator.rs:1164-1178 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/estree_translator.rs:828\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2116a2a0bb0fbf30b222903880f5d62256c9e88d5a069aa38e1e5ff3e864c74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/autofix_ts_syntax.rs:77-90 | rust_port/crates/flow_services_code_action/src/autofix_ts_syntax.rs:96-109 \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 \u0060rust_port/crates/flow_services_code_action/src/autofix_ts_syntax.rs:77\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":"rust_port/crates/flow_services_code_action/src/autofix_ts_syntax.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91152b7306b403cbecab8925adde405fe64575da0146bbef72e7b3b7c242b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:2374-2386 | rust_port/crates/flow_typing_debug/src/lib.rs:2390-2402 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:2374\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"89444e03643feb52ab3daa4eb460f52fe0cf9e0211ef75360acb0880d3250822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:965-977 | rust_port/crates/flow_parser/src/estree_translator.rs:997-1009 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:965\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060property\u0060 to \u0060\u0026ast::statement::record_declaration::Property\u003CLoc, Loc\u003E\u0060 in one and \u0060\u0026ast::statement::record_declaration::StaticProperty\u003CLoc, Loc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec65e42c3d220e981ed41bda8c383dac24db48194c79fe77133023854b898c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2057-2064 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11181-11193 \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 \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:2057\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24a46377c2b468e13bf642cc35f2aaf6ee5dde2fb3ca3e6375fd11ed49ae162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:16164-16176 | rust_port/crates/flow_typing_statement/src/statement.rs:19098-19110 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16164\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:19111\u0060 calls \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:16177\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":16164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a14b3bc58888459755a1f9f1885c1356f2584c84516a90e50a761ac426b7d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1380-1392 | rust_port/crates/flow_typing_utils/src/type_env.rs:1396-1408 \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":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24621cab0126111aac92c894a8b3b711848fc22a6cc4299171273a561e60ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rust_port/crates/flow_parser/src/estree_translator.rs:3469-3480 | rust_port/crates/flow_parser/src/estree_translator.rs:3504-3515 | rust_port/crates/flow_parser/src/estree_translator.rs:3544-3555 | rust_port/crates/flow_parser/src/estree_translator.rs:5448-5460 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:3469\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":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":3469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc067bdb7673e2b11259ad85776dffd396ba717d5b031759f80c596337dd36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:2134-2146 | rust_port/crates/flow_parser/src/object_parser.rs:2153-2162 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:2134\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bc48e3345c8249f042ed70f9fe3ffb7c31e75aa75dea9562f0b33706d6d872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): rust_port/crates/flow_typing_utils/src/type_env.rs:1471-1481 | rust_port/crates/flow_typing_utils/src/type_env.rs:1485-1495 | rust_port/crates/flow_typing_utils/src/type_env.rs:1499-1509 | rust_port/crates/flow_typing_utils/src/type_env.rs:1513-1524 | rust_port/crates/flow_typing_utils/src/type_env.rs:1530-1540 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:1513\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"8769d66c867f9bf644b6077619f7284ebad9aaa940db0aa193beefbdc543649e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): rust_port/crates/flow_typing_utils/src/type_env.rs:1457-1467 | rust_port/crates/flow_typing_utils/src/type_env.rs:1471-1481 | rust_port/crates/flow_typing_utils/src/type_env.rs:1485-1495 | rust_port/crates/flow_typing_utils/src/type_env.rs:1499-1509 | rust_port/crates/flow_typing_utils/src/type_env.rs:1513-1524 | rust_port/crates/flow_typing_utils/src/type_env.rs:1530-1540 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_env.rs:1513\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de9ac2eb10937a5740b39ab5e776eda2343db18cd1b690304b56333d13f0a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3503-3513 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:5194-5204 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:3503\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf86c4a9e22032fd22ac7f10bc8815320b54f967498764d86650670ad998fce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/statement.rs:14604-14614 | rust_port/crates/flow_typing_statement/src/statement.rs:14792-14802 | rust_port/crates/flow_typing_statement/src/statement.rs:14820-14830 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14604\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14803\u0060 calls \u0060mk_reason\u0060, \u0060dupe\u0060 and \u0060rust_port/crates/flow_typing_statement/src/statement.rs:14615\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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28415f4d7fce278de844e05ec6471be085523478aaddfe0d14060bb83c52147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:3221-3230 | rust_port/crates/flow_typing_debug/src/lib.rs:3543-3553 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:3543\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"23851003b4ac2cb3f76785fd694429d0bd41ed16d3971844c82d70d033791657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_port/crates/flow_parser_wasm/src/serializer.rs:1905-1915 | rust_port/crates/flow_parser_wasm/src/serializer.rs:1917-1927 \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":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e9765963bff45871b6b7975206eac2fd37131a8d2e179ea5f63c911be1f810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_cli/src/cycle_command.rs:15-24 | rust_port/crates/flow_cli/src/save_state_command.rs:19-28 \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 \u0060rust_port/crates/flow_cli/src/cycle_command.rs:15\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/cycle_command.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"25071d54b7ea132e6e1603f3fee509e0b930066c02e923030889e671b4a1f0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:4775-4784 | rust_port/crates/flow_typing_statement/src/statement.rs:4981-4990 \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 \u0060rust_port/crates/flow_typing_statement/src/statement.rs:4775\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2dd5ae2e3ccfb11a075cbab6d719042202e2cd2e8b89ed40a5883aa8c4926a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_debug/src/lib.rs:3634-3643 | rust_port/crates/flow_typing_debug/src/lib.rs:4182-4191 | rust_port/crates/flow_typing_debug/src/lib.rs:4199-4208 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_debug/src/lib.rs:3634\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":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca2d130f2734222b6b19bc8013e4f9c43398466a54706b163aa5622aefb5700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust_port/crates/flow_typing_debug/src/lib.rs:3210-3219 | rust_port/crates/flow_typing_debug/src/lib.rs:3232-3241 | rust_port/crates/flow_typing_debug/src/lib.rs:3243-3252 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c751163d2d7366e152024eaf37bbdcc932ae945f729fcc73a2ea00d0a2cadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:108-117 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:172-181 \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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"09579e3d73567a836f3f130e64b8fd638d72c8716f1e75b2e2651f39d74edc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_printer.rs:1579-1588 | rust_port/crates/flow_common_ty/src/ty_printer.rs:1598-1607 \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 \u0060rust_port/crates/flow_common_ty/src/ty_printer.rs:1579\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":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cab57236eaebaa7435d5c7a70cd08c719dac748ab0cc1d8ec7f57052f5bbd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs:171-180 | rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs:189-198 \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 \u0060rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs:171\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":"rust_port/crates/flow_typing_loc_env/src/match_pattern_ir.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e47af3c9b6a6397eaa9a974b43135013ca8d51873fe28cecfb26bb95f2e9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6715-6724 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6728-6737 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6715\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f8e44488a966376d3ec0568eac3e7b6f142af2eab3112443d02aa3ef8c52e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:294-303 | rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:412-421 \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 \u0060rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs:294\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":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5830059331290f2fa8bf720f31fcb7ddc9e21089aa0da4d284343f4fa0c786b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:1372-1380 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:2339-2344 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:1372\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e15e9f4b0b0ff413f39e06486c71aec8b7083866fec8bcb5cc8ed3e06fdbac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): rust_port/crates/flow_env_builder/src/name_def.rs:5120-5128 | rust_port/crates/flow_env_builder/src/name_def.rs:5172-5180 | rust_port/crates/flow_env_builder/src/name_def.rs:5278-5286 | rust_port/crates/flow_env_builder/src/name_def.rs:5333-5341 \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 \u0060rust_port/crates/flow_env_builder/src/name_def.rs:5120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69663150ca3614cfefb15d7efcac2516cf6cb16c58d9f0bc307009e9bb4bdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2206-2214 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2243-2251 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:2206\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7115a8011b9add9b73541771a5dac0d0002b4d6b0f2f21f994520db886efdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1202-1210 | rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1218-1225 \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 \u0060rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs:1202\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":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f005da7316310c05ae678d81e29d54a9c6a5056f3eeee3b54016b74ad4e3a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_context/src/lib.rs:3422-3430 | rust_port/crates/flow_typing_context/src/lib.rs:3439-3447 \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":"rust_port/crates/flow_typing_context/src/lib.rs"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0512c7c231cbf4fceab6e1b7e5b144870532e5a1f21c832a64d5afc193b40dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13): rust_port/crates/flow_cli/src/agent_helper_command.rs:254-262 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:94-101 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:201-208 | rust_port/crates/flow_cli/src/apply_code_action_command.rs:300-307 | rust_port/crates/flow_cli/src/autocomplete_command.rs:167-173 | rust_port/crates/flow_cli/src/autofix_command.rs:177-184 | rust_port/crates/flow_cli/src/autofix_command.rs:349-356 | rust_port/crates/flow_cli/src/autofix_command.rs:518-524 | rust_port/crates/flow_cli/src/check_contents_command.rs:73-80 | rust_port/crates/flow_cli/src/coverage_command.rs:382-388 | rust_port/crates/flow_cli/src/dump_types_command.rs:158-166 | rust_port/crates/flow_cli/src/inlay_hint_command.rs:101-109 | rust_port/crates/flow_cli/src/type_of_name_command.rs:168-176 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/dump_types_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/dump_types_command.rs:158\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, \u0060rust_port/crates/flow_cli/src/autofix_command.rs:184\u0060 calls \u0060get\u0060, \u0060truthy\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/agent_helper_command.rs:262\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":"rust_port/crates/flow_cli/src/agent_helper_command.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1158128e750b66a2bb88704f0cd6787c047e2233eab6e0446eb3cfa40491142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_cli/src/force_recheck_command.rs:83-88 | rust_port/crates/flow_cli/src/ls_command.rs:373-381 \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 \u0060rust_port/crates/flow_cli/src/ls_command.rs:373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/force_recheck_command.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b17bcc03afa220a14afe51dcdc96555b0ba47454e007f0e1b6b44fe64883f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/check_contents_command.rs:190-198 | rust_port/crates/flow_cli/src/check_contents_command.rs:205-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/check_contents_command.rs:190\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":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"070d7252e001351135a271fb2d13262900c95b8de45c559a9ae4207c33ca3cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/foreground_check_commands.rs:330-338 | rust_port/crates/flow_cli/src/foreground_check_commands.rs:380-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_cli/src/foreground_check_commands.rs:330\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_cli/src/foreground_check_commands.rs:389\u0060 calls \u0060add_saved_state_flags\u0060 and \u0060rust_port/crates/flow_cli/src/foreground_check_commands.rs:339\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":"rust_port/crates/flow_cli/src/foreground_check_commands.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"886ee182789fb210d5f9619505cbd23b91924e17e9ceca533a186c6b6f574f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_cli/src/autocomplete_command.rs:32-40 | rust_port/crates/flow_cli/src/get_def_command.rs:18-26 \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 \u0060rust_port/crates/flow_cli/src/autocomplete_command.rs:32\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autocomplete_command.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"36be524a497bc955b0f5ea0a8a34f6cf2c1b12aef2516d8416394a0b108ec43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:4904-4912 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5030-5038 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:5096-5104 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:4904\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b488e361c816228dfb734448c6e8f482a9657b3c621fa35c97cc15707eca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser/src/declaration_parser.rs:617-625 | rust_port/crates/flow_parser/src/declaration_parser.rs:628-636 \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 \u0060rust_port/crates/flow_parser/src/declaration_parser.rs:617\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82f7c3bbeb2240f96d8a05063ebd27c70bc5d045ca5955057700ba9de13a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6591-6599 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:7363-7371 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6591\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6591}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6aff844a287c1c305efceff936d2bdec6015b095a27c5fc7c9b43b5c5fe94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/func_sig.rs:723-731 | rust_port/crates/flow_typing_statement/src/func_sig.rs:750-758 \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 \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:723\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed7f539b8dd168f39f8d37f2fba28aba8b10fa4f7d9a0357e9839ff04466f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust_port/crates/flow_typing_statement/src/func_sig.rs:694-702 | rust_port/crates/flow_typing_statement/src/func_sig.rs:721-729 | rust_port/crates/flow_typing_statement/src/func_sig.rs:748-756 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:694\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a36519150860f9c6fda98af6405234c247b8f0186c5a5e82cb11330769f9a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing_type/src/type_.rs:3950-3958 | rust_port/crates/flow_typing_type/src/type_.rs:4564-4572 \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 \u0060rust_port/crates/flow_typing_type/src/type_.rs:3950\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":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3950}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c12ad386b765e782ea18f868fce395eeaa845b0d44bb421a7070445697513b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): rust_port/crates/flow_typing_debug/src/lib.rs:2166-2174 | rust_port/crates/flow_typing_debug/src/lib.rs:2183-2191 | rust_port/crates/flow_typing_debug/src/lib.rs:2200-2208 | rust_port/crates/flow_typing_debug/src/lib.rs:2217-2225 | rust_port/crates/flow_typing_debug/src/lib.rs:3256-3264 | rust_port/crates/flow_typing_debug/src/lib.rs:4195-4203 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_debug/src/lib.rs:2166\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f5626e67cc3ff4098a62d155966417f514f08a0e73ec540b3f0add6b816d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2430-2437 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2677-2684 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2700-2706 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2824-2831 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2908-2914 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2938-2944 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2430\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10738568cf11cc79088556460fd5f1b9ecb2e382f5553cfca15523c850ecf9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_env.rs:1104-1111 | rust_port/crates/flow_typing_utils/src/type_env.rs:1118-1124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f529e7f3ef409b904ede94d0489982feda723dfd347735abac9819bed22947f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_services_code_action/src/code_action_service.rs:2056-2062 | rust_port/crates/flow_services_code_action/src/code_action_service.rs:2080-2087 \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 \u0060rust_port/crates/flow_services_code_action/src/code_action_service.rs:2056\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb2ea67ade8f7eac98b6881292d0775e9ba1dfb1d88cb0acff038c9fa6aab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/file_watcher.rs:908-914 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:917-924 \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 \u0060rust_port/crates/flow_server_monitor/src/file_watcher.rs:908\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a845110141b764afd30f870af47735801bba84099a14232d1dc8e91f15b1a9b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_debug/src/lib.rs:3221-3227 | rust_port/crates/flow_typing_debug/src/lib.rs:3561-3568 \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 \u0060rust_port/crates/flow_typing_debug/src/lib.rs:3221\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":3221}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f57caedb4bd0624a032f70343bd583487324c98574fafd25188592dd35a573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:5207-5213 | rust_port/crates/flow_env_builder/src/name_def.rs:5233-5239 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":5207}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa58f938eb6bc046a275b92fc514920b66af77746f96ac5c704104819a91f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:305-311 | rust_port/crates/flow_parser/src/type_parser.rs:367-373 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:305\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76f3a89c05531d44ce76352689efc89e1846cb4974281dd61824e9140c02316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3254-3257 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3328-3334 | rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3365-3371 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs:3254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aad47b317b9989831ce497d89427e077906256f51985fa7292faca9688059e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11310-11314 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11319-11323 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11328-11332 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11337-11341 | rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11346-11352 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs:11346\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":11310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08f753906a8f56346ab2e6a062a9d8c31512bc18f2ef2e61f20775c2706c336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_analysis/src/property_assignment.rs:351-357 | rust_port/crates/flow_analysis/src/property_assignment.rs:472-478 \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 \u0060rust_port/crates/flow_analysis/src/property_assignment.rs:351\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expr\u0060 to \u0060\u0026\u0027ast ast::expression::Member\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026\u0027ast ast::expression::Call\u003CALoc, ALoc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/property_assignment.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3a7631899ab0de6296b06d2b883def20d9cf7c959f98eb9b5fc98f5e4a8475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): rust_port/crates/flow_typing_statement/src/type_annotation.rs:2292-2298 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2432-2438 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2679-2685 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2702-2707 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2804-2809 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2826-2832 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2910-2915 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2919-2924 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2940-2945 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:2967-2972 \u2014 all 10 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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:2292\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c30ea1b0e8d78945a106beac5b66c6314dec7939780844bc568144ea1c509f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6151-6157 | rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6161-6167 \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 \u0060rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs:6151\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":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":6151}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb5e5bd1646773820c446cb22d9e849864c31afcf80255b4ab42e4c48466495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_parser/src/estree_translator.rs:2304-2310 | rust_port/crates/flow_parser/src/estree_translator.rs:2374-2380 \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 \u0060rust_port/crates/flow_parser/src/estree_translator.rs:2304\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b57249a8f176d207aaa042099217694f0957d2fbb69ea29dc4ce7b0d7e48db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_semver/src/semver_version.rs:181-187 | rust_port/crates/flow_common_semver/src/semver_version.rs:188-194 \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":"rust_port/crates/flow_common_semver/src/semver_version.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10cade72b783b4f6e4f3c9f7f444d5466d0db0ce7567805747fa460046d6d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_cli/src/init_command.rs:95-101 | rust_port/crates/flow_cli/src/init_command.rs:109-113 \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 \u0060rust_port/crates/flow_cli/src/init_command.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/init_command.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9043db718fc6aef006b267352352d7cc7052a0e1761da6ed9963ca8ea5b26b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:2997-3003 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:3008-3014 \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 \u0060rust_port/crates/flow_server_command_handler/src/command_handler.rs:2997\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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95740e47330821355f5164c0ab6fc012db6781fa2516ad229b6bd8eb00cdc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_server_monitor/src/flow_server_monitor_connection.rs:373-378 | rust_port/crates/flow_server_monitor/src/flow_server_monitor_connection.rs:387-392 \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 \u0060rust_port/crates/flow_server_monitor/src/flow_server_monitor_connection.rs:373\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":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_connection.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38280aa18887ec93e0fe120b420ca8ff7ab9660b20b87a9c2c20e69336461c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/convert_types.rs:471-476 | rust_port/crates/flow_typing_utils/src/convert_types.rs:478-483 \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":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e94d1c8635af5e6d5c3d6eecab5190f8a72ed9f325e2fae8b8c495bb0c52477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_parser/src/flow_lexer.rs:1491-1496 | rust_port/crates/flow_parser/src/flow_lexer.rs:1517-1522 \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 \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1491\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e13dc21a045b162e06a37d508dac562caeb96273d09f4a803fb47daf8de6ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/func_sig.rs:225-230 | rust_port/crates/flow_typing_statement/src/func_sig.rs:235-240 \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 \u0060rust_port/crates/flow_typing_statement/src/func_sig.rs:225\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":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08876b31d77cb229c46fd298de265d4be3596fe90cf5e126b52ca86b258e4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:1492-1497 | rust_port/crates/flow_parser/src/flow_lexer.rs:1518-1523 | rust_port/crates/flow_parser/src/flow_lexer.rs:1595-1600 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1492\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd307b66fc9a36917d716e6415f1742a0102ba6db3d12c00563c5a76392d0570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:570-575 | rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:619-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:576\u0060 calls \u0060as_str\u0060 and \u0060rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs:625\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":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4f89ab34080efd1d59e196ee28861837a8557a3d68690e18dbc4cc5da7f692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9461-9467 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9614-9620 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9461\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9461}}}],"partialFingerprints":{"codehealthFindingId/v1":"979058c26554ee87be7cd144e2f1bc821660dcaec5231c2aa4e25b89daf30f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9532-9538 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9539-9545 \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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9532\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9532}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba4ec78d21ab0d4331dd8b161af8c46808d7560e2ed6886ce03c8a6aa5a649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_parser/src/flow_lexer.rs:1366-1370 | rust_port/crates/flow_parser/src/flow_lexer.rs:1616-1620 | rust_port/crates/flow_parser/src/flow_lexer.rs:1627-1631 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_parser/src/flow_lexer.rs:1366\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":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e293901c14437f2144cb88204f1b3199d867223f1a7b5f24f0d13bee6fc0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_cli/src/autofix_command.rs:186-190 | rust_port/crates/flow_cli/src/type_of_name_command.rs:180-184 \u2014 before extracting anything, compare \u0060rust_port/crates/flow_cli/src/autofix_command.rs\u0060 and \u0060rust_port/crates/flow_cli/src/type_of_name_command.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_cli/src/autofix_command.rs:185\u0060 calls \u0060get\u0060, \u0060truthy\u0060, \u0060unwrap\u0060 and \u0060rust_port/crates/flow_cli/src/type_of_name_command.rs:179\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":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d86c940d77be66d09ba43207af0d1886dd35109c2403afc2663274765cfcd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_cli/src/lsp_command.rs:42-46 | rust_port/crates/flow_cli/src/stop_command.rs:35-39 \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":"rust_port/crates/flow_cli/src/lsp_command.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25e424e3253511fc3a7826fc132986ac20d4254c4da7f743a4e4e49e04f240f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:130-134 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:152-156 | rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:174-178 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs:130\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":"rust_port/crates/flow_services_code_action/src/convert_type_to_readonly_form.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b685e3704df2dbead89bf0f044f91c7ce783b757e1bf45d88c2bdb6a5480092f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9024-9028 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9031-9035 \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 \u0060rust_port/crates/flow_typing_errors/src/intermediate_error.rs:9024\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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":9024}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65e7b69913b7de3c521aca9176c15e33ce7f5060707542146d2be95c4a57020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9422-9426 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9433-9437 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9465-9469 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9472-9476 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9479-9483 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9500-9504 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9515-9519 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9522-9526 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9529-9533 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9536-9540 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9543-9547 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9568-9572 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9604-9608 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9611-9615 | rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9618-9622 \u2014 all 15 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 \u0060rust_port/crates/flow_type_sig/src/type_sig_parse.rs:9422\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":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":9422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78dc5fa8e93a03514cca9385239ca73adc4bea2237ee6417086e0a6717ea30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty.rs:3495-3499 | rust_port/crates/flow_common_ty/src/ty.rs:3571-3575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_common_ty/src/ty.rs:3494\u0060 calls \u0060on_bool\u0060 and \u0060rust_port/crates/flow_common_ty/src/ty.rs:3570\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":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec385b55f00a0cb4efdeb96d59f0d49c5aa088b0e567fa067211dd1ee676936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_common_ty/src/ty.rs:3514-3518 | rust_port/crates/flow_common_ty/src/ty.rs:3522-3526 | rust_port/crates/flow_common_ty/src/ty.rs:3530-3534 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":3514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43089ca86d57e1a7bb842eba2ae4fb64868ad8d54b64ca86336c1e4f674f386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_common_ty/src/ty_utils.rs:638-644 | rust_port/crates/flow_common_ty/src/ty_utils.rs:690-696 \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":"rust_port/crates/flow_common_ty/src/ty_utils.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93da9b4ae427571cb1b56d1c0ad0a78fe6ea178c5aa4094d8d100dd6fe3bbbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_common_utils/src/graph.rs:487-491 | rust_port/crates/flow_common_utils/src/graph.rs:564-568 \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 \u0060rust_port/crates/flow_common_utils/src/graph.rs:487\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":"rust_port/crates/flow_common_utils/src/graph.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"21998a226b36207b3425181c50924acac40906584dd7172dc1824e8f2255cfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_env_builder/src/name_def.rs:2802-2806 | rust_port/crates/flow_typing_statement/src/statement.rs:20592-20596 \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":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f90c9f86aa754e6548a5057235a9ca60488d6027d5d38883305206e2d447e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_lsp_server/src/flow_lsp.rs:1473-1477 | rust_port/crates/flow_lsp_server/src/flow_lsp.rs:1489-1493 \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 \u0060rust_port/crates/flow_lsp_server/src/flow_lsp.rs:1473\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":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3f7b138b2f4cf3e64198858dede2aae2a0698388c22239562a7af629a31d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/ast_visitor.rs:12455-12459 | rust_port/crates/flow_parser/src/ast_visitor.rs:12489-12493 \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":"rust_port/crates/flow_parser/src/ast_visitor.rs"},"region":{"startLine":12455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68857cfe808428dc12aa21d5744561a054f5fb48547a8be3617f6327cd9517a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/object_parser.rs:374-378 | rust_port/crates/flow_parser/src/object_parser.rs:393-397 \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 \u0060rust_port/crates/flow_parser/src/object_parser.rs:374\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1939c62289dac8c82a1bb68ac64de699cf1a5c63a3f676dbb1f5eb207d97f7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6619-6623 | rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs:6635-6639 \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":"rust_port/crates/flow_parser/src/polymorphic_ast_mapper.rs"},"region":{"startLine":6619}}}],"partialFingerprints":{"codehealthFindingId/v1":"252035ce4007c59d74b04e6cbed5ff4cd9f10f1b86c41f96ed07e13ccd2622a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_parser/src/type_parser.rs:1839-1843 | rust_port/crates/flow_parser/src/type_parser.rs:1989-1993 \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 \u0060rust_port/crates/flow_parser/src/type_parser.rs:1839\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":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77c2fbc3a6d6a439f4b08288c97f255f0239dfe274a9fd04fb605f861f9fd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_profiling/src/profiling_js.rs:167-173 | rust_port/crates/flow_profiling/src/profiling_js.rs:186-192 \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":"rust_port/crates/flow_profiling/src/profiling_js.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a57a359e87bd3c9a1d63d61756c943d35c9b416f4cea82eec97d790bfa515a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_server_command_handler/src/command_handler.rs:1306-1310 | rust_port/crates/flow_server_command_handler/src/command_handler.rs:1331-1335 \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":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0660f66f4275e58dbfe0b7f0ab362bcd8e88a1df3f78341320579bea4acadb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_server_monitor/src/file_watcher.rs:619-623 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1356-1360 | rust_port/crates/flow_server_monitor/src/file_watcher.rs:1569-1573 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_server_monitor/src/file_watcher.rs:619\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_server_monitor/src/file_watcher.rs:1354\u0060 calls \u0060clone\u0060 and \u0060rust_port/crates/flow_server_monitor/src/file_watcher.rs:1568\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":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37faa718b8a27ebe94f015f97580dc3ca77f4e05f5abb5922951c05841a28af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:787-791 | rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:800-804 \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 \u0060rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs:787\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ident\u0060 to \u0060\u0026\u0027ast ast::Identifier\u003CALoc, ALoc\u003E\u0060 in one and \u0060\u0026\u0027ast ast::jsx::Identifier\u003CALoc, ALoc\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf86cd963e89a3df0dfddaeaf93c101ab4f7c0e133202739da6f4f22cbf2b0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_services_inference/src/type_service.rs:204-208 | rust_port/crates/flow_services_inference/src/type_service.rs:209-213 | rust_port/crates/flow_services_inference/src/type_service.rs:214-218 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47b8107133611dc466321ac23d5336e38fc2310021a35bcc6f3962e391bdba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_port/crates/flow_typing/src/ty_members.rs:169-177 | rust_port/crates/flow_typing/src/ty_members.rs:207-215 \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 \u0060rust_port/crates/flow_typing/src/ty_members.rs:169\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3127cf7b2b80a49cbf8f77653e958dd90318f709df5233d50a0c95492ae221e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7372-7376 | rust_port/crates/flow_typing_errors/src/intermediate_error.rs:7476-7480 \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":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":7372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60bb6d8b1e7591ef1b41507d6be9161ccdd39012f080142a4e3651d7b4975c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:557-561 | rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:684-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs:557\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":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7121ac1a7ab0d102237441a0292d01684c3d8372654d4b85b746f8d075558c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:2868-2873 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:2880-2885 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":2868}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16760ba932784ae23ad5c04b41a7f44cf13decfa960669f8c034400c4e3c908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4566-4572 | rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs:4597-4603 \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":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":4566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc8d9b43466e98f801b9c805b9caeab0b652479288840a9e98965ce0c7fb3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:866-870 | rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs:871-875 \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":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"087d9acd9874e08e163cd881ac8db3c4ee474f8ad4c1532eae03ee8315384ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:155-159 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:212-216 \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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4f82e9fdc2e74f9834000d9d37d7c9e78c7590790dfd3aa0f0c998c86cc57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:918-923 | rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1003-1008 \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 \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:917\u0060 calls \u0060validate_placeholders\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs:1002\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":"rust_port/crates/flow_typing_flow_js/src/template_literal_type.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d7efde7c2b80a0d5350681926dd698d1e68bfe1aaa4aaafa22269da927525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/statement.rs:11338-11342 | rust_port/crates/flow_typing_statement/src/statement.rs:11392-11396 \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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11338}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7074c0b3831ed63da2f205673b906a61c641e6fd7293a1f6012c171c2d70dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:1332-1336 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:1356-1360 \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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5df00c798c7840b49a67fd76441465c4e858391fe06f67dee90cea7b135df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_statement/src/type_annotation.rs:4966-4970 | rust_port/crates/flow_typing_statement/src/type_annotation.rs:5047-5051 \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 \u0060rust_port/crates/flow_typing_statement/src/type_annotation.rs:4966\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":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":4966}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a03bd03a87664eeb4126553217cdaa658df3dbdee68b8b67c30c29bcd56658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust_port/crates/flow_typing_type/src/type_util.rs:1531-1535 | rust_port/crates/flow_typing_type/src/type_util.rs:1596-1600 | rust_port/crates/flow_typing_type/src/type_util.rs:1611-1615 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_type/src/type_util.rs:1531\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eee1858b4359091b92dd727ca84814002a577d5e7054864cc2ac5c1e28e9c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/abnormal.rs:68-72 | rust_port/crates/flow_typing_utils/src/abnormal.rs:133-137 \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 \u0060rust_port/crates/flow_typing_utils/src/abnormal.rs:68\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":"rust_port/crates/flow_typing_utils/src/abnormal.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde8c14fc68e73cf787c5f2d94a6699f57899e30c998951c216cc46f356954b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:256-260 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:267-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:256\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43bfb88de5f59079da3f35e53b1ac2519b38ef296614b17e8ce433e4ab429d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6514-6518 | rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6527-6531 \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 \u0060rust_port/crates/flow_typing_utils/src/type_sig_merge.rs:6514\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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":6514}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f0cb29516b27405b8de12b56912610d3069ee483c1f109a32559306fd3b0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): evals/compile_swebench.py:440-453 | evals/compile_swebench.py:530-544 \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":"evals/compile_swebench.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f3e652eb31ffb4780911049b151dbf07e5a0196b3844ed7a2456e8acc53477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): evals/compile_swebench.py:464-473 | evals/compile_swebench.py:561-571 \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":"evals/compile_swebench.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d48b71de1d9a8f15265e34f48b1b6f8f426526b9a5be54fa5183aff53e702b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): rust_port/crates/flow_command_spec/src/lib.rs:556-568 | rust_port/crates/flow_command_spec/src/lib.rs:574-588 \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 \u0060rust_port/crates/flow_command_spec/src/lib.rs:556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_command_spec/src/lib.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"337c4da736be20163916abd98855b1b3a0beeacd9d1bd257ea6eb5921c7badc6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FindDeclarations (LCOM4 31): FindDeclarations\u0027s methods fall into 31 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 31 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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fc4a0f5671f75a70b4ea8f354cf7361548b982c4b329ffc32c77ca604f78e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FindProviders (LCOM4 25): FindProviders\u0027s methods fall into 25 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 25 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":"rust_port/crates/flow_env_builder/src/find_providers.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff4b6119f9b40fa14e62777830087a62f27a844dfe1ef57a5ad355e53f48629"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TrailingCommentsRemover (LCOM4 18): TrailingCommentsRemover\u0027s methods fall into 18 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 18 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":"rust_port/crates/flow_parser/src/comment_attachment.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3855e300654672d8a32d43943ea238de6458296fa018784fc9276b30b84dabcb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScopeBuilder (LCOM4 16): ScopeBuilder\u0027s methods fall into 16 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 16 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":"rust_port/crates/flow_analysis/src/scope_builder.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481a1f654d56c9758978b1310fbb6daae8822d6ccc1a6e1b7847a21532d5584"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NameResolver (LCOM4 14): NameResolver\u0027s methods fall into 14 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 14 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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cd67bba4d7bc439837c365461dd8fbedb03d69357fefb8e08ee011f0aa3feb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SsaBuilder (LCOM4 13): SsaBuilder\u0027s methods fall into 13 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 13 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":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ed79bd14b5c5652434fe2cbb6319791fb4f21d6ca953fc70d7b884afdba906"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TypedParse (LCOM4 8): TypedParse\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":"rust_port/crates/flow_heap/src/parse.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0caa09c6f374e05c67b651ba967e46109577f9c9a59c782efa650aa303e059"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UseVisitor (LCOM4 7): UseVisitor\u0027s methods fall into 7 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 7 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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6acccc64ce9b5ce0f444c078914855552723dfe7151fb377c984db4ccfa20d3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StripFlow (LCOM4 6): StripFlow\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/babel_adapter/strip_flow.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7887d02d65c462473dd6dba1fadb6d481afcb4b9bc44329ee19860659c72724e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExtractedInformationCollector (LCOM4 6): ExtractedInformationCollector\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/refactor_extract_utils.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5081f93010b9ab4c71320f87499f6d70264c51402be9e711aaacf7188d549c9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DeadCodeMarker (LCOM4 5): DeadCodeMarker\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":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":12038}}}],"partialFingerprints":{"codehealthFindingId/v1":"75353efc06c8aef894b5f6db92bd6c080db8fbe17d3d043b779b94ca1470cc94"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DefFinder (LCOM4 4): DefFinder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1d7b1354236b4fe5fb37780fa7accc0f289d3058b5702a985c08432cfef22c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProcessRequestSearcher (LCOM4 4): ProcessRequestSearcher\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_js.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5130246ab40b189b59710f9380e38bdd34e8fde4e8406137a4d8ed38035b4153"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Searcher (LCOM4 4): Searcher\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_utils.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4318e77809c74c9ef263d3c70f8d21f454f864025fdb57dfee4da1b249d021b6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Substituter (LCOM4 4): Substituter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbfe8a70d265c5fbb5935336e008eae2c15202f935373ac9e4b6d91b6d00bbd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Op (LCOM4 4): Op\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":11028}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbad6a9cec5112ac56f8ad67e276bbe2df3aa9465b342cd1fa60bd8e2154c5a4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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":"tests/closure/callback_writes.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caabc563b350db7d4e1431a7a88137bd3c085c35f85ce5e44af74d20a51b910"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: first: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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":"tests/closure/callback_writes.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae1604c2eb4faa7f7e41704414acf7ebfadd30ab46d7f52736b1254c80ac210"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: second: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, 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":"tests/closure/callback_writes.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae2dec87b639821b274cd6963bcbe19bd7ee3fefbad82e169605ef82b8ab86f"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: the repository root: No conventional assertion call was detected in 3 of 3 tests in \u0060the repository root\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/closure/callback_writes.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a2307e3469564e7adb5e73dd96fc45d3341ee484187c0a1f77a57240f3651a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_errors/src/intermediate_error.rs: rust_port/crates/flow_typing_errors/src/intermediate_error.rs changed 172 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 885 in flow_typing_errors::intermediate_error::to_printable_error at line 4398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_errors/src/intermediate_error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/intermediate_error.rs"},"region":{"startLine":4398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac5340dc8e7b99efde7a461918d4c7daa9800a584c0dda9dffbc41dec59f443"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs changed 153 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 693 in flow_typing_flow_js::flow_js::dispatch::__flow_impl at line 633. 3 of those changes were fix/bug commits, and the other 150 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b2ac9957ef3c129ac3a5e2ed58c2b7c926854607b1df85c403677c3e80a227"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_debug/src/lib.rs: rust_port/crates/flow_typing_debug/src/lib.rs changed 115 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 426 in flow_typing_debug::dump_error_message at line 1966. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_debug/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d790becacce13c7eb0c3cfe51a861af27fb38849e3598e545924bfe9eaab25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_errors/src/error_message.rs: rust_port/crates/flow_typing_errors/src/error_message.rs changed 140 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 334 in ErrorMessage::friendly_message_of_msg at line 9925. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_errors/src/error_message.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":9925}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b5384fa7161772bc98c9a6db9a8aca6e657c217ce1a9afc172cef4df418f59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs: rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs changed 112 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 315 in flow_typing_flow_js::subtyping_kit::rec_sub_t at line 3054. 3 of those changes were fix/bug commits, and the other 109 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068d026b2c7fec7ce3e1aae207a3ad423ea1c4692d53291dcff5485071e41b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/statement.rs: rust_port/crates/flow_typing_statement/src/statement.rs changed 178 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 183 in flow_typing_statement::statement::statement_ at line 2275. 3 of those changes were fix/bug commits, and the other 175 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/statement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e38995642a7083dbb05441a54bb13b3a1e9ef33e688b17dc6b4720a115632b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/type_annotation.rs: rust_port/crates/flow_typing_statement/src/type_annotation.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 199 in flow_typing_statement::type_annotation::convert_inner at line 1143. 4 of those changes were fix/bug commits, and the other 83 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/type_annotation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b300c49dddaadb58a401c7b51ae84627c383c8d054d75670331702bd37ef77a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_type/src/type_.rs: rust_port/crates/flow_typing_type/src/type_.rs changed 140 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in UseTInner::eq at line 3388. 2 of those changes were fix/bug commits, and the other 138 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_type/src/type_.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1f9f71858034b6d5dd28e288273e4aa8d983cccb1e390e60bbf15ff79600a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/annotation_inference.rs: rust_port/crates/flow_typing_utils/src/annotation_inference.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 196 in flow_typing_utils::annotation_inference::elab_t_concrete at line 1127. 3 of those changes were fix/bug commits, and the other 51 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/annotation_inference.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5cb262cb367730f828c2c2b3daed747429e00cf908283022bc3ea465d6e30e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/type_sig_merge.rs: rust_port/crates/flow_typing_utils/src/type_sig_merge.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in flow_typing_utils::type_sig_merge::merge_annot at line 2034. 3 of those changes were fix/bug commits, and the other 76 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/type_sig_merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8e7bceefc96b5f2e636d367c3cb2c4a034cbb46ad45c2f3c0bf3bf3187c63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_type/src/type_util.rs: rust_port/crates/flow_typing_type/src/type_util.rs changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in flow_typing_type::type_util::mod_loc_of_virtual_use_op at line 1079. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_type/src/type_util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1200219de4886c4a41ae4cd44de54a3f8bee2f920ea45f5bd45465269f327441"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs: rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs changed 130 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in flow_typing_flow_common::flow_js_utils::primary_reason_of_use_op at line 1761. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e15aa746d10752ec09d86a8cc07d4d6a5f7f23490e53cb50fb40e6d3f0834ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-api-translator/src/flowDefToTSDef.js: packages/flow-api-translator/src/flowDefToTSDef.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 320 in flowDefToTSDef.getTransforms at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-api-translator/src/flowDefToTSDef.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad408f17f4ac0277bd578f92c84a729b564e1a0d86098ce18e490585065c95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs: rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in Walker::walk_structural at line 1146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9118d8570596e137af3a400c2e7963c253d64f11ec2724e3d80791db7aba6e5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs: rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in flow_typing_flow_js::implicit_instantiation::t_of_use_t at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ef1c0da78d87ef7124aa4e95cd0e5e2eefe0bda2d5ae289cb7cd84b3232013"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_type_sig/src/type_sig_parse.rs: rust_port/crates/flow_type_sig/src/type_sig_parse.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in flow_type_sig::type_sig_parse::expression at line 10357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_type_sig/src/type_sig_parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49449cbdc24165c43a7c6846138d48f26063bf4f2ee507348acc8e8756e6fca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_services_code_action/src/code_action_service.rs: rust_port/crates/flow_services_code_action/src/code_action_service.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in flow_services_code_action::code_action_service::ast_transforms_of_error at line 1106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_services_code_action/src/code_action_service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c318c3adafae01b7bedff1d1ab4d6d8e5d79c81537600911a56a75fcfefbcb6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in flow_typing_flow_js::flow_js::helpers::handle_generic at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/helpers.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d314a143bcb3da5d3b511a7d23521709e41f7bb8b1c9f40197144feca5b1f3ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing/src/env_resolution.rs: rust_port/crates/flow_typing/src/env_resolution.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in flow_typing::env_resolution::resolve_binding at line 1306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing/src/env_resolution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd4e84d37000ce7080bd229281652c168c152eb090b604fea9edf4158a5293"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_env_builder/src/name_def.rs: rust_port/crates/flow_env_builder/src/name_def.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in DefFinder::statement_list at line 4827. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_env_builder/src/name_def.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea08d773522fbdc31ac480e6f3bffdff7e6073c3bcaba766590871381310516d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs: rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in flow_typing_ty_normalizer::normalizer::type_converter::type_ctor at line 1416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b0d23c5b5e8c4ef9236caef0695143cfaf236c8436b677c73208231443e85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs: rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in NameResolver::visit_match_pattern at line 4416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":4416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3850904937fcedef98490fb9ceaabeb16f9b916e8c02d5edc934439f5f7e0f1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/predicate_kit.rs: rust_port/crates/flow_typing_utils/src/predicate_kit.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in flow_typing_utils::predicate_kit::intersect_type_guard at line 1587. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/predicate_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"563c943c8973757e4cd256bc19f7a51474e2c2b0b2fbb876671bceec680af740"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_command_utils/src/lib.rs: rust_port/crates/flow_command_utils/src/lib.rs changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in flow_command_utils::connect_and_make_request_inner at line 2918. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_command_utils/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_command_utils/src/lib.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b84c93783f781a45aec2c8865f9edd49f02a9f3f19bda80424118e1b184878"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing/src/merge.rs: rust_port/crates/flow_typing/src/merge.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in flow_typing::merge::detect_sketchy_null_checks at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing/src/merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/merge.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef06b387493dd97ecc69e362ca70e9801b60c28bf9281df5960b8363b45a823"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in flow_typing_flow_js::flow_js::multi_arg_helpers::finish_resolve_spread_list at line 526. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/multi_arg_helpers.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eac01455c47b329e373cf467cca499b536c62038f32be985e24f4170a4b600f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_common_ty/src/ty_printer.rs: rust_port/crates/flow_common_ty/src/ty_printer.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in flow_common_ty::ty_printer::type_impl at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_common_ty/src/ty_printer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_printer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb18cef88ceb32b7d14d5d59f2247223fd1609d54fd2a775f708cd9dcf8019d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/default_resolve.rs: rust_port/crates/flow_typing_flow_js/src/default_resolve.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in flow_typing_flow_js::default_resolve::default_resolve_touts at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/default_resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/default_resolve.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeaf936a9099da36a055a937b0beb30b9755c77bf842542270be3d464600f44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/check_polarity.rs: rust_port/crates/flow_typing_utils/src/check_polarity.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in flow_typing_utils::check_polarity::check_polarity_impl at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/check_polarity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94a2d838980cdf281fd04fd005f6c69b9f56368d67d603a87cda3110b090bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/slice_utils.rs: rust_port/crates/flow_typing_flow_js/src/slice_utils.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in flow_typing_flow_js::slice_utils::resolve_with_env at line 2314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/slice_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"98298dd9342d46073b6d662a67b9a4cbaf4301c84c0e60ed89eee5f177c83471"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/type_hint.rs: rust_port/crates/flow_typing_utils/src/type_hint.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in flow_typing_utils::type_hint::type_of_hint_decomposition at line 827. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/type_hint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_hint.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cca16e402110ee645c8c3a5ac5a56bf83ab19be5e6c4c59461d6ad466b478b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/object_parser.rs: rust_port/crates/flow_parser/src/object_parser.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 149 in flow_parser::object_parser::class_element at line 1036. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/object_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"4336dee122c9ed724b6a0374c6c59d1ec9b0aaf466bfd0166e417218fbc0d922"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/members.rs: rust_port/crates/flow_typing_utils/src/members.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in flow_typing_utils::members::merge_type at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f78f4ec6dfd350570dd7c987326a624ee7c30ec01893f671846a60f7dc2a2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/estree_translator.rs: rust_port/crates/flow_parser/src/estree_translator.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in flow_parser::estree_translator::statement at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/estree_translator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa317e163be5f3c0b485b9a7f99f4bc0411b10becb5b8c460ead2c2bee187aea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/type_operation_utils.rs: rust_port/crates/flow_typing_utils/src/type_operation_utils.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in flow_typing_utils::type_operation_utils::perform_type_cast_with_env at line 2089. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/type_operation_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_operation_utils.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"00128e66e5e0ab1442709fbca9ea054432f10cb4b838a8835d1790d8e0871375"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/type_parser.rs: rust_port/crates/flow_parser/src/type_parser.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in flow_parser::type_parser::object_type at line 2474. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/type_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/type_parser.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"60417c0cb3cbcaa72b0db1efd94de6b07027ca2930486df16d5ee1756e6cdd6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in flow_typing_flow_js::flow_js::eval_helpers::eval_destructor at line 445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/eval_helpers.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c8d7f5eec0faae637ac64ddb28e4abe10266142a504e9a7d91a0e52de6a36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs: rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in flow_env_builder_resolver::name_def_ordering::depends at line 1442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b9020247a851d6f204aa5288b9f22a92876a336727d77e62e2f2fd4baac13d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/exhaustive.rs: rust_port/crates/flow_typing_utils/src/exhaustive.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in flow_typing_utils::exhaustive::filter_object_by_pattern at line 1859. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/exhaustive.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c44f12286fcb9b67c246effdb4b29086e56531f07a76f02ede3fd60058cf94f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/parse_error.rs: rust_port/crates/flow_parser/src/parse_error.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 193 in ParseError::fmt at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/parse_error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parse_error.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6923b1276ea318c41e9360236fc8d6b587c9bab5cffb8622a4b13161ae959dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_visitors/src/type_mapper.rs: rust_port/crates/flow_typing_visitors/src/type_mapper.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in flow_typing_visitors::type_mapper::type_default at line 363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_visitors/src/type_mapper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_visitors/src/type_mapper.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"18173f7ab604c0f2b1254a9c5d245ddc69a41fbc9d257f9c023be27c3f6746ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in flow_typing_flow_js::flow_js::unification_helpers::__unify_inner at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c12307866a04730badbe60123924526c708eafcb9c01e4e05ea0d3a6a7f862a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_server_command_handler/src/command_handler.rs: rust_port/crates/flow_server_command_handler/src/command_handler.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in flow_server_command_handler::command_handler::get_persistent_handler at line 7244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_server_command_handler/src/command_handler.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":7244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfef5c59958f1fa605a073bc575aea122a42ccb67126e978332e91def77c5b36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_type_sig/src/type_sig.rs: rust_port/crates/flow_type_sig/src/type_sig.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in Annot::iter at line 2536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_type_sig/src/type_sig.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed4096c7e27b26f5db2353183a199aa28dbc8592f54cc76c54707cbfec03a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/react_kit.rs: rust_port/crates/flow_typing_flow_js/src/react_kit.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in flow_typing_flow_js::react_kit::run_with_env at line 741. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/react_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d846478c6e0fb99e887302cad007b1813f2480d9b5acd80d4d116bce07ff0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-api-translator/src/TSDefToFlowDef.js: packages/flow-api-translator/src/TSDefToFlowDef.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 225 in TSDefToFlowDef.getTransforms at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-api-translator/src/TSDefToFlowDef.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e040e595e106d1d44ddbfc8aff174f86e0e54b1b682a0bec55b34871beea1815"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/class_sig.rs: rust_port/crates/flow_typing_statement/src/class_sig.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in flow_typing_statement::class_sig::elements at line 810. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/class_sig.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9ec328c7f9bb3843699b52f70dac9677c8f8f5710d81d06a63d8fcf189ba1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/func_sig.rs: rust_port/crates/flow_typing_statement/src/func_sig.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in flow_typing_statement::func_sig::toplevels at line 477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/func_sig.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/func_sig.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6836f1be6a54e4c14e75f04b03da063b03ee1a8006315513faf6d56b9c68880d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs: rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in flow_typing_statement::module_info_analyzer::visit_toplevel_statement at line 410. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/module_info_analyzer.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a517a3543f61f8441f09ae66ceeefca20070190274f6a216ac9f2934f2583ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in flow_typing_flow_js::flow_js::inheritance_helpers::inst_structural_subtype at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69534ca0f27ab4a225ba4a6061d41970347f2918be399d7358d81d6cc302c65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/object_kit.rs: rust_port/crates/flow_typing_flow_js/src/object_kit.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in flow_typing_flow_js::object_kit::run_with_env at line 563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/object_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8940893fdcd26164c748c12003f8143249916ae44bbc9e0beb13127293c2d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/convert_types.rs: rust_port/crates/flow_typing_utils/src/convert_types.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in flow_typing_utils::convert_types::json_of_destructor at line 1104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/convert_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f44f22fe6c3790bfd4e7cfc7b7c4473022405b17043894fc1cd795f0b1c07ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/type_env.rs: rust_port/crates/flow_typing_utils/src/type_env.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in flow_typing_utils::type_env::predicate_of_refinement at line 996. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/type_env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_env.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb210e0c4cbcbd0300c06fadcebe90eeb506f5a975f2820eb5de267d66031e1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser_wasm/src/serializer.rs: rust_port/crates/flow_parser_wasm/src/serializer.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Serializer::serialize_class_body_element at line 2398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser_wasm/src/serializer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/serializer.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9a34867fc0fb658d22b2da0a72ea788c39a100564116e3738321d991a89324"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs: rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in flow_parser_utils_output::js_layout_generator::expression at line 1536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdec09d28d898aa557faaac2ca76fdcafb05ebe24ce5aaaa1f151f252b2b4bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_common_ty/src/ty.rs: rust_port/crates/flow_common_ty/src/ty.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TyIterTy::default_on_t at line 1199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_common_ty/src/ty.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"be973d6f826710449a5761eb9803ebd7af8c68c8ad7157685b168e242dff88b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/statement_parser.rs: rust_port/crates/flow_parser/src/statement_parser.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in flow_parser::statement_parser::export_declaration at line 2844. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/statement_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/statement_parser.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc2c1da131903be95d86cb5a73a3cfa3f106e586a11125c34dbc7c8072442f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing/src/query_types.rs: rust_port/crates/flow_typing/src/query_types.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in flow_typing::query_types::type_at_pos_type at line 479. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing/src/query_types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/query_types.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2384dbb2a473e4a85c21b5c33823037b3a52cd94cca568c3ba8854bc57e975"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_common/src/type_subst.rs: rust_port/crates/flow_typing_flow_common/src/type_subst.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Substituter::type_ at line 640. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_common/src/type_subst.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/type_subst.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"148da37ee8d0f72ed0d9c15c83d245d4c03a3a79f4985bbaa1d55b16471ee238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_common_ty/src/ty_debug.rs: rust_port/crates/flow_common_ty/src/ty_debug.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in flow_common_ty::ty_debug::dump_t at line 568. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_common_ty/src/ty_debug.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_debug.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"251fd884e328f07c72db360ee273c913a3dbc68c7e5082302044e4a0000a34b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_utils/src/type_filter.rs: rust_port/crates/flow_typing_utils/src/type_filter.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in flow_typing_utils::type_filter::not_truthy at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_utils/src/type_filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_filter.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8eee8f9a91af70934bc2fe06ed84f4e876a87376e2827a7bc5141d06fe3e935"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser_wasm/src/lib.rs: rust_port/crates/flow_parser_wasm/src/lib.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in flow_parser_wasm::hermesParse at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser_wasm/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/lib.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d93527062dc46e244c9a9273680a1b80bd6dfd65f6ab6212f3d3604a7e4804c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs: rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in flow_typing_flow_js::flow_js::any_helpers::any_propagated at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3478255ae5d59d43e8d78047e921ff791dd1e60baf572571eaf07267b9bfa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/natural_inference.rs: rust_port/crates/flow_typing_flow_js/src/natural_inference.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flow_typing_flow_js::natural_inference::literal_type_mapper_type_dispatch at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/natural_inference.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/natural_inference.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"96064659f4d41da9a9238d7e531085dbb1baea418e88aeea56f68ba0b1aa8b57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/ast_utils.rs: rust_port/crates/flow_parser/src/ast_utils.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in flow_parser::ast_utils::acceptable_statement_in_declaration_context at line 678. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/ast_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"050f72d0890a7e77003959cc6e5a884d72df7818941f2e07f66f73eb8dc03dd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_common/src/files.rs: rust_port/crates/flow_common/src/files.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in flow_common::files::make_next_files at line 1032. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_common/src/files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/files.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6196fa092a2556baf91bb164b5ef38db921f7c06c46178d46d5a124d59625a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/main_parser.rs: rust_port/crates/flow_parser/src/main_parser.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in flow_parser::main_parser::check_for_duplicate_exports at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/main_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/main_parser.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce42071b252a4dcc18c75900d832e7bb08300a9c869826bd3c404669f37e96f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/renders_kit.rs: rust_port/crates/flow_typing_flow_js/src/renders_kit.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in flow_typing_flow_js::renders_kit::try_synthesize_render_type_with_env at line 713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/renders_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/renders_kit.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400e06bf6999d7366564a094005644c73fda50359f18016e8d9088fe5030367"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_statement/src/react_rules.rs: rust_port/crates/flow_typing_statement/src/react_rules.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in WholeAstVisitor::visit_function_with_id at line 1444. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_statement/src/react_rules.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/react_rules.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dee0ad12fb2464bb776e7d0e945dd448ed7a841cac890d5958a023d31a3193f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-parser/oxidized-src/estree/StripFlowTypes.js: packages/flow-parser/oxidized-src/estree/StripFlowTypes.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in StripFlowTypes.transformProgram at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-parser/oxidized-src/estree/StripFlowTypes.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd901cb0517855dfe48144618e85f2685c8e4872dfd4f8d9bfabc635ab8c19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs: rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in flow_services_autocomplete::autocomplete_service_js::autocomplete_get_results at line 3054. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autocomplete_service_js.rs"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8634a6bdc6d086604339ad878fae5dc188ac1abdf17b15300a98ce69340661cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parsing/src/parsing_service.rs: rust_port/crates/flow_parsing/src/parsing_service.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flow_parsing::parsing_service::reducer at line 502. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parsing/src/parsing_service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e104f04be9c5c97263ba6c63b88d22b4df4aca6ff6cea6a1d62b63a603525d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_visitors/src/type_visitor.rs: rust_port/crates/flow_typing_visitors/src/type_visitor.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in flow_typing_visitors::type_visitor::type_default at line 302. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_visitors/src/type_visitor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_visitors/src/type_visitor.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e3ae19b1935c6c95eef4f61c73754b05b6c94fe35b37ecf825749b78ea6df3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing/src/ty_members.rs: rust_port/crates/flow_typing/src/ty_members.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in flow_typing::ty_members::members_of_ty at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing/src/ty_members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca5c7c926c73ed7e633977a9faff81cd5c6dfdbe36ad4716fee2703d64c6b93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/expression_parser.rs: rust_port/crates/flow_parser/src/expression_parser.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in flow_parser::expression_parser::member_cover at line 1766. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/expression_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2301ad1cd757cb5aaf0fd7540f3097fc1406f15bdb3d360904a803078bdfba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js: packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in eliminateAbstractComponent.eliminateAbstractComponent at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac04988daedc39f4562a1e755b06c9423d2ed2263a9da4c650ba112933203f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_lsp_server/src/flow_lsp.rs: rust_port/crates/flow_lsp_server/src/flow_lsp.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flow_lsp_server::flow_lsp::main_handle_unsafe at line 3272. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_lsp_server/src/flow_lsp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp_server/src/flow_lsp.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c884069e80c28b780f5ed92b5d6ebb7d6055ce814cd56ab7d4b05d1747f5d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_type_sig/src/type_sig_mark.rs: rust_port/crates/flow_type_sig/src/type_sig_mark.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in flow_type_sig::type_sig_mark::mark_local_binding at line 240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_type_sig/src/type_sig_mark.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_mark.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf7ec36dddef2f6ff14f952779acdbfc347023ac36bfa9ad907b938c92fbd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_common_errors/src/error_utils.rs: rust_port/crates/flow_common_errors/src/error_utils.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in flow_common_errors::error_utils::cli_output::print_message_friendly at line 2978. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_common_errors/src/error_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ece47a88182427063be02916ccb7155fc871482c0493616c37a00e7a06c6f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs: rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in flow_typing_flow_js::speculation_kit::optimize_spec_try_shortcut at line 895. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/speculation_kit.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca69334e8a7eaa5b23c8119176697c3c661479d24f286389a1757102ff0bc448"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/__tests__/flow_dot_js_smoke_test.js: src/__tests__/flow_dot_js_smoke_test.js changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in main at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- src/__tests__/flow_dot_js_smoke_test.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/flow_dot_js_smoke_test.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"afded303942f7b454eb1a865731395b4a5719d27ffc89d90d171a5fc9e45bdba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser/src/declaration_parser.rs: rust_port/crates/flow_parser/src/declaration_parser.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in flow_parser::declaration_parser::parse_function_params at line 331. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser/src/declaration_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/declaration_parser.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f10076327776b8216369cb5891f46c879dbd8c6138bd76880773586239d28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-parser/oxidized-src/FlowParser.js: packages/flow-parser/oxidized-src/FlowParser.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FlowParser.detectSourceType at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-parser/oxidized-src/FlowParser.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84c22cfeca2602a2451553134e533f888a424e37899cdd3da3c1c3dca999b9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_services_code_action/src/insert_type_utils.rs: rust_port/crates/flow_services_code_action/src/insert_type_utils.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TypeNormalizationHardcodedFixesMapper::on_union at line 1418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_services_code_action/src/insert_type_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/insert_type_utils.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4110a3b112fe53007c2916f42d7d3803c54cbf807e427bf7230f04a05f8e6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_parser_wasm/src/bin/codegen.rs: rust_port/crates/flow_parser_wasm/src/bin/codegen.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in flow_parser_wasm::bin::codegen::generate_estree_predicates at line 1363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_parser_wasm/src/bin/codegen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0ee265b1ab9173dae27cead494b99b96e2627277cb184270fba44215a9571f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_services_get_def/src/get_def_js.rs: rust_port/crates/flow_services_get_def/src/get_def_js.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in flow_services_get_def::get_def_js::get_def at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_services_get_def/src/get_def_js.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_js.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86f9e9db777acbf4fc2aa08bbfbbaf489f34e414330a63abe1563cdc92d6de2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: evals/run_swebench.py: evals/run_swebench.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in run_swebench.run_eval at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- evals/run_swebench.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/run_swebench.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"38562892463ef429cbe256eacf59ef5cad1e82d7a47243fd6ef02cd5de11c259"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-dev-tools/src/test/runTestSuite.js: packages/flow-dev-tools/src/test/runTestSuite.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in runTestSuite at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-dev-tools/src/test/runTestSuite.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/test/runTestSuite.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3332609edbb3a73ec98b85b1c44988ad3f6cddcdb9c31f83b0f02a2c473ebd5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs: rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in flow_server_monitor::flow_server_monitor::internal_start at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a488c29dea846e0f27c916b7bc07b3edfdb855d76ddd6930d1c74cbd304f23d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs: rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flow_typing_flow_common::concrete_type_eq::eq_with_env at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/concrete_type_eq.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5588d24c1d4bbf9d399c1cb454c6d2d3584f41157b14f2f8df3609da1e48e3d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_services_code_action/src/document_paste.rs: rust_port/crates/flow_services_code_action/src/document_paste.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ImportInformationExtractor::import_declaration at line 134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_services_code_action/src/document_paste.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/document_paste.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9004dcf5af779af8a18dfa777ee0d02e796a6229a8deab9c8e7a41824e4c4a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_cli/src/ls_command.rs: rust_port/crates/flow_cli/src/ls_command.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in flow_cli_support::ls_command::main_impl at line 347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_cli/src/ls_command.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/ls_command.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca9b801f01deb96e219752e1d498cbb632963d83979d970cea1fa80b884dd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js: packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mutateESTreeASTForPrettier.mutate at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d79cfc69cd2c4a3b40964ccb8dccb67841d2b8b7754ac998302c82aa2398baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_port/crates/flow_type_sig/src/type_sig_pack.rs: rust_port/crates/flow_type_sig/src/type_sig_pack.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in flow_type_sig::type_sig_pack::pack_local_binding at line 863. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 17:21:27 -08:00\u0027 --until=\u00272026-11-13 17:21:27 -08:00\u0027 --full-history --no-merges -- rust_port/crates/flow_type_sig/src/type_sig_pack.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_pack.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"30151b170914a33187d37bae01db91f08a5a37c301865967f00bf71a7559169d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 132 significant file(s) lose their only recent owner: rust_port/crates/flow_typing_debug/src/lib.rs, rust_port/crates/flow_lsp_server/src/flow_lsp.rs, rust_port/crates/flow_typing_flow_js/src/slice_utils.rs, rust_port/crates/flow_services_code_action/src/code_action_service.rs, rust_port/crates/flow_typing_type/src/type_util.rs, rust_port/crates/flow_parser/src/flow_lexer.rs, rust_port/crates/flow_env_builder/src/find_providers.rs, rust_port/crates/flow_common/src/reason.rs (\u002B124 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"63fb14de1a8146b819e14b72774d792bae28e9bd8c4ea1295d7c9cf92f34613b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: rust_port/crates/flow_env_builder/src/assertion_call_target.rs, rust_port/crates/flow_typing/src/declared_types.rs, rust_port/crates/flow_env_builder/src/nonvoid_return.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d4c51719b58c11e757e4035a471dd986ad6b74c561432db5ade4fe97c4f94be"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (137 single-owned of 534 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 534 of the 783 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part4.rs, rust_port/crates/flow_parser_utils/src/object_type_key.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enumerate all use types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/annotation_inference.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75af16825ec662bbc37307c40c1fcdd3e74c683174dca34251798d0c213e58f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enumerate all use types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":12161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad52d026d8277dd61c64cc224f85463852e896a2f5c64670fb32f97420b1b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: flesh this out \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ef5f87443489e9b3645a6bcf268a6615fcd08b66b807a3261edd899e95d96"}},{"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":"rust_port/crates/flow_typing_utils/src/check_polarity.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef96adfd39e2af0afa0a7a080e8a0201e3e70616e45784f22c04df2bea392e6"}},{"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":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6cbeaaf093c79f2c19a2d4a40dd447c170f4ee634697738792fb2b511956ee"}},{"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":"rust_port/crates/flow_lsp_server/src/document_symbol_provider.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46bcc244f76d069aed61d0f0f773568aadbc5d274654e2ceadd161e5945459a"}},{"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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cb2d5732cb9f79583ed253cb49c502825aaa4e5e57b4836d916b6d8ca98759"}},{"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":"rust_port/crates/flow_env_builder_resolver/src/name_def_ordering.rs"},"region":{"startLine":4001}}}],"partialFingerprints":{"codehealthFindingId/v1":"422a351e10df7252fe774a459fbebe94c3897b504b0b44242536820d718eecaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: prop_map needs more investigation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c6c25cfa237ad312759fec30ab6c585a2e3b9073042a9981d614e84d7cef04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update existing machinery to return the info we want and use that instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/exhaustive.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce37c225888fa47e24768e1263ebc7ed3320d237ca84a3074806521b2d209bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How to merge param names? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b158bd4136c16b2da411806bebc0a3488b6a6cf06991564f2ccc07c6d8a81514"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: How to merge rest names and locs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42e83cae841b43203b4079e545580b6c092c351b4cce3079455d696db36705a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merging type guards would require aligning param names as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff14f58900ba16a8ec8c1d22a1be6f07599daee748b75ff79f26a9dd91d25d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need to do anything special for merging Null with Void, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0db3d4de4307d5f0ef7ba11829f5cbca17027b1304e2b0677e46cb7fc4e278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need to do anything special for merging Null with Void, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c49d987673a55151f9379df4aed665ce394b34bc38fca4167395b3514178e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace type parameters with stable/proper names? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"83de4c1fcb07338bf0eaabf1de90eac0407b7e300fcf0233e06aec456f978e38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It isn\u0027t currently possible to return two types for a given \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"876797ee780153ba2659fc14b2c26019844b0f69273bf7e8483f7f2f318a876a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: own props should take precedence \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/members.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf04dfd2432c94551099091dda5b00eb3b07a132389991e5e78bada1a2fa2ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: own props should take precedence \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":6350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef77345ceae01434765f9d89459776eb10137fc79ed9b8d339753ee4f03ff01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: for the moment we only support simple keys (empty projection) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"455091d584e97227703a6aaf2918a4495093c0d0b24f25934b48ef5f2be550da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possibly unsound to filter out orig_obj here, but if we don\u0027t, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":2496}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d122ea3387efab09571a466518fcbc0178b0f2561d3da671864b92f37db0ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: possibly unsound to filter out orig_obj here, but if we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a440d1b9a64c9d105b9c51730de446c3df4785c2c2993498974bba582e4006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a3ca7acecc2f1cd4989a25f0de6b0308e44e4040882759092a8e7e5fdb6a5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6481787ddfe12ecebc75c2d58100cd16ab5bb3474938cd06af58be4720563a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d945ceaf5d00a123ecdc3693f448c121f14da37e1fcacdb11aebed99ab1b789f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c79a5fe099413da9e75bab0613ef9c813614025d193ca2ff685b9cf397597e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"9563d64ef107c7ac5b85c168a62e612fb172a74f96666e4bc75cdb268b64a45f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use_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":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"315f42f5e0f75b24536f1d8c5c29c697f8ac1a77871974c6427e7fe72f744cea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix spread to use provided __proto__ prop \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/type_sig_merge.rs"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"11313b8fe399900a65e0a631c3c1e14ad7c45a3676ad4f91c9fc8e4feb63681c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // but it\u0027s OK if they are in practice. TODO: consider making this an internal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_.rs"},"region":{"startLine":12158}}}],"partialFingerprints":{"codehealthFindingId/v1":"01668b7d6393fc2e88db721e0f42af5897cb44ef9a69b401e555f6e6f2af1d46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make a type visitor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_type/src/type_util.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5274e0bdca7461a4d8010807135070344e0cca9a5c65ad6eb72dcd595a0967d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will potentially report a remote name. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_ty_normalizer/src/normalizer.rs"},"region":{"startLine":4041}}}],"partialFingerprints":{"codehealthFindingId/v1":"911d88dd2c1fafc5af6afb063d0772a73bdcb4c49d8d1c416c97531744214757"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // intersection of super types. TODO: Instead of using an intersection for \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6372b2d2f39e227b73747696a2c4bafec115ffe3dede50f32b9f606d942f8ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally we should check polarity for all class types, but this flag is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f578e25cda7ba8875a98824a02f1b5031b8bd4fc48c8a6d19f387a370098d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use tparams_map instead of calculating this 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":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e33c19f0e43cd218d7151085bf4b31ba295bcd0b0baaa67a9b3766267ba83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can also specialize when there are targs, because this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/class_sig.rs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb010a449be49eb54e781afd3d6096f002d52b4961a4593ed60f8f39ad6e16a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO destructuring\u002Bdefaults unsupported in assignment expressions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/destructuring.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9902e142c2da690da383ff8d69f7508a49e637a0f4b42af6cabb0c2b24ddab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This assumption does not always hold. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc2288f4867e51845a76cf20c3b48bb8e9d1a6050d36c925e4c37db394841b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use tparams_map \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1ba1b20ecb198a66eeadb342655a1348f86309aeb17b8ad396dd1a3f2c044e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vijayramamurthy): what is the type of \u0060Object.name\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac1a8aceee05f33bb7e3185036ff0bac59f486254c0ae8148d593119f9f0cc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: object, array and non-member expression patterns are invalid \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":11807}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31f9c53aeae1ef5b3f6fc2ff3d66e808876a1081e7dc9499887c7d135c9d4e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we could make it configurable like the jsx pragma, with the @jsxFrag directive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2451cd9161706e71c42c71c4992dfd017076c1b573835ce198889efa6e8f64b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO check attribute types against an fbt API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":12954}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32d11e787f6c45444a707e673101c290403caf87e4a37aa1bda6cbbef5542b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? covers namespaced names as element names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b73976c0f5991a4ed1d6b6faa94e11e7163fb0d7045a963f81769064d59026"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: attributes with namespaced names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5022bc789f3bdb07ce3d80fab72db7df48040a71b0df390edf68d59bd2cc7cdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Model jsx more faithfully. children are now passed in as part of the props \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":13847}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efd13de5e1654b4419223903ba58b1b9d5a86bd3b38c17b6b4a212eb56c9a07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It should be possible to factor the processing of LHS / reference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3089b7c4940cab992e177038236a09c4e3bd9801c2bcfdaa36c654d163be41b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vijayramamurthy) construct object type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":14757}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a67594fcf378d940c5a6b70749586514d029aa2e3dc3ee0549f0de9b002903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(vijayramamurthy) construct object type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7644d3a1d827195f9cf0575cf0d21b7db74a21ea8d442634cc53ec1513989890"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(pvekris) expr could be an \u0060as const\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":15567}}}],"partialFingerprints":{"codehealthFindingId/v1":"322545c9d22ad5271d4614e071e1489cc224d6a3035bbaad6fb144fdb9793b4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we could probably take the same shortcut for functions with an explicit \u0060void\u0060 annotation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/statement.rs"},"region":{"startLine":20714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8651f155101c778e9cd71e1c507681d6f9ec857c6d9b8577f992fb27bb7c6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: interfaces don\u0027t have a name field, or even statics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_statement/src/type_annotation.rs"},"region":{"startLine":8959}}}],"partialFingerprints":{"codehealthFindingId/v1":"f224b0483c6d47917e517e3debe9ab489f94f2f438df48475db0f78bf8d8ba2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Handle defaults on type parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6473d5990e712b9a640cd82bbbbcefd4966bc3c2bc2f1f2fceec76b0efec61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: await should look up Promise in the environment instead of going directly to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"840d1c5efe4f3e84f1144902ed51766c409218ea6d04b253aec8c30f985cbbd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update this comment when recursive unwrapping of Promise is done. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e867e090b9125f5a01ff9cbaba3ec78d6e504d196093349c47003aaa2723c443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Add polarity information to props \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/object_kit.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"23da7833df37ef2f509f3eeb321f9d1dd941e30d2dad1a5511a2eb915e0ec241"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: generate reasons in a more principled way everywhere, so we don\u0027t need this hack. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/react_kit.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"120485730aa1c0d1fffcea172fd84828681b6ebf2d395493dada135f4fac643d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // be exact. TODO: Forbid writes to indexers through the photo chain. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4588828a25e9cc7071cb2aa8900da3d7298d46923dfdffb2ee9a7311399772bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Audit this condition. Should this be a conjunction? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4da821c145c402825e63ade6788748296c15622d8182f29e90655f141970351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Statics of a class. TODO: This logic is unfortunately duplicated from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d6a9c930fe9d66a340675957d82c082456292b0508609730ef261cc12071de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Investigate if these cases can be used for ReactConfig/ObjecRep/Rest. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb17827daef64e27924cee7e468d5f732bbabee22c269a7941f87a933b0db60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): This should be Inexact \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/slice_utils.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1978653d1f580e55c45b74a93a1be8b9dbedabae7b2a0f9668203d55a9dcfee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: somehow the original flow needs to be propagated as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe2057e07c77596cc80d8043bb05a99e15e6be750abddebefab0a0f2309661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make these rules great again by computing more reasonable summary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7b247cadf3ed2ded680349cd9de68cbb2054f064d0c43b604ecb4add38c7d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba9417abdc55926f4c58584d15b7589df53d2711869b97d00f988e7b380d606"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3732}}}],"partialFingerprints":{"codehealthFindingId/v1":"510f204092bd3f8f1ec4b16f8c932feb828513753210ee200084f3a8143a038b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3751}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d9c4fee76e1a4913e3f2a61c8e1e57f6bb5b4651efb89147d5ee9e9ec0523a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e651148fab0456fdf3a1de8255ace46e5a8861f807ab5a626232783cdb4e7ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"140d444c3ba2ce8170e0079cbbc6aa723afa0093f64658852c1e2cd10e34094b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0f931a5332523e6fe233d402a80bb6d338cb486f862fffd448a43abc5eba53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f28594892f3d55e2011423b7c1fb4713daa2e4b81aa54fc3f8abb112c326bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ordered_reasons should not be necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":3826}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9a98ddefe859b758552b488b201e34554c0d2553502f9bc454555484bd609b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // slices, but that approach behaves in nonobvious ways. TODO why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d4242073adb345a34cfe21b89aeb8afa49fee5d46fa7d6221b429862ef410"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally we\u0027d do the same when lower bounds flow to a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":4988}}}],"partialFingerprints":{"codehealthFindingId/v1":"009c4793a247fd6be5d4689b694b06f1072ee8f7f765cad9451769b951b53ad0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This rule doesn\u0027t interact very well with union-type checking. It \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6420}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a00e97fe3d0bc8227bb635279a2f913c5d548a5a4f07147e3d1451811c416c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: similar concern as above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e0c1c8dff263d0f0f221cb61c47e2e097326321ba4c1f24a733cc9e7ab5cfb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Call properties are excluded from the subclass compatibility \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs"},"region":{"startLine":6781}}}],"partialFingerprints":{"codehealthFindingId/v1":"1893d3a119919520ee41dc992ba29e87399656d20f5618aec352361295f9ffd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the cap on the number of ancestors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/implicit_instantiation/walk.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf209d2aa2e48415a992b3b3f570677cd31d81d2525104397d36404521c1e178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Proper InstanceT propagation has non-termation issues that requires 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":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"205fd1ddee963b383636d80983b04f323e9404dee707b5d82c70ffb3ec895e26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Punt on these for now, but figure out whether these should fall through or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6935b11d25a7a1b675ea0396f507ee9263945428f79f38f1fa9889cade9b5c57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Punt on these for now, but figure out whether these should fall through or not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"867df906b1084887ba46fbf9791d696e9809176be3481466473c1621f82d3bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: directly derive loc and desc from the reason of tvar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0a45ad801f860cd18d1780d8a47df976bfa36d0b331929a4445ef9f593797e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we can move to a single representation for singletons - \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b73b000559b1c614206e645eff5e77818502878a89095438e652265c01c2325"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it is conceivable that other things (e.g. functions) could also be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4729}}}],"partialFingerprints":{"codehealthFindingId/v1":"612c52e4ca3be501ddbe2e7a84dc09ef2effbcc26b4aedfb6c72af77f0bb0e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that this is a subtype of i? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":4989}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b20ea26503b7567b975459b0bb08915be83f795c7f6acc2f33f5513633d3f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix GetProtoT for InstanceT (and ClassT). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":6644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae7963000b2da7c105dce64d2094ad5799c7e56affa27552cf2f3a0b2498de4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inherited_method logic no longer applies for statics. It used to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":9066}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662a0d21f547286eda4dd1014a538d282a7c0ef910aec208de2796e5e8ce04b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: These properties should go in Object.prototype. Currently we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":10318}}}],"partialFingerprints":{"codehealthFindingId/v1":"786ff7dc48737560190e88b97de32b108bb1a9537a9f548378ec41ff50410957"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ditto above comment for Function.prototype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":10344}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d9af4e27d53b44df0415bed75f9b82759f1df4c3de283321e2b528cf09a8bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: own_props/proto_props is misleading, since they come from interfaces, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/inheritance_helpers.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dbf0892fa8864bbccbb68c94197f8a7410e2f0890fc8d3249fd9eeab69f1fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unification between concrete types is still implemented as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a573ef59e8a8a42c06b2a7a10bf7d361fe79cc198c46f399f344299e8a02bd0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: either ensure that array_unify is the same as array_flow both ways, or \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/unification_helpers.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfef8f8c2f1a2ee6b91339d762b0f8a12551892111aacee9dbbfaae290483fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider filtering these to OrdinaryNames only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34c143e6f35218b57849aa98960b3854b21365e1933532047b8dc74da441413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider filtering to OrdinaryNames only \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_common/src/flow_js_utils.rs"},"region":{"startLine":5715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3b0007a54f6b559b4a88d1381771a8f3de3ef29cb29ff0bc1cd480a285bc6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: any related suppressions should not be considered used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_suppressions.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cfc9d38763c4936ee6454f25a273c4e0eae9ba418e728f231f116545b4cc8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO print info about the key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5464944cd5f6910ed7d951c59fbd987aad87f33f49f9e58e9f43fcbf1173885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ban assertion functions in intersections at their definition. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/declared_types.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddb9938b4eb00d57b71e627d10ceb2a21d13b3c697b999a42efec899b3e94b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown) This feels incorrect \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cf50c1a39c8eea98d6a97c100bef22ff4c32b229ce831791eef6a585944337"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: eveyrthing after a computed prop should be optional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcb9bdece32efb41f1c712a4d62be563d24d4c36341f07d0359a3bae1e48aa4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO merge code with statement.rs implementation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d145db08c4c26fee23279dd7864dd92676bb0d0228e97acadca87ab38a3b60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: loc should be loc of loop \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/env_resolution.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f7ecc6df898f559c012e3e1233414598c38e63b3948a5f7bdb1963fb5df3f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Mapped Type autocomplete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/ty_members.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"92174394a5d3189ea83e6ee6b43e36441f4d874093f2d215c5b9dc3003166a02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (rballard): regional lint disabling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/type_inference.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f76a96121a6821af6e1d65966e6af36fd8234b76aa0fc4c81446656c72cc2bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also frame \u0060import\u0060 specifiers as \u0060(alias)\u0060 and enum members as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing/src/typed_ast_finder.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc23fee572c1318ccd9c4e7f6d69fc41090f918646f74f1780fcbab3b40af0c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should only special-case this logic if \u0022require\u0022 is not aliased \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10674}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb89bef4fa5e80e16e7aba5b47031eda302e40d3a0f4ac982e28a040f8b8a47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Similar to the \u0022require\u0022 case above, we should only special-case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10718}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1708491b564b6d064a0a42ff158fdedcf3031514f70948cc076ff83f862f99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In general, \u0022keyMirror\u0022 could resolve to anything. It might not be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":10771}}}],"partialFingerprints":{"codehealthFindingId/v1":"841f41d76ef5157c32152b8362a318c46d7735f73b8fc7c237610d882b1b2a36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Assignment expressions can alter the actual type of something in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_parse.rs"},"region":{"startLine":14844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d926efffe0540323306e0306592d86c51749992e7a22c87323e9458ea14f11fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This only handles global haste paths. It needs to handle relative \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_references/src/rename_module.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d817273c055a917c949982854cb8b24033febecc60de4ded7167c23be31f1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow partial edits \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_references/src/rename_module.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb60adf4e51841710136a3ea49b0501fdb281a8a533672532e4865ce9ec4acf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is OLD_M the same as NEW_M? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3bc8b4637882c1993b9f3dd28a75802a8b69cdeb7872fc83109fda0e9c600"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fully re-initializing from scratch doesn\u0027t make sense. instead, we should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cf778cd7fbeea7b0dd173ea798bd0c12841bf600353721628917baead2d1fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_get_def/src/get_def_process_location.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ebe98f23b3d0a8c2a3f4eacf018122c4a82c6d2d67f56bcb8ffaa60ff552d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a very coarse ranking. We could do much better. For example, we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_export_index/src/export_index.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"05678aa63c1602c26eb0d0dbde36f3868318420a3a96279ed7df601a0d6d4857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rethink coverage for these types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_coverage/src/lib.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98b715e090bbf8757f9649bd946dad93e85bcd1423bd86d4772681bee0addb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sort global modules above ../ above ./ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/autofix_imports.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"914cdc033dc8545798097e89209e9ea1232dd52c1e4faf7c7bbe35704d5b4244"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sort global modules above ../ above ./ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dcff40cb8f2fe484eb4d497319104c3b6cdff6390c68379f81ac33c61f6c1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO surface all errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/insert_type.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b23139bbaf2074267a8f3f61e450a1c65a08625d9e27cca4bbf7144acbf643"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle requires \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0550295c9696b133d7baa746b2d34a6f74abff837732a20af511aa84001da42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // a separate import. TODO: maybe make this a config option? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd3507326c29a233cc7a79646da928067982d855befe6ae5f8c88579c9cdc56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // import. TODO: maybe make this a config option? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"addf3da91d3ec46c4083ec7eca1c6fe7b78d554dfe79c5ed9fb689520db9b899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe make this a config option? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"769513cdf7cdb023b6ff471140efde20f4025864e8bb7cb1579066569275d345"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe make this a config option? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/autofix_imports.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7540b1567da0e3ae327c24d10b6d753e51ba5b92ce1e759155358a2c0a358c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle other kinds of patterns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/jsdoc_stub.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26255e2de9a8bb7b93fa007dc9efca437a59c5988a86b0559346ff8131806a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: include \u0060of\u0060, \u0060in\u0060, and \u0060instanceof\u0060. We don\u0027t currently autocomplete at positions where those are valid. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_autocomplete/src/keywords.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cc9f39e1854213fb96ca4c1d4078c75ae3ba06dd324af12fb6eb9dbd0bbca5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - Push-based API for dfind. While the FileWatcher API is push based, dfind is faking it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/file_watcher.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d443947be89db4dc76606a79bc9cb84922c57bdb625b568d4d902bebe4751228"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (glevi) - We probably don\u0027t need to make the monitor exit when the file watcher dies. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_monitor/src/flow_server_monitor_server.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"516af686f73309eecb6b6da5edb09b85102ec4c0604f882c1aaf263fb506b5c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to gracefully kill the workers. At the moment, if the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_monitor_listener.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289637c379ac71e2f7d049eddabda8d9c30a6de8daab06f298118988d105593"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use file_watcher_mergebase_with from flowconfig \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_saved_state_fetcher/src/saved_state_scm_fetcher.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504203fbdb97dcd441900c9ffd37741703ddbc8fa091b6317d816c97c095d56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use timestamp to enforce a max age. it can take longer to load \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_saved_state_fetcher/src/saved_state_scm_fetcher.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38d0b0c88c4bef0a68d363ffa94542c4c37680281ba1d59a9380ffe4a0a0fd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use expression context for printing to insert parens when actually needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/ast_diff_printer.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"241eca0dfab64689df2230f26df8439a1535bbd97799412dd3f618f7813344c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this only needs to be shallow; we don\u0027t need to walk into function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1b1b2e7f29ee041cf3de16ab18b5c80191ad4fec9a0cd20066124752a5bbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use a fold \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f42ccb8d71e3e59751360d4b39eb39592f9fa9f138e9d633a52bf34086a58a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO we shouldn\u0027t do this for the last attr \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e348c0411a86a7234c27f1ebe811fd1c0e5941e6c61970b615b7ddbe66cb530d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the \u0060Newline\u0060 hack, this forces newlines to exist \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":5272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38d2e1b8565c213defd79d0a40f6eed4cadcc6c911d37dd7de6b479dee05a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: getters/setters/constructors will never be async \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator.rs"},"region":{"startLine":7306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a312548437a92b347e06284c7c5970345bb9deddf1a1934c9e707b01b75686d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support matching break, inline, indent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/layout_test_utils.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"58caa3c3e26c5345c22b8a40a5dd95e89bd6f3537a98198e69e11e0e6add1c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/pretty_printer.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d9e9cf5e88b151b55b60d902548618c9ec6b0df0afd30ccd09439717d6b0ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: need to consider \u0060after\u0060. and indent? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/pretty_printer.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d897ba431fc87abded77d34c574b55b419e55aa74d63d5f3d6dea2105aa1dcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove any right trailing whitespace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/source.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"957a9f1646f0ced5a635eb0aacbf017c9648187ce856fec4c02ec5f2b4906601"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This comment printing is not ideal. However, this needs to also be fixed for functions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/component_test.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e66774d14400f698b6edbfee2f1b5ea7bea295a5e988ac038a7955420fd2b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This comment printing is not ideal. However, this needs to also be fixed for functions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/component_test.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3d6c7c6cdb5fe77a89a67d940726e0b8651954bd8500463cb9e32d313b6889"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This comment printing is not ideal. However, this needs to also be fixed for functions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/component_test.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7ad1eb1b5d41556088f2c98d4936f72f7be9caa3da08cad7f89bcbff74f7c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove space after do \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part1.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54285ef6d30200ab8c1803231b2bfd1e000f0b7d48b5470e9a46e35091188a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove trailing whitespace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part2.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ea20bc11994e288d6bd1a44fd17ec4897ac8fa734250abae801a02138fe34e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove extra space \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part2.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cc9ba834f53ec51415d66362dd01f77dcef7821dc2e51ed791b7ab6c139dfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove extra space \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part2.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a3085c7233cdafa54851d7ba9e60b7c8cedc26e776ad87d90504894c6c4ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this seems wrong, \u0060c {\u0060 should break onto a new line \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part2.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c70f2beaccd9a0c526ffe0802080a382c4a08851bc2c93bf3c6709fc622b14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flow does not parse this but should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part3.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9c9aa6c66feb355c6b5ebb66aeab82167592acce83b57cef4d11b742113b93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the RHS should be indented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part3.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71b01302854240ff7f487552cdc11442a1fec6e7e25c285d8e85420e5bab6fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the RHS should be indented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part3.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e9515f6ba5128c4eecd2dd7454fd17dcf2b0fd4c309ae240bf1f9c3a8cf767"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix trailing whitespace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part4.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3032bebe9734ed76f3294ac0e16915914c29f480be2547b43ab2b165e205a9dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix trailing whitespace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/inline_tests_part4.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aee32b4dd7019c0ba7fd67219e5f404bcc24514bfe56a647cfba01554f4bf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Utils_jsx.trim_jsx_text is overly aggressive for pretty \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/jsx_test.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c58c7be8335764b91a70633e6f74a69b5863a600b9fafebf4ccec0c3588715a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: valueless attributes shouldnt print trailing spaces when last \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/jsx_test.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8630e5aca40df054a35be6a1bd5d100ef0cd8a3b7a1f6eb325f75749848d72e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the second b40 should wrap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/object_test.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6327804703592dd3fc70512119220d12bffe6e994d7dec9b138658165c3ed019"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: inserts an extra line between line comments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils_output/src/js_layout_generator_test/program_test.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c5ec1b539f69e6dbe73a2679c4281732d13511d4b82625b5f9a60f699e0c43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle AsConstExpression, OptionalCall, OptionalMember, TSSatisfies \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/flow_ast_differ.rs"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b36900984b73665913fd355822a55428dd88e8124b767a7715d8b44b60a025"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider adding another name variant for munged property strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/signature_utils.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5d8d0e6b12430336da9b2e9988f77d5ec5e1058840e5f2abd6b7ec3393148e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jmbrown): Hoist declared components \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/ast_utils.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0ff36741418ecec092a87942a58deadca86a55f08ae0e30e0b3ad5694a243a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: extends shouldn\u0027t return an array \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646bf4e7738ff6a2cac35027400a42216e2fd583839bff96a32808f8d58a31c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // backwards-compatibility. TODO: change this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/estree_translator.rs"},"region":{"startLine":6095}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4802c5fa0402af7474fcd520acc4ccfc2edb3fa46fd8235c2252d4ba2bd443"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use [Symbol.iterator] instead of @@iterator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/flow_lexer.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b073d26bb8058ce929d067dc5fd0da08912612a79a2f236e03a2d24042f4ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add support for object method predicates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4597c934d388b282d812e78dbe950d9d91b47ab7b2d2032aa25a76c0e3fe6fc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add support for method predicates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/object_parser.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6680036519fa8ccf1ffe8f8d519e362d704be218f3485aabc2fa741c04ae7da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: run_full_test: depend on Flow_polymorphic_ast_mapper \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/offset_utils.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c727b456e1a53fe7652e3f80ab778b1d33abc27fa65775640d11f58d74c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flow should include this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d429194d8f4a7a84e89f02c1cf4b557a19f6e0929165c695c0e75ae7c2bc9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable this in tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"51307860e02772fba83ad33c7a4f358ae45e58c4f41d4906d9f7646f25dcacfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also check line and column \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f8a5c2e502f6927f243b40f57ddb79db5ba731abbcdb85f738e4b04a10d776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should insert gaps, but I don\u0027t expect people to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb0720d04628f4aba7c23b5eeb26f4cba0f05687a4da56a8e22f40c28b295b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle writing other kinds of diffs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"83428d0c62799a0e40b9e744598aaeb0560a53c16655808316965553c55c1c74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hardcoded allowed failure. They are just different in errors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/parser_integration_tests.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8618ad8521fada93468838ad9d827d610e7ad04fdec1ff06c8cfb43e0bea9b21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t clear live parse errors. Those don\u0027t require the server, so we can still keep \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_lsp_server/src/lsp_errors.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7538c1ca00a6df5f5e29a97494b60d1884a775633c8083b2bf98b5e2f67cc84b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: min_level should probably default to warn, but was historically info \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_logging_utils/src/lib.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d41165d97703b80a747e4c1dd68869bd58ee25b83b03bc0ccee8acb0c42e3e"}},{"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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804efcf9d8a59c5bed39c9c555c0fc6f50f5296ec7b1564f1a99ccb633c0a28"}},{"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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7ff9cd953641773b5fb29e0a93f0561575a45c322285ac34ff9088bd98a066"}},{"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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b93abaff5ef99465ee92151186247d835ad21f7e8dccd149c6cf1e3f39693"}},{"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":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0c9a46299fe57c5677e99c243745023b47341d1e759bd48406baf1366ddd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get \u0060_qual._name\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524091d401d68cda320cc04df5cdece07f02f27109aaf0afc1a228a1f14b518"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get \u0060_qual._name\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fdfc164fb244f45f70606ffa0dc210c213b97290083b8d5769f38bdda98d12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remember these cross-module aliases. if the remote thing matches, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b534b52997800137acc083470436dbd9779826fa0dfef890200c410b7bc455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remember these cross-module aliases. if the remote thing matches, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c592ad5646f9fb012a602672adc6b32d4679492e0455e28ef0fcfad2368df1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We cannot resolve to the underlying definition here from another module, so we don\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b3e465730acd06b7a78c68f0fd03bff8633bee00fc06b102b7630dd46b6209"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also DefaultType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports_tests.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8170d49a4c25954dba42e9d71ed277e6a6d1ab459727f53419ae3fc422ea82ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also DefaultType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports_tests.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d791cf333c77b8dc25fcde1a95813470428d6a61ee8b8625976d72ecc0efd44d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also DefaultType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports_tests.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"be622d0bbe0ef5969e62ac4abc09a8f0a7a98f499a5f73d4e408dc6c094a2a08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also DefaultType \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/exports_tests.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e5ce9a8f88059137eccddfe3167994caa4ae6f8f9f27ea12de670c0c70d6d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Require, ImportDynamic, etc. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_imports_exports/src/imports.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c3109bde7c3ae36f014075e89a8e0659ff627315032d0833dbdd96a233113"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO For now in \u0060x.f(x)\u0060 we do not consider the this-refinement on x. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9ddec46d3282f97af5cd8fccf06ce3ce84ee6e30ebb198651c26b0d078be6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently, optional call foo?.(...) is not modeled as NotR(MaybeR) on foo and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":8441}}}],"partialFingerprints":{"codehealthFindingId/v1":"046601e23c72b14874a59e2f353cfa7196ad9b2c6f4ba9b0c598904d5eb5f4f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what identifiers does \u0060\u003Cfoo:bar /\u003E\u0060 read? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder_resolver/src/name_resolver.rs"},"region":{"startLine":9390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb341cc7f20023e0c09e77666b5f6ec3369bb8218b694480907f6b8675e1d5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what identifiers does \u0060\u003Cfoo:bar /\u003E\u0060 read? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf66ec1aebca1a8f5dbc28b2c77dd20afedd5050a9912e3bcddc3bf4d9fabe7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be a parse error, but we only produce an internal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71d921632ec78ced3cc0ebfb41948d712e0303df081ca5dc72668934a48a510"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Complete implementation of all method overrides for full functionality. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea5920b80e793db8ff799749fc7722fb72c0ceb759c943fe38f7cffe12d960f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO update the logging provided in the end of the command \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/update_suppressions/update_suppressions.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"632153f44413c1f9b3329c59696b6c47bcc52cd4039856a92a25c0cff50e2fac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO consider making it an error to try to serialize an internal name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_ty/src/ty_serializer.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d75dd56f62e4a3978083a1228855c5449b4b80d6fb4d5ee2fa2829619c3a709"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support unions (\u0060||\u0060). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_semver/src/semver_range.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3664f37f6092a4b54549a7f79307fee05ac360908ba6e202d1b3c565bbbee54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // A fatal error with Watchman (TODO: dedupe with Watchman_error) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_exit_status/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0118f82debf8d6584b10b56013e17a9fb84e9cb4cdfd1821a35bc27dc0754f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this patch does not render well for speculative errors \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c47928218dbb25970ecfb9b8c344b648e2657308136ffe1da7c50dacbbb190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deprecate this in favor of Reason.json_of_loc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5e1317d574f9369cd5c18d1b97aa52234ead9a52a5a745c4e9a275e7f1f5c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return serde_json::Value::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":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fb1bf83e75ce57cb00129a471818e58cbe1ff06bf174c15fe98fe22680cc14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Handle orphans gracefully. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6e352d71e5dea567df7d51dd2d8333fbcd636bb736480bbddae43ad646a518"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Get a SHA for each file when we parse it, and include the SHA in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_errors/src/error_utils.rs"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68601deed25e11df07f03d999c622278dea953743f1899143621429e64e8449"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO type names should not be able to be internal names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33293e0e919bd4c4425c513a1e18c8dd5acaa6705de8c43aae6c020e6ab202a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO React element names should not allow internal names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common/src/reason.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bffb7768ec66d7d076fc94ad6877fa6aaecf391426c86a5fdcc9ad5afc8fc01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make these CLI flags \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/ast_command.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ffe5bddc19c053cb3a5453258980d519ae78fcebd24591145a66e825577ffa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this? kept for BC \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autocomplete_command.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8d270bcadfecd0a5d29254f35350c4bc643f37d1386696e636fc6ba2c9564c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Figure out how to implement root striping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c897eb881bbf8e312bf2f0f3cd620a78e3c4c1b8aa33d3c3df53175f41f6a50c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO implement a more useful set of error conditions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/autofix_command.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"02183af96b597f882d4b4b45b96ca642c7784a14765c7ca7ecb3955e84e9e2da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T138883537): There should be a way to configure which fix to apply \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6c1f1ea9ed261ced60ec45ab11bb9b32ef3f69db1416570ff8a2989ce4211"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(T138883537): There should be a way to configure which fix to apply \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/codemod_command.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba89726d444c45c372821f3873394c2c8a5ccb92e660ccf0ea57872db674282"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Given that at this point we also have loc1.start.offset \u003C \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/coverage_command.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bb2f6fddc3f4682ed729da43c8e9a2b15eb58d93d8ae2f46310330205d0215"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We reach this codepath for requires that might resolve to builtin \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d4b16fb3cd5f95bc09fe51220a81e2441ba64e71395c58f5e51ca4da8c982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally implemented as a fold, not a map. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a689a7d84ed10f661bd1dfe5252dd8eec6de311dc416e1abaa22f96f866e134"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It should be possible to vastly simplify hoisting by overriding the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/hoister.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9312b59527800abdda91c6be533ee751d162e69973ab1957306793b42bc86a5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: These low-level operations should probably be replaced by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_analysis/src/ssa_builder.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb390ade3a5d5c30c89e6a2f2b16ed28d6d44adc22cf8b66e3ecabb63d693be8"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060babel-plugin-transform-flow-enums\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/babel-plugin-transform-flow-enums/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":"packages/babel-plugin-transform-flow-enums/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61ce1dac1ffb9f4bf748578bfaa03af3dc114d9d824d00cf28a6f0a26e2ca42"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060flow-enums-runtime\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/flow-enums-runtime/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":"packages/flow-enums-runtime/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b3231ff79ef868afd22c31079f83a5c5b11d8a28620bf4620954e62f2f0ca5"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060flow-estree\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/flow-estree/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":"packages/flow-estree/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea78fbd2a76809d818568e31b92c6303cff915f5c1f3ee636c73385241a1dc9"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060flow-transform\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/flow-transform/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":"packages/flow-transform/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3901d7cd22f168c73cd6c10824ddd328837f188ff1932025ad12cfbc346f769"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060try-flow-website-js\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060packages/try-flow-website-js/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":"packages/try-flow-website-js/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce1fd9e77a544ff49b4bb08c3b54815ceb6ac98bc7e51307b234983bf13a53"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060rust_port/crates/flow_parser_wasm/src/bin/codegen.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_wasm/src/bin/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"419b258a36193797a9bda360149543d18d10a2ca0a650e40e6d5847fb5cc35dc"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060isBitwiseANDToken\u0060 spells \u0060AND\u0060 where 160 names in the project spell it \u0060And\u0060: 160 of 164 names in project repository spell the token \u0060And\u0060 (160 of 164; unit: names in project repository containing \u0060And\u0060). Peers: test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/autofix-exports/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspNotification,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/auto_close_jsx/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/enums/test.js:13); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/match/test.js:12); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/react/test.js:11). Rename to \u0060isBitwiseAndToken\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-estree/src/generated/predicates.js"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e10e4f501f63a3a6b56a57a863f98306b21d9ba84d5614929ccad0d6cb6e94"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060isLogicalANDToken\u0060 spells \u0060AND\u0060 where 160 names in the project spell it \u0060And\u0060: 160 of 164 names in project repository spell the token \u0060And\u0060 (160 of 164; unit: names in project repository containing \u0060And\u0060). Peers: test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/autofix-exports/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspNotification,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/auto_close_jsx/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/enums/test.js:13); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/match/test.js:12); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/react/test.js:11). Rename to \u0060isLogicalAndToken\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-estree/src/generated/predicates.js"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"408829f985f826e63279ff96eab2c7f49faec07f632f2645dbc04e27ddb3d1e8"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060isBitwiseANDEqualToken\u0060 spells \u0060AND\u0060 where 160 names in the project spell it \u0060And\u0060: 160 of 164 names in project repository spell the token \u0060And\u0060 (160 of 164; unit: names in project repository containing \u0060And\u0060). Peers: test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/autofix-exports/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspNotification,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/auto_close_jsx/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/enums/test.js:13); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/match/test.js:12); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/react/test.js:11). Rename to \u0060isBitwiseAndEqualToken\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-estree/src/generated/predicates.js"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b8b29a9238abc46bae2438791f2f92a93b428442639a6b2713f364f382e486"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060isLogicalANDEqualToken\u0060 spells \u0060AND\u0060 where 160 names in the project spell it \u0060And\u0060: 160 of 164 names in project repository spell the token \u0060And\u0060 (160 of 164; unit: names in project repository containing \u0060And\u0060). Peers: test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/autofix-exports/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspNotification,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/auto_close_jsx/test.js:10); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/enums/test.js:13); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/match/test.js:12); test.default({\n    lspStartAndConnect,\n    lspStart,\n    lspRequest,\n    lspInitializeParams,\n    lspRequestAndWaitUntilResponse,\n    addFile,\n    lspIgnoreStatusAndCancellation,\n  }) (newtests/lsp/code-action/quickfix/react/test.js:11). Rename to \u0060isLogicalAndEqualToken\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-estree/src/generated/predicates.js"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bde6617903dab2b3974944500827ca8ca912488aa541ae891324b9062628e12"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060UseAT\u0060 spells \u0060AT\u0060 where 13 names in the project spell it \u0060At\u0060: 13 of 14 names in project repository spell the token \u0060At\u0060 (13 of 14; unit: names in project repository containing \u0060At\u0060). Peers: String.charAt (lib/lib.es5.js:403); String.charCodeAt (lib/lib.es5.js:409); flowToJS.stripAtFlow (packages/flow-api-translator/src/flowToJS.js:23); DocblockUtils.removeAtFlowFromDocblock (packages/flow-api-translator/src/utils/DocblockUtils.js:17); normalize.snippetAt (packages/flow-dev-tools/src/test/assertions/normalize.js:114). Rename to \u0060UseAt\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import-alias.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb80de4687a9661b2bb5718dc60305edce2ea56f0832f3c770ebdc4ee7892f1d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Opaque type for a preloaded query reference.\u0022 repeats the code it sits on: 4 of its 5 words (opaque, type, preloaded, query) are already in \u0060export opaque type PreloadedQuery\u003Cout TQuery extends OperationType\u003E: Readonly\u003C{\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":"evals/evals/03_project_patterns/relay_core/context/RelayHooks.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"528d13d27a62885e3422d6666650cad817f7f1bc7f23cc531502ee623243448c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test \u0060getRuntime\u0060 plugin option\u0022 repeats the code it sits on: 4 of its 5 words (get, runtime, plugin, option) are already in \u0060pluginTester({\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":"packages/babel-plugin-transform-flow-enums/__tests__/babel-plugin-transform-flow-enums-test.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ba46c14e80b71c878bcedf4d7c185042f265109828cba15164991ee83734a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 14, 17, 21, 23, 24), for example \u0022React.ElementRef\u003Ctypeof Component\u003E\u0022. 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":"packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/types/react/global/spec.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef13ed7a411059ec474f80ea92fe4447f9b7e3cdd23be64c74d75a0f335bcc5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 6 comments in this file only repeat the code they sit on (lines 16, 19, 20, 23, 25, 26), for example \u0022React.ElementRef\u003Ctypeof Component\u003E\u0022. 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":"packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/types/react/import/spec.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5c82a652809bbfb38885333f5d5ec3ddcc92874aca1f39b8f74bbeab1021a9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022you can only declare export types within a module\u0022 repeats the code it sits on: 4 of its 5 words (declare, export, types, module) are already in \u0060verifyHasScopes(\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":"packages/flow-eslint/__tests__/hermes-scope/declare-export-test.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df8cbba539ae6afc4ffd2e16912a238f8f66232661154229737df78860d835"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Process the right hand nodes recursively.\u0022 repeats the code it sits on: 4 of its 5 words (process, right, hand, nodes) are already in \u0060if (options.processRightHandNodes === true)\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":"packages/flow-eslint/src/scope-manager/referencer/Visitor.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96f301cd52fb4b988061df6e5fdf3244fa970d5872916e72e214ba9a19d7e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022max of keys LOG_LEVEL\u0022 repeats the code it sits on: 4 of its 4 words (max, keys, log, level) are already in \u0060const MAX_LEVEL_LENGTH = Object.keys(LOG_LEVEL).reduce((maxLength, level) =\u003E\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":"packages/flow-for-vscode/src/common/Logger.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca660c5df6560c5de14dcda10c24cc13a6f67bb46997fe4d7abcbe495a6277c8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Babel converts ImportExpression to CallExpression with Import callee\u0022 repeats the code it sits on: 5 of its 6 words (babel, import, expression, call, callee) are already in \u0060expect(parseForSnapshot(testCase.code, {babel: true}))\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":"packages/flow-parser/__tests__/ImportExpression-test.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef65ab6952894822521422cc5af098cb188154741e795d43fa0f15eda75797c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Convert to simple generic type annotation\u0022 repeats the code it sits on: 4 of its 5 words (simple, generic, type, annotation) are already in \u0060return createSimpleGenericTypeAnnotation(\u0027symbol\u0027, node);\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":"packages/flow-parser/oxidized-src/estree/StripFlowTypesForBabel.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3878020e61879f0e2f7584729e54139ddbd7806ab681ce5358f33353e0423c3e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Convert to simple generic type annotation\u0022 repeats the code it sits on: 4 of its 5 words (simple, generic, type, annotation) are already in \u0060return createSimpleGenericTypeAnnotation(\u0027bigint\u0027, node);\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":"packages/flow-parser/oxidized-src/estree/StripFlowTypesForBabel.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6473a8f93a0c6a8cc8070d2f25300d84cbb3d335f8375a3300920062674739"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Scan for references to our component.\u0022 repeats the code it sits on: 3 of its 3 words (scan, references, component) are already in \u0060const referencePos = scanForFirstComponentReference(\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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9abcd7af755911bfaea757d249e667846c1b4c8ff80fe4497255e69cf8e487"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022static build(node: Node, bigint: true): Stats\u003Cbigint\u003E;\u0022 repeats the code it sits on: 5 of its 6 words (static, build, node, bigint, stats) are already in \u0060static build(node: Node, bigint?: boolean): Stats\u003CTStatNumber\u003E;\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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0042825d45ed76d24bab529e248b14aa019cd92d104461bbd2eb3044df543ee0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022statSync( path: PathLike, options: { bigint: true, throwIfNoEntry?: true, }, ): Stats\u003Cbigint\u003E;\u0022 repeats the code it sits on: 10 of its 11 words (stat, sync, path, like, options, bigint, throw, no, entry, stats) are already in \u0060statSync(\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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a50a6d7ebb1f28417b4417095edad602c642ad0e3eeb219880345c4ce4cfd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Then process the file path as JavaScript.\u0022 repeats the code it sits on: 5 of its 5 words (process, file, path, java, script) are already in \u0060await processJavaScriptFilePath(filePath, stats.size);\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":"packages/flow-upgrade/src/findFlowFiles.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0a06f1e01dbb03491a310b1219086a018504abbb3b6b99bd7f8838cff956b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Open the file path.\u0022 repeats the code it sits on: 3 of its 3 words (open, file, path) are already in \u0060const file = await fs.open(filePath, \u0027r\u0027);\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":"packages/flow-upgrade/src/findFlowFiles.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f15f2d73d1a82732370bb7f83ac32c79e203c399e8ff10cd128a3ba8bbf8b9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find all of the Flow files in the directory we are upgrading.\u0022 repeats the code it sits on: 4 of its 5 words (find, flow, files, directory) are already in \u0060const filePaths = await findFlowFilesWithSpinner(directory, options);\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":"packages/flow-upgrade/src/upgrade.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6660919a37a12057eb0ef4c58a016f55ec8fa74536fd2fb4ef14246095525d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022string | (number =\u003E boolean)\u0022 repeats the code it sits on: 3 of its 3 words (string, number, boolean) are already in \u0060type A = string | number =\u003E boolean;\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":"src/parser/test/flow/types/function_types_with_anonymous_parameters/migrated_0019.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba4a53e40137ef180cae2182988b0bd4b698911b497a19b3bca5d35717bf3ae"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022string \u0026 (number =\u003E boolean)\u0022 repeats the code it sits on: 3 of its 3 words (string, number, boolean) are already in \u0060type A = string \u0026 number =\u003E boolean;\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":"src/parser/test/flow/types/function_types_with_anonymous_parameters/migrated_0020.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b70fc6fc81741fcac2910080b4e49257a29cb07eb8a011245972ffb0e19b94b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022string =\u003E (boolean | number)\u0022 repeats the code it sits on: 3 of its 3 words (string, boolean, number) are already in \u0060type A = string =\u003E boolean | number;\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":"src/parser/test/flow/types/function_types_with_anonymous_parameters/migrated_0024.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ada770caf7725275cdca9fbb9d5d243294879dde2c815568f4087ae46fca80"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Async component with props\u0022 repeats the code it sits on: 3 of its 3 words (async, component, props) are already in \u0060async component AsyncWithProps(foo: number, bar: string)\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":"tests/async_component_syntax/test.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f103174510fe19a0179c6fb28ebfe9c58978eea0e655a1b782969a3ac69c9c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Export async component\u0022 repeats the code it sits on: 3 of its 3 words (export, async, component) are already in \u0060export async component ExportedAsync()\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":"tests/async_component_syntax/test.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b252e7ca7042cbbca13c82e6dd8d0b07f8651187542504b5ff9deba59ecccb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Async hook with params\u0022 repeats the code it sits on: 3 of its 3 words (async, hook, params) are already in \u0060async hook useAsyncHookWithParams(foo: number): Promise\u003Cnumber\u003E\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":"tests/async_component_syntax/test.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb04710a4bcc1f30d687ed69353547c80844a3174b9ebc52a71ebab17e21a4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Export async hook\u0022 repeats the code it sits on: 3 of its 3 words (export, async, hook) are already in \u0060export async hook useExportedAsyncHook(): string\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":"tests/async_component_syntax/test.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eb16fa6dea053780f6bbdc7a72e71c078fc9e49a5e0a0c65df32aebb16807e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022fn params name clash\u0022 repeats the code it sits on: 4 of its 4 words (fn, params, name, clash) are already in \u0060function fn_params_name_clash(x: number, x: number /* error: x already bound */)\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":"tests/binding/rebinding.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30d1833ea1a84c3480df7eff91ac438e4d07128c1d1dd1e15d3770ce17ff51b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Every exact object type is an \u0060ExactObjectType\u0060\u0022 repeats the code it sits on: 3 of its 3 words (exact, object, type) are already in \u0060exact as ExactObjectType;\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":"tests/exact_object_type/test.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbda8bdbb88f1eee017d7ebd3acc0e9ba4a9510f0c1c0c829636348899492f59"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Type only exports\u0022 repeats the code it sits on: 3 of its 3 words (type, only, exports) are already in \u0060type T = import(\u0027./export_type_only\u0027).T;\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":"tests/import_type_annot/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb3ff6a69845ce7c0e170901e31764c918431e16559b4f9dfd7ac05514a5c99"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Record with PropertyKey\u0022 repeats the code it sits on: 3 of its 3 words (record, property, key) are already in \u0060type AnyKeyed = Record\u003CPropertyKey, number\u003E;\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":"tests/mapped_type_utilities/record.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0c14ef9ffd38274528a69b4d69d60c04d6d51b2ec0b3c8fac8abf8a85f992"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Promise\u003CT\u003E -\u003E catch() with throw\u0022 repeats the code it sits on: 3 of its 3 words (promise, catch, throw) are already in \u0060function catchDefaultWithThrow\u003CT\u003E(p: Promise\u003CT\u003E)\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":"tests/promises/promise.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb15e6fe9e4bd4c2d304ab8f8e0cdbd52fffc0dcbb76973c4bf7230a045310"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 6 comments in this file only repeat the code they sit on (lines 20, 22, 24, 26, 28, 30), for example \u0022ImportedTypeDefaultClass\u0022. 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":"tests/type_at_pos_imports/import-default.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"72febadc973e4a1c4d68e65e83e7f3e59e416d2a7328c39caf06b869b6f99d2c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022$NonMaybeType\u003CT\u003E\u0022 repeats the code it sits on: 3 of its 3 words (non, maybe, type) are already in \u0060type NonMaybeTypeNumber = NonNullable\u003C?number\u003E;\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":"tests/type_at_pos_type_destructors/type-destructor.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"710c7ee47c419ca1550450e25ee648aaaad5e6fdca95b0a85ffe313df2f0dfb1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022item is SpecialTypes = TypeA | TypeB\u0022 repeats the code it sits on: 4 of its 4 words (item, special, types, type) are already in \u0060item as SpecialTypes;\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":"tests/type_guards/refinement.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba98000292e5fb9704b31f200d6677aa02cee7f15f5b9a93aafb9ad15fd4341"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Object.getPrototypeOf()\u0022 repeats the code it sits on: 3 of its 3 words (object, get, prototype) are already in \u0060Object.getPrototypeOf(...arr);\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":"tests/unsupported_spread_args/test.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6b5245aceddb5f5fe316b711c5d78cd97dfc3d8cbe170ca360ac3f56d81919"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check all schema items are present in the config\u0022 repeats the code it sits on: 4 of its 5 words (check, schema, items, config) are already in \u0060passedValidation =\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":"website/src/try-flow/flow-services.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1399b24681506a58665e2ba0284dc192913228b531075b48bfc65ea4cb8f18bd"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 7 of 22 project(s) overshoot their size bounds, lowering Project Cohesion to 4.1/10. The most over is \u0060rust_port\u0060 (570123 LoC, 3061 module-visible types across 123 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bd1647d5c048b55b390c30d9931a503ad4f873cffe522159cd1687b4285f554"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"3825cfa79555137b3aa9b123c032454e4d8340a808f5f23166b144297563194b"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"9d59345c616670267651dd31871322ad8a6daa045ad60156ec2c659cb9b08481"},"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":"faa5e38a1451d19e7a25581551015c1b2bb900d278258726f71b5c4716372bc6"},"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":"a10bfce5c5c6242f1148286cd0f08ebab1f7dfc90f0d6697055798049ee46aa1"},"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":"f17d52fad9d838a1b0ff177b306ec95bb4b3047a3d62299ae128e6c340b300de"},"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":"0a203190816fec498ad875c702d607d86f291219d8c9cc4294f1f60181a50748"},"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":"c4987e424a46e3b18c14730871b1dec940f24db951c8d6d91655770f1e1c5714"},"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":"cc7fb8a7b5bc670e4e96cd94adcf222af0421916ca0980ef8a2573c8ec6c2ad5"},"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":"08109ddf84a9257ead6cef9a1fa81c856b8231dfc67bb9e0378fc4b5694890ed"},"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":"0b012eb0c9663e0cc099d11b63229ff6ab12362ca4319b5ef3b68bfb64107525"},"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":"b84cdc8909a5dc8af7b934f9f7d71005909f1ce04c5c507c4a78cfb0839e50e6"},"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":"dd031d9e5489b3dfc8b8885ea99811eb2e416e068f157fd93b11a31ef86d5d20"},"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":"6bcd759c09f799443f3de9db57d4c3b2fd8ff97b8b95620bc6d245ec1221acb8"},"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":"6223fe2011c923f4df6b410b1efba2f00851cea992dd81f9177bf5b38fa10cc2"},"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":"085f5008a836944fcb6a7fe8a269a7bc64497d704ea5eff663a8f8d23f6da3d8"},"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":"07960a3cb4c363611a906ad7fe54e552ad54dee6314edf28d88f0ede70f41849"},"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":"46353881274324d8f2db978bbf20b5abd20beeb82a88fa92fe15231df30771ab"},"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":"5d753ca35b37b246d707290c9baea9759427afe6108e6651e75023f641515210"},"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":"0a67848a8919e6bb7aedccbfdddf0705b73a8251b254dc197f9859bd55a759b2"},"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":"e6c30f9484104fb42b8371c089015bc43040e4c4b66d248a51a63235c7bf4640"},"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":"118ff27c41bfb1d473c2edc473f43d775e7aada5f0f3e6ceca657f2ebd15eef0"},"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":"a356d33f4ddd9d4206d3426ef1dd7151b9031cb3c10ef309b45b44c8bf81e58a"},"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":"a94d0d383f18114a8271be9ca21e14abe26c61f528112f22d39c23abcec3258b"},"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":"87173852a2edd4c862e8a8a7836777a1c053eb4621a50c19a1c46f8693e8fff2"},"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":"37e4acea345122aad7231c447d83cbeebf1d9f4eaf7db5947a64739659e7dd3a"},"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":"babc3198fcc71a21f57aa688453f389bbf2a1af556cafa00605440e088992c3f"},"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":"b7978406a2ba269a0d569f7a164ce50be37e0a25c728be9f7335f0a80468c805"},"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":"fb8dba171f7354497de9d3504a07401230834e4a1b1f614c1e5da23477deeee7"},"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":"14cfab8c51d8d124d679f9c4f0dabccbb68a20d3489b413bd72ea280420a6c7a"},"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":"5f6356005716479fc30014c50b8d11b9ddd8747bf61d634761101799d3a6d0fa"},"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":"3c3921c789a69629f6cec6ed1d72aefe2e2c1beaa54ad4ec4f3a6aad6476daf1"},"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":"f454b17c6e88611f0a896cec36fee3bfd8fae12ed52d3d4707758ded7b16da40"},"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":"0a2ca20873106c205d22fbe2e74ca3eb5dc5fc39bfb45bf7c39cce7e879906d1"},"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":"80349c2d7c09d55f0a474bae6dd7f7b1dda2fabecab4f9089984dc607ccb9a28"},"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":"b720aece863d0f973484abe9ae061a9f4da0bd24b407946d9fc54f6cefe20548"},"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":"a26a957fb7a5855f8b9243f9e184b97257a857019ab0adc660915c2c62616fc7"},"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":"6648cb23d7530c94e84c3c4e429557bc0ece079ec1cc78d986b6470057802a28"},"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":"c0413fbba44178ae5818339438b8d21db76eb41bce33436b26eb28c23dcf649f"},"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":"e9fe391e6911edb1191a22f984f8693e48840a7824df96b99144aab61387a4d5"},"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":"d9644b7caa0096d8c4d10f1b417f6f6f4fa674b6cdf20414ca32e78c8b5c561e"},"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":"79d9994fc309391e66ebc06d135905958b15b0a6a4acc2bfe3210e7521960bf9"},"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":"132872099d117931b5e1341859cdf8323f477b90dd69dc9c786759d8a5af5461"},"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":"4ed97af41ac23331350808081559df6898ec7b383540c380aecb4034626ef9c5"},"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":"ea87406889c84eac217c9fee8c3f87995bb2e766319ebd7589b242c50db5094b"},"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":"4d0627c0163ed4d36eb2dc6493f1e18c35612915d84135172f2645dbfea057eb"},"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":"196714b4f05c76358e3f4ae70a878cd46e3cf5624601e90ab009d9a269bc6b39"},"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":"da162af8ca6faa0f97c151da83cdab8be93adc11af13aa16f011cc7dea2d2cf5"},"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":"5362c96d37cc15e70d23f6416bb59408334def8fedea14464783a9106b8f7e92"},"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":"9a6a121f810e5bfa8dd8cf7ccb21b3922558fb6e5bffedb64f43327052a256e3"},"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":"66cbb68d984bf9fea8800f97d0a6c77a62428cc95dfddc7d2aca52fd48b0b442"},"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":"bd367c19ab2ef6fc7b742529035da745570f17a25d4adaf58f943734a8f1f811"},"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":"e074044a20b1c9d14acb618b9b38c6f83f1a2c3e33b1d3d8e0d40506e58b30c3"},"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":"2d66a73696cf9c47bbbabfec0f844f664b95857738c85e65e947be6d58341328"},"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":"fd8f0da64218960479bb90a929e2c16d21751aa963b401b2307512f611887448"},"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":"23e5bcdc2a7e41822be2f5029979f9473f157fd5363550f370f6d8cf779ed7b9"},"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":"309721ad88829d7b3367644a97c044e7cba01211f130a86410ccc5f81f1129b1"},"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":"b53cd38a1afb007488929b7659035c4b27f615c2c2f37719b7a871d1b7f795ce"},"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":"44aff5875e060d1713d0411ea26281798bcad67c823fcde7f9f0c4bcf76de7f5"},"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":"ff617b28e1d7c6b44a48384a56f2d780eeaa72891934ec5855198ca38ad13c48"},"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":"fa7e6fab7d7a0858aac095cf7b0be86ae7c18ee10e71682bbea7a4a5eb7830db"},"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":"0b1475814fb16fef99c40bdf635b44486e38b975680be3b9c94573b6794eeae1"},"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":"9e0ca2c9f9e52bee98281e3a45524742a7267e04dd8ee29b300c9754c4c74ced"},"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":"59b28e98a8be456cfb165ebb8c40e70ba365da110eebf5f208b49ed784014007"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c94548167a8118df245dc6038f3fe4d406d39fd445feba388ed1b5f94cbf442"},"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":"b26fb07852ccc0cf037146db2c11de47f4d8fc08a055f642a814c9ffde060049"},"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":"9ec1ab39ff172631ce57af82ca2b8d38725aa2c93f24aa07a3acb6ee14856bf9"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1db7c3cb27bfb0df1bad33d65ed9497cfa4fd5732c2726c67480b72e528a3a6c"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f565ddfa345e76100c774035e297ce2a1675420ac52f85f1bc3e4c33c0addb0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e096cc525d515ad4da63a114b1b95a489d9663786d7b0473e021094e7945261"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60505a67bc682e0cea0a16617c53eef8fd96b68ee36979ccc07ba93baeaf6714"},"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":"a5e82ae7afa1c94b3d05f29c380a3cf529bf43d48a99920370e2d524e77ea534"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"37a1ef5da5920bc15c8aa3ce85eec415864620d23c8eed1631dec4116bc570d1"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6874d19b34c24443a6c7e1ebe56115a8bb121b5d465c7616fd7e19c66e659142"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ec52f72745ca9022e01aa2c9ae61d3dadedc5a3853574594b69a7687857f95e8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0f8f80afb8f44a5e5ddf169881622367eb66b96ef24579ac0154e0ebf7ac49c1"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1c85b39b13686b80a8a212a90e2b03e86b2457add7f8ff0c84b178f6776cef7b"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c523a70a46020d1f135be85da077da09ee2a4da125df9d391b936ed3a681e617"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9827910eb9dc418f3e6a6145d155da0b9bd65f5e8c3b9fdf29a45b714f9c3762"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"417303c7e0b1f30c1d0f19372fe4108e91900fe7e78e57edac784216b7209c96"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1e17e44d6be767bf2ad62a04490602814a2a05b892a7df8ff068fd84abb0af6b"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"aaa8bcb97a0ec4f0cace5834d44ec5bff5c0b2715c1f51bcbf1638c11e79a7ce"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"155aee0b5582be646babbd17e829a7ee775ac6799a5571aeb2d64071eb8a2cf5"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"80903d39093735d88f9a574fc0c1f2d53d9311fb916a2757cc67f749d89063d5"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"39e448048ab5fbb12a596d0faf92ca28f7ef95766cf2f4fcbff9449a4fa4adce"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d0e019bc70369b441ce65a98140f72398e3929eb9a6fd3a6068a17c1bfde2234"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"467f9904d058c663bc5aa74e6d42b0285e65d1d5b80dea91b56e5c88211d8f93"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c661be84f2bd5b8f0a38f6335669ba86c350140a9e84fb8e4a77d188daa17371"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"15a5a89327030b42324d5a8eda82d50a315b13e8405e9b39d59967ceb2072353"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a36bedfcd0678891f0df6864d73378066ef82cc6f6e57724e3a32adea0712523"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"af85d5674ab4e6b2f58c549c063ac22dd33ce93af14526103277ef775fbaa4bf"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"5ffa84224b3906e37b6d45048824efae82d5db12a9204a0134fc95a3b5a9f900"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"c983430c66e4a61a8760b0e04c40d07788d27569479f40c5e2f08b248e9f9f57"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"ff569a23723de9253a797628c30430861b4a32d47897398877406672ec498452"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a45af34870444c322a058bfac6e8f8ed27de11833b93a44bd1d80f0e8ef521c5"},"properties":{"dependency":{"package":"@babel/traverse","version":"7.18.9","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":"a7209a8cd1b41e95a008ab2bb194c5b933fe0ec25efba8db92f47722890e2752"},"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":"5d9874703aa55decb621d2e8d2efea83d2f6a8265e15af7eecbc1b33b3e9987d"},"properties":{"dependency":{"package":"braces","version":"3.0.2","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":"aeed4b217d8bdaecf61b18311ca98540f8e2fa4961d5d3f40658c7e1229b0b0b"},"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":"22ddacb65fcc48f9d874f93f5f818c5abb146831db99332d1eed6fbde2d97c7e"},"properties":{"dependency":{"package":"form-data","version":"3.0.4","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":"bf313fdf786a185c4566ca7542e5aad782d1eb9af2f2b513b12a9c92fd4fd0d2"},"properties":{"dependency":{"package":"js-yaml","version":"3.15.0","advisory":"[GHSA redacted]","aliases":["[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":"c06815efe395801dbd3328bfd0ff2cf79a781e4cdf6bc085d54067fe981599a3"},"properties":{"dependency":{"package":"ws","version":"7.5.6","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":"6314612d4b75fa1a30fc3dc4b941e2515b4a7058da3f7bc59d41bfd28dd1558b"},"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":"83574bb374ff9ce3e08a6a6b89dfc3ec0c0453568572b6ae721f7e0ffa852386"},"properties":{"dependency":{"package":"browserslist","version":"4.16.6","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":"1fb4a58e6ad8da9ab7e615a98061bcef7923c87f494f6698e9ffe97b70b15ac2"},"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":"1b380a8c560acba6a7949ce88c80658e503a0a61b197b6858a1be26170adccf3"},"properties":{"dependency":{"package":"form-data","version":"3.0.4","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":"5d05274c55bd6d2064f1cbc15bc2f05f93d8abf8b226e2d3e8797864c530cbd7"},"properties":{"dependency":{"package":"js-yaml","version":"3.15.0","advisory":"[GHSA redacted]","aliases":["[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":"b6f2724d1ebdd88431ba7fb40e26081bcaba5bd6f702106c50d1dabb0b635abe"},"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":"97a05fb028f74e930556974a1285006d632cc2976ae47496f4cebceab843fbbf"},"properties":{"dependency":{"package":"ws","version":"7.5.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":"2d16d26f398e25fcd86406b4061454ff8bd93c2d9a22337ed4b1a0478a8ed8c6"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"782a76e5c63e21698b7d7ad1d9736b5b3cb054402b6c070657fd8dda4fbb317e"},"properties":{"dependency":{"package":"browserslist","version":"4.18.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":"d67bd04a26772c550da75081a487e621a1c1771ee0f3b0e8acacca324f5b4e28"},"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":"2659a1075cf65a9b9d70ecc43aede5dc5c8db22fb359c35509a86ec4565db365"},"properties":{"dependency":{"package":"ws","version":"7.5.6","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":"4d29b9cd52368bdb22744bdd5d2eab4b2b321de7e78e601b68f27b90f6eb52cc"},"properties":{"dependency":{"package":"@babel/plugin-transform-modules-systemjs","version":"7.18.9","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":"a2c919d91e08db26e3fd56039cc9877a31122df5a278a3b3b221d50869c9f8d9"},"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":"07fa4deebd9346f5a6801d10186b4235e0e6f809b39540c265b3583a3cf9116b"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","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":"d8d653e4e4fdc6e14bbb044d33d6ceb1688357a09d375c3b97ee0882e0be7379"},"properties":{"dependency":{"package":"browserslist","version":"4.21.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":"c8d7db8b2d0d7b16a7f52ee95c88c0f06169b82e501eea1b5e67eff5e07b2b7f"},"properties":{"dependency":{"package":"browserslist","version":"4.24.2","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":"e344cd8dd8fefe4b4802d0b0dd1940f4e67afd0b6480640fefa6fd8c95c33477"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"35a58de2e9215e5eb7c5e6d16e26b6905927ac84bac6e21036f512f3c04574cb"},"properties":{"dependency":{"package":"linkify-it","version":"3.0.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":"d64cb0384785a1db89b1ea3d689505087674db194c6167aae5949639b12856d9"},"properties":{"dependency":{"package":"markdown-it","version":"12.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"1b20c96f63698746c3535b84409f208d6cbae83b04ca253e4cf1fe89e2dcd9c1"},"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":"3b5683e1607cfaf7c206a92766d42826cebf19ccb92557e8c2dcb1f2b97436f3"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","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":"a5b1f8bd65d83df0d757cdf6e1cf458f4efa98d9bf0f9dfb2072173a19eb935e"},"properties":{"dependency":{"package":"semver","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"260170467c3484d9497ce7f8836461263091724d7fa03d6078efe2e4970cade8"},"properties":{"dependency":{"package":"semver","version":"5.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"9167fef8372eade4389de5406dfc7f3b6e8faf1955331a972d82273518bffc11"},"properties":{"dependency":{"package":"semver","version":"6.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"011b66fbe91efee85b1160f4cea55b9248e4e7b67656e0146c80f3596e1e0d3f"},"properties":{"dependency":{"package":"semver","version":"7.3.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"ea89560984ccdbca3605bc3b19da23cbe4878005d6206d62a5a6e1449094c1c4"},"properties":{"dependency":{"package":"underscore","version":"1.13.4","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":"d7e286391a117b10d3873781ba8c2abd64b84ad182f4da86361dee34f7d3570b"},"properties":{"dependency":{"package":"ansi-regex","version":"5.0.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":"fef31779702810069090784311ac7d60da43d485f275ece6a0dbada4575a0400"},"properties":{"dependency":{"package":"braces","version":"2.3.2","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":"0a1417b7ea8f04d196e5b66f0252c7116e65db584e4caacd352b67eedd16a783"},"properties":{"dependency":{"package":"braces","version":"3.0.2","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":"a9880e89cc9d3a2510a435c4db60eea2832d0d0dcf2a99d6f1ab900fde50ee14"},"properties":{"dependency":{"package":"browserslist","version":"4.16.6","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":"7784c984350acbfa7472d7acce91956d241d2af1d72f6b688cd7fb17c543af9d"},"properties":{"dependency":{"package":"browserslist","version":"4.25.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":"4e69aae7636ce8f1fec4caaa9f220127dee0dfa0800e2049d05687af444b33d9"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","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":"f5bbe7ed8881fe7bac402fd095a421b6883fb0406ff898958cbce233f662afa9"},"properties":{"dependency":{"package":"js-yaml","version":"3.15.0","advisory":"[GHSA redacted]","aliases":["[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":"a593ac6387c4d8971767d15566c277cc1b4a3a9736fb0a6960cc5da13da88e14"},"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":"4fc28fe2a1112544301d3b5d56821c4c5ddf9349a1ce51616ed7c9271bfeab54"},"properties":{"dependency":{"package":"semver","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"packages/flow-upgrade/src/upgrade.js","line":13}}}},{"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":"22b9a2018f3c2c11dae0d450de318f378c8f0a93e8376e7bb92e81ba257b2654"},"properties":{"dependency":{"package":"semver","version":"5.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"packages/flow-upgrade/src/upgrade.js","line":13}}}},{"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":"4e9a194b4f004ee21cb0d82bb5c32e96be8397e44fd2aae0a31543e28a33a1dc"},"properties":{"dependency":{"package":"ws","version":"7.5.7","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":"b3ebec9730bbd6f9f058ad71e18bf161b48179dcf323357df4944b2d31aaf642"},"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":"96bf8f168f51003d41a4ea5f8ab2df5c69b4f469b90efcd60361d724c67248b8"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.1","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":"2d31e6c000ff0c923d739eae07d8320e4992363022c43b13c4fe1b7de1566532"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.4","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":"ed0bc44e5b5bcff29bab5e5be4bdbb7f4809eadf7dde45f468524c2d93de576b"},"properties":{"dependency":{"package":"browserslist","version":"4.19.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":"e82c52731f9a2d268ee330ba3fda996aeb2d0671213e511d982cfd7521a16365"},"properties":{"dependency":{"package":"browserslist","version":"4.25.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":"6e0e316dc59b0c2101b340feb9a8a6c877867180aab0d63625d54f6e63b1e581"},"properties":{"dependency":{"package":"cross-spawn","version":"6.0.5","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":"c7b0920eedcb56770a401962059095fb0fcb30fff16b380099d51ddec1170e8c"},"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":"34ea8e4da185969d3b3887984af09191159f02cde47037a72a7f730c4034fae5"},"properties":{"dependency":{"package":"flatted","version":"3.3.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":"5593f2f6b7b12ecc8f2c54ba703176502dd2aae903f2c38ed36da5a472bbdaac"},"properties":{"dependency":{"package":"glob","version":"10.4.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"packages/flow-dev-tools/src/utils/async.js","line":11}}}},{"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":"8e3cf47acf8c0f0033508bb28cbe58ae4b3a1588e33f55a360dd1f3b1f4de14d"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.1","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":"e3e736a552a76942c1599de0b330a447849401a9f728942dded7b33599a8b2d1"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE 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":"581134e006c5c27378590de77547617f86d791e5bb56447b3f634f3b7a80daac"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA 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":"56a0feb39a95fb436313c1433e1257b982d29f8b0b6bfee03503c2a36c52b658"},"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":"e289e767076c605f4ed42f1e192573b34d0e6b585d7b0cb43c31cf6667f4ef76"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","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":"34f1ba4a396de17bd2411a432ed19e1985499f53023f97e4812c800ba3a59847"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE 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":"a8805992bc79459aadc6d4925a7c0ae2a9e2cd2e1c36340a836f63ffeb337aae"},"properties":{"dependency":{"package":"picomatch","version":"2.3.0","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":"293abd950220031e63ceb39cc419250e29a041ed203431370bdb11925872f773"},"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":"2fae88c4f92d59fdba17af387f0fdc6b57bfa2e779cdd2c5b21ad0b32c8812ae"},"properties":{"dependency":{"package":"picomatch","version":"4.0.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":"266dd228fe010248e0f458249ce9a7cf4a567783879d4c06d567e9b83e8a58c7"},"properties":{"dependency":{"package":"semver","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"5608cf6effca44ff602af97f79f3442ca5ef768990c3b9de569d5567788e1aea"},"properties":{"dependency":{"package":"semver","version":"5.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/flow-for-vscode/src/utils/checkFlowVersionSatisfies.ts","line":8}}}},{"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":"889e9785d921ada76aabe930c4647966468e2d234e20432617e72342511b8a2f"},"properties":{"dependency":{"package":"tmp","version":"0.0.33","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"caed82800350ec6ea7ecf72e520d88dcbac8c5cf826367cfea66e000f0d12f5a"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b17922a974a31a89446770b66fb8df2cdb4adc45f18cdba01113792dc0e5f23"},"properties":{"dependency":{"package":"bitmaps","version":"2.1.0","advisory":"RUSTSEC-2026-0247","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cd5e929f6921f749885300b98c653daff132c886133e0036a2c0a6413eecedb"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d46cd95f42525bbdd4966cc1bfb6447e93cf2e94c2cec5c5f3fb651d304f11ca"},"properties":{"dependency":{"package":"im","version":"15.1.0","advisory":"RUSTSEC-2026-0248","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0aadeca1d00d2edca4c39510609dd21b2985bce62370a8a8e91b1aaffc54a21"},"properties":{"dependency":{"package":"im","version":"15.1.0","advisory":"RUSTSEC-2023-0126","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec62cbfb881c14b0db0d6c4f752da6b535212d0adb8836578d4177c1d02a35a"},"properties":{"dependency":{"package":"sized-chunks","version":"0.6.5","advisory":"RUSTSEC-2026-0251","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d7f558a71647279c0f3788d37ed77e1b712edc196ba3729e3c2d1ea7a657fc6"},"properties":{"dependency":{"package":"sized-chunks","version":"0.6.5","advisory":"RUSTSEC-2026-0255","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"211ae99c90cae82ccf312cfdf7a861de9083202e1616f1644be9e394459bc69f"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.16.3","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":"0c0cd086ebd1548975537d94f4fa196f652f7a9e5679f254713e5da94541d94b"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.16.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":"34a58b7191edd16174f55b1af4b90c26b0828754d1b6732f9912e3e25ad3d6ad"},"properties":{"dependency":{"package":"micromatch","version":"4.0.4","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":"4158139497d3e8d765927d7e45cdf2ece378283d2d46f2ec83a783e4dfcbdb1d"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.14.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":"b55ed514a5172fffc8b2bb3c93f363e82ab5009d4f3526938b55bc8ceffd5de7"},"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":"0ee605b142b5e400677981afec8576369fbd6d309351edd07df5dff065b20db4"},"properties":{"dependency":{"package":"ajv","version":"8.6.2","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":"6c1cb713e63eef5182ffabda4088d5b32e58746b73719e3f7bd2037d29115b3e"},"properties":{"dependency":{"package":"micromatch","version":"4.0.4","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":"2b9b1c44dc53f641f3a4d2df00abd877643157a62df523bb055ebe1dad32c5bd"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.16.3","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":"0c9d03870da782f399030215c5bb5715123b935f037c7ebed57083f9abec4a59"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.18.9","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":"66fbcf655daa2a217d98828d4e02850560a0f6f2b1d02b3b28d4803bbfde235a"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","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":"8fa5d05865a3131f6c91f775d8921068535b4421fb537badf80f4fdb158a08b2"},"properties":{"dependency":{"package":"qs","version":"6.15.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":"47d7921a2b6a2a003fa94abd037d05fc7492d65b8c552ca3c41dce74f431c245"},"properties":{"dependency":{"package":"xml2js","version":"0.4.23","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":"4ce6b6a8ee4d0e80dd28a51d662ac70a5a23a67069adb3977d22f97a9b22ead6"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.14.8","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":"a6e7ffc40aa601b55d19cd3e62f69d6b54716f4d9c43f15e968e9e84710ca584"},"properties":{"dependency":{"package":"micromatch","version":"3.1.10","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":"a924a5960fe661f7131c78e432e74f41d4efc39ae552e12556c1bdaf11a81ad8"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","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":"e1e0f3653ff44eaf3dee9609b8c1786ae496fed0f7f146542e9dabde80df72cd"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.12.5","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":"9cd1b73a47924c7d02d5b452ac92e345d44c65b0f84da28f25e268a9875c4a00"},"properties":{"dependency":{"package":"micromatch","version":"4.0.5","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":"51cc9619d02feffa99d4b85e417ee26ba1ad8e86dfc1ece795759e89fd711cd0"},"properties":{"dependency":{"package":"micromatch","version":"4.0.4","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":"d656faa4342a2eeeabc342191be5ef91b502fd854f3b5162ad385d150597aca5"},"properties":{"dependency":{"package":"minimatch","version":"10.2.4","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":"54747a7c09edd23e3b4b95b9fac5cdb065c9cc55bb52a9a97a90e08db3fa7979"},"properties":{"dependency":{"package":"yaml","version":"1.10.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"d0cb54dc947ef18ac0b06c696c80e8a0f59eea788c4819d1fde22b290760d0ff"},"properties":{"dependency":{"package":"@babel/core","version":"7.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"806f875704b1fa346b9bb0c1ad9728b233964dbc57eb70de29d329fd1fac5064"},"properties":{"dependency":{"package":"@babel/core","version":"7.16.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"4f331ac00f4d2c6ed123bd908387fd5525f7d2b615239db854fa1bc2cbe1ca16"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"3b6ec6e490ebe8f0a6822c3f937ffb59b60c4d94578267d647c6029a744ba733"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"7d4679da9c016470a7c4ea89fce65e0f3cb327368a0b63a47909520941e63a50"},"properties":{"dependency":{"package":"@babel/core","version":"7.14.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"aee94889b60b9e1c5f1dd30d55fffcf35bf11df7b77f4c8f5519fce83678a22a"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"a8b265496a1d91d7e5e1dcce51a2230f836bcaf5ff79165b3feb5971fc1a3d8d"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"315038b78a95f559e85fbe432122fb3ac03418ac033d4377a2117cc380ea0599"},"properties":{"dependency":{"package":"@babel/core","version":"7.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"be0a938e7ef32632fea4b2d7c0cd5978c4c1e3cf6c4b765f041b900a474bc9b3"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"3436e30159edfb2d87e8ca4377e8142a58e4e57bc78f89a416bf80e104370e1d"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"16c8d83c929bf7a1635b250b4ae89ae1209031bcbe3da7e86efb62f490cad299"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"ede09a31651412ba73d0062a39f13875132009a7c4b74787f857546b0fd07ed5"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"9551e78f77c849a553ab1010c3f17c7c96961009a0f3ab426ff32e2154f1ef03"},"properties":{"dependency":{"package":"deepmerge","version":"4.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"137a94b66799ac625aad5ee8166cd91677ca68cfed2a8fbe32dc910ef608e8ca"},"properties":{"dependency":{"package":"toggle-array","version":"1.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"cb328e0e98dd8a93019cd4477996a3d2b948505914dc6b18ff4db21b799f71c0"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"97a191af9b08cfe9fc6bb151b2a1061bf850e64fedc4ac730f16082695a89eac"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"6183ea5fae0de56037d24c775e3b69cb665e19d546928b1b259aa4922b0ba9c6"},"properties":{"dependency":{"package":"toggle-array","version":"1.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: default_resolve.rs \u2192 lib.rs, any_helpers.rs, type_util.rs: \u0060rust_port/crates/flow_typing_flow_js/src/default_resolve.rs\u0060 changes together with 3 other files \u2014 \u0060rust_port/crates/flow_typing_debug/src/lib.rs\u0060, \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs\u0060, \u0060rust_port/crates/flow_typing_type/src/type_util.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/default_resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9f3e405c4c0c32d69ebf8bfd36ea40cd41210cad5bc730ffb80a073f75c72a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: any_helpers.rs \u2194 implicit_instantiation.rs: \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/implicit_instantiation.rs\u0060 change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060f996aad2\u0060 [flow] Keep explicit \u0060in out\u0060 type parameters invariant in TypeScript\u2026; \u0060fef04c51\u0060 [flow] Remove unused \u0060BindT\u0060; \u0060d6e8d417\u0060 [flow] Move \u0060ObjTestT\u0060 out of the constraint system \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3010f5f8eb9f6e257652eed11bfaa7baca5d35b3b1d5df6c265349ae67e29b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 any_helpers.rs: \u0060rust_port/crates/flow_typing_debug/src/lib.rs\u0060 and \u0060rust_port/crates/flow_typing_flow_js/src/flow_js/any_helpers.rs\u0060 change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060fef04c51\u0060 [flow] Remove unused \u0060BindT\u0060; \u00604453342c\u0060 [flow] Remove unused \u0060FunProtoBindT\u0060; \u0060d6e8d417\u0060 [flow] Move \u0060ObjTestT\u0060 out of the constraint system \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_debug/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655776d2dd1464cc335ee7d667f827d10d1c406ba8417e2d0158f7b673ac3bdb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: type_sig_options.rs \u2194 lib.rs: \u0060rust_port/crates/flow_type_sig/src/type_sig_options.rs\u0060 and \u0060rust_port/crates/flow_typing_context/src/lib.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060c5e6cbc8\u0060 [flow] Remove \u0060experimental.ts_utility_syntax\u0060; \u0060254d2168\u0060 [flow] Flip default of \u0060experimental.export_as_namespace_support\u0060 to \u2026; \u0060b9ff6ca0\u0060 [flow] Remove \u0060experimental.declare_global_support\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_type_sig/src/type_sig_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41fcacb81cb4e415d7361e8a324cdca1f5dba7034b4f213b1012845e6464ec4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: flow_js.js \u2194 flow-services.js: \u0060website/libs/flow_js.js\u0060 and \u0060website/src/try-flow/flow-services.js\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006070ef3421\u0060 [flow][try-flow] Return null for empty flow.js type-at-pos; \u0060be43f71b\u0060 [flow][website] Fix all Flow type errors; \u006012974121\u0060 [flow][website] Prepare for richer type-at-pos results \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/libs/flow_js.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fe32e28fcd9fe6b3ae22ad4bf1cd92153a02366a8f770d42d14299a38877bf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: misc.js \u2194 flowlib_contents.rs: \u0060lib/misc.js\u0060 and \u0060rust_port/crates/flow_flowlib/src/flowlib_contents.rs\u0060 change together 54% of the time (15 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060e85d15f7\u0060 [flow] Use TypeScript\u0027s ESNext iterator library; \u006012ac3b5f\u0060 [flow] Use TypeScript\u0027s ES2015 iterable library; \u006063e8d795\u0060 [flow] Use TypeScript\u0027s ES2015 collection library \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/misc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ab7daf9fa79774d6e15edbfadc7f2a6a0ec38352722e43635c81bd9150386"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: misc.js \u2194 tslib_contents.rs: \u0060lib/misc.js\u0060 and \u0060rust_port/crates/flow_flowlib/src/tslib_contents.rs\u0060 change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060e85d15f7\u0060 [flow] Use TypeScript\u0027s ESNext iterator library; \u006012ac3b5f\u0060 [flow] Use TypeScript\u0027s ES2015 iterable library; \u006063e8d795\u0060 [flow] Use TypeScript\u0027s ES2015 collection library \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/misc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec74d4db795f6c78b1b4692712d958f292cf3b401cc742db4cb5a5d06d18eccb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: convert_types.rs \u2194 type_mapper.rs: \u0060rust_port/crates/flow_typing_utils/src/convert_types.rs\u0060 and \u0060rust_port/crates/flow_typing_visitors/src/type_mapper.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00600e4a67a8\u0060 [flow] Give a mapped type the strictness of the file that declares it; \u0060d4d91a30\u0060 [flow] Normalize intersection annotations behind \u0060experimental.normal\u2026; \u00604453342c\u0060 [flow] Remove unused \u0060FunProtoBindT\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/convert_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d63552e76155bc7e47038182209f350567df3dcb7e02bae5e1999a0ca74a9c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: parse.rs \u2194 type_service.rs: \u0060rust_port/crates/flow_heap/src/parse.rs\u0060 and \u0060rust_port/crates/flow_services_inference/src/type_service.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00609b8ccaa9\u0060 [flow] Track TypeScript global augmentation contributors; \u006023416df6\u0060 [flow][refactor] Record a declaration kind on every \u0060TypedParse\u0060; \u006036bab5e9\u0060 [flow][oxidation] Use OCaml-style Rust heap entity commits \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_heap/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837ce7a9c5b56b5394acd01e6555223dabe79cc1b65f8ca1e7498ded98785c77"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"d7607849a591d455f8eb1d4d300dc563fc51dcba849902cf3b2366907898100f"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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: Node.js 16: packages/eslint-plugin-fb-flow/package.json declares Node.js 16 as this project\u0027s engines.node, and Node.js 16, support ended 2023-09-11. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2023-09-11 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":"packages/eslint-plugin-fb-flow/package.json"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae2f3a8282e46ca5dd279e36d8b67377808c252f1adc205b7a3682137c5b9b"}},{"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: README.md links to \u0060src/parser/README.md\u0060, but \u0060src/parser/README.md\u0060 does not exist. 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":"README.md"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: packages/flow-parser/README.md names React 19, but the manifest declares \u0060react\u0060 ^18.3.1. 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":"packages/flow-parser/README.md"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb8ca4a6fa82b3825a34fed895e8578df7d587eb60a5df79714acf7a1dcd8d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: website/docs/react/refs.md names React 19, but the manifest declares \u0060react\u0060 ^18.3.1. 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":"website/docs/react/refs.md"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a15ca888db3eb252357ce08a59a3534ae6ee06a43aa7333a163d3e561c174a"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 24/32 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060packages/flow-bin\u0060, \u0060packages/flow-dev-tools\u0060, \u0060packages/flow-remove-types\u0060, \u0060packages/flow-upgrade\u0060 and 3 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageProvider.ts\u0060 reports through \u0060console.*\u0060 at line 90 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageProvider.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"18021c995a581561fed77911bf4cfac607d15d2bb62c66a60e5291e9d1603d62"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 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/build_and_test.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060package.json\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":"package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 224 typed \u00B7 9208 plain JS \u2014 the untyped files are evals/evals/01_error_fixing/error_001_refinement_invalidation/ideal/main.js, evals/evals/01_error_fixing/error_001_refinement_invalidation/input/main.js, evals/evals/01_error_fixing/error_002_exact_object_types/ideal/main.js, evals/evals/01_error_fixing/error_002_exact_object_types/input/main.js, evals/evals/01_error_fixing/error_003_unknown_type_refinement/ideal/main.js, evals/evals/01_error_fixing/error_003_unknown_type_refinement/input/main.js (\u002B9202 more). 0 production file(s) opt out entirely with @ts-nocheck \u00B7 11 @ts-ignore suppression(s)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (19 clone groups): 19 duplicated blocks under packages/ have copies in at least two of the sibling directories flow-api-translator, flow-dev-tools, flow-estree, flow-transform, flow-typed, flow-upgrade \u2014 12 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 19 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 19 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/npm/glob_v7.x.x.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93a3c00383f3f5c41f4a20ebe74e8a90c4d14188e866aecf0c9fe29c390cf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (16 clone groups): 16 duplicated blocks under newtests/lsp/ have copies in at least two of the sibling directories auto_close_jsx, completion, connection, documentHighlight, document_paste, edits (\u002B8 more sibling(s) not listed) \u2014 8 of them are reported below, and 8 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 16 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 16 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 16 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dcbe7685e4a3b903f0e5cdd5a2a963be3d27b01b0b69cf35f3584fdf872573"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 7 sibling directories (5 clone groups): 5 duplicated blocks under evals/evals/02_unique_features/ have copies in at least two of the sibling directories component_006_rest_params, component_008_ref_param, component_025_migrate_forwardref, enum_001_string_enum_cast, enum_003_boolean_symbol, hook_003_hook_type_annotation (\u002B1 more sibling(s) not listed) \u2014 4 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/enum_001_string_enum_cast/ideal/main.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adea4bf7e85d40e9ecc6ad8d5ad5b2b8142259530d2c3ef10754c505d549251"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (89 matched lines \u00D7 2 locations): packages/flow-api-translator/src/TSDefToFlowDef.js:32 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:40 \u2014 the two spans are one implementation copied and then locally edited \u2014 526 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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1b8f21e5f99bab1368b3e7ff9d783127c423324073bf2c271a62f288e5ce1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/ideal/main.js:18 \u00B7 evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/input/source.ts:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 368 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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/ideal/main.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e205aa24f813fadaf57a1acda4fdb13bea1a82216a782f2daae9f6436e73162c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/npm/glob_v7.x.x.js:4 \u00B7 packages/flow-typed/glob.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 420 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":"packages/flow-dev-tools/flow-typed/npm/glob_v7.x.x.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c11637d9982107291bba0951c376b1b10843fcb9644213a0d9ec16639df78b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): evals/evals/02_unique_features/hook_005_conditional_call/ideal/main.js:13 \u00B7 evals/evals/02_unique_features/hook_005_conditional_call/input/main.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 372 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":"evals/evals/02_unique_features/hook_005_conditional_call/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"57002f86f6f76cfd18bfb0ec25e4e9f1d8fff4f0d5ec08cedf303f71f1a79abf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 16 locations): newtests/lsp/signatureHelp/test.js:875 \u00B7 newtests/lsp/signatureHelp/test.js:921 \u00B7 newtests/lsp/signatureHelp/test.js:967 \u00B7 newtests/lsp/signatureHelp/test.js:1013 \u00B7 \u002B12 more site(s) not listed \u2014 all 16 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"742303836448a9a942f446f98b1a6c88b3a848f98d3da5bc63ed18a48eac8b93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): packages/flow-typed/jest.js:332 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:762 \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":"packages/flow-typed/jest.js"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8720384bcacd7e293aa727c8337fe3d8ab4bad2c12ac9f26ce3aa22a048943fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_022_implements_object_type/ideal/main.js:16 \u00B7 evals/evals/01_error_fixing/error_022_implements_object_type/input/main.js:16 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_022_implements_object_type/ideal/main.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a9309fded625d08224ed805a65e78bb03f390d3881c5247f656660018453d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/unknown_top_type_narrowing/ideal/main.js:10 \u00B7 evals/evals/04_ts_to_flow/unknown_top_type_narrowing/input/source.ts:1 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"324d6489a082526fb14fc63dda24621bc42b0fff66b06f36d64461096e977dd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): newtests/lsp/signatureHelp/test.js:1893 \u00B7 newtests/lsp/signatureHelp/test.js:1962 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e982e4a3ad4a8f96a79fd66a10c21e1a65ddc54fdc8f8e58f42fe0a9331df66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 6 locations): newtests/lsp/signatureHelp/test.js:1592 \u00B7 newtests/lsp/signatureHelp/test.js:1631 \u00B7 newtests/lsp/signatureHelp/test.js:1670 \u00B7 newtests/lsp/signatureHelp/test.js:1709 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c9407cfc5fbf3f7557bf5b573c8364850cd6c57a8ec0f13809226355221a9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:307 \u00B7 packages/flow-dev-tools/flow-typed/node.js:364 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd08a12606e5f563fcf911d6da112261c3a847267f7a596d15930a86789d86f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 21 locations): newtests/lsp/signatureHelp/test.js:2034 \u00B7 newtests/lsp/signatureHelp/test.js:2071 \u00B7 newtests/lsp/signatureHelp/test.js:2109 \u00B7 newtests/lsp/signatureHelp/test.js:2147 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f980644ca9ff5797c334ae62fa04dda4b92a41781c7af52fffaf0f3c4ddc6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js:14 \u00B7 evals/evals/01_error_fixing/error_019_class_nominal_typing/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cb7a39e928322fb27422d147d42082c145557fb36b7559df4deceab426c396"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): packages/flow-typed/jest.js:669 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:1094 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/jest.js"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd4348c815d7f337fcf01ba39d39ebe395be13c6c35e15373fa66ccb2e6edb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:537 \u00B7 packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:667 \u2014 the two spans are one implementation copied and then locally edited \u2014 185 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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"782d6392331cc44840120e6870085a87788fb0d32b774961ccbed1aa04275e23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): evals/evals/02_unique_features/hook_007_migrate_basic/ideal/main.js:12 \u00B7 evals/evals/02_unique_features/hook_007_migrate_basic/input/main.js:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/hook_007_migrate_basic/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd2b4a78943167fdb68fd78db7f24fb3115b6ed3bbabe6eaf8bb061bd8290aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): evals/evals/02_unique_features/match_017_unreachable_patterns/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/match_017_unreachable_patterns/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 163 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":"evals/evals/02_unique_features/match_017_unreachable_patterns/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff66af83bdb0a725699df40723939b4e70da42e4fa0e570e201e5d744ebfdad5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 matched lines \u00D7 2 locations): evals/evals/04_ts_to_flow/class_private_members/ideal/main.js:20 \u00B7 evals/evals/04_ts_to_flow/class_private_members/input/source.ts:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 269 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":"evals/evals/04_ts_to_flow/class_private_members/ideal/main.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5879294768335f7095be39cc44a31fcd893c8119b7001d74426813624b58e221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 6 locations): newtests/lsp/signatureHelp/test.js:153 \u00B7 newtests/lsp/signatureHelp/test.js:185 \u00B7 newtests/lsp/signatureHelp/test.js:217 \u00B7 newtests/lsp/signatureHelp/test.js:249 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615fbc81d44ff145668a7d7b01f04aed973bf85eeeabf88874f082cd9951827"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 7 locations): newtests/lsp/signatureHelp/test.js:587 \u00B7 newtests/lsp/signatureHelp/test.js:618 \u00B7 newtests/lsp/signatureHelp/test.js:649 \u00B7 newtests/lsp/signatureHelp/test.js:680 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff2c6c5c0114c08a2400daa0595102609cffb611d3c5d4bace868da6f616793"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 10 locations): newtests/lsp/signatureHelp/test.js:2829 \u00B7 newtests/lsp/signatureHelp/test.js:2860 \u00B7 newtests/lsp/signatureHelp/test.js:2892 \u00B7 newtests/lsp/signatureHelp/test.js:2924 \u00B7 \u002B6 more site(s) not listed \u2014 all 10 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e731b538252242b87083fc1bb79d531cf8fb2ff2cdad17d2f60def74b027b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:2782 \u00B7 packages/flow-dev-tools/flow-typed/node.js:2851 \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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f434510ce20b06c36e2581d5dead0faa02bc495153085c064d5eaa551f6cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 5 locations): newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:472 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:502 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:532 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:562 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacca15d4a9543077662790a873614a2269adf90b83b3a8558a703d45b6b5097"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 8 locations): newtests/lsp/signatureHelp/test.js:2848 \u00B7 newtests/lsp/signatureHelp/test.js:2880 \u00B7 newtests/lsp/signatureHelp/test.js:2912 \u00B7 newtests/lsp/signatureHelp/test.js:2944 \u00B7 \u002B4 more site(s) not listed \u2014 all 8 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b45d8d96541b4526043377d41d8fd621f907121e7a9b0d721d0d70d1c2e37b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:150 \u00B7 packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:233 \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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3299b6c24fd2f1ecb854612a478119338a253701627354eed688feb9791f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): evals/evals/02_unique_features/hook_004_mutation_prevention/ideal/main.js:13 \u00B7 evals/evals/02_unique_features/hook_004_mutation_prevention/input/main.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 176 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":"evals/evals/02_unique_features/hook_004_mutation_prevention/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d19c7d61de47d9a64a3ead7b6eba4d4e433415f6673fa1e8ab268da71aea1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:2954 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:3001 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623ecb4e556d95df2b420f39620f0d99d15f142354e0888c9cf6f94b0654454"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): evals/evals/02_unique_features/match_022_instance_superclass/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/match_022_instance_superclass/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/match_022_instance_superclass/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b1e333e3299a05e96c2ec6dc1f01d3524925790e71b11691063846ba3c859"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:2656 \u00B7 packages/flow-dev-tools/flow-typed/node.js:2693 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0436c6509992dd22f53626851c9fa2ea4c4472291dff96bbb32d5234505f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_020_ts_access_modifiers/ideal/main.js:12 \u00B7 evals/evals/01_error_fixing/error_020_ts_access_modifiers/input/main.js:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_020_ts_access_modifiers/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b34233430868a7cb013a0e0ad366d4ee3a3cf792ca923f9c1dabac8e3cd4cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_025_object_this_reference/ideal/main.js:13 \u00B7 evals/evals/01_error_fixing/error_025_object_this_reference/input/main.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 190 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":"evals/evals/01_error_fixing/error_025_object_this_reference/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aed8f614226e5486b50171c694e2fac0f803516a33a6ccef6356e1fbd4be52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js:13 \u00B7 evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/source.ts:4 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d14dba1ecb91b1d587d52dd2be89e6eb3a6bbf866837d5c012b6af98e43c1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/ideal/main.js:22 \u00B7 evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/input/source.ts:12 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/ideal/main.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"22adba74aa6d778d9a465ae9bd5798295e07398b4976de2cca87c46342a0f1ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 21 locations): newtests/lsp/code-action/quickfix/match/test.js:21 \u00B7 newtests/lsp/code-action/quickfix/match/test.js:48 \u00B7 newtests/lsp/code-action/quickfix/match/test.js:75 \u00B7 newtests/lsp/code-action/quickfix/match/test.js:102 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/code-action/quickfix/match/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"df356b65495ee83fafd343ff01aea1c958205cd46dff08f4353569aa9742897a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 9 locations): lib/lib.es5.js:1993 \u00B7 lib/lib.es5.js:2275 \u00B7 lib/lib.es5.js:2557 \u00B7 lib/lib.es5.js:2838 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lib.es5.js"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"384dc706dee3c791d8d741c45841353e79cd4ce9102ab544dc2ea992ac273528"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4 locations): newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:77 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:103 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:129 \u00B7 newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js:155 \u2014 all 4 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb06d0aaeefbde7f8b5195b9b17970a5e8b535f99b6290b75fa904ea3ec8ca84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_003_unknown_type_refinement/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_003_unknown_type_refinement/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 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":"evals/evals/01_error_fixing/error_003_unknown_type_refinement/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5053777f91384b581ce0fbad595fb19e2a0383e0bd47d460cadfff2f7b5e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): evals/evals/04_ts_to_flow/hook_utilities_complex/ideal/main.js:12 \u00B7 evals/evals/04_ts_to_flow/hook_utilities_complex/input/source.ts:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 232 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":"evals/evals/04_ts_to_flow/hook_utilities_complex/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"17761cb57a6ef77bc5f801487ac0dc509dedd2073d7e48922c4eeacf0cdcabd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): newtests/lsp/queries/outline.js:3 \u00B7 newtests/lsp/wait_for_recheck/outline.js:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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":"newtests/lsp/queries/outline.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cf5595f4e0e1d458407df780264856bcee330af076ed6ff697e7e43867016d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:25 \u00B7 newtests/lsp/wait_for_recheck/test.js:51 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"89759ce195b52ba5ef0217b6c65ad9f7489017b9a68fb0062b6ae8cf1670ad42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_005_array_variance/ideal/main.js:14 \u00B7 evals/evals/01_error_fixing/error_005_array_variance/input/main.js:13 \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":"evals/evals/01_error_fixing/error_005_array_variance/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"babfd96e431f779af30e551504b724f14d9ba289ee5816caf12ed139e0e4d10a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_023_interface_property_variance/ideal/main.js:15 \u00B7 evals/evals/01_error_fixing/error_023_interface_property_variance/input/main.js:15 \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":"evals/evals/01_error_fixing/error_023_interface_property_variance/ideal/main.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bcc1b720360dec85d7cd9f96cfb2f837abd8bdc8065b0a024d0a1ca9391a5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): newtests/lsp/signatureHelp/calls_monomorphic.js:3 \u00B7 newtests/lsp/signatureHelp/calls_overloaded.js:6 \u00B7 newtests/lsp/signatureHelp/calls_overloaded.js:46 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/calls_monomorphic.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1952dacda1ac036b3d1b86aeb0839c0e2a742b5e45c4bd71b4b6ec83bda1ca8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:1332 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:1357 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dd397c057a672eb71181c8a11cc41a789f0c01a10fb9ad33b80f4f833bbb3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js:32 \u00B7 evals/evals/04_ts_to_flow/object_combination_spread/input/source.ts:24 \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":"evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561cb55aad5754761f48b072b393661307a60388eb0fdf65b4a40f49cf02008"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): newtests/lsp/queries/test.js:195 \u00B7 newtests/lsp/queries/test.js:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/test.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b052f44e4f09ac0fabd134915a70ce81dc1d499a59e41344e342bea44cd588"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:1859 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:4790 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"b245cbf1bd847aab8baf83edb42a9f35d803d028cd4a4869b27ab6eedd81bfb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:1965 \u00B7 packages/flow-typed/node.js:77 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3a1f97ebfe419fe5080097c7563fbd20c861f7d8d65b123b13ad630a9c989a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:2381 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:2436 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b40928cf0cb579df6f8b6a0adf9727a5f6765a2eacd696ee6e8de3bde892b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/referencer/Referencer.js:255 \u00B7 packages/flow-eslint/src/scope-manager/referencer/Referencer.js:448 \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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b19a3a7f830d2c8f5ee404dcc4cc8fb0a5869755d7f839bac5e6b543f62a1b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/scope/ComponentScope.js:22 \u00B7 packages/flow-eslint/src/scope-manager/scope/HookScope.js:22 \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":"packages/flow-eslint/src/scope-manager/scope/ComponentScope.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6a038cceade91dfd67523b8f814a26a7946b6dc4c4467d14dfa15cc413b160"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/comprehensive_dom_attributes/ideal/main.js:30 \u00B7 evals/evals/04_ts_to_flow/comprehensive_dom_attributes/input/source.ts:30 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/ideal/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"48772edad98621ea6391e8bbcc1734cb18b0956404c7aaeaf3741daa1562046b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/mapped_generic_props_factories/ideal/main.js:20 \u00B7 evals/evals/04_ts_to_flow/mapped_generic_props_factories/input/source.ts:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/ideal/main.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734278fb110437335f0e4bc9ffe086f0ac3f55eed6f1a795054e90ef875493f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/ideal/main.js:22 \u00B7 evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/input/source.ts:13 \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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/ideal/main.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54d6b8242bff46a12a3f090b5f355bee512ddb21b72d1bff14fb6fd37062dde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:225 \u00B7 newtests/lsp/wait_for_recheck/test.js:248 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7f3e32b0170cfcf08a2237260d59950efbb91ef2fe918d5c1e9e13548146e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/flow-api-translator/src/TSDefToFlowDef.js:523 \u00B7 packages/flow-api-translator/src/TSDefToFlowDef.js:851 \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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a80bc7f9b1e764a5c8d509611999c7cbbb13e1d5f198c87e849873244d89a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:3280 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:3441 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3069a73db917fbbdecf4559dd81dbdefbd327470803b0bd1500fbd3985e1a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/estree/StripFlowTypesForBabel.js:72 \u00B7 packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js:66 \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":"packages/flow-parser/oxidized-src/estree/StripFlowTypesForBabel.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d239a50ac2194c9cce77d3b0e8ed73d37785508a0a3577c0fc251e0fb0cf824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/flow-transform/src/traverse/NodeEventGenerator.js:128 \u00B7 packages/flow-transform/src/traverse/NodeEventGenerator.js:163 \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":"packages/flow-transform/src/traverse/NodeEventGenerator.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c646238ca5334001b894f7bcbbbf5caa2c9ab13a4598c0c07b8fe7c04084955"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/flow-typed/jest.js:750 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:1185 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/jest.js"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1ebadbf5eff974727aaee97dd42b7dab66bb8e4c190fc1bfae67382216546a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/anonymous_interface_param/ideal/main.js:17 \u00B7 evals/evals/04_ts_to_flow/anonymous_interface_param/input/source.ts:8 \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":"evals/evals/04_ts_to_flow/anonymous_interface_param/ideal/main.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1ab2cbb8bbb53b879a9109abaff51a7508a0df1dd7808b33733d8a1f2be4cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/class_implements_utility_to_interface/ideal/main.js:23 \u00B7 evals/evals/04_ts_to_flow/class_implements_utility_to_interface/input/source.ts:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/ideal/main.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df5b77830db4978460ceddd2b2042107b07c6b716890183d39f016bcec6eb31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/variance_advanced/ideal/main.js:26 \u00B7 evals/evals/04_ts_to_flow/variance_advanced/input/source.ts:22 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/variance_advanced/ideal/main.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18afc7c34f50eb2ffbd447c29eb61253fede4aeba70280175bdf535c8404b48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/FlowParser.js:111 \u00B7 packages/flow-parser/oxidized-src/FlowParser.js:135 \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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48c6627423463ea7d3a752ac43a4c5e6d52452a57afe216bacfde4760c4222e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/as_const_assertions/ideal/main.js:10 \u00B7 evals/evals/04_ts_to_flow/as_const_assertions/input/source.ts:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/as_const_assertions/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15cdd36dea8f6151fc73a16808339c8157865df8f70d0287af03b37004ad09f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): newtests/lsp/documentHighlight/test.js:29 \u00B7 newtests/lsp/findReferences/test.js:35 \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":"newtests/lsp/documentHighlight/test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f16a22ed6b5aa8a7673c4f888cdc4c3ea9e3f3d5b1e7da8ae0a288f5166af83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:3086 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:3327 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caee21140656b1ef1c808e98261bd240a5d65a2a678f8872808c8021fd75069"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:1535 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:1559 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b250a8f07c47562b106ec7a21feb1532f10ca8510a5a3dcbc3088f300b2fcf55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/flow-typed/jest.js:77 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:67 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/jest.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e732559ff1e8a94aac17d5892768d645e7e427ae200e7ebcb28bfd165ffbc763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/flow-typed/jest.js:160 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:580 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/jest.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b5a38201cb98a0471ff9d04ba085d0c0c432dd562732b07e33008f6ce72de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): newtests/lsp/documentHighlight/test.js:29 \u00B7 newtests/lsp/findReferences/test.js:35 \u00B7 newtests/lsp/renameFileImports/test.js:28 \u2014 the 3 copies are spread across 3 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":"newtests/lsp/documentHighlight/test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d21fe81d3469d31f38b059a9156da9023eed497534e711eaaf5fd4eff82813"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:1107 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:4380 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ecd40b067da263f88da57d1c61a1d13662cd53c0b4e86706420c2d255f9dab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:610 \u00B7 packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:799 \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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9ba5f2b2dba22aea7a58aa750e245943fff97a81a422064e41d65b7bd6cdb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_004_exact_objects_extra_props/ideal/main.js:14 \u00B7 evals/evals/01_error_fixing/error_004_exact_objects_extra_props/input/main.js:13 \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":"evals/evals/01_error_fixing/error_004_exact_objects_extra_props/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"134f10879f1771caa98d67ab5082c6765a858ac0daa0ac246aab039e7ca74ad6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_006_generic_bounds/ideal/main.js:24 \u00B7 evals/evals/01_error_fixing/error_006_generic_bounds/input/main.js:24 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_006_generic_bounds/ideal/main.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"55505fdbd0b2651efe9c6b05fe0ef192dd2b4b00f182087a144946968492ad7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): packages/flow-api-translator/src/flowDefToTSDef.js:1416 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:1462 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:1481 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"51686e9036f20b279673a2b15cd84a840be9dbda0b4fa25af63a27b3c466ae32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:1449 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:1468 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7562eae38cffecf0cd21717c589b1494e0658dace72d4540bfb89d8842054ef7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:3195 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:4763 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fcc8e94755224cc8c99b1c4947c5d1662ab13d8839a3e4a5dbb1961809cb82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:3310 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:3393 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb8a89bc209e4b3e7aead13f22a30c6fff50abbb74ac9a75ed995d0079f7cf6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:961 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:979 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89bef23e5f742edcec2f4ef6a7d24b326ce82ec6e1c2365ac7d05329c15e839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:1504 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:1580 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae376d887bbd5940ba3a8013a2f1a3967c69bf1524b91e4c2307b9ad518031c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:3158 \u00B7 packages/flow-typed/node.js:138 \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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":3158}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f7e8ad0c1115ab1ba7818fd928431a30c7acf4127fb93694792bdb41092b3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/flow-typed/jest.js:14 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:4 \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":"packages/flow-typed/jest.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4f0fa1007a328f415ecadbd28612d157abf9b2709fbebaef0221207ba4169a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/scripts/transform/genTransformCloneTypes.js:41 \u00B7 packages/scripts/transform/genTransformModifyTypes.js:35 \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":"packages/scripts/transform/genTransformCloneTypes.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602fc63a797808560163824a33a11c22da40384be24aba311046850675c050c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_009_react_props/ideal/main.js:12 \u00B7 evals/evals/01_error_fixing/error_009_react_props/input/main.js:12 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_009_react_props/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ddc875e6a1c2956f7ee43c5a3842ea53e201b504c3e0c8fe3e4048d3f80949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_026_asymmetric_subtyping/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_026_asymmetric_subtyping/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_026_asymmetric_subtyping/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9040b6ccae35c6aac465b1d6a5c19e59e1e8199b6abb05c787b7bd058881f329"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): evals/evals/02_unique_features/match_021_instance_pattern_union/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/match_021_instance_pattern_union/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/match_021_instance_pattern_union/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a43d3b863864da9a4d734fe401dbd79430e5a8dd94e62bfe62bdbd8776840"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/ideal/main.js:10 \u00B7 evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/input/source.ts:1 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f9480def4adfea26bb286e6b38c8e6035b101b926610b5d697adfa09e39a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): evals/evals/04_ts_to_flow/component_props_element_ref/ideal/main.js:18 \u00B7 evals/evals/04_ts_to_flow/component_props_element_ref/input/source.ts:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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":"evals/evals/04_ts_to_flow/component_props_element_ref/ideal/main.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"adab4e5340295802c3e4061f77c65008200387900af8884dcac167d0a778c737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): newtests/lsp/connection/test.js:181 \u00B7 newtests/lsp/restartOnReinit/test.js:22 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/connection/test.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3934c4d98074b3765efbbc6e04a923e7ded5df4357764cff7140f66902a53de2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): newtests/lsp/documentHighlight/test.js:31 \u00B7 newtests/lsp/findReferences/test.js:37 \u00B7 newtests/lsp/globalReferencesAndRename/test.js:57 \u00B7 newtests/lsp/renameFileImports/test.js:30 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentHighlight/test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af3ce3cd160bc2abe8a7966ea4508d6e826896aeb7e151b83b0c369786e5dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): newtests/lsp/queries/test.js:26 \u00B7 newtests/lsp/wait_for_recheck/test.js:32 \u00B7 newtests/lsp/wait_for_recheck/test.js:58 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/test.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"14db828066058c43d082fe538c7588694f093b1e805d83312642fdda909c7acf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:4327 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:4346 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":4327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5bc667a854ae3222a2eb36f83decdf86b2c9191ea812e843448e2012f7194d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:997 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:1013 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"526c1a000642a1450765f1c9d3d80fbfcf9708c6ec3e4181bed57ff331b302f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:88 \u00B7 packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:110 \u00B7 packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:273 \u00B7 packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:289 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba36b736a064f4551d1ffe16bf9724d125443e5c45ff69c9028fb17d7046e57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js:29 \u00B7 evals/evals/01_error_fixing/error_027_interface_spread/input/main.js:24 \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":"evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"984c8a021ea027a01a440884be4ab4f5b4788f0056c9ff6a9483f4496aa77be1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_030_this_type_variance/ideal/main.js:12 \u00B7 evals/evals/01_error_fixing/error_030_this_type_variance/input/main.js:12 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_030_this_type_variance/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b83aa1bd091b49cd11b23086e6e145025046cee7ac506808c4a51c31f7e1fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): evals/evals/02_unique_features/react_util_001_element_type/ideal/main.js:31 \u00B7 evals/evals/02_unique_features/react_util_001_element_type/input/main.js:15 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/react_util_001_element_type/ideal/main.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5522109104642b90175fe6cc68d317b987c7521a6035ad518fb4b874febc71c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/intersection_function_overloads/ideal/main.js:10 \u00B7 evals/evals/04_ts_to_flow/intersection_function_overloads/input/source.ts:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/intersection_function_overloads/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9c11404b8dd557c42f038288aaa173e675dccf1377e1c6ea9d71c231ac4403"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): newtests/lsp/completion/autoimports/test.js:26 \u00B7 newtests/lsp/completion/autoimports/test.js:55 \u00B7 newtests/lsp/completion/autoimports/test.js:86 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba67f55431e812e99b18a01a88ff01418b6818b8ea211acd46355e1d6f1dba6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): newtests/lsp/completion/autoimports/test.js:51 \u00B7 newtests/lsp/completion/autoimports/test.js:81 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da4df31aaf756a672763394a64f1c55297682bd6745495e9fea1f074f5558e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/flow-api-translator/src/TSDefToFlowDef.js:1742 \u00B7 packages/flow-api-translator/src/TSDefToFlowDef.js:1799 \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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a89a5abd02a62cc733cd70472828ca43e49ee08fad61795462046651cfbe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/flow-api-translator/src/flowDefToTSDef.js:1138 \u00B7 packages/flow-api-translator/src/flowDefToTSDef.js:3661 \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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"171df500c3bcd964addc8175038e74ad7aabd56bcc4e2b21cf3ae94bdb143ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:1639 \u00B7 packages/flow-dev-tools/flow-typed/node.js:1683 \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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"705b4d3843a2ae91d2133921a313efac7a6478d9b82055a5af090586c314b635"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/flow-eslint/src/scope-manager/referencer/Referencer.js:356 \u00B7 packages/flow-eslint/src/scope-manager/referencer/Referencer.js:621 \u00B7 packages/flow-eslint/src/scope-manager/referencer/Referencer.js:657 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eacc3db855003d62bf51248ea3436538eb58bd4d3fab667102131ae1ee1302d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 9 locations): packages/flow-eslint/src/scope-manager/scope/BlockScope.js:15 \u00B7 packages/flow-eslint/src/scope-manager/scope/ClassFieldInitializerScope.js:15 \u00B7 packages/flow-eslint/src/scope-manager/scope/ClassStaticBlockScope.js:15 \u00B7 packages/flow-eslint/src/scope-manager/scope/ComponentScope.js:17 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/scope/BlockScope.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb509be670cb269ebaaf2e0e0898669b37f391c5c08bf3fa7821f011b8fd6824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js:98 \u00B7 packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js:115 \u00B7 packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js:185 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bd998640954eb8180aa4c53752625ad32bcd259fdd254526b52e68e7e96e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): evals/evals/02_unique_features/component_013_nested_component/ideal/main.js:12 \u00B7 evals/evals/02_unique_features/component_013_nested_component/input/main.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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":"evals/evals/02_unique_features/component_013_nested_component/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"89735ed16cdbbbacd668028fdb4c3e5a97ca02f5e773c8a0c615def77c0d2dec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/opaque_type_branding/ideal/main.js:19 \u00B7 evals/evals/04_ts_to_flow/opaque_type_branding/input/source.ts:18 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/opaque_type_branding/ideal/main.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a996a771c1f96a2e901593c35a38736e2624e8f0ec907e5b3d67789a35d7719a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js:34 \u00B7 evals/evals/04_ts_to_flow/utility_types_filter_collections/input/source.ts:29 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b24df2bde00b9c51081e09df1ff5fd5d745fa5124d9c06ba6111b6d138e054"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): evals/evals/05_code_generation/modernize_007_readonly_collections/ideal/main.js:10 \u00B7 evals/evals/05_code_generation/modernize_007_readonly_collections/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/05_code_generation/modernize_007_readonly_collections/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acf3e927dd4e5f4fb3ffc6cdac2fe3199ed00b5d395dac13c25127f1a4d9311"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:138 \u00B7 packages/flow-dev-tools/flow-typed/node.js:155 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0e3bfe4635b8211187e25873bbcca2f06765068d73bc7f81d9a2e414f74a5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:5197 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5222 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5186e2319ddf296f7f4bce7dc5c9020de18e211341bc679ead5d40a78ccfd433"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): packages/flow-eslint/src/scope-manager/scope/BlockScope.js:20 \u00B7 packages/flow-eslint/src/scope-manager/scope/DeclareModuleScope.js:20 \u00B7 packages/flow-eslint/src/scope-manager/scope/DeclareNamespaceScope.js:20 \u00B7 packages/flow-eslint/src/scope-manager/scope/RecordScope.js:20 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/scope/BlockScope.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeeb1f682967dd52526b38fb2baa7d2e9556121ea7a2f35c0caa1b2ffbc05e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/scope/ClassScope.js:20 \u00B7 packages/flow-eslint/src/scope-manager/scope/MatchCaseScope.js:20 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/scope/ClassScope.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0392537dcb5a7e64c38fb5399a33f72b77f73ae49f9f19e8a8b20112732f229"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/scope/ScopeBase.js:466 \u00B7 packages/flow-eslint/src/scope-manager/scope/ScopeBase.js:481 \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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8342f092d11d5eb98397dad76fab5c83bd90cb297ce0ff7f7762478f20b07221"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/flow-upgrade/src/codemods/convertShapeToPartial.js:19 \u00B7 packages/flow-upgrade/src/codemods/renamePartial.js:18 \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":"packages/flow-upgrade/src/codemods/convertShapeToPartial.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5897fa29e5fbd0c495b09bc88bc81226c5db79a476869682af584ddff2bacb2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_001_refinement_invalidation/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_001_refinement_invalidation/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_001_refinement_invalidation/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e927c159996bd2fe902b3a757dab28727bcbe0b8adcdeb93392b7a4eb2a6ac55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_008_indexer_access/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_008_indexer_access/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"evals/evals/01_error_fixing/error_008_indexer_access/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f93f37beed32f31eb216541600b0d333ebc44989fe8fb8a7ca3df12d8a6d02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_015_recursive_return_annot/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_015_recursive_return_annot/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_015_recursive_return_annot/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df24e1bd49897249222d6c6288b062a88521b2a1a04fec5894ac8e7501cfd47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_027_interface_spread/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a47c1bb1d18da1e1613780b910b63396510705469cc28744b8d2f186e30d47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_034_var_branch_union/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_034_var_branch_union/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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":"evals/evals/01_error_fixing/error_034_var_branch_union/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9cbc4c0d6e7261adfb3ae5e0b90beff14aec8f79c4374f9a8bb357b980cbcd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:187 \u00B7 newtests/lsp/wait_for_recheck/test.js:208 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5567780ff43254df62cee7dd2e9c87c2ffce25954be19e9111c892a98f39ca7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:437 \u00B7 packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:465 \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":"packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"89678363dd8a07373e14817ed9096900234e4ef0298503a3e7ff6d572e293435"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/StatusProvider.ts:48 \u00B7 packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageProvider.ts:53 \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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/StatusProvider.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ebbe6efbbcc62e160d990b17464b50be325af673aac495747a7328d79d7f42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js:252 \u00B7 packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js:373 \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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca91c1f86a25e4181b34f9249bebf01fe16aa6a5f2a302d051e352397143838"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/transform/astNodeMutationHelpers.js:84 \u00B7 packages/flow-parser/oxidized-src/transform/astNodeMutationHelpers.js:119 \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":"packages/flow-parser/oxidized-src/transform/astNodeMutationHelpers.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"988fc78ec7b045a8056ac25b94fb4976c890f0a04fc2caa6cdc8fb61312fde62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-transform/src/transform/mutations/RemoveStatement.js:30 \u00B7 packages/flow-transform/src/transform/mutations/ReplaceNode.js:37 \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":"packages/flow-transform/src/transform/mutations/RemoveStatement.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cb72bb34e74d75702bb232c0af7cf62c3d4f4846fdf929eb834481ded91452"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-typed/prettier.js:849 \u00B7 packages/flow-typed/prettier.js:868 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/prettier.js"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062a1ed4f0bf356524b5e8e98178889a5274d62a7a6ddc6f09001336b0563de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:185 \u00B7 packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js:199 \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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386e3761e7ac1222b577ad08e905217dea2ad4d86bb18a3aa8f9dc18a233ca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/scripts/transform/genTransformCloneTypes.js:21 \u00B7 packages/scripts/transform/genTransformModifyTypes.js:21 \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":"packages/scripts/transform/genTransformCloneTypes.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b236b0e12b4a0db42f2d68f4de2957d12a84e85d1260b9b3ee6c3448029cb09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_002_exact_object_types/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_002_exact_object_types/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_002_exact_object_types/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d817556a375381907363e578c342ee8d95ac5a467d2b8f5ede586bdd57d6fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_014_method_return_annot/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_014_method_return_annot/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"evals/evals/01_error_fixing/error_014_method_return_annot/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d2cc604cb93c18e654226dcdcf76fb4b2bb825adca62a031354e43cafc774c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/evals/02_unique_features/react_util_005_component_props/ideal/main.js:33 \u00B7 evals/evals/02_unique_features/react_util_005_component_props/input/main.js:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/react_util_005_component_props/ideal/main.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38d0668c7a4309cbead4a460e270d32e9edc50a64a2566f1136c31991f735f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/mapped_type_modifiers/ideal/main.js:22 \u00B7 evals/evals/04_ts_to_flow/mapped_type_modifiers/input/source.ts:20 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/mapped_type_modifiers/ideal/main.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f957f49f221f3e706c27591812a33ee8749bff43156fdc8daff537f2a16f63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/ideal/main.js:35 \u00B7 evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/input/source.ts:26 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/ideal/main.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33a2132b1d357b029e3ae2df4ed61765aa1a8c506a73f5f30c942219518c819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/evals/05_code_generation/modernize_008_mixed/ideal/main.js:10 \u00B7 evals/evals/05_code_generation/modernize_008_mixed/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/05_code_generation/modernize_008_mixed/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcf441c50e1e4f88b39dad084c55bb6dfcefba9f6811cd0021b63b755f895dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): evals/flow-typed/environment/jsx.js:1587 \u00B7 evals/flow-typed/environment/jsx.js:1624 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/flow-typed/environment/jsx.js"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eab9c153c2b1f37ddc7c42a1d01cb19f04d77ec027b00463477acc571492840"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): newtests/lsp/connection/test.js:75 \u00B7 newtests/lsp/connection/test.js:102 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/connection/test.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cff5e2fa607f4b4e25efdc97e269f1da7f99d1d55885cb991c12738ed25f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:77 \u00B7 newtests/lsp/wait_for_recheck/test.js:92 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea597cae2dff836df502bef259af2b95d42da665b1d8e0d30e631dfa0237cf5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:115 \u00B7 newtests/lsp/wait_for_recheck/test.js:130 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"581729efd9851b37417bec614234a3e8f52973bf9050d38307438c9fec28e81b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:148 \u00B7 newtests/lsp/wait_for_recheck/test.js:163 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e27d14118e16806494092eaec1878ce012111716cec4a2087400495364cdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js:67 \u00B7 packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js:81 \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":"packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880f417c994026af0b68541ab7dc5b801ce62feb3b1f62fd13eeceb0b8a9d8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-api-translator/src/flowToFlowDef.js:752 \u00B7 packages/flow-api-translator/src/flowToFlowDef.js:1518 \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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b357564877d14c58191d21a1938c71698b7b3709392a5ec2ccb2830597404c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/ScopeManager.js:224 \u00B7 packages/flow-eslint/src/scope-manager/ScopeManager.js:238 \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":"packages/flow-eslint/src/scope-manager/ScopeManager.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3af0a6c53f94e83fb63213f68ec642ae8a360c55a7da220c2211223d25dd90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/analyze.js:97 \u00B7 packages/flow-eslint/src/scope-manager/analyze.js:124 \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":"packages/flow-eslint/src/scope-manager/analyze.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d569e311f95c886b46c1e9e0f97e0063b67688cbfe7485a918958251b5de92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): packages/flow-eslint/src/scope-manager/definition/CatchClauseDefinition.js:11 \u00B7 packages/flow-eslint/src/scope-manager/definition/ImplicitGlobalVariableDefinition.js:11 \u00B7 packages/flow-eslint/src/scope-manager/definition/NamespaceNameDefinition.js:11 \u00B7 packages/flow-eslint/src/scope-manager/definition/RecordNameDefinition.js:11 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/definition/CatchClauseDefinition.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e819c97ba85c5e144faec5058440aa7978937fbd6796acf2228505145aeb800f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/FlowParserDeserializer.js:324 \u00B7 packages/flow-parser/oxidized-src/FlowParserDeserializer.js:342 \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":"packages/flow-parser/oxidized-src/FlowParserDeserializer.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f8cd597392e790e311a817536a043a493a21b32f10c7e60ec01efb476350b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js:796 \u00B7 packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js:816 \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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a33f66cc4ccb4f680526aea411990f0c52ccc7a56489f26a3bb6bedb3743e1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/utils/Builders.js:106 \u00B7 packages/flow-parser/oxidized-src/utils/Builders.js:119 \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":"packages/flow-parser/oxidized-src/utils/Builders.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c96b8603554c3a918c244ba88f5e3b901163a99bab5e52f1e5107a50163c48d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/flow-typed/prettier.js:586 \u00B7 packages/flow-typed/prettier.js:602 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/prettier.js"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec1c4ec038649ad2de91951896aad13113bd062d9438a916ba07697745138ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_007_property_variance/ideal/main.js:30 \u00B7 evals/evals/01_error_fixing/error_007_property_variance/input/main.js:30 \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":"evals/evals/01_error_fixing/error_007_property_variance/ideal/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff901f938cbe35e6ed3d1c8568b9519a0cf89b0881470b86814b2653b79df12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_031_method_param_variance/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_031_method_param_variance/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_031_method_param_variance/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ce4ce600b4c263b822d92cf1fdd36beb7a0716323acf1110885cd6e25ed481"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_035_var_null_init/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_035_var_null_init/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"evals/evals/01_error_fixing/error_035_var_null_init/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd486d7a7d60693ef448342aec87e268cdeb228bc2736fa931322b0941c888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): evals/evals/02_unique_features/component_006_rest_params/ideal/main.js:12 \u00B7 evals/evals/02_unique_features/component_008_ref_param/ideal/main.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"evals/evals/02_unique_features/component_006_rest_params/ideal/main.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9d80ce7bc6e793c4d858cbf6d14618992e1091f2c7cc45f1e280a6ec06d897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): evals/evals/02_unique_features/component_008_ref_param/ideal/main.js:13 \u00B7 evals/evals/02_unique_features/component_025_migrate_forwardref/ideal/main.js:12 \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":"evals/evals/02_unique_features/component_008_ref_param/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf54f7eaa1fe89d73a0639cb60db008fc52743afea0e3dea542dc1f1750edbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/02_unique_features/react_util_002_ref_object/ideal/main.js:21 \u00B7 evals/evals/02_unique_features/react_util_002_ref_object/input/main.js:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/react_util_002_ref_object/ideal/main.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eec76b2991f6a3459aa0afb2ba54dea8c854c4c7e2a29e9d8fe825d65f32f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/02_unique_features/react_util_003_ref_of/ideal/main.js:30 \u00B7 evals/evals/02_unique_features/react_util_003_ref_of/input/main.js:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/react_util_003_ref_of/ideal/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ae8cb3fa869dfa7fd5e0597b2ca836f59bf474ef584d1d689a1e45583a6365"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/02_unique_features/type_guard_001_this/ideal/main.js:26 \u00B7 evals/evals/02_unique_features/type_guard_001_this/input/main.js:25 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/type_guard_001_this/ideal/main.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427bc8d3c151f5f5308b318a80fd532da86b63507a86cd99a2d04a81e52982c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/const_type_parameters/ideal/main.js:10 \u00B7 evals/evals/04_ts_to_flow/const_type_parameters/input/source.ts:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/const_type_parameters/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58188ae473978db4b50fa988d8a9741f3e34a9dda67648122fbd079330f3fbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js:63 \u00B7 evals/evals/04_ts_to_flow/object_combination_spread/input/source.ts:55 \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":"evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"651607b1034f0a7aa46a7a3cd2bfe397a5807b81e897ed35576fc723f47199e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/object_literal_this/ideal/main.js:36 \u00B7 evals/evals/04_ts_to_flow/object_literal_this/input/source.ts:21 \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":"evals/evals/04_ts_to_flow/object_literal_this/ideal/main.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea8c9dc4de0890ba18dd196745dadfe4fb56e4697b9ba71048048562d6711bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): evals/evals/05_code_generation/modernize_020_react_element/ideal/main.js:16 \u00B7 evals/evals/05_code_generation/modernize_020_react_element/input/main.js:16 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/05_code_generation/modernize_020_react_element/ideal/main.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8005ea2c774dccb53a8d814e7aa40af4bfec4136a728666fe672aa173f4c9435"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): newtests/lsp/findReferences/test.js:7 \u00B7 newtests/lsp/globalReferencesAndRename/test.js:7 \u00B7 newtests/lsp/rename/test.js:7 \u00B7 newtests/lsp/renameFileImports/test.js:7 \u2014 the 4 copies are spread across 4 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":"newtests/lsp/findReferences/test.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1a96fcb049ecbc81fdc7967d508381c60a7706b9241df8380a55f5a7fd45f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): newtests/lsp/queries/coverage.js:3 \u00B7 newtests/lsp/wait_for_recheck/coverage.js:3 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/coverage.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e570cc3a6d2ae57d0122225879751d1513b2511c2097d3b64b5c181fb67472e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): newtests/lsp/wait_for_recheck/test.js:272 \u00B7 newtests/lsp/wait_for_recheck/test.js:286 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab54f703c6ed7fa2caaa99195e87da5965bd2ef3c3856cda77c63eebfabce555"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:2937 \u00B7 packages/flow-dev-tools/flow-typed/node.js:4143 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"719df5a2be9861e1a0b623321cd2bffc734d94145ecdb21edfb95fd624755f10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/npm/chalk_v4.x.x.js:84 \u00B7 packages/flow-upgrade/flow-typed/npm/chalk_v2.x.x.js:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/npm/chalk_v4.x.x.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc2dd68f5a5baed5defa89c80592bf2eb6c87aabbbac6d7a36cd958056b7288"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/ScopeManager.js:188 \u00B7 packages/flow-eslint/src/scope-manager/ScopeManager.js:232 \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":"packages/flow-eslint/src/scope-manager/ScopeManager.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3506e9a18405b4f001580de1a6922c4c086d26dd49dda56b38509ce881e77a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/flow-eslint/src/scope-manager/definition/CatchClauseDefinition.js:18 \u00B7 packages/flow-eslint/src/scope-manager/definition/NamespaceNameDefinition.js:18 \u00B7 packages/flow-eslint/src/scope-manager/definition/RecordNameDefinition.js:18 \u2014 the 3 copies are spread across 3 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/definition/CatchClauseDefinition.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d982ca702e60ff1e9100d993edced1b6cb60a9ff9b15d31482a66b1f15b5f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/definition/ClassNameDefinition.js:23 \u00B7 packages/flow-eslint/src/scope-manager/definition/FunctionNameDefinition.js:23 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/definition/ClassNameDefinition.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"368905b198b7b16954a05cc0603b7e040cb4ebbb47c85d1ac2f6e0ce21f45e7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/flow-eslint/src/scope-manager/definition/ComponentNameDefinition.js:22 \u00B7 packages/flow-eslint/src/scope-manager/definition/EnumDefinition.js:18 \u00B7 packages/flow-eslint/src/scope-manager/definition/HookNameDefinition.js:18 \u2014 the 3 copies are spread across 3 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/definition/ComponentNameDefinition.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ca3bccee15f60a3c29366aca7480aed89b0388037bc28a034df68386f18c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-for-vscode/src/FlowLanguageClient/ClientCommands.ts:117 \u00B7 packages/flow-for-vscode/src/FlowLanguageClient/ClientCommands.ts:130 \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":"packages/flow-for-vscode/src/FlowLanguageClient/ClientCommands.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"024f464125ac0f44e941c44777f94ee48e8e4dd84aa08546005e0f2ff5e9206c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:215 \u00B7 packages/flow-transform/src/transform/comments/prettier/language-js/comments.js:302 \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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cecc8f2b5641d9acd0c6b2ce4cc1cd84fe26d0327cd1f08585780f817a4d29b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-transform/src/transform/mutations/RemoveStatement.js:43 \u00B7 packages/flow-transform/src/transform/mutations/ReplaceStatementWithMany.js:77 \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":"packages/flow-transform/src/transform/mutations/RemoveStatement.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"16033d3fe891b0a8d1973d02cc3d2ba2ca0e29e6f9fa8fbcbe058283d18abaa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/flow-typed/jest.js:284 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:714 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-typed/jest.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"716ccb14159724c68f500ee023ed247955185009227b2868cc2f0c5fddadadd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js:13 \u00B7 evals/evals/02_unique_features/hook_008_migrate_hook_type/ideal/main.js:12 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee0fc57b7a1b7d33dffe9d43b78050e36e5d4ff8d8a3057f3f0f06ddbd74948"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/02_unique_features/hook_006_conflation_prevention/ideal/main.js:13 \u00B7 evals/evals/02_unique_features/hook_006_conflation_prevention/input/main.js:13 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/hook_006_conflation_prevention/ideal/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e5e14855df05b4e376578f6fd07b81987674ea47cedfa18f09562a67d45d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/02_unique_features/type_guard_003_one_sided/ideal/main.js:14 \u00B7 evals/evals/02_unique_features/type_guard_003_one_sided/input/main.js:12 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/type_guard_003_one_sided/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa4c9ed14ddd2ccb5a3b56f9fd086910ec5220092b52c83ecc5140669c40cdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/default_type_params/ideal/main.js:23 \u00B7 evals/evals/04_ts_to_flow/default_type_params/input/source.ts:21 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/default_type_params/ideal/main.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deb1cc8a50241486e28962de99b8bb2afcc757a1f5d09176e0a09ddf204cd13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): evals/evals/04_ts_to_flow/props_composition_hoc/ideal/main.js:33 \u00B7 evals/evals/04_ts_to_flow/props_composition_hoc/input/source.ts:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"evals/evals/04_ts_to_flow/props_composition_hoc/ideal/main.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e6c99bdb201564b9cbccd3745a32f6a2ae15d16c954294085ef6685f29cd03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/react_element_basic/ideal/main.js:16 \u00B7 evals/evals/04_ts_to_flow/react_element_basic/input/source.ts:9 \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":"evals/evals/04_ts_to_flow/react_element_basic/ideal/main.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0adf0eba24f99ef84d658a4bdca0988f4caee1e02ff0d4112b33d8d910efc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/this_parameter_types/ideal/main.js:14 \u00B7 evals/evals/04_ts_to_flow/this_parameter_types/input/source.ts:12 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/this_parameter_types/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a79ea09fa13d41c40f12aeb5849cb76437a7ffdcf0d45d71e7cd7883833ef6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/values_member_unions/ideal/main.js:24 \u00B7 evals/evals/04_ts_to_flow/values_member_unions/input/source.ts:22 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/values_member_unions/ideal/main.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d31208b4d0568ccb3f8fa1ae83304ba5532423a0ab39766185892b8d2a7100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9 locations): lib/lib.es5.js:1807 \u00B7 lib/lib.es5.js:2089 \u00B7 lib/lib.es5.js:2371 \u00B7 lib/lib.es5.js:2653 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 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":"lib/lib.es5.js"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4f12ec3915b41542a61306a989ffc3a61597048cfb2b214719ac10f1f1de2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): newtests/lsp/completion/autoimports/test.js:123 \u00B7 newtests/lsp/completion/autoimports/test.js:267 \u00B7 newtests/lsp/completion/autoimports/test.js:312 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb1e13535dd702afbcc19ea3e51c784496a51c0f9df2817d10df275ab97dc94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:896 \u00B7 packages/flow-dev-tools/flow-typed/node.js:907 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba182196b315cbc1de3bcc3e3f0fce15360a2dceccec88d28fbb1d3cf240595f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/flow-eslint/src/scope-manager/definition/ClassNameDefinition.js:25 \u00B7 packages/flow-eslint/src/scope-manager/definition/EnumDefinition.js:20 \u00B7 packages/flow-eslint/src/scope-manager/definition/RecordNameDefinition.js:20 \u00B7 packages/flow-eslint/src/scope-manager/definition/TypeDefinition.js:33 \u2014 the 4 copies are spread across 4 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":"packages/flow-eslint/src/scope-manager/definition/ClassNameDefinition.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef15d6c392f1074248119195b1eafb6e55159428ee48236d6e805c58d0ccd9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/flow-remove-types/index.js:199 \u00B7 packages/flow-remove-types/index.js:210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/index.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b505acbc564d98769d8f84d01a82bb8e10c82397862b06d58187bdca9e0a99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/flow-typed/jest.js:545 \u00B7 packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js:970 \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":"packages/flow-typed/jest.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c65439f9877d174a4646f344a6902eff7c499ed1e6d43e2c5b5f8bc1847a9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_028_primitive_into_interface/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_028_primitive_into_interface/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_028_primitive_into_interface/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7a1833c2e5a308b7bda93a9755c4158ce3f975fe80f0bcd1882c5604484d5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js:30 \u00B7 evals/evals/04_ts_to_flow/exact_objects_complex/input/source.ts:43 \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":"evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd202cb9fd8cc2b550f7fafc6f6c4d096d589ebf55044dcff4f983fc9a7c8a52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/multi_file_module_split/ideal/money.js:15 \u00B7 evals/evals/04_ts_to_flow/multi_file_module_split/input/source.ts:6 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/multi_file_module_split/ideal/money.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"add13dc056680a4205e55a79dbdc2d4a881570af281f88b3524f6099419a4697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/readonly_functional_patterns/ideal/main.js:28 \u00B7 evals/evals/04_ts_to_flow/readonly_functional_patterns/input/source.ts:19 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/readonly_functional_patterns/ideal/main.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"32173f9ad9f8079ed5edeb0a0f19a76388e3adc3f0c2fd5285bbed3ee8c8c82b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): newtests/lsp/completion/autoimports/test.js:199 \u00B7 newtests/lsp/completion/autoimports/test.js:244 \u00B7 newtests/lsp/completion/autoimports/test.js:377 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"086cac42581a8a0d47bae4c1e90fc0d56fa670ee121b982b6e869bfa16d3e6db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:137 \u00B7 packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:176 \u00B7 packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:237 \u00B7 packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js:335 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa7d6ff343869e7e43d124620e662250f4d51df404b61e15723186555c35998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/flow-eslint/src/scope-manager/scope/CatchScope.js:20 \u00B7 packages/flow-eslint/src/scope-manager/scope/ModuleScope.js:21 \u00B7 packages/flow-eslint/src/scope-manager/scope/WithScope.js:20 \u2014 the 3 copies are spread across 3 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/src/scope-manager/scope/CatchScope.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cdded80747a1823a88c16b656d36207f18e9ebb59ca565e451a59df9cb5dd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/scope/ScopeBase.js:333 \u00B7 packages/flow-eslint/src/scope-manager/scope/WithScope.js:30 \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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b579bf644f2b609a816bdd084725bb8e94cde0978c60905fe8bbdfc27c8f0fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js:95 \u00B7 packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js:111 \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":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"606183c50391ec9ba7ceca47e48e880162215130358a78ebabb7c098cb48d9cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/flow-remove-types/index.js:307 \u00B7 packages/flow-remove-types/index.js:318 \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":"packages/flow-remove-types/index.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f23d7304b39814b34a66718a81c4386e0970f1abd5f9564b05270220e940715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_016_underconstrained_instantiation/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_016_underconstrained_instantiation/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_016_underconstrained_instantiation/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"647d527db6b3d9002b4dd639b7c1eb1287f088b6d129d2f04552ae649fe5bd16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): newtests/lsp/completion/haste_package_auto_imports/test.js:36 \u00B7 newtests/lsp/completion/haste_package_auto_imports/test.js:53 \u00B7 newtests/lsp/completion/haste_package_auto_imports/test.js:70 \u00B7 newtests/lsp/completion/haste_package_auto_imports/test.js:87 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/haste_package_auto_imports/test.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b773aedc20af573c39fbc8527276f40365d7de3020896c5e7a19721244bf889"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:5775 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5789 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5775}}}],"partialFingerprints":{"codehealthFindingId/v1":"567ba810c7852a7314928a25126e26aabb10f80c73c62c5e4c411e9247eec06d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"49261f483c6063fc68ab105dcc33c17ed3661a8749c95ea3ea2a8a473a672cb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_012_writeonly_property/ideal/main.js:16 \u00B7 evals/evals/01_error_fixing/error_012_writeonly_property/input/main.js:16 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_012_writeonly_property/ideal/main.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1d2b7c411d3ecb99bac747b758dc63d382f8101c9238bc8dd7747a9dc8ffc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_018_generic_context_var/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/error_018_generic_context_var/input/main.js:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/01_error_fixing/error_018_generic_context_var/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"98894f937fbc2736a83beb162a11787808209b9e1c99fe35d1ea8ecb5508c018"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/01_error_fixing/error_021_class_into_object_type/ideal/main.js:20 \u00B7 evals/evals/01_error_fixing/error_021_class_into_object_type/input/main.js:20 \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":"evals/evals/01_error_fixing/error_021_class_into_object_type/ideal/main.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb24ff5ecafba4bc201fa425d9192aa02eab5497134259f896a7572df3464f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): evals/evals/02_unique_features/component_011_missing_return/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/component_011_missing_return/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"evals/evals/02_unique_features/component_011_missing_return/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"715529762f88e7c627d4030a5457ba9f5c16e2e074325e317b5c93c5c4d5a942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js:15 \u00B7 evals/evals/02_unique_features/hook_008_migrate_hook_type/ideal/main.js:14 \u00B7 evals/evals/02_unique_features/hook_008_migrate_hook_type/input/main.js:14 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6084e6711243b4ab64c2bbb44f8176c6207867f21e3c6fd69a31a8c0d486bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/02_unique_features/module_001_import_typeof_value/ideal/main.js:14 \u00B7 evals/evals/02_unique_features/module_001_import_typeof_value/input/main.js:13 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/module_001_import_typeof_value/ideal/main.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f47e791c450f804fe0b762e0f5edca21e93b9669a0406ca20510af7bbdbafb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js:46 \u00B7 evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/source.ts:37 \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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0019b5a7548c49178d966a206b4bed387314de6644eacb262b11dff9c78a3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/function_overloads_advanced/ideal/main.js:39 \u00B7 evals/evals/04_ts_to_flow/function_overloads_advanced/input/source.ts:35 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/function_overloads_advanced/ideal/main.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c82e04f3b6f9203f918f288c2deabc79915f4b4be9978fd6596c0c64f6a19af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): evals/evals/05_code_generation/modernize_019_exact/ideal/main.js:16 \u00B7 evals/evals/05_code_generation/modernize_019_exact/input/main.js:17 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/05_code_generation/modernize_019_exact/ideal/main.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fdd01a55f1a6d4a6c1b52c2cd3dfed1d97ba0ec5d86900f468d58ab59e5950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): newtests/lsp/edits/test.js:29 \u00B7 newtests/lsp/edits/test.js:51 \u00B7 newtests/lsp/edits/test.js:61 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/edits/test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"998313d5d48e0a87cb5491310d4083434f7b10d825a816a09edec75b7c603007"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/flow-bin/test.js:12 \u00B7 packages/flow-bin/test.js:21 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-bin/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac04789ec7c4de4769578fb06453dc65149767b58baf246845c40aef2bd5073"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/flow-dev-tools/flow-typed/node.js:5755 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5774 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5788 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ada78d42d4d2ff166be0dfe3f4cdb94bf0aada5b3d395ac43c0c722295d60fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/flow-dev-tools/flow-typed/node.js:5846 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5873 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5885 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5894 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5846}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99d930046642179ab1e95d02b13e62f3de49949716812dd0a5dc6b28844abd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/flow-dev-tools/flow-typed/node.js:5874 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5886 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5895 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1995c966de1d53da19edfca0d763490b1a50d6d0122ed49d936848ed2d2c0c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js:133 \u00B7 packages/flow-parser/oxidized-src/utils/Builders.js:56 \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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"972ba448640ced69ce026b44c682d930a5fd36d7b5478a8fbab6b53feac60a0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): evals/evals/01_error_fixing/lint_003_unused_promise/ideal/main.js:10 \u00B7 evals/evals/01_error_fixing/lint_003_unused_promise/input/main.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"evals/evals/01_error_fixing/lint_003_unused_promise/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f765edf6373214b7ba57b1df6a8f6a5daa475dd69a1d8a00e41b7635b26127"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): evals/evals/02_unique_features/match_013_ternary_migration/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/match_013_ternary_migration/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/match_013_ternary_migration/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4befd2558f742f850563dade61b7bc7f16440237153a65c42c3f64e9a3fb29d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): evals/evals/02_unique_features/match_030_await_statement_body/ideal/main.js:10 \u00B7 evals/evals/02_unique_features/match_030_await_statement_body/input/main.js:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/match_030_await_statement_body/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea130e627019452759c5b1794f988aa4711b03c176a6c878b784b003d23319f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js:44 \u00B7 evals/evals/04_ts_to_flow/exact_objects_complex/input/source.ts:57 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b102ddc1d7515c7b2076b0b01f6454072ac47e9d0f047ebe315bcde66f6347c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/type_predicates_refinement/ideal/main.js:24 \u00B7 evals/evals/04_ts_to_flow/type_predicates_refinement/input/source.ts:15 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/04_ts_to_flow/type_predicates_refinement/ideal/main.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"66964f2acb006f32415ee8947d6cd5e5374670dbf51e7c5c5100e099c1c89a9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js:19 \u00B7 evals/evals/04_ts_to_flow/utility_types_filter_collections/input/source.ts:17 \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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd8d1feaba9bfc7a9066a7b17711f21d7c9613719b6a11a5cd43316cd0c6591"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9 locations): lib/lib.es5.js:1905 \u00B7 lib/lib.es5.js:2187 \u00B7 lib/lib.es5.js:2469 \u00B7 lib/lib.es5.js:2751 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/lib.es5.js"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb3b67d5de3109f0f4d3fda1550c54af41538afaf0cf422513da4112352abc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): lib/misc.js:218 \u00B7 lib/misc.js:338 \u00B7 lib/misc.js:346 \u00B7 lib/misc.js:354 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"lib/misc.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"30efac26f32d9af9e0a34ffec34a1c722372a91cbf0fdd97beff6e611f08f2d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/flow-dev-tools/flow-typed/node.js:5190 \u00B7 packages/flow-dev-tools/flow-typed/node.js:5211 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":5190}}}],"partialFingerprints":{"codehealthFindingId/v1":"320655e169d61f91eb52e44e260f2fd7b6947ce30916e48585111e830f2df616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/flow-eslint/src/scope-manager/scope/FunctionScope.js:67 \u00B7 packages/flow-eslint/src/scope-manager/scope/HookScope.js:44 \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":"packages/flow-eslint/src/scope-manager/scope/FunctionScope.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b333ec266693716ee43ce58574e745c5933bcd1ee2007e298136a68ff0b53895"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/flow-transform/src/transform/comments/prettier/main/comments.js:309 \u00B7 packages/flow-transform/src/transform/comments/prettier/main/comments.js:332 \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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baaa0d6b87d5d235c787954f83432b9e0ba5e80bbe06315c46d0e659f538943"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): evals/evals/06_config_tooling/cfg_002_expected_error_suppression/ideal/main.js:3 \u00B7 evals/evals/06_config_tooling/cfg_002_expected_error_suppression/input/main.js:3 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/06_config_tooling/cfg_002_expected_error_suppression/ideal/main.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb8e87ade5e0a4c21a642cfcff73207e909bcfeee41aeba7b55489d54997d00"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/command/allCommands.js:14 imports packages/flow-dev-tools/src/new-test/new-testCommand.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/command/allCommands.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ac5f567dfa7d04fc47c13d651a7160a74dd6753973cf27e9377e24ec0d95b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/command/allCommands.js:17 imports packages/flow-dev-tools/src/test/testCommand.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/command/allCommands.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47f778e9477bbc2ef040b1f96433bb7b4afddd987bb23985fe475f402a35f9e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/record/recordRunner.js:16 imports packages/flow-dev-tools/src/test/builder.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19c0b0235e330ea19742db1bbc75a7c4c70843aa69b83922c45b511370b8044"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/record/recordRunner.js:17 imports packages/flow-dev-tools/src/test/findTests.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5ea5e1f0382adbf6db55b509d3cd775acf5b5cd67d682fd1ab6016dc7cead"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/record/recordRunner.js:19 imports packages/flow-dev-tools/src/test/findTests.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f2b1a7fb9c9c74ce1004b50bfab2e7fe3bf0ef6cdadf2ee9f8bb20460bed1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/flow-dev-tools/src/record/recordRunner.js:20 imports packages/flow-dev-tools/src/test/RunQueue.js, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce75f18b90fc5cd82fe5f68a1771c5b363931ed105c40d15431c9325e85736b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/flow-for-vscode/src/FlowLanguageClient/FlowLanguageClient.ts:26 imports vscode-languageclient/lib/common/utils/uuid, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-for-vscode/src/FlowLanguageClient/FlowLanguageClient.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cd4761a8a00560be6baf54a51215661f00bb3b582841caeaa07310011dbe96"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageFeature.ts:11 imports vscode-languageclient/lib/common/utils/uuid, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageFeature.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf3f845fae156a22af1f1a5a4117750b0491838ada5998ac3b1b202f323837c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 1153, cognitive 1152): (top-level) has cyclomatic complexity 1153 and cognitive complexity 1152; 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":"tests/type_printer/types.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"29493273962e692bea0fa2d9dee1c9d93aae982eb70c1c0feee79f58e04ee7ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 259, cognitive 450): (anonymous) has cyclomatic complexity 259 and cognitive complexity 450; 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":"tests/refinements/invalidation.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"414f2c6fff89e41c11757221cb42b448a8dcfb9dfebe4a105d5bb56ae576ab8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSpecialObjectCompare (cyclomatic 107, cognitive 143): handleSpecialObjectCompare has cyclomatic complexity 107 and cognitive complexity 143; 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":"packages/flow-parser/test/esprima_test_runner.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"58abb3b80554087058051d32d94b098ab153c660a9cd97d699aede80f93f098d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 95, cognitive 94): (top-level) has cyclomatic complexity 95 and cognitive complexity 94; 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":"tests/disjoint_union_perf/jsAst.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c41bba2811d6d754e92d19ae79c74219060bff91f967306dda301c9a8b2a10a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GenericTypeAnnotation (cyclomatic 81, cognitive 37): GenericTypeAnnotation has cyclomatic complexity 81 and cognitive complexity 37; 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed1d959745c1198bfe372278107ab8b1c22c43ca494064ef6a6323ab260767"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 77, cognitive 76): (top-level) has cyclomatic complexity 77 and cognitive complexity 76; 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":"tests/enums/refinement.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"106e229b95b19aa385297d0f71bb15b1f9e133b436a664be53e681dc22ee05e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 71, cognitive 105): (anonymous) has cyclomatic complexity 71 and cognitive complexity 105; 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":"tests/refinements/invalidation.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2972ccef436b0fd20d0c99b1118926eb5d7117e6580048a77e84a60e85fa53c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 66, cognitive 101): (anonymous) has cyclomatic complexity 66 and cognitive complexity 101; 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":"tests/refinements/invalidation.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a138d8870e1811603debb8a10f6dd8ae9cd6f46a7f2d5b27afdda515f67dcc8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 56, cognitive 31): (top-level) has cyclomatic complexity 56 and cognitive complexity 31; 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":"tests/switch_case_typing/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a461c1080d80c0e6cc7b28bc2067a735cabdcd3ffa5deb926a8757f610c82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 48, cognitive 45): (top-level) has cyclomatic complexity 48 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 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":"tests/sketchy_null_default/test.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"782e78ec6f3f64303fa0be694b6c798092abb6989d3670b6b0942a075fc13e44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transform (cyclomatic 47, cognitive 23): transform has cyclomatic complexity 47 and cognitive complexity 23; 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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda998b860481a6ebfb8559becc42bb09e80428c6b40c80b03c133e27c137d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eliminateAbstractComponent (cyclomatic 43, cognitive 22): eliminateAbstractComponent has cyclomatic complexity 43 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 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":"packages/flow-upgrade/src/codemods/eliminateAbstractComponent.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7427fddc4a3b994eae84e0296ba07942ef8164e539d1155ab5b3bacafc66cc4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTest (cyclomatic 35, cognitive 55): runTest has cyclomatic complexity 35 and cognitive complexity 55; 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":"packages/flow-parser/test/esprima_test_runner.js"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e116466cca9d63bcaa698d6b1eeebd15f0f741ea3ceb0d734193c47c99face"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertClassMember (cyclomatic 32, cognitive 26): convertClassMember has cyclomatic complexity 32 and cognitive complexity 26; 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f96d58424357bc407061f4200b43fe5baf57a83a0f525dc5652b4fe853f34d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 31, cognitive 38): (top-level) has cyclomatic complexity 31 and cognitive complexity 38; 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":"tests/constant_condition/unary_not.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed320124d193cd3caf3bada076f47cbfb6e1362cc094bd49aa5bea8fa1680459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 31, cognitive 30): (top-level) has cyclomatic complexity 31 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 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":"src/parser/test/flow/expression/conditional/deeply_nested_parenthesized_consequents.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcca1465873a2f2ced752583aacce2a56b9fb5431e8db57b43dd8cf9a73a0a0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attach (cyclomatic 30, cognitive 53): attach has cyclomatic complexity 30 and cognitive complexity 53; 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5e8a183e607748ecf5908eb9a827a0d0006e64ad6b4537f9d2a191cd14807"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 30, cognitive 50): compare 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":"packages/flow-parser/test/esprima_test_runner.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d04205e0500098d7d16971bb9582efc4c0584954bff7aee2996070f4b929b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DeclareExportDeclaration (cyclomatic 30, cognitive 40): DeclareExportDeclaration has cyclomatic complexity 30 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18ff0d1c3104e8d198bf815fd5bcb04f44e224d78fc03d30b3f7b5a335750f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 30, cognitive 36): parse has cyclomatic complexity 30 and cognitive complexity 36; 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1dcb7ca38af067faf6572d9904bfcafe709f82c2d0ea80e77c75472e15898"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function f (cyclomatic 28, cognitive 31): f has cyclomatic complexity 28 and cognitive complexity 31; 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":"tests/new_generics/maybe.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb030d6b66f6ee981a14ad9f2d7be08969e18177a7444a417b956c13d1c1336b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTestSuite (cyclomatic 27, cognitive 62): runTestSuite has cyclomatic complexity 27 and cognitive complexity 62; 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":"packages/flow-dev-tools/src/test/runTestSuite.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f49557bc3b060f0fb0ce86d5274cb728c4d26205e41ec1df5ef235b4c4e5c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 26, cognitive 61): compare has cyclomatic complexity 26 and cognitive complexity 61; 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":"packages/flow-parser/__tests__/runWasmFixtures.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b92513e086872d7f27532fec34d551adb6399d6cd4682bcd8b4b0dd0052755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ObjectTypeAnnotation (cyclomatic 25, cognitive 47): ObjectTypeAnnotation has cyclomatic complexity 25 and cognitive complexity 47; 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2f44e99fa5755d0fc623002de611064035a1bee2c74ca2fb8d90aa08b3a49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOnce (cyclomatic 24, cognitive 69): runOnce has cyclomatic complexity 24 and cognitive complexity 69; 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":"packages/flow-dev-tools/src/test/testRunner.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab45f85130f73ce8dd1521f054adee9354d05c825213f8264ba5ec164c93fc60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 24, cognitive 59): compare has cyclomatic complexity 24 and cognitive complexity 59; 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":"packages/flow-parser/test/hardcoded_test_runner.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bc0abb25c02fd49a69bc154ab7e00b7a9de088989a35351914621e805d4556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectSourceType (cyclomatic 24, cognitive 30): detectSourceType has cyclomatic complexity 24 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b569e6c515f249b2f783efab331f181389878912a8bac86a242aa2dd83cdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _async_scope (cyclomatic 24, cognitive 23): _async_scope has cyclomatic complexity 24 and cognitive complexity 23; 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":"tests/constant_condition/err1/promise.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a077ebf500032fd11ac0322ffa90206c868d5ce3df4ba8c86d35e048af2db30c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRendered (cyclomatic 23, cognitive 14): validateRendered has cyclomatic complexity 23 and cognitive complexity 14; 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":"packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f32419edd44bca9dd8138add7189919a611fee39de54af19473db38c5f36f24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDiff (cyclomatic 22, cognitive 56): getDiff has cyclomatic complexity 22 and cognitive complexity 56; 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":"packages/flow-dev-tools/src/test/assertions/simpleDiffAssertion.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f40fd7f16c2d7e4ef80e43c38541d572a357fc97069775465478f6671a704"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function logical (cyclomatic 22, cognitive 19): logical has cyclomatic complexity 22 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 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":"tests/unused_promise/test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c473302e19e1b10440ab52e458b1523b54449ecd704dfe0690b8e1f2cbd81dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 18): main has cyclomatic complexity 22 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 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":"src/__tests__/flow_dot_js_smoke_test.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0932c35db0c2ccae7745cf207ee04a7ccc675ac49b8cdd7737771e62c03766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 21, cognitive 31): (top-level) has cyclomatic complexity 21 and cognitive complexity 31; 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":"tests/optional_chaining/refinements2.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94cf7a820fa4868cbd0f68379c77e79286123330a6b2cea0c448672ffab7726"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleClassComments (cyclomatic 21, cognitive 27): handleClassComments has cyclomatic complexity 21 and cognitive complexity 27; 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd245edcf890bf43244c9c8f737bb9cfa463cd77f809a2d2369fed46ae40453e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 21, cognitive 20): (top-level) has cyclomatic complexity 21 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 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":"tests/constant_condition/string_literal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1103343871af42323f6857656836c038925095f084175ccb128db8190290a8f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertExport (cyclomatic 21, cognitive 14): convertExport has cyclomatic complexity 21 and cognitive complexity 14; 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d7f28a61790b39afb169d6b7f0a12531cbad6a1b7d9be64b136443e650570b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DeclareClass (cyclomatic 20, cognitive 22): DeclareClass has cyclomatic complexity 20 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"078214e5b002da0b6da8b91d14096f7f2b5d46971ab30859c2ce433fc5c7571f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertExportDeclaration (cyclomatic 20, cognitive 22): convertExportDeclaration has cyclomatic complexity 20 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea76677c5e9b2d75f410b29d81f238cb844f71056010a278c05652cb9c58353a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VariableDeclarator (cyclomatic 20, cognitive 22): VariableDeclarator has cyclomatic complexity 20 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":"packages/flow-upgrade/src/codemods/collapseObjectInitialization.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"945d1d222ff723b8d1af8cc41f13fd597542dea2ce01b5fcf67556103f32a190"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzePattern (cyclomatic 20, cognitive 16): analyzePattern has cyclomatic complexity 20 and cognitive complexity 16; 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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5359d4aabf3ce658084d3e4bf77a803ccccbfa65d72028d553a42cce69960c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 11): (anonymous) has cyclomatic complexity 20 and cognitive complexity 11; 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":"packages/flow-transform/__tests__/test_codemods/thisInExportedFunction-test.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48fd0b5f59b594565d7d15dee2faf09275bcef16da2a5c13f4e68ec22972303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EnumImpl (cyclomatic 19, cognitive 22): EnumImpl has cyclomatic complexity 19 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3fb7f7358535dd9312d55d8443b4cd5d11e8e9be2afb924698a1674c6b5d3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 19, cognitive 18): (top-level) has cyclomatic complexity 19 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 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":"src/parser/test/flow/types/conditional_types/passing.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9391dae08ac892dc0f4c340d6810e744e6b14334355668d34ae64a27d6069a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CallExpression (cyclomatic 18, cognitive 16): CallExpression has cyclomatic complexity 18 and cognitive complexity 16; 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":"packages/flow-transform/__tests__/test_codemods/bindThisToArrow-test.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2534f625d5cab749944c90a2cf73e504e98ba74da3d82228bf970e5b67f3cc07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLastFunctionArgComments (cyclomatic 18, cognitive 10): handleLastFunctionArgComments has cyclomatic complexity 18 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ae722ecc9c6610368cfe7a55209b343d4d16935556218bc18347b44ca1c646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runner (cyclomatic 17, cognitive 71): runner has cyclomatic complexity 17 and cognitive complexity 71; 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":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"427cb2b65fa5b65c736a6aeb75a95bfc7a869eca78293b4ee88429b56acc9f97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 17, cognitive 20): render has cyclomatic complexity 17 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":"packages/flow-for-vscode/src/FlowLanguageClient/StatusBarWidget.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"606effd9086263f64b38df585429a28db535bd2edeb6bbbc3b67a488cef689d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowToRunnableJSWithSourceMap (cyclomatic 17, cognitive 17): flowToRunnableJSWithSourceMap has cyclomatic complexity 17 and cognitive complexity 17; 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":"packages/flow-remove-types/runnable-wasm.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8281901887a937de1da156d9d0b046ea6753f18e8d8dcdda53ade75ff380d1cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 16): (top-level) has cyclomatic complexity 17 and cognitive complexity 16; 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":"tests/render_types/renders_maybe.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5db1584fa418325bc374020e71de7c0bcb2e7a5754dd46764b3b20fe9b81a49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 16): (top-level) has cyclomatic complexity 17 and cognitive complexity 16; 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":"tests/ts_constructor_object_instanceof/consumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74c1971a6f6a0d6ff4dfafdaa6091dad3afa3e2e4a3bfd937e47b563d450c25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 16): (top-level) has cyclomatic complexity 17 and cognitive complexity 16; 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":"tests/type_guards/tuple_refinement.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61402863d7f00871d5e880c15481aac31c1bda202bbd8d44c1ccb6996c890fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 16): (top-level) has cyclomatic complexity 17 and cognitive complexity 16; 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":"tests/unknown_props_in_conditionals/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d99b11e68a5ed245f7029d45bb35da6c735d08e4152fefc1f137c150f2a391b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 16, cognitive 29): (top-level) has cyclomatic complexity 16 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":"tests/in/refinement.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011f6ecb6e6a3ac4f959a769678cc672d5a729cf0a31497aa887c2342c7bfba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 16, cognitive 26): (top-level) has cyclomatic complexity 16 and cognitive complexity 26; 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":"tests/refinements/ident.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff66fef0ef5b8b2e75218ef7b830d0b54eebbe54c2e50858d2cdfff6035c639d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flowRemoveTypes (cyclomatic 16, cognitive 19): flowRemoveTypes has cyclomatic complexity 16 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":"packages/flow-remove-types/index.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8655c475cc5062f21832bdf8e264688b2d6b98dedfecb795634d6a47ffde58b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTests (cyclomatic 16, cognitive 18): getTests has cyclomatic complexity 16 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":"packages/flow-parser/__tests__/runWasmFixtures.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d295c12b3bfae083f5297cc962296b88a0c3d3d3ef9c296f09950f6281e0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skipNewline (cyclomatic 16, cognitive 16): skipNewline has cyclomatic complexity 16 and cognitive complexity 16; 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":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"38733f0adbedd5f32fb1463c5dc1ce361ca430ddd62da026593c092845b1114f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOptions (cyclomatic 16, cognitive 14): getOptions has cyclomatic complexity 16 and cognitive complexity 14; 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":"packages/flow-parser/oxidized-src/index.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4216b61ba657432791b09f004a4b46eb8f85f4d9e2a1c4d0be2316b1af707bcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeNodeForDebugging (cyclomatic 16, cognitive 13): describeNodeForDebugging has cyclomatic complexity 16 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 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":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf25e32f7b5bcb5c6bd4fe89d741c3263ed5f2863f8a1ce311e16ff7a2746c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImportDeclaration (cyclomatic 15, cognitive 27): ImportDeclaration has cyclomatic complexity 15 and cognitive complexity 27; 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":"packages/flow-remove-types/index.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"339a11bf2b056bc0ccbdd19351c9967556561f35662041507f3eadef0703efeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 15, cognitive 26): report has cyclomatic complexity 15 and cognitive complexity 26; 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":"packages/eslint-plugin-fb-flow/rules/use-indexed-access-type.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2616cb352a04f20497c0a64a23884fc57712a348025f298a8b6cbc843b320a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 15, cognitive 21): enter has cyclomatic complexity 15 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":"packages/flow-parser/__test_utils__/parse.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6dfbc594fc339ec615d25423091a3a20a9d1a2412b466e5472a9ae62867504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getSortedChildNodes (cyclomatic 15, cognitive 20): getSortedChildNodes 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df5e39a11a691fdc55eb9dab4cabe4fcd04921f56213e455213a98b11f8604f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDefaultExportDocPlacement (cyclomatic 15, cognitive 19): applyDefaultExportDocPlacement has cyclomatic complexity 15 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"344536762b90b02c290ebd14bc46d32e6f048b25d0401a4cf6126c1f0b22ff02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transform (cyclomatic 15, cognitive 19): transform has cyclomatic complexity 15 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":"packages/flow-parser/oxidized-src/utils/mutateESTreeASTForPrettier.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afbb1d6ff6b4b8408868cf04ebeba3c11ec8c324d7c04c06f96322608688dcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTest (cyclomatic 15, cognitive 17): runTest has cyclomatic complexity 15 and cognitive complexity 17; 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":"packages/flow-parser/test/hardcoded_test_runner.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c184d34a495498b76a8e3fa1e3750759334acdd2e063382c55465de3c7cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get_tests (cyclomatic 15, cognitive 16): get_tests has cyclomatic complexity 15 and cognitive complexity 16; 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":"packages/flow-parser/test/run_tests.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"431c12c0acd3a3ff22c4b2981cc77484d2eca509a79b414f5a6256cf85238872"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 15, cognitive 14): (top-level) has cyclomatic complexity 15 and cognitive complexity 14; 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":"tests/react_rules/exception_for_init.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50d2fab4a2e5105f6d260a2727bd79e79d3625d5edaa3b4d3b246e87f37334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleOnlyComments (cyclomatic 15, cognitive 12): handleOnlyComments has cyclomatic complexity 15 and cognitive complexity 12; 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bf5086bc617d57537dfb3530362140fafd7d909dc9b2aa529dc3f07fc801b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 9): (anonymous) has cyclomatic complexity 15 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":"packages/eslint-plugin-fb-flow/rules/use-flow-enums.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d3305a89ed08e894fe8e06c3e74126bac1ea2c80825a71758e8a25d251b872"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDuplicates (cyclomatic 14, cognitive 30): findDuplicates has cyclomatic complexity 14 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":"packages/flow-upgrade/src/codemods/removeDuplicateClassProperties.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67029a0fe948882bd8449e15ecf00e4a2691f4fc3f9229e4bb3a42c79d4d07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDeclarationByName (cyclomatic 14, cognitive 20): findDeclarationByName has cyclomatic complexity 14 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043cb898494ff4d51139a3e3ecb0909a5bd0b636ffdcae98209f4156860d6c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitFunction (cyclomatic 14, cognitive 19): visitFunction has cyclomatic complexity 14 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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b33e071e4b10577d160c0e0fc20b35624b930534d5e37d5f96d149ba220cee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertRequireToImport (cyclomatic 14, cognitive 15): convertRequireToImport has cyclomatic complexity 14 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f12c9bd465a2897cba3434988f8287c9ac67a2a78eea6e47339db7a81e3ef43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getTransformContext (cyclomatic 14, cognitive 13): getTransformContext has cyclomatic complexity 14 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 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":"packages/flow-transform/src/transform/TransformContext.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5894728326e22e872539976a5742e77a565c7768450673f4331bba4a131d75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 13): (top-level) has cyclomatic complexity 14 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 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":"tests/exact_empty_objects/defaulting.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ebcc593059790f9420c52331a8fcb9464770441008b9db12b536eecfb1ac88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 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 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":"tests/refinements/tagged_union.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4035b94e01b75e0e387dada95bb7524b4707a0b197eb4c37467d2849243e56ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 25): visit has cyclomatic complexity 13 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":"packages/flow-remove-types/index.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0e28b588ebc975501f2bf0138437abf376af986446abfc5f954b046f2d4db5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 13, cognitive 23): parse has cyclomatic complexity 13 and cognitive complexity 23; 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":"packages/flow-dev-tools/src/command/Base.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5038cc67049a288df97ee81121721d3463aac764b58806aaa6fcb8cfe27d0de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ClassDeclaration, ClassExpression (cyclomatic 13, cognitive 20): ClassDeclaration, ClassExpression has cyclomatic complexity 13 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":"packages/flow-upgrade/src/codemods/removeDuplicateClassProperties.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f245e4b4eaa4fd1cddc77d837e0dc9d53af023cf9b1fb8e18738f0321a18ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f9b278a8c7fdcc93cdd1edb8a19b09e3c7b2d1cdda8273074d0cec9939ef18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 14): (top-level) has cyclomatic complexity 13 and cognitive complexity 14; 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":"tests/refinements/member.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec3f2b3e6e753d15493ff7df4e163e9c14e2561e4a077c1d447c6de6b181f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unused_refinement_optional_chaining_test (cyclomatic 13, cognitive 12): unused_refinement_optional_chaining_test has cyclomatic complexity 13 and cognitive complexity 12; 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":"tests/literal_subtype_checking/test.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cc8eaf51a2d61ecd85a4e97dbb8eaac557612b2e6cfc48fecb6d911c4cae11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bool_literal_subtyping_check (cyclomatic 13, cognitive 12): bool_literal_subtyping_check has cyclomatic complexity 13 and cognitive complexity 12; 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":"tests/literal_subtype_checking/test.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"130fc597a7150a4773e10aed03e49fa377f5970f21a61834be67f16bdd77697f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foo (cyclomatic 13, cognitive 12): foo has cyclomatic complexity 13 and cognitive complexity 12; 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":"tests/nullish_coalescing/nullish_coalescing.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d43603c1b85d91768cd33958b4ac95a68bef7229ee8226b3f90615882185bc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 12): (top-level) has cyclomatic complexity 13 and cognitive complexity 12; 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":"tests/number_lib/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9ea4a96b460a2c53283eb72574ee23c226104d2966dc9a0a2906f26502c6b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 12): (top-level) has cyclomatic complexity 13 and cognitive complexity 12; 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":"tests/ts_syntax_allowed/optional_unlabeled_tuple.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06e86dcde54f2240199c63a527bbf2c26cf1588c5adfe72c0cc8423adc941cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPossibleTypes (cyclomatic 13, cognitive 9): getPossibleTypes has cyclomatic complexity 13 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":"packages/flow-transform/src/traverse/NodeEventGenerator.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dba2c00652b6450efd74f161e763aa3cfe484816b803550bda022b8dde2c19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 12, cognitive 32): start has cyclomatic complexity 12 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":"packages/flow-dev-tools/src/test/RunQueue.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3875c7d8c2eda5d6bd0153a2267b9f0050efd3ce17e2c29be8b97f6b820869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply_filters (cyclomatic 12, cognitive 24): apply_filters has cyclomatic complexity 12 and cognitive complexity 24; 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":"packages/flow-parser/test/run_tests.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e4afd3038014cb31b39e5d1636fb62f2330f1469e82525e9b93df0d74d01ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitChildren (cyclomatic 12, cognitive 20): visitChildren has cyclomatic complexity 12 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":"packages/flow-eslint/src/scope-manager/referencer/VisitorBase.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d796601d37692a7c0fd9fecaeab26cf2f768cf0b4889be1106c670e72a9abaac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dfsForRange (cyclomatic 12, cognitive 19): dfsForRange has cyclomatic complexity 12 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":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3cfaefa6fa32a72720a862e807b35f5ac07b7fd2f5e8430fff4337cacdf20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test5 (cyclomatic 12, cognitive 18): test5 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":"tests/type_guards/this.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf2650ad2be98553110e63a3011ac7ae1536468f0d1378a9c7e42f4441b2133"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decorateComment (cyclomatic 12, cognitive 16): decorateComment has cyclomatic complexity 12 and cognitive complexity 16; 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c02e35d118cf1a713cced95978041067b1dee6ec1b73d50a4b974d29085356"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStrictScope (cyclomatic 12, cognitive 13): isStrictScope has cyclomatic complexity 12 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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d271b420e975eb92868d1c80b68d2797e7f6c56abb66ae5ef1862a9fbfbeb65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 12, cognitive 12): (top-level) has cyclomatic complexity 12 and cognitive complexity 12; 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":"tests/enums/equality.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03ac705b03ca589579d21ceb71a8c7757ddd0a311c7634f032677d8b796a7d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 12, cognitive 11): (top-level) has cyclomatic complexity 12 and cognitive complexity 11; 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":"src/parser/__tests__/flow_parser_js_smoke_test.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5ec69a889d8ab9a89c17332a753a306f0333c41384ad3d26740a0e9e3c1591"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 12, cognitive 11): (top-level) has cyclomatic complexity 12 and cognitive complexity 11; 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":"tests/react/component_props.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"266a57ebe956cd44610e21be5cf8e6aa484c2581f6cc096cf6d2b5b40dbd566b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function :matches(ExportNamedDeclaration, ExportDefaultDeclaration) \u003E FunctionDeclaration MemberExpression (cyclomatic 12, cognitive 9): :matches(ExportNamedDeclaration, ExportDefaultDeclaration) \u003E FunctionDeclaration MemberExpression 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":"packages/flow-transform/__tests__/test_codemods/thisInExportedFunction-test.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46fddad54ee1b28854df5c50e58ae41528d1c808d017e92659c8f0f08e2dd06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyHttpStatus (cyclomatic 11, cognitive 20): classifyHttpStatus has cyclomatic complexity 11 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":"evals/evals/02_unique_features/match_004_guards_and_or/ideal/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a96cfbe7a3c8a472538a6b116fa9847a7ac0cfa1a516d5a83ddc8c07970116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeNode (cyclomatic 11, cognitive 18): removeNode 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":"packages/flow-remove-types/index.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc994d3cf321119470528e69755320306cd1e63b65b5d810e43ebaddf7496995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function test1 (cyclomatic 11, cognitive 16): test1 has cyclomatic complexity 11 and cognitive complexity 16; 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":"tests/type_guards/this.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b624bb5a540eb5ed3df981ef212790c8b79ed854a1057e014f170ebf81a9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function breakTies (cyclomatic 11, cognitive 15): breakTies 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":"packages/flow-transform/src/transform/comments/prettier/main/comments.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a05149b1b9e8c78568ccab24a8fbb87d0ff03a525ad225f5aef55af5558dfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convertSuperClass (cyclomatic 11, cognitive 14): convertSuperClass has cyclomatic complexity 11 and cognitive complexity 14; 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0a652755ce6271cc9c3cb212d24b5e133d33563ccad32cb63e4fbbba33fc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; 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":"packages/flow-transform/src/transform/comments/prettier/common/util.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2088e2e176dabe5e897748861c247772d6cae4bd5ac418d912c3124542c5ec3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b754a495a9696fc36b29b38b08c66c4d6068cd24254fea62d0b66f95988abfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWindowsDriveLetter (cyclomatic 11, cognitive 11): getWindowsDriveLetter has cyclomatic complexity 11 and cognitive complexity 11; 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":"packages/flow-for-vscode/src/utils/uriToString.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d397dadebd711efa6c94f82b28524a352ca999de3ef8d19cdb8eb27ab6fa354a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapComponentParameters (cyclomatic 11, cognitive 11): mapComponentParameters has cyclomatic complexity 11 and cognitive complexity 11; 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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f4be779a0e9887c0cd7b6ae6b60668bf4e74fe4fccdc61506dd9bc3de1428"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendCommentToSource (cyclomatic 11, cognitive 11): appendCommentToSource has cyclomatic complexity 11 and cognitive complexity 11; 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":"packages/flow-transform/src/transform/comments/comments.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d322fc60c5ad88a0a7af6f24a09251f62af48544abd2ef76d59cfe1be64f3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleIfStatementComments (cyclomatic 11, cognitive 11): handleIfStatementComments has cyclomatic complexity 11 and cognitive complexity 11; 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0033ac1ea7a1c700840ea6954787e1341495acfa7420fe8f842c6810272764"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"packages/flow-dev-tools/src/test/testCommand.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49269b7802c96083708d8748634f5563eb4fa9f755b83af712a6323128263a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"tests/constant_condition/boolean_literals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"921918a5ef90ef31c244eaffee1cf9a17b637de7c83b2f455c65a836714780f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"tests/implicit_instantiation_walk_regressions/best_effort_hint_flow_fails.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3408e92e1a5da06792b35d8a4206dd0163012142cf36791bcc7ad3d97b707f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"tests/nullable/error.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c10ba40ce22e127222023004f6eecd53aa513f3b5c4a3187adade0abfc68c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 10): (top-level) 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":"tests/refinements/object_union_number_keys.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa14647253a56d36a5d67860a72a99f95eff4de851189c62a3518167c870b5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCommentInEmptyParens (cyclomatic 11, cognitive 9): handleCommentInEmptyParens has cyclomatic complexity 11 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"53819b68d6726208e4dd96fc2907fab087ca79a95023037039482494c25a21b3"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/completion/test.js: 10576 lines of code: newtests/lsp/completion/test.js has 10576 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":"newtests/lsp/completion/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4647e7bbb660c23391bb11e93e1b2fdf32121467f2ca5671ee302bac38230"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-dev-tools/flow-typed/node.js: 5655 lines of code: packages/flow-dev-tools/flow-typed/node.js has 5655 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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85583e07528abaee388a35fe140d33ded75d407bf174b414ffb0488d03d377bd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-api-translator/src/flowDefToTSDef.js: 4645 lines of code: packages/flow-api-translator/src/flowDefToTSDef.js has 4645 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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2538696f4969e5a5609e092103e393f87ad8a8e0e8c1946a01d5e6b75d280b5a"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/lib.es5.js: 4010 lines of code: lib/lib.es5.js has 4010 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":"lib/lib.es5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf10152ffe17e472fe79428aa037d1ee873d092014e42e162cb602f9e71e9d47"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/documentSymbol/test.js: 3629 lines of code: newtests/lsp/documentSymbol/test.js has 3629 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":"newtests/lsp/documentSymbol/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5756eb449eaedd7068331ecdbe9196ef1fb8117a98598fe09434f534d4e3a899"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/signatureHelp/test.js: 3577 lines of code: newtests/lsp/signatureHelp/test.js has 3577 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":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad980363d802bb1ff95af25977d9b57e9cb0cfaba80448ff0f3ea729af76d02f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-estree/src/types.js: 2158 lines of code: packages/flow-estree/src/types.js has 2158 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":"packages/flow-estree/src/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d96897c1f4b3500f6bb641c27ea2be6922fd3a0f41c7c6e4ad3189a17166dc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-api-translator/src/flowToFlowDef.js: 2063 lines of code: packages/flow-api-translator/src/flowToFlowDef.js has 2063 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":"packages/flow-api-translator/src/flowToFlowDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2bc5e06bdbacf6faf65ed02bd7c1c16c35ba5d8426018f9a0c1e1837f7947d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-api-translator/src/TSDefToFlowDef.js: 1995 lines of code: packages/flow-api-translator/src/TSDefToFlowDef.js has 1995 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":"packages/flow-api-translator/src/TSDefToFlowDef.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a4835c33583e82c947f710f4120586aec4e9b0d4155d7270bbc02bf5852d49"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/selectionRange/test.js: 1957 lines of code: newtests/lsp/selectionRange/test.js has 1957 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":"newtests/lsp/selectionRange/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ff1e79556f20fc3e223379975273d47503ffe759e4f02447ae8919d6c8f523"}},{"ruleId":"R3","level":"warning","message":{"text":"evals/flow-typed/environment/jsx.js: 1929 lines of code: evals/flow-typed/environment/jsx.js has 1929 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":"evals/flow-typed/environment/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d04eb76d5d146cfb326e20a9ed05bb0b6f0352b0f2f75af72abf0c10d61ed3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js: 1196 lines of code: packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js has 1196 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":"packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"477fbf0667c4d609b482ee0bb00b2ff4bb8f0982f200e6c980aa6899644b823c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js: 972 lines of code: packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js has 972 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":"packages/flow-parser/oxidized-src/estree/TransformMatchSyntax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b02b51fd5cb242eef4b70353eadb4f2e7fa60d90e9409f2cab8951aa1b5485"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js: 934 lines of code: packages/flow-eslint/src/scope-manager/referencer/Referencer.js has 934 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":"packages/flow-eslint/src/scope-manager/referencer/Referencer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bb13b27687abd00ca1880e14a34c97f5fc26b33a04cf4e5dacc33aa41eaf1b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js: 903 lines of code: packages/flow-transform/src/transform/comments/prettier/language-js/comments.js has 903 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":"packages/flow-transform/src/transform/comments/prettier/language-js/comments.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2128981fa553f3796d348e1207f7fab6e579c7e258f9a8ee2c3c4b385a954025"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js: 828 lines of code: packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js has 828 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":"packages/flow-parser/oxidized-src/estree/TransformComponentSyntax.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96acfaba68112035aa4cb05d809bda3c9514044bdbbc9506d0209e1ed24b3dd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-typed/prettier.js: 813 lines of code: packages/flow-typed/prettier.js has 813 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":"packages/flow-typed/prettier.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1c1be92edcc3bda6438cc3eec3a4f4a4e7d48c6bff7fba52ec622bbeb65fa9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js: 804 lines of code: packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js has 804 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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5b9b72ca17a49c5b2f3d6db44fa09b59b686b7ba44a57c4673b0dd5036bb98"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js: 797 lines of code: newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js has 797 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":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d156ea32cf006ad927905066080263ea92b365e4466ce65782368910f640711"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-remove-types/index.js: 782 lines of code: packages/flow-remove-types/index.js has 782 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":"packages/flow-remove-types/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b19da1c0fd085d09803542dee0d097b387fae746e818d7b9894537bf413c2e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js: 765 lines of code: packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js has 765 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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dcf59b88231fe517726d57def554eb0c4540701fea58f5087c48576531943f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-typed/jest.js: 751 lines of code: packages/flow-typed/jest.js has 751 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":"packages/flow-typed/jest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20711bcd1db1128b6e570e0b1b25483b6dd624c6abd4f9467fa607a614175cb6"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/code-action/quickfix/react/test.js: 685 lines of code: newtests/lsp/code-action/quickfix/react/test.js has 685 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":"newtests/lsp/code-action/quickfix/react/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e66f37705f0766ae603634e9e12fb600acb98225465eab625e6c282988c94"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/diagnostics/test.js: 617 lines of code: newtests/lsp/diagnostics/test.js has 617 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":"newtests/lsp/diagnostics/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f40fbc9b4bb1b5df653849411d67c56c801fc2b7865f4783ceacec6535a401"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/code-action/quickfix/match/test.js: 601 lines of code: newtests/lsp/code-action/quickfix/match/test.js has 601 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":"newtests/lsp/code-action/quickfix/match/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c1e3319e88d140930187d5d42a9e1eeae002b8050f5aafea2c010798bd4c1c"}},{"ruleId":"R3","level":"warning","message":{"text":"newtests/lsp/code-action/refactor/test.js: 587 lines of code: newtests/lsp/code-action/refactor/test.js has 587 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":"newtests/lsp/code-action/refactor/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472c4da7d3e032d8bd23b283849dc92eb24518cba49ac31fcc235bce0697e2aa"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flow_dot_js_wasm.js: 527 lines of code: src/flow_dot_js_wasm.js has 527 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":"src/flow_dot_js_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913306c98601e55f869c6a739a88ae4d1dcf41a4198c1f67c36433dbe47b9073"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-transform/src/transform/TransformContext.js: 521 lines of code: packages/flow-transform/src/transform/TransformContext.js has 521 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":"packages/flow-transform/src/transform/TransformContext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9c49a1542ae8459cfa75e76cce937fae61f8ae3f0da84accc6b8903f7a4b60"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts: 461 lines of code: packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts has 461 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":"packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee52a2db45b02cdfeddf7e41ba878efa86c997886ccb4f4f3e9d24eca4ee42"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-parser/oxidized-src/FlowParserDeserializer.js: 451 lines of code: packages/flow-parser/oxidized-src/FlowParserDeserializer.js has 451 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":"packages/flow-parser/oxidized-src/FlowParserDeserializer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a00b2dca7b73bdb6048461ff03e32d05092a4ac0ad37cb3f7870f7613b7283"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js: 436 lines of code: packages/flow-eslint/src/scope-manager/scope/ScopeBase.js has 436 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":"packages/flow-eslint/src/scope-manager/scope/ScopeBase.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b411c06ed04bb68a4ca164b1ab26608cb21f5b78641851e0eff360a5d008e747"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-parser/oxidized-src/FlowParser.js: 423 lines of code: packages/flow-parser/oxidized-src/FlowParser.js has 423 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":"packages/flow-parser/oxidized-src/FlowParser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecf17f3429cd023ef02691a0fa5f53a2dda3e2100834c45a09fbc2be179b354"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js: 422 lines of code: packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js has 422 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":"packages/flow-eslint/src/scope-manager/referencer/TypeVisitor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a06b5a7448225aea0249a1c657963022056750804e0256aa4fce8b237a8a0"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/export/module-exports/typeof/import/spec.js:11 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/export/module-exports/typeof/import/spec.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3575a1ebe2a6964d42b7052a0aaaf2661d55198c57f29cd491195370fa7a2d9"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/flow-remove-types/test/test-node-module.js:4 imports \u0027./missing-type-only-module\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/test-node-module.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdeeacdea16ef5a3c00309ac094f2a2109fa2240b55bc49228a72f6b4c6f7b6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/import_unsupported_phase/contextual_default_and_named.js:1 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/import_unsupported_phase/contextual_default_and_named.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e6b8db7d58f2fabfde4e0171a798d253e2f8c7eb40905ad2b0422ae6d77054"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/import_unsupported_phase/contextual_default_binding.js:1 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/import_unsupported_phase/contextual_default_binding.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daaf0dce5ddf5d10bbe395a7d79407c351d6b5cc09d4b978e50a28ec3e766c5"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/import_unsupported_phase/contextual_import_equals.js:1 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/import_unsupported_phase/contextual_import_equals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c01eb184424b04f201eba8b615bf6ac248e6336498dbf071a8d5dd7d081940"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/import_unsupported_phase/default_binding.js:1 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/import_unsupported_phase/default_binding.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92a32c3fe453b3c2b13c27d2868dbdcb8bb45b7c28f441a310d1a5a78cd79f2"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/import_unsupported_phase/unknown_phase.js:1 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/import_unsupported_phase/unknown_phase.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954f5b745af2d78afe34bca4c3863eceedb9cf5707337fee78cf741b43520d2a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: src/parser/test/flow/ts_syntax/export_type_specifier.js:2 imports \u0027./export.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/export_type_specifier.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4613f811e587ae97911176d0fc1bc68ceaa68a30327ca1ef50acb31b3e22c"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_components.js:5 imports \u0027./components.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (2 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_components.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0678482320ad816688ec9dc7c1d0814310fdeaabe54d0e161f0ac5c0a88be30"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_functions_no_semi.js:1 imports \u0027./functions_no_semi\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_functions_no_semi.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b61d230a0cae7275c4a61b674bdaa236377dbd375f5880da16bc81b1da5025"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_implicit_functions.js:17 imports \u0027./functions\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_implicit_functions.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb90494811db4483f4ebd6d46a7c579a5dae3703db7a80ff1b1870532332ef"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_optional_destructuring.js:1 imports \u0027./optional_destructuring\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_optional_destructuring.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb1656a080609e0e8b3f215dee6d83c71bf354249ad8e5f1498bc371037fb28"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_optional_methods.js:1 imports \u0027./optional_methods\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_optional_methods.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff54ad5051eedaaf060ead4b6f352ea9b9d487340094ac8d0f7f8a5549a6839"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ambient_declarations/use_variables.js:5 imports \u0027./variables.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_variables.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cdde962c3b9ab8f24616d78ad2c53621a873ea2c5a883b0e9b7ffd3d106b56"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/annotate_exports_import_paths/file.js:4 imports \u0027./lib-flow\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/annotate_exports_import_paths/file.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca266a84f66ffa91667d5d325b9bab0769a288ae7dc46d120ee7dc4f701a8a0"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/autocomplete_from_a_to_g/bar.js:3 imports \u0027./unknown\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_a_to_g/bar.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1269076ccd0c9960de39e92fc5a8031b8b12d1046637bc986ce5e98b9bdba500"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/cancelable_rechecks/sleep_dependent.js:3 imports \u0027./sleep\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cancelable_rechecks/sleep_dependent.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2185100e49a42fb1dca7977840acdba40740238d78a816e81c1b3126d647e217"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/config_module_file_exts_precedence/test.js:2 imports \u0027./aaa_vs_zzz\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (4 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/config_module_file_exts_precedence/test.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1527851a212df8022b8a517ff516c00862be743de56fa3760d4e49939e799d3"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/config_module_name_rewrite_node/A.js:3 imports \u0027./1DoesntExist\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/config_module_name_rewrite_node/A.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"646836a2c14bfd860b38a446f31fdbe934b98b84013deb5c8a231dbb563debdc"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/config_untyped/test.js:9 imports \u0027./untyped/bogus\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/config_untyped/test.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f08cfcde07827b719257f18915bcbc3eba3ba2641fb019d9fdd383eda072b"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/declaration_files_node/test_relative.js:19 imports \u0027./confusing_dir\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/declaration_files_node/test_relative.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb326777d80901348c5c1e9d4016589e889ec1987680fe445233d71cc48da68b"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/declaration_files_parse_error/test.js:3 imports \u0027./no_pragma\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/declaration_files_parse_error/test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb9163be5d00ca27eb73f437e4bb285a78cbd7eebe69e5cfc3b76316b6fc93d"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/dir_coverage/b.js:3 imports \u0027./folder/c\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dir_coverage/b.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b7fc82547d91aa42c48836ca669e3b56f6464a5388479ec88322e955b12995"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/dir_coverage/other_folder/h.js:3 imports \u0027../folder/c\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dir_coverage/other_folder/h.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7009a6768a16ca461327d85f6144826cc028a8564a19eda7654748b33b5e00"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_basic/tmp1/b.js:2 imports \u0027./a\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_basic/tmp1/b.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"04345d6c56ab093d8aa938c3a13caa92e846fb882d7250ad808ddeb8c8a2b0bf"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_basic/tmp3/b.js:2 imports \u0027./a\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_basic/tmp3/b.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3cda4f9fea1fe7d53a8607e9ec55b31c2e5c7034e0a9b09dfcf5f165d9da6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_cycle/tmp1/B.js:2 imports \u0027./A\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle/tmp1/B.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001f5ff6aa790190e7b731ac0e1ecf91313b62bd1ec83937f48f472e1431b3f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_cycle/tmp1/C.js:2 imports \u0027./A\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle/tmp1/C.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd58555ad3c164ca80436d5aec0247be0d1ed116d3185f74c7d185b577d88cb"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_cycle/tmp2/B.js:2 imports \u0027./A\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle/tmp2/B.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef4d252fbeb12cb49992c937fa78d5e260d9e67b3101f2c5a4c0b1b705fc0ab"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/incremental_cycle/tmp3/B.js:2 imports \u0027./A\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle/tmp3/B.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"005c4a783c27d2c0ed5035927944159e8bd429e27b6583cdcb6aa9238f08fd59"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/json/test.js:6 imports \u0027./b\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/json/test.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d4a14dd07ecb287f518ad5b4a32c6bdc4de3ab80665e481e3b3c46ba024d7c"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform/android_only_use.android.js:1 imports \u0027./android_only\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform/android_only_use.android.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903b44750f71429c046ceb1cc62cdfc27b4d17c123cd56f8310fad264038789"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform/test_interface_import.js:10 imports \u0027./allow_no_interface\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform/test_interface_import.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c997e694f07b55cb095d1d4484862736ef81cc0979170a6d5070f4c4bdda1ca"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_incremental/import_A.js:1 imports \u0027./A\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_incremental/import_A.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220a4331f8d12e17a9f1ddb54298de49c99dcad216c8b1407f0026592e66df76"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_incremental/import_B.js:1 imports \u0027./B\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_incremental/import_B.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ded52caea4f4521129e43c97afc6b18c87b94e13d016af390f00b384732024"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_subtyping/test_subtyping_outside_of_conformance_checks.js:5 imports \u0027./classes\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_subtyping/test_subtyping_outside_of_conformance_checks.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"01180e0734561894ae9674fa0878574530507a8839a31c619c92fb99a3dff490"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/native/use_tests.android.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/native/use_tests.android.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"469fc8f7e3467b2e2277bd99543ffca6619317a90fb2b32c8bccb2a8efc51793"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/native/use_tests.ios.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/native/use_tests.ios.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db8e4a93b2c2abe9cb2f3d8d5059ce50142a122fe51db83b2ef821a5e70850"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/native/use_tests.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/native/use_tests.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204cdfb2ea3371c5ee44533ef7fbff1600a86a6d6cea097358de52d092afdc0d"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/native/use_tests.native.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/native/use_tests.native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0bacd838bc8143ec6c9fa917026192374b34b54f50202ce20b04929a5d59fe"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/web/use_tests.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/web/use_tests.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c972c5c9054fcc94797cbe2a9c1125b213fafc0cbe7d5239b74425f6ec2d36"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/web/use_tests.web.js:1 imports \u0027../xplat/all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/web/use_tests.web.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec10bd2365f26448e89b03e321a60703bb8b26645d8d9f121acab5832e763ce"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/multiplatform_web_and_native/xplat/use_tests.js:1 imports \u0027./all_platform_forked\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (3 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/multiplatform_web_and_native/xplat/use_tests.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d400537f64d8f4ee56014168c7c9f303173e7a0282ec94189500c747663c139"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/node_modules_with_symlinks/root/foo.js:5 imports \u0027../unwatched/dir_link/../util\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/node_modules_with_symlinks/root/foo.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3daef3824477fb140c5dd432fb9bf8681c0a8344b85abb19f15e59232bb0ae"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/qualified_type_namespace/test.js:3 imports \u0027./does-not-exist\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa886360cef1c57ad9502dff6d724f02ff9c87ddf8447bb3b1819baa32c0970"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck/tmp1b/b1.js:3 imports \u0027./b0\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp1b/b1.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bf10f74e4970d59b841b86c0d4140c941d090cdab43fcb770e5cc8a7f4ee69"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck/tmp1c/c2.js:3 imports \u0027./c1\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp1c/c2.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad276a5c09a628650c0a3a427976078aa8a213ed2a335f100b80ce29eb58ec4a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck/tmp1e/e2.js:9 imports \u0027./e1\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp1e/e2.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d0ec8d5531e9395329a5c9715097c1eaf0ec1a7df0883710ff4a575b790f79"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck_cancel_cast/sleep_dependent.js:3 imports \u0027./sleep\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_cancel_cast/sleep_dependent.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e32e0e8fb26bf4e7d88871c7fc46cc8e2f5d47111c1980fbbd09ccacdab94a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck_cancel_optional_chain/sleep_dependent.js:3 imports \u0027./sleep\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_cancel_optional_chain/sleep_dependent.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"449277d2f05f795eab6b2f3fc44e6d02c9a9aecb6926a18c519486cd8a9064a1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/recheck_cancel_unary_arith/sleep_dependent.js:3 imports \u0027./sleep\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_cancel_unary_arith/sleep_dependent.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a502e111621945739c55c872a03137a5d317a16dd58a3cdf6379a94ef6e9cc"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/relative_resource_files/main.js:4 imports \u0027./d3.tar\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/relative_resource_files/main.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b206f75cb682f99bb1cb84913366d866c0f65a8c29e147abbc016a0363b5399"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/resource_files/test.js:2 imports \u0027./foo\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (2 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/resource_files/test.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b8a5edc4334db2c97ac2de31ec4f4221cfe6a2fd80ff5c4648c56a77a0a60d"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/strict/annot.js:1 imports \u0027./unknown_class\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict/annot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b3dbe399543daf328d583e84c170de53a8c174f923ce3f4ba02603f6e511a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ts_lib_latent_saved_state/use.js:3 imports \u0027./created-external\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_lib_latent_saved_state/use.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"afae68b66f8fa2ceaf128e7a527c4b069bef8fb79ce2e32697634283e9e0ad27"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ts_syntax_allowed/anonymous_default_export_usage.js:1 imports \u0027./anonymous_default_export\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax_allowed/anonymous_default_export_usage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"933db059aa49cf91cf7594da5e99f0b0bd433fdabaceb6c38d643ee5d3f58f64"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/ts_syntax_allowed/property_value_initializer_import.js:1 imports \u0027./property_value_initializer_exported\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax_allowed/property_value_initializer_import.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7cf75383aa9cca85cadb730f70c9412241aabd65f7e07bc048534e7dc29423"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/type_at_pos_any/typed.js:2 imports \u0027./lib/untyped\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_any/typed.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc27007330244fa1515d0be2bc7c9c24ad62438a7c2f62c824f5e71ce4fe17a"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/type_at_pos_imports/import-rec-export.js:3 imports \u0027./rec-export\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import-rec-export.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4c76b043e66de301a58f3ffb66fa16707bb4efeb88f5273c95ba6e87073803"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/type_at_pos_imports/module-specifier.js:7 imports \u0027./rec-export\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/module-specifier.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e7ea1b9b8e104265814427d2235f49d1abcd941d57e2ec626fbd668471668e"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/types_first_parse_error/tmp3/qux.js:3 imports \u0027./bar\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_parse_error/tmp3/qux.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"332d88182774e610aea1f85b7566e81d3025d5815d75e55fe02866e846514141"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/types_first_recheck_opts_regression/tmp1/c-v1.js:2 imports \u0027./b\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_recheck_opts_regression/tmp1/c-v1.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f4d1289869da294cb65b83a747d2871d594df11e052113e7de4bf1e9f7228f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/types_first_recheck_opts_regression/tmp1/c-v2.js:2 imports \u0027./b\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_recheck_opts_regression/tmp1/c-v2.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb435d9330ab6a10794a45b027be1574f81cec366481e891dc86dcf222b848fd"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/unchecked_node_module_vs_lib/test.js:22 imports \u0027./buffer\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unchecked_node_module_vs_lib/test.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d007b28ba1d391be215401b0905675a6dfe4b966ab92ba7f94b9cad818c399f6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/untyped_import/imports.js:22 imports \u0027./nonexistent.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/untyped_import/imports.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc367f257999e3b4ffe5b65f52132aace2c2f19ee76e1495ae52d1a2817f88f"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/untyped_type_import/imports.js:25 imports \u0027./nonexistent.js\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either (1 further unresolvable import(s) in the same file). The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/untyped_type_import/imports.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab829ae37b751fa88f1015a43fdbac13c590fce66e7f92153e8e61d26a26d18"}},{"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":"newtests/lsp/completion/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719faf3b2694d18a690ec1a23f5410db9dacef31ab009e7077b4274c925e6f96"}},{"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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bdf01ad4f54db9f9e787b1e5211263416884be598457aac60c4f9870ce44ec"}},{"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":"lib/lib.es5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5198f5737b7443d4be8a23b136687bb60bd86eaddb25fd556999cc0a1fc1c3ce"}},{"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":"newtests/lsp/documentSymbol/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72a6ffb0a0a7adf159ecdc2c4c63c9843316492932fc31872aa9176aa7a3665"}},{"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":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cc4525c1aea94a47d9144c0ce2e8cf8d58407e7f020a9ffd76ecf988424eff"}},{"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":"packages/flow-estree/src/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83f091b21f9c5e48786328b5b441fcb3e93ac910d774fdfac22bdd3445c02bc"}},{"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":"evals/flow-typed/environment/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fa507faa504fd7d476cd41c8e3254f124527d68da4f5098d35f97ee162a40d"}},{"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":"newtests/lsp/selectionRange/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2594a6bf982bcf875b72b3c15a0aab825ca34dd9d618385db47eabdaaa83f43f"}},{"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":"packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d81307fa1c061daec4ab4d3959bd521fb2765439e2ecd283d1d346a4c3cc2"}},{"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":"packages/flow-typed/prettier.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93a12ecf76567958e3e8f250b73f34e5bdc2ac33ab14d03ec28ded5988c5a6c"}},{"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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38cc146b0a1779ef5ad0a56b4b7a815422d221beda77758c74272ab14e44e44"}},{"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":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c231c25181c78e0bc707de7bca2954bc2b04722c21b4cd01bad7cca9703e2"}},{"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":"packages/flow-typed/jest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"663f27791dae5f56234503a7893ef5f0f979ff3651e3c1ba49b781565a2c1955"}},{"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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54343d4a66750e9b7a0b76c3c6152eda4199056eaafdf2e45f2ada8930f20f3f"}},{"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":"newtests/lsp/code-action/quickfix/react/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70476361fc9db4568cfd2b17c97d3f02b8b083dbe6555d8351b27fbef5b633eb"}},{"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":"newtests/lsp/diagnostics/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f6855a2ffa5aa6b23d32cce4c31a4d3a128d750cc3aecbb1778cceb42a5ef"}},{"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":"newtests/lsp/code-action/quickfix/match/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"098d101ea1a761251e54c8da2dadf467d6c4c5f90b79e0471d5c3decbe24cb7f"}},{"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":"newtests/lsp/code-action/refactor/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2aae04c985883fac700c7ed27562fb6bdb6ad5713d94b42a9e7cfabf3db0a0"}},{"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":"src/flow_dot_js_wasm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6e71fef908e4252d5f6602f87e14710162c0b392eb436bf5862fb0da12dc2d"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/DetailedDiagnostics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a89fa08fb524fa01e72e676ec87c251b59965daa6bf2a95576955a87619880"}},{"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":"lib/misc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcab98aa36d9846c44b1d817afbc4bf64c292b7dd8b80a9eb1f3f3909b322ab"}},{"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":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a317d40598a2e5fa10530bb3abeffcb30f7a6dbf3ec8d52858bd81589ce732e"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/FlowLanguageClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e115a352193c8458b64c13655a6cb3b2f10b04244d9280ef2c772c62b3d53a73"}},{"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":"newtests/lsp/queries/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050f4da38dd76200f6707c4970da8ab681f935c59bd6e1b7aa0e0135870f3b0"}},{"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":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"802b0a7e9c098dae625e5cbba7880f125c3402cd229201d6abe1ec46d4c30a69"}},{"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":"packages/flow-upgrade/flow-typed/npm/yargs_v17.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9364d5ccd94159281ecf50dad24dd7ea23594226c714dc3d4676901a90ed9a"}},{"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":"newtests/autofix-exports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633f0f14d72e885a2d1f5cab7c906b450415aa2dc282f8c1f7b8b544a9ddfa9"}},{"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":"newtests/lsp/documentHighlight/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e3e915ed2ec5f686688ce4203129e2230bec518145c082368fb98213e7e059"}},{"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":"packages/flow-dev-tools/src/record/recordRunner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e0505eda3affec7472a1ca7c0c90beeb615dbe76108990bd54673fcf9a38ee"}},{"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":"newtests/lsp/linkedEditingRange/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88d7451044241652fc02d7dc45eed3d502fba68c0921cdadf4d8086450b448b"}},{"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":"newtests/lsp/connection/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04021792bb77c5993327e2e6858f0f4bc9f1294045cc4075f5df703eebad40a6"}},{"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":"newtests/lsp/globalReferencesAndRename/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f834db2dbc8d1f950f24c063dca7717a6277b3ef7d93182b471ddc86b4a1baf6"}},{"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":"packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecc254fa3ccc7c5c5e45386a4e768c122d9e74b6ce71c9ac808d15196bd139b"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f36b6793dbfdb5b809f8e4ec568a27c9aebabbb4b5433fdea47a8a9be8d9e13"}},{"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":"lib/dom_extra_to_be_removed.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e546f22914769648aaec4d9cb40a5d629edd178303c69f9cb97e94ddc14e043"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/StatusBarWidget.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81ba99e335166f36c219940c7a446fc7e2f81274e3f8254e261a26705743ee6"}},{"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":"newtests/lsp/code-action/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcd96a795770b9201916229b8551fa8ae66a31b4ac80555e3169b941711c0aa"}},{"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":"packages/scripts/transform/genTransformNodeTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe9b34410ea0f14358a97cfccab456f355b818b10cd4759920a4ae227cebc9"}},{"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":"packages/flow-typed/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f5b1a594cb6e4c277cfbcda49cdf3803a2c91db83bd5c7cd45f8a7e2e556e"}},{"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":"newtests/lsp/code-action/quickfix/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef47ebe27574983614afbafb3d9b79ce2da116818c811f5c95d298fa2a2c36cb"}},{"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":"packages/flow-for-vscode/src/handlers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"471ae828c49486f02b03356bf7378ed45d6312e77cade473a5ca06efa3052f7e"}},{"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":"packages/flow-for-vscode/src/utils/getVerifiedFlowBinPath.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8c254c2c728efcb96402fa2af033d95a9ae74bd92c94878c2fff6e73f59fe9"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/ClientCommands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcd46d9a69fb97555a5d90cc636bc6e0b393187e75f7097bb17a8958478abbd"}},{"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":"packages/flow-dev-tools/flow-typed/npm/chalk_v4.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c08f9abc79acf4e15c59f10bd17d943a5f63c5374bce93e7e5f2f49f46946c"}},{"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":"newtests/lsp/signatureHelp/calls_overloaded.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d258c3837c29db90420d877aa7291c425cdbb84baf1da214eae9cd58cd7a06"}},{"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":"packages/scripts/transform/utils/scriptUtils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9894495c77d5774154bbeb9ffb4e43b424bbd4e8dc1e643db6b7cc267ff1349"}},{"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":"packages/flow-for-vscode/src/utils/getFlowPath.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3a830136255ac2b6cde48ed5de389efed7171612391b035d8afb6347076898"}},{"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":"packages/flow-typed/babel-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc69a731f0bd95e32385bddce060fccb9b21064c5a736500cbb989d2389ca69"}},{"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":"newtests/lsp/code-action/quickfix/records/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091813e006bf0fbe988489a32e6068af2452bab3738f0579b0e61c40570c9f5"}},{"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":"newtests/lsp/completion/haste_package_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6867aca37aa212605c9136c7a0a45be934a5a660a5d2342e3bbeb66b89c84603"}},{"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":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434918b54d766138c38fd0d2add68572dad2bb33cbc590ffc4cd7b54ac2f02bb"}},{"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":"newtests/package_json_changes/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4702938697124bdbcc5d0202573ac1a65275de60bc121e72b56fc80fc055253"}},{"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":"packages/scripts/genSelectorTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c459d627634669eea44cc6192930eecd52cdf158d24627308b0b9aa1b795d5"}},{"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":"src/flow_dot_js_wasm_packager.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d0ec72a8649c91d873eee2fba759e73b480cb02f23ff3a8f27d2751c41f781"}},{"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":"packages/flow-for-vscode/src/FlowClients.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b6a1acf9026cdc61c0fc9a2417bfecbb929d8de2d427a197ba7c9c4e34d9c"}},{"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":"newtests/lsp/document_paste/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"936453b5c29ead87c9571ab2ed0dbea653d552ac9683c33771dc11cad5449a27"}},{"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":"packages/flow-for-vscode/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a13d892cb6d329c23878e26ec5c5ab075955544bf18beca1ab71f8d4e55eb59"}},{"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":"prelude/prelude.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a68221423feb1d035686ec7d49e4d3381be2df94c6478ab9d80905504f0d26"}},{"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":"newtests/lsp/code-action/refactor/readonly_conversion/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e5b487e8401b0d785bf3b5075e8eb70ed055dd1cde6e67d6d3af2b0bae03d5"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/Status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea13bf75e8485c3add0f1ec8653c5f3b82377191edf0a7d65ef1091f1f1956bf"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/StatusProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9bb8d97448ca71f86241cfd6e52cf780e228b321a9c5f771d2757f5edd074d"}},{"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":"evals/evals/03_project_patterns/relay_core/ideals/02_activity_feed/ActivityFeed.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1bf9cd5e3cc3854a8abcfea8c798863b311489837a06f784b4cc53ee9c9fa3"}},{"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":"newtests/lsp/rename/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a15223e9aa455818071eff2c8feeac7c420edca3e15502c63b47bea22334784"}},{"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":"newtests/lsp/detailed_diagnostics/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c8807ebba70e657f9c0583b3592002e22532068be12e414101e6ac4b1f9cc5"}},{"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":"newtests/lsp/findReferences/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeefcd446248d8b0573ed8c0f267b0e2e0cc9405585de9bbf5f5c8a8445f2a78"}},{"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":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed17317dca2218d388355d4d85e6fd1de451a2fec538dfdb2121fbd9769c67"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc82ea0a5a3f13a0d6f9e1299db70b192f42f77c1e6ada77321be36bd9abc399"}},{"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":"packages/flow-for-vscode/src/common/Logger.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb664b13eea7aa0e0fed9124ced7ac6a0f6618761ea941dfd43558f10c0f93c0"}},{"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":"packages/flow-typed/glob.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22643be436b2cb3179d69e12e40aeffaa68f5c959526734aaa1950566cd1c93e"}},{"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":"packages/flow-upgrade/flow-typed/npm/chalk_v2.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d792663f8e5776c0b34a03ffcde75a198000e2fb5807f1f0afce1e47074a0a"}},{"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":"packages/flow-estree/src/selectors.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6bc84ad3fa73a3d4e39dd4bd1f9e7e2fd843a53f142c57a25681fa768dd468"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/TypeCoverageFeature/TypeCoverageFeature.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeee5cc8b3553df7a8804685fdcf91255f8e3a6f09d87ea37e2319bea15dd99"}},{"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":"packages/flow-dev-tools/src/record/recordCommand.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d229239689326cd9194d309e9672a46e287a2ff5131e031ceb85258ef46c7ba"}},{"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":"packages/flow-dev-tools/src/help/helpCommand.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93e55f7509b8c4c2ded58701fff8368d7b0371d488b7addb2d83ce0803ee7d8"}},{"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":"packages/flow-dev-tools/src/ping/pingCommand.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"045dce3483919461ea146e86d7a2f9342833e4875f1d65abeb46845b04986016"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/SemanticDecorations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3e7f342885bc2adf5e7793799aac7c93d9d4e820e9a319b944b39599494f33"}},{"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":"newtests/lsp/completion/node_modules_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af30976eda03399539a2a5cbd35d937f340ebab20e830c4c86acede42be139d2"}},{"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":"newtests/lsp/savedStateReinit/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b2328566e110e5a92c170edf0fb16e02794e7daafd8512772a45fef11eee3f"}},{"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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce09ebc2f74416a0667a2da5a4f5dcf454c20db82b96be36e67d5347103c48a"}},{"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":"packages/flow-for-vscode/src/PluginCommands.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d9354d014abb0d39a84e933e463ab86e23b4ddf8ed5bf0776d91d9023aedaa"}},{"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":"newtests/lsp/staleTransaction/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af338a3843a1801bf6dd892344000fc73e40591d5ce6e4cd4d37b75ef3d7451"}},{"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":"packages/flow-dev-tools/flow-typed/npm/glob_v7.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0d2094571ea8d0574020589dee89782be356dc9fee549c93b0ec9bde529f2a"}},{"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":"packages/flow-dev-tools/src/errors.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6320511e488be5142bb2acf9104accdb822198ba4aa9462e09db7decbe7bd068"}},{"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":"packages/flow-typed/espree.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5858dca87e78634ae661d7e8d8e575cf4a50da3c1408bc5a4b737c2abd26d374"}},{"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":"newtests/lsp/auto_close_jsx/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"378d60e404f88a566173b7d181591d7077a94818619c71da78f6f8f4824f6077"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c920854f8d05562fe15f81c0c5eee817068a4f64803848235a55a9638a63a"}},{"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":"evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5a5c78a8cc3db44fa5c4c7173173fecd0c82328bd62c337b26031698b3826d"}},{"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":"packages/flow-typed/babel-code-frame.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c3f8e8b972682ad1da013f1753089c5386e0ea43cbea2a01f3e0a5304f232a"}},{"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":"newtests/lsp/code-action/test-utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c75e820bf85f5591b1eaa357dba99d8149514e700fc79d1ecbbc04da2d957a"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84159e8711867fdc3cebd13996ffdb864b77c925b403c6ee020df00953c291ec"}},{"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":"evals/evals/03_project_patterns/relay_core/context/RelayHooks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deee990834d68f039d0cfeac0b1153b27530fb18bef8c401a640389fd579c9af"}},{"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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa4269eae767abd9d3cb8b6d52392abaa55c42ca40fe9ff1df81d0068e9890d"}},{"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":"evals/evals/02_unique_features/component_008_ref_param/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6180f39651b935bef6f101ca5de0417812e91866ad0f47ffb8dd2419f469a0"}},{"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":"newtests/lsp/edits/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"061fe5566caa78329a0fec8703e052a92cf2768d11d02902dbee092d0b8cec4d"}},{"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":"evals/evals/02_unique_features/hook_005_conditional_call/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebd05fd9d393ea17f2c131114fb9149cc20a9f191198aacd4b6cd911c8e5fbe"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18098ff30c29a1969456c36f9c9b2c69c45f3ee82a9f9cf842ebc32b042ca3db"}},{"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":"newtests/lsp/completion/component_syntax_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"866f291aeea848f18e383165bbfe4999df648670807774a1bf448f60a9c987ae"}},{"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":"newtests/lsp/restartOnReinit/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee220d71803449a9c480b4a9eb0bcedde5826c35e7c569de50499517de0537"}},{"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":"packages/scripts/transform/genTransformReplaceNodeTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f69931b1089a28318587e05133a0bbe6d9c982c8340de039f7575914bd2ca68"}},{"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":"newtests/lsp/workspaceSymbol/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bce8128b5ee3463605ea4fc6dd124f6b23621615c9d32801b2f2adc89d35403"}},{"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":"evals/evals/04_ts_to_flow/object_combination_spread/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f8c979f776f9cd760b5440ed4881fba773615f5e362828d92c1dff51f80ac8"}},{"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":"evals/evals/02_unique_features/hook_005_conditional_call/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caf885a525bdc0a12577a7d19d78a913c1060c71d86f8648e2371fbbd8f0df1"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/Client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c30c05711c73fc0b22f3df830ce623511e2058be0daef9ca7d0579cd0b5796"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae04c8c1c68b0dd7ce5d97c104b143de347b125173282e3c1f030b0ad7af9d9b"}},{"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":"packages/flow-for-vscode/src/FlowLanguageClient/createMiddleware.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb832567a2614eef1c1391dff68575bce914d435d465ed212ff1723f3e09aeb"}},{"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":"evals/evals/04_ts_to_flow/exact_objects_complex/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0e7694356f071116d21406a080d28fe132be5e2ede8b4eef3b5dad949cc32"}},{"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":"evals/evals/04_ts_to_flow/function_overloads_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b15b8bd46787eacf9ed7e10868b7581046efbdfdf817ff336c216a4fa6f9804"}},{"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":"packages/scripts/transform/genTransformCloneTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3df7e6b3c067974000d4aafd8604a7503a82cb4e67d9d83fa6baffb986b4fa7"}},{"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":"evals/evals/02_unique_features/match_017_unreachable_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843886d94ff8a3cb4499eec9b52c2888c4e8fdafee184eefb61f97c637fcea57"}},{"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":"evals/evals/01_error_fixing/error_022_implements_object_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afab72f7cc3578ee90e824792486963d229ada558541c28ac31d0420b80c710a"}},{"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":"evals/evals/01_error_fixing/error_022_implements_object_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a3fe0bdd1b2eed402039fe9df746f049ec968d23388923c3836f21ee0326dd"}},{"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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eadd39240b5ca77f48b462aa3ccb7ac0efef0812536cd1e5f15a295789d5a4"}},{"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":"evals/evals/02_unique_features/enum_002_number_enum_switch/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa860c5d15665eaff7ae695798a9602c088fa236a98029a4e2958bf9eb3f89dc"}},{"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":"evals/evals/02_unique_features/enum_003_boolean_symbol/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3291e6cfd24d9576616190d7bee9a870878348a0ad9d5a52700ee8b1837a4e06"}},{"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":"evals/evals/04_ts_to_flow/function_overloads_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43793d739896e0b347f5b4d00c336448b7a108dc354dcb227a5328d4685f2679"}},{"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":"packages/flow-dev-tools/src/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f35fed9171d4f69d67207d30957b8d191f955f64d1f2a70b79a718fc07cae2"}},{"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":"evals/evals/02_unique_features/hook_002_readonly_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f74a5dadc806e8e9aa7ddac51f7ddde3218d3ffe779ee4c8becce2c800453"}},{"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":"evals/evals/02_unique_features/match_010_enum_exhaustive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f7fbd85780a3d0e4b699b37c3f203a48a3a42fd4750b585a896edcc8f3fd6c"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/ConfigureCompletionSnippetSupport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46505eba42128e34f81030edda89a4025da880df216a0b21f6e566abb69914a1"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f92cb21527ee1d261cf8738aab3134da761a1fbcde6c71e7cb91cf5a5aa27b"}},{"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":"packages/scripts/transform/genTransformModifyTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aacb46124e7c9965eb7bf64b18e6d54f4bd3cef33d3fec58e1479a6187d4e79"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9b19b71a865c967afca239fd2a67c79dff995cb431c3dee1d1bd494e47b1a7"}},{"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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"989d3acc67857657f1ae57aebd276b67d998174d853d33b8bb96dc760c695c14"}},{"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":"packages/scripts/genFlowWasmParser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff40363db5d56b615263f11d7eb0d421a13a441bd391224f315c94e5024f56b"}},{"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":"evals/evals/04_ts_to_flow/class_private_members/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"447ee3bce51078c2c12bf03d4298efa9066ad0040a2a82a5149a763ec48037d1"}},{"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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0283327da89c6ff41fc1087e8947f81405c223a8a9765357462be02a504aeb4a"}},{"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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0705c6926560e5471b613a04d4efadd832e0832e425b0c4d20ec049fcec14d0c"}},{"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":"evals/evals/02_unique_features/hook_006_conflation_prevention/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c6cd35e856d74c49d1f2cff43eabe3782f052a0114949bbef5a395d6a738f3"}},{"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":"evals/evals/02_unique_features/match_017_unreachable_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cba4421a5a9c391a6927f87078eab29c4cec1b86aa58cf437e2af5558410b00"}},{"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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ced1955bae264e9640b3efd254102519c0e8ee9cdb77006b5dbbde133122e"}},{"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":"evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da32aa745f1c8d620fda73bbaf635c0f22884250072e76390306ddb10ae4218"}},{"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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de200a38b9c99228936b76b2190122ecc8706ef05efb11a0cf24422c0078efea"}},{"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":"newtests/lsp/code-action/quickfix/enums/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cac6d6c3025d0dcf2d6fb69388b881d4c7d2216fa2f5b92a6e7a40549c7d85b"}},{"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":"newtests/lsp/renameFileImports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228de1e43d50972cc0bc3f9bf766caeef2c5a7c8d632eb4b13ee0320d596c70b"}},{"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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b618781dc0fea291b92355fa2fbe6476aadfb860925ed2cb16d546fd14bcbae8"}},{"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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a47026c7e909cf67b823c021fb9a126e300efe5db42ce816c13a03bd6d0533"}},{"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":"evals/evals/04_ts_to_flow/variance_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b31f3575fabbb03e8b47647eb766a318ed199b9ce50052fc1aecd50637098c"}},{"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":"evals/evals/02_unique_features/component_007_destructuring_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"538573c9517517f1a9fc6a675322dc1a9aaf74a54c4d37c809d0bdc11cbbb6ec"}},{"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":"evals/evals/02_unique_features/enum_008_enum_match/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac3b70e3fe65b856db663be4bd26a45b370d2792ffa56fbecd63e6839c722c"}},{"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":"evals/evals/02_unique_features/hook_006_conflation_prevention/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8de2d3596d073f7f23bba733de7fbeeec95caa516a79bd11a8b4a143aa3738"}},{"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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67359af19adbc77ec452f5fb91929f4bfae31f66f76eb2afadfb250936931341"}},{"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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd75c3b4013bd3b188450a1dff493aacddfcecb3a5db4be0a00a78333e6c3e0"}},{"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":"packages/flow-upgrade/flow-typed/npm/ora_v5.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4abb487081205cecc9022acf8080da1048981778d90830a21d0e46903bb471"}},{"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":"evals/evals/01_error_fixing/error_003_unknown_type_refinement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"870872d8a87444f5927872f5d906586c93cb148a3dd06c8dcdd34daa3bae079e"}},{"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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e8dccb5229b6fc8d71c697bc17299e2172eb402585a8e4ed08de7244ef11b"}},{"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":"evals/evals/02_unique_features/match_022_instance_superclass/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027ed5e66f62bf499abaa9cb97a1d980299609223842558b05be7ab89f2db03c"}},{"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":"evals/evals/04_ts_to_flow/object_literal_this/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bf38e5d2bb84a3cbb66ea4476cf6bc4737ca7c738783b1a11e154e459b1f42"}},{"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":"evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"724bfb0f92dd18d071fde1d4c3a1ef0caf870c393c4c65390ea330ccef87f0ef"}},{"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":"evals/evals/02_unique_features/component_003_polymorphic_renders/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d275f0690d03f100248c740d9bc5eea5dfa4f1107fb9cf2827a11851847c8a"}},{"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":"evals/evals/02_unique_features/component_006_rest_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba44a11af7ae541960667ee1817e4ae89cc678a144aaa63c6c2a212e158d6470"}},{"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":"evals/evals/02_unique_features/hook_001_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d191e4e55aa250b046002ba4236db03b358bd615191e9db4bd7d23d75f31e04c"}},{"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":"evals/evals/02_unique_features/hook_004_mutation_prevention/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"953268ab93f0efdf0cc2ee1a92976103710aabf809e506631d534096e1a65f79"}},{"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":"evals/evals/04_ts_to_flow/variance_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b66faa94c6211e5ca6d63295cebc3d976251e2c5fe4543f9be3a83fe8d8504"}},{"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":"evals/evals/02_unique_features/component_009_component_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a31e97d25438508f0728f4ff7006b6c531fce4b4424172e57d8a8ab39531a67"}},{"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":"newtests/lsp/signatureHelp/calls_generic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c733d8ebf917826ca1d4473618c4cbe44b66d557704685e5fcf7cb6726450ef"}},{"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":"evals/evals/02_unique_features/hook_004_mutation_prevention/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b235bfa5f96b67c3d8619c0816d3c4afe95fdce124aa4238d57233f1d65c96"}},{"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":"evals/evals/03_project_patterns/relay_core/context/ActivityFeedQuery.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ab6de8b64e52b5c67d04b1aeaf2e69c0a5774cfe87d418433abeb8e99d8c67"}},{"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":"evals/evals/01_error_fixing/error_006_generic_bounds/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222321152397c9ebcd16e8352a2d14fd8ffe95e347e160b4ea0b73a3a0250c1"}},{"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":"evals/evals/01_error_fixing/error_006_generic_bounds/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7842e556dacc3e77c123d9fcafdc7bd2ebdfd83403366fc5792edc954de3ac59"}},{"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":"evals/evals/01_error_fixing/error_026_asymmetric_subtyping/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76915144d2e0cd1183a07f1fecba9b263b5b42649d2dc357e5ba09000037135"}},{"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":"evals/evals/02_unique_features/react_util_001_element_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d336cf97351b6b72cf467de57a4b05b320ec8981379f832dc209ec56428c3f7e"}},{"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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61ceeefdee7f6591930a28481aa4bac53f2ef3ef033f613de7c6c3d337edb4d"}},{"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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66fa0c243037858b7a1ebeddd03565e13bfdde9a70288a9197ae8b27866ba82"}},{"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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1766c8b5da0cdd485822c7cb8be805a92c63af1ca27d6971cdc0eb56161c77ba"}},{"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":"newtests/autostop/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1697a0e8495928271c69269d1c035f0dec05c1c18bea2b44529e964e540fc9b5"}},{"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":"evals/evals/01_error_fixing/error_005_array_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f295d5b37f82182ba799e116954148751ffd84d37880f4e2fd3ef2a5e8d1db1"}},{"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":"evals/evals/01_error_fixing/error_023_interface_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d6408c6d806e761d75d29a3c7c5612ab8a771c6cef3b20ff6d38f37e4841e6"}},{"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":"evals/evals/01_error_fixing/error_023_interface_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa1e049c00c0e497616e6fd0b36e399d35623a4ef650a3aed473dd0ca10d3b1"}},{"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":"evals/evals/02_unique_features/component_001_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6373a064795bd4d6a1eff5155dcba5fa0072ee164b9c3c981aab0529984a4d"}},{"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":"evals/evals/02_unique_features/component_020_render_subtyping/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a23722a46553f3b75d975fa9617445f6f9923168c61cf7dbd67dd5ffd6c235"}},{"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":"evals/evals/02_unique_features/hook_007_migrate_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d74f5c812df036159e4f85f0346098302da7535b36d9a5532398f0325e6ddc"}},{"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":"evals/evals/02_unique_features/hook_007_migrate_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37037fe45d92bd34a7ae1ec6dc539af98106af6e55521b8047a515b61853488d"}},{"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":"evals/evals/02_unique_features/react_util_005_component_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1162a3d1a1a2a67ff2d9bd37d16ec08603d09e6d4ab0152b7698c44899473270"}},{"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":"evals/evals/03_project_patterns/relay_core/context/relay-runtime/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7d6b216f336232b6c3c18a8ad1a9a2a0fb2cf6e583c8e0801bd2f9a554c61d"}},{"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":"evals/evals/03_project_patterns/relay_core/ideals/01_notification_inbox/NotificationInbox.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20b7c798f0474004c11a2caefbc864fd5b24d1204da7b7a126c66284eb22bf"}},{"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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7cba9691fc75c6f92cf17dad2d294bf46eeddf8607e536de8c7a4110e46c8"}},{"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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1943270895c93fc51a4d52f8162346d2098abc53d4d2b0b5f81ab95f5723bba8"}},{"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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9f709f48ece7353a08ed67327848b874c42e99a1bfaa31e639a0ffdbd2da97"}},{"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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57867cac391dc826730908ff20def7efae155cf5e61e5251a86711c0e559e2b"}},{"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":"evals/evals/04_ts_to_flow/props_composition_hoc/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a87c1e22e71e7aa775417a6c4f60c9f5e2d93ca1ded275658e96b6acd91e30b"}},{"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":"newtests/lsp/signatureHelp/calls_monomorphic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1430a7d2bed7b4eb95b46b181616020a210e1d2c5c4a6063bbfffba7522bc0"}},{"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":"evals/evals/01_error_fixing/error_005_array_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d01d243f23fd02bd33fc7e6eef907dc9b175bc343d26d3ad7cb8bc4141119d"}},{"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":"evals/evals/01_error_fixing/error_007_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0fd17669a044ec19c5740e1d5e377aaf49bc1eb6006d1f40de604fc5918b13"}},{"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":"evals/evals/01_error_fixing/error_007_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631eaf85cac7c0dc091848fa6795d89b65689564adff862eeb5c506252739ea"}},{"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":"evals/evals/01_error_fixing/error_009_react_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"100628409c1e89895e11db07a95a15814c94251827e64b33f943b91652348d7d"}},{"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":"evals/evals/01_error_fixing/error_027_interface_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee897a1f61d764cac981bbc20217d8fd266f43825ef117189c2956b2943b43b1"}},{"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":"evals/evals/02_unique_features/enum_001_string_enum_cast/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2492fe189b767e37fef62dfffaec467861e03739d77acf28291db18522af1a"}},{"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":"evals/evals/02_unique_features/enum_007_abstract_enums/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f282d73013de2456210f5a75f3e352aa8948e2e81438d10e3afa070bf7aeba"}},{"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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"243a07858d32b3092f32d3673b58d4e1dd70ba9716edd9705aeb94cf2c5ca585"}},{"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":"packages/flow-for-vscode/src/utils/LanguageClient/StatusFeature/StatusFeature.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49f715939717bb3ecfd2bdcc62133a17d9c49f61a61f13006d7f191d63f0d56"}},{"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":"evals/evals/01_error_fixing/error_020_ts_access_modifiers/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf6cc8bf0ca49204b1670a2f3a00ffdcbea0d29d3644b6e64cc792f70c8403"}},{"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":"evals/evals/01_error_fixing/error_020_ts_access_modifiers/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c9827efec6b33b7f3b669e838e60301daa22667e72d0469e0088cbe8451ce"}},{"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":"evals/evals/02_unique_features/component_002_renders_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf92054b5f3e3ccaee6cdf56a466465fb0d2b8064798f514cd6c5a2c13374b2a"}},{"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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1411956125130eed0061d66424d47d2e5d22358a79e708c61182611829ab26"}},{"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":"evals/evals/04_ts_to_flow/react_element_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda5f2f596f5ccc127913a06ae0cd3e34b0d7cd7db6d62564920b2bd54a6238e"}},{"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":"evals/evals/01_error_fixing/error_025_object_this_reference/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4cadb77ecc00cd916556fd83ba522168ea82dca6e72d0c352234711d434f89"}},{"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":"evals/evals/01_error_fixing/error_025_object_this_reference/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc5fcbc88f6cd9da715e3be7fb7aad2cd1c123899e17a9fc17ee615e5ed273"}},{"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":"evals/evals/01_error_fixing/error_026_asymmetric_subtyping/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae01f27a29c9c293c7c43e057b6fec2b2b5305e4284e929f2905326dbfdd6978"}},{"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":"evals/evals/02_unique_features/match_022_instance_superclass/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be58606129eddfee1b150b1bab73a6dd1b0a953386a625bb8434694b91c8902"}},{"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":"packages/flow-for-vscode/src/utils/FlowconfigCache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72619ef64a6261a0e066a7ac6d658570273c2139617445a940d728bc5d5e716f"}},{"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":"evals/evals/02_unique_features/component_004_generic_constrained/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe11cd54a87d598cd5679925f093bc2a61d511a89f1f36b217fa5df9c03901e2"}},{"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":"evals/evals/02_unique_features/react_util_003_ref_of/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99748d587692fd0a79031725a90541ad132dec748b8e32a067dd387536e86767"}},{"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":"evals/evals/04_ts_to_flow/anonymous_interface_param/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"377628c4d6e46245c10d4950e23020b48dd1c8fa52848efd6328effb63764f3a"}},{"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":"evals/evals/04_ts_to_flow/class_private_members/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e10066c46834fdcb626dc0973a782edbdee794d32daaeeaffeb30bacc74dd0"}},{"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":"evals/evals/04_ts_to_flow/conditional_types_infer/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"085328f09369ab58b6f33e23cf1b8ba414b5ce091de45a8c5431499c762a52b8"}},{"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":"evals/evals/04_ts_to_flow/conditional_types_infer/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"702a5157c7eff5c43ac30221139a5ded3d524565a478ad4bde0fd1e5d560316d"}},{"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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554e1759707c0562830e58c78b8e27cdb252ecca9536b95cdf2d3a4951c6254c"}},{"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":"evals/evals/04_ts_to_flow/hook_utilities_complex/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69167ba6832a89d464657029dd7722236f7933e7eb153a324996ac7f22bc9d7"}},{"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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccea3dfad50c6ad768cb752c427e3e69c28b8410a5085460476fbc840ffc110c"}},{"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":"evals/evals/01_error_fixing/error_009_react_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd471f277991099e764ffa05545cc7853bfa7aa14a093f8b5e803ab83bd423ed"}},{"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":"evals/evals/02_unique_features/enum_004_members_getname/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ffb9f982384f8d0a9f7e0460427823ca2be8fded19c3f13efb0590666f7e65"}},{"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":"evals/evals/02_unique_features/enum_006_unknown_members/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91206411425b200bdd645c48f728eacc457a83979bf6d9b1949305d99999cc0b"}},{"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":"evals/evals/03_project_patterns/relay_core/ideals/01_notification_inbox/NotificationItem.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e96f44aa4e88f81947973639ed9b1db9e27292dc4dcac6ccbacfa5f054da90"}},{"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":"evals/evals/04_ts_to_flow/interface_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c2116994849035e1936e6f2937fa74c6707b89243c06b6c399c2f1cbb3f43a"}},{"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":"evals/evals/04_ts_to_flow/type_predicates_refinement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5195e08e71ab68b4f60406ad8bc299e1c07aed45f116cec829b6481f8209742b"}},{"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":"packages/flow-dev-tools/src/command/allCommands.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1508db8999033c1a81fc9d31981458085f4bdac73b94ac13915f559255548b"}},{"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":"evals/evals/01_error_fixing/error_003_unknown_type_refinement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a8c6a41ff4ef92eae8dd704785c63c4fb3f1f9f5aa584dafd2a6fa8b5825ea"}},{"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":"evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13608dd3ef6f243f851271931faae079c60b30ceb58f88e578c5f2ffdfa44234"}},{"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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b357d0ed229674f43bc81d65a5f297f15f42f886dbc3ebffce46d00e85ee0b"}},{"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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fcd5d8f43b250effc7c4cc07e0267e1f43ff8035efddac0161d8b066c2bfc2"}},{"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":"evals/evals/04_ts_to_flow/opaque_type_branding/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a1d0812e387794aae6f07396309d5d925774b1b076a3cc23b9b556e618c141"}},{"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":"evals/evals/04_ts_to_flow/props_composition_hoc/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c365a7c1f94344502716c70f8ad40d81a10fe72657af6d7392717e8763867fe"}},{"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":"newtests/lsp/version/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e14985a8813235be8935d29b7df315b46144a671165db57c6f4139a7fd717b"}},{"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":"packages/flow-upgrade/scripts/postpublish.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b1f0fe3580ad86bfd0f873ced3a1ae48b2dc062515f1c1d67cdf2d136d7cc6"}},{"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":"evals/evals/01_error_fixing/error_001_refinement_invalidation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080599118f73e6cade1adfa65181a1dc73d04eb6e8d2786dcdcecbab6b749dd1"}},{"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":"evals/evals/01_error_fixing/error_002_exact_object_types/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b92343b26b1e1ac867b4e667651d82a96cad23f06ef34868ae769b0ea2eaef"}},{"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":"evals/evals/01_error_fixing/error_002_exact_object_types/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f363630a0fbfee0e45be014ec5230caae9fb64d23979b0f6d52f6cb26f9f240c"}},{"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":"evals/evals/02_unique_features/component_026_migrate_class_state/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985efa4bbd1e6efb341a55b7b1b34678ae0abec3c31d7dd60d617af7ad6626ba"}},{"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":"evals/evals/04_ts_to_flow/opaque_type_branding/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea564f618f81833390c453d95a04fc558c020885eab075edc918576aaeec38ee"}},{"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":"evals/evals/04_ts_to_flow/values_member_unions/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c047003d1b6ac04a07aef5ed9d6c71dd51c19378ce874d341032973bde0ab3"}},{"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":"newtests/lsp/signatureHelp/tupleRestParam.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"140924bb420268538c8cf94fb6bd165c205279dae6dc2ed40bb65db86bd8f66f"}},{"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":"packages/flow-for-vscode/src/utils/findFlowconfig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cbfff57bc4eea881faf309f0f2ffcc35c9049178f32776db44adf790530c56"}},{"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":"evals/evals/01_error_fixing/error_001_refinement_invalidation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60159d8de1ea49bcedf38782c11834fd21b66d3bdac54f59e5961ccd4d85801"}},{"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":"evals/evals/02_unique_features/match_021_instance_pattern_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03169555af2adccceb4936ed467c6ed651ff64b54a47309d4e955a137705f91c"}},{"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":"evals/evals/02_unique_features/type_guard_001_this/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d26f23c9a6d9766cc4072b9ccc0cb807404b6386709764a7527e1b28776524"}},{"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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc6e6eb0dc10e3fbaf7f644034f7c20c96eb136c7f82a305c6e29b5e32baca4"}},{"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":"evals/evals/04_ts_to_flow/default_type_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54eeb5d1cc1ce9b7ede1196278e8235a1f4222ea566675083b23a9f061613aa"}},{"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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893898c15ff0ba9bbe70baef9e75b1c0b5ef139f1df0290b6c6e63bd19acb562"}},{"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":"newtests/lsp/queries/outline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111fe70da3b7ab90793e45e1acd33f2871472a350eb1bbffc690bf02eef0c27b"}},{"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":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf81905ef87a7ee432d1fe61ef0a80001f29c0f2d47c2685e2e8bbee08c44e6"}},{"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":"evals/evals/01_error_fixing/error_004_exact_objects_extra_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be63cb9858f75802b2c66e2d7761556edb0cb137cb24e0fe1f3c0d81d7330995"}},{"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":"evals/evals/02_unique_features/type_guard_001_this/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adab78232d7ab8cea5b595911bb9d3072bae4d59521a7a64cbfc04b7d45ab595"}},{"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":"evals/evals/04_ts_to_flow/component_props_element_ref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a329b88c500fe756ac24467de7e26e0f759cf96f54ae3cac8ba1df139f1b407"}},{"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":"evals/evals/04_ts_to_flow/values_member_unions/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54ec97beaa493ed94fb38a62397b2c2d12418d9e5e5f69ff818f50b62c7de05"}},{"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":"newtests/lsp/signatureHelp/member_callee.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e413ff1b1668cd2f35570e2d9218746968b4b57914717fa0dc02da46358e7ed"}},{"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":"evals/evals/01_error_fixing/error_004_exact_objects_extra_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9990a401ad75dcc6a275d49ce1a52af797bf7978d26cc7a50cf8b6c9fc2322"}},{"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":"evals/evals/01_error_fixing/error_008_indexer_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f0548e5ade374e385117dde34149cb0bbf7c62a3e90f67043bed082e67029"}},{"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":"evals/evals/02_unique_features/component_010_propsof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7d2b369541be4c6264685c4026e9d3f5b7be9163d91a370af73bec477df0f0"}},{"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":"evals/evals/04_ts_to_flow/as_const_assertions/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce162238aa2a35a09e723662a6616bc1bba141b6dad04988b2d9bb05f8defde"}},{"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":"evals/evals/04_ts_to_flow/default_type_params/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29fced5c3577f159771b3d112063bd3aa10d68adb9cddb039ef0482783ff9f9"}},{"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":"evals/evals/04_ts_to_flow/intersection_function_overloads/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e28c0009af0d0f9a4230f8fac95a3342ca36c41b0cdf772b4dff2361591d5ca"}},{"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":"evals/evals/03_project_patterns/relay_core/context/NotificationInboxQuery.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d068bfb7f4c65bfd1081890bf377cb3991db7dea6500e822d25457efab8f82"}},{"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":"evals/evals/04_ts_to_flow/react_element_basic/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb138182f02496b80a64da5bb20dd8e90877ef4bdb32b4c3ffb0363d759f5aaa"}},{"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":"newtests/lsp/signatureHelp/jsx_attr_docs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"085716aab84adbbd85b54987ebd733791cb5eb66b9ed58ee88831c96c9a09b7f"}},{"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":"packages/flow-bin/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4d6002971454d1c9badaf5c20d607c6417254be845034fe04c33e136e9d4b4"}},{"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":"evals/evals/02_unique_features/component_016_disjoint_union_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a320567c408e8152878b4f97f3f1126153d73e9fa5cb539998decde3d9172e0a"}},{"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":"evals/evals/02_unique_features/component_017_renders_optional/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0eb1dd0aad8da48ddb5998c496cdf1016c24e6cefe0f55f4833c00f5e49f48"}},{"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":"evals/evals/02_unique_features/component_018_renders_list/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5d968f5687afc8455b96d43bd32e867088975f17983c66a13a48240206e8fd"}},{"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":"evals/evals/02_unique_features/component_024_migrate_renamed_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"624550de36491995938960c3028a76c41461e5e067702257e37e699f42a070c4"}},{"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":"evals/evals/02_unique_features/component_025_migrate_forwardref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04fa7316c81c0f0c3d637b4a03169b5c3e899c70c06396d46e0082564e895db"}},{"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":"evals/evals/02_unique_features/react_util_004_element_ref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e6174e0a556b51cd810100c91403d31028e375983edc88a2ec03eeea33a08a"}},{"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":"evals/evals/03_project_patterns/relay_core/context/NotificationItem_notification.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02984dda3d4ac191fdeb9ae2082b91dd175a864540af9c5c8b5fec7d6e93dd6"}},{"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":"evals/evals/04_ts_to_flow/as_const_assertions/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ece963afcfa0e425b2ebddb0f11c104f16108acaf1e8282f02b73846abaf49e"}},{"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":"evals/evals/04_ts_to_flow/intersection_function_overloads/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d94429ffd2f068f35e2deb76cf16949147fc8f70e202842d142583c1c11cec0"}},{"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":"evals/evals/04_ts_to_flow/object_literal_this/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7f70dd1e4d3891fc60f58bff916db5f40eb0d174268cd6d0262576c3c2a337"}},{"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":"packages/flow-dev-tools/src/comment/add-commentsCommand.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb06d9e31d9e4d5c09a7eb2f1193d28697de3f114d062a12649c1e67efe209"}},{"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":"evals/evals/02_unique_features/component_019_render_prop_constraint/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faac61ccd33f80e957689b856c61bb4f3a7b5cb2f1daab1fa17625e258c331c"}},{"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":"evals/evals/02_unique_features/component_028_migrate_rest_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91310786d758260be00e9ad1e807ac8107bce4e88c8b3267d9142344ce0e5d"}},{"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":"evals/evals/02_unique_features/enum_005_isvalid_valueof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e270b501f40f844821918f740ef63f10d6f920de88bed9d35b2424073f0ee40b"}},{"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":"evals/evals/02_unique_features/enum_013_migrate_object_freeze/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1eda9e6ee8ff45476babf6354f1c271a2cb4d35af93da2a241617b9266fd97"}},{"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":"evals/evals/02_unique_features/react_util_002_ref_object/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2925a2855cf48091e92b74869d78415f047f1b81c171441d12544116f31fe846"}},{"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":"evals/evals/04_ts_to_flow/anonymous_interface_param/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4adc16b4905262aeeb655ef8405a9be69bbc913274df5e9284ad5a1f218cbf"}},{"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":"evals/evals/04_ts_to_flow/component_props_element_ref/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc0e5239e6c4e46e810777a55c35ebbeee55fbef3b6a33316b05daa3fec94fd"}},{"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":"evals/evals/04_ts_to_flow/hook_utilities_complex/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae52ad94cdccee5dd39e43b4b1c7700f79f1d921ebe99558db68926d24dc15"}},{"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":"evals/evals/01_error_fixing/error_008_indexer_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ecf82b2d6b548cb401490bb5ccce9d0244f069481256ee12477fc33db5474d"}},{"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":"evals/evals/01_error_fixing/error_031_method_param_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d729ee5c396128dbd9e6b96ef6698a0aa36d2076985e797788f35ecee91ab3"}},{"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":"evals/evals/02_unique_features/enum_014_migrate_keymirror/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01954bfd625d2f59a7b8be9ebf6cf6346093e153f0448405b216594c714bb59"}},{"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":"evals/evals/02_unique_features/hook_008_migrate_hook_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed26ece95ee7d9717083fe2c1671b8940e0484356cc5b1e9f3c46abf4f0e6dd"}},{"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":"evals/evals/02_unique_features/hook_008_migrate_hook_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39183743cfa448d10c188892c8d9147e3341edd5846e90d5ca438ca790f7d355"}},{"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":"evals/evals/04_ts_to_flow/interface_property_variance/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d26f8768dade1b820c7d2fd503c304d1c49c9ff7c24559e8e154afd7b5521a"}},{"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":"evals/evals/04_ts_to_flow/type_predicates_refinement/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4db9a6296f95a55706dbc3d107aea5d7bd3d7caa4fc8e11f5cd2e7684811096"}},{"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":"newtests/lsp/completion/unqualified-type-annotation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"040695ff58aeaef47a51554502656ddd87ccfa06cf379e1a59d89c143591799c"}},{"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":"evals/evals/01_error_fixing/error_030_this_type_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ab97d37ebac4e9d9bc05b65ba401e97e2290711fd8e1f57bcddf8f212d5fe7"}},{"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":"evals/evals/01_error_fixing/error_030_this_type_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc227e080393a7a1d1e6b64febe3cbf0c527798962e6bc81dadb55ba4140c02"}},{"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":"evals/evals/02_unique_features/component_005_renamed_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f7d7223dbca86ad27b330cffca84aa93f02b57798d06a9b29bcf16cc819f2b"}},{"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":"evals/evals/02_unique_features/match_023_switch_statement_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820af5168c5ac17e340e943f506b473071a2945f1801e19a4d452c0b883c7c08"}},{"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":"evals/evals/02_unique_features/react_util_001_element_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f91803dc9af4ec6691683240ed56cbbe8591f69526f5dc9e60827522c573d"}},{"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":"evals/evals/04_ts_to_flow/void_vs_undefined/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"580b89f3a0ea9d9705622f928f19e7320146a0f0fb8222fe49823ecd9ff187c4"}},{"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":"evals/evals/01_error_fixing/error_031_method_param_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cabc3d29d64fed1270394a53757958889b82d4639c50bd18d97c8fe20d36eb"}},{"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":"evals/evals/02_unique_features/component_022_migrate_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16163bc8af72bb71b36d5193cf04570966ebc3265fdff31894d21f352071ef2"}},{"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":"evals/evals/02_unique_features/component_025_migrate_forwardref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11237640724da39d9864a42d7c90e90e340198cd41d2c6449227e951150078a7"}},{"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":"evals/evals/02_unique_features/enum_010_enum_union_refine/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbdedf7eb2ae96c1e2b64661bb2ff377ac871ddf9be67d6036f5ba6751fe50f"}},{"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":"evals/evals/02_unique_features/match_005_object_destructuring/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a071e3b367e369e5248d376cc5377f8b9660bc4b86b739d2627837760c45dd2"}},{"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":"evals/evals/02_unique_features/match_006_as_pattern/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38f97be875bc34981e56b3c74075ab3d2d1a08fe2a57069a5c84f3b284dda66"}},{"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":"evals/evals/02_unique_features/match_021_instance_pattern_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44984110b116efc34c103a4c280500bb0854a3c010b690e833e0d97f90c6090f"}},{"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":"evals/evals/02_unique_features/match_023_switch_statement_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"278739231a08af2aed94f8e980414dddd0c2796b4433daa298db6268de6bd455"}},{"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":"evals/evals/02_unique_features/match_030_await_statement_body/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9f24660ad56cf49d2bcd8cfb78c1224359076405c7ec7fa9a59198147e502c"}},{"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":"evals/evals/02_unique_features/objtype_001_type_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc9f3b2189c52870bcada371fb4d9bcd16e1020b0ba7cfe9d07867c58e1465"}},{"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":"evals/evals/02_unique_features/opaque_006_type_predicate/ideal/Metric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f22a8b698d42c56eaeed8ec8680196465a0139aed7163b51b15b398e04ee7c"}},{"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":"evals/evals/04_ts_to_flow/multi_file_module_split/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afc451c905d49d9f9e59c7b130efa23f5ba965a14a8fb29a49a5f16194dcb9"}},{"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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"288ce32ee6aa60fd1de1b71ff8840a8c80b11e68cebcc802300d888074aca0fa"}},{"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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8b788855c864f979bab2cac93568f1cf679760dcaf2fcb22d0c63b3f41cbab"}},{"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":"evals/evals/04_ts_to_flow/this_parameter_types/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b65e5ae9879b45cb10f14798779ababe545c7dfe7ec0ce0f8e33acfd9abf0e3"}},{"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":"evals/evals/01_error_fixing/error_021_class_into_object_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7d13cd8b4cd9c885252ed6a3a8d5b382864e9fb5970e657adc1ec7f18b3792"}},{"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":"evals/evals/01_error_fixing/error_021_class_into_object_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46baa24e9dcda71a20f030816ac79b6e43ac41d5568d5ff413dffba7a9934b1"}},{"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":"evals/evals/02_unique_features/component_013_nested_component/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b07cb90e45325da5695f7e530190f0b56a58fcf0908870315430805364741"}},{"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":"evals/evals/02_unique_features/component_023_migrate_default_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54de69d5ed40b239180864aba4967c491824c70e034853d467273d7c5b72d9b4"}},{"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":"evals/evals/02_unique_features/component_027_migrate_generic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8065201cdaf4063e00997fd985aef4f427fa139aad4a68560bb15eef8562b63"}},{"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":"evals/evals/02_unique_features/enum_011_string_explicit_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d06ac727567721e1d59e7c330866c874c214b8d0b82dab0196d5ecc9532cee9"}},{"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":"evals/evals/02_unique_features/match_011_match_statement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c558ac1de4193b98cadc2b2fb23c524f437d03354c0e9e80d6d544221140f23d"}},{"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":"evals/evals/02_unique_features/opaque_006_type_predicate/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6c2ba76dfab831e3b458c6f123ec9d6e7917d9bb3e60f82a388d30730ddb70"}},{"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":"evals/evals/05_code_generation/modernize_020_react_element/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd5184b2e4fd842056157d453ba5c693decaf63d528efa7dd53b396fb8bb465"}},{"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":"evals/evals/05_code_generation/modernize_020_react_element/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2465a380d9732fad345165cfb535c395df2b3552e01790eb047c2522e783301"}},{"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":"newtests/lsp/linkedEditingRange/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63074bb0b58144b9588bf04b069e52f5f288a4507497eb1712341bf982d386e"}},{"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":"evals/evals/01_error_fixing/error_011_unsafe_as_unknown_reinterpret/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fc3eff8117ccfc2ea2f271f12fbd60e28389711f10053b20ed105909c407bb"}},{"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":"evals/evals/02_unique_features/component_013_nested_component/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceebceb67a28d5222f90adf2cbffdb6fbb9f3144e79d35861ba08c1e4bd08b7"}},{"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":"evals/evals/02_unique_features/enum_009_bigint_enum/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d323748dbe98547769da770cd2d1e3cc610cc780bb540c69204b915d08c54fe"}},{"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":"evals/evals/02_unique_features/match_024_switch_assignment_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d020875e3156c9cb629deaf6eda28d79fbfdc5d4c64523da20fda33c7c3ef118"}},{"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":"evals/evals/02_unique_features/match_027_member_computed_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9bf61424a3a215e0f0e88b9b9336ed3298eb15563fcc3de4bf2f3c2666692"}},{"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":"evals/evals/02_unique_features/opaque_001_basic_nominal/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1a1d2b15a235ad1effcfa0b482819153710ceb4ab2859fb27700c7045bb0d1"}},{"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":"evals/evals/02_unique_features/react_util_005_component_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d09b24ce7967d1460b3ac1d3ba4791980c0025c08ae063b705b86f4dd9c438"}},{"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":"evals/evals/02_unique_features/typeop_004_optional_indexed_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c4659886bfe782c55f9cebdf7ee5e94ad8653ea0b882bdfc47a30188af4708"}},{"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":"evals/evals/04_ts_to_flow/conditional_spread_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5ecd9cbbd0ec170585a898fc5ca34a597a2911bffa0583e27660d93f901993"}},{"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":"evals/evals/04_ts_to_flow/this_parameter_types/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb5ad995af322ca731d2cb8bd812225a7d89ce03b032d7f43d576dc4ed2c4c8"}},{"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":"evals/evals/05_code_generation/modernize_010_rest/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9872548c691df8c606fe71ec7722d6276bb459b7f18233bdddc4141d7bf8ae35"}},{"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":"evals/evals/05_code_generation/modernize_010_rest/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55890611baaf414653e7b7977a186bd73f3e6f59e0fecdc1c424fc698cefb145"}},{"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":"newtests/lsp/execute_command/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7fc53148f824c73295a31405909d95144555e6b1652c1c164dce446f15213"}},{"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":"packages/flow-for-vscode/src/utils/importFresh.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca14f6811b9c6e76c4d9502a82b5b1f1e190d6beb9baeb0af501995049e4156"}},{"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":"packages/flow-upgrade/flow-typed/npm/prompt-confirm_vx.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c682e45e4398fa7b27f8d206712ce18889091c14f279fbdaeb6832b9bcba62"}},{"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":"evals/evals/02_unique_features/match_004_guards_and_or/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d4ac926ff0ac2b5b8f960fb24f69a69292952511308c3b72f1d3e36327bb88"}},{"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":"evals/evals/02_unique_features/match_007_rest_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3363865d705187236c5f37cad2d96fb83ad37e99c40d04578fce444164f4880"}},{"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":"evals/evals/02_unique_features/match_018_invariant_throw/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d24a0f11ec74eb09a78438796f06eff100feb7a39b231146197f6c4a2df2da"}},{"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":"evals/evals/02_unique_features/match_019_tuple_matching/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa40709295e4d85dedbbc9df18286238972cf9a93c045afbd0abf9756b433aaf"}},{"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":"evals/evals/02_unique_features/opaque_002_module_boundary/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c98614fad3363c3a06fd9c82ab549ba6d2eb02d4b8634bd99801200f2f683c4"}},{"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":"evals/evals/02_unique_features/opaque_004_generics/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d66a0a5c214c468ecbfaeb6fe82795aa086c5ddd90c0800e03bce3fd6967f2"}},{"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":"evals/evals/02_unique_features/react_util_002_ref_object/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7faed1f4f0e8daa56b840e7c55bc498b199a3da7b4a3b563c19a2b297e9bfca"}},{"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":"evals/evals/02_unique_features/react_util_003_ref_of/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec26caf933e5adb242c70abbf0fe2c16e0e20c4a77389ff8393f2db68ee8e678"}},{"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":"evals/evals/05_code_generation/modernize_019_exact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a499982d9f6847fc6524295376190b7c75fe7e19c2c305137cd3caf23d57271"}},{"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":"evals/evals/01_error_fixing/error_012_writeonly_property/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c05150c36dfb987d630a494b1adc03f7d4f42e6c8c4373a282dc7828102ffd"}},{"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":"evals/evals/01_error_fixing/error_012_writeonly_property/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1cfc2e264b14862665595f3ef0f05edda8e1e564c8cd4f959a576e4dab819e"}},{"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":"evals/evals/01_error_fixing/error_015_recursive_return_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed1e64f1959ea970edc848420489afa4cfbbfb780416ffd1e134104f2f162e7"}},{"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":"evals/evals/01_error_fixing/error_015_recursive_return_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e8a9650718cbf61e766bbb4e7230d2ba4635bdc3c9bd5ee703bca7cf1cd04b"}},{"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":"evals/evals/02_unique_features/component_022_migrate_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a374d5ae052b31a1aca8e4a3c80f7182ab65b55921a2ed178890295b892a2e"}},{"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":"evals/evals/02_unique_features/component_026_migrate_class_state/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceea4dfce20e3d362195651f097b7608b258eef438a257d0c03134fa159405e"}},{"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":"evals/evals/02_unique_features/match_012_switch_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"657c1f42a65f293a82cef622920911efb8b3a1b01921ab1fdebc8a9e7ff89f18"}},{"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":"evals/evals/02_unique_features/type_guard_003_one_sided/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d476efef9bb88dbf79101a4a328038ee5994316428884a1212e5132c5d0301"}},{"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":"evals/evals/04_ts_to_flow/const_type_parameters/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fa707cc4172637579642441ec76cc2b69f8e2297b14d3b96366abcc12bd0ab"}},{"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":"evals/evals/04_ts_to_flow/multi_file_module_split/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd39adde1e9d5eb5e08314551b45bb7b6725de5991109aada7ffe8bc4136a574"}},{"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":"evals/evals/04_ts_to_flow/multi_file_module_split/ideal/money.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d0a0c49ff6aec6b098a85ae0dbef9c10722156cf6f19ccbddc3c841d030ae7"}},{"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":"evals/evals/05_code_generation/modernize_009_diff/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1f3985a08982215d27aa95a3bbe26824afbe0b726931bf61dca408e4e7e6a5"}},{"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":"evals/evals/05_code_generation/modernize_009_diff/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d181b2fd015f24183be67283bc4167d2a22f8ccde78225ad163afd45c660998"}},{"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":"evals/evals/05_code_generation/modernize_019_exact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58cf725f4b2184d3f1325641d321408b9f52bdaae8d5b53ef3dcebda3c40db9"}},{"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":"packages/flow-dev-tools/flow-typed/npm/minimist_v1.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a6d4a4638c4a1d56ffd1aacec19513c0571b437644c8b5a8f428cb9f5cf656"}},{"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":"packages/flow-for-vscode/src/utils/toDiagnosticSeverity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cadc41abc274774f255fa281fa47cc6f7ed05435380505eba8dbd6effb4ac4"}},{"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":"evals/evals/01_error_fixing/error_034_var_branch_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a820e90d9797172bdf1667512bd512201bf234695da13ddd5b845403f342b9"}},{"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":"evals/evals/01_error_fixing/error_034_var_branch_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5351f744c3e3687489f068c816401f61322b7a6ab1fe5b28118fcfafd217d24"}},{"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":"evals/evals/01_error_fixing/lint_010_unsafe_getters_setters/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"134644dd2233ccdea8ba4b38c9e72eb5a17c4a0ba253b76d71787b5ba1f14f1a"}},{"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":"evals/evals/01_error_fixing/lint_010_unsafe_getters_setters/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43f6109346f10a07d62911d140dfb05837f71a567711c5491b5b69012b9f50"}},{"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":"evals/evals/02_unique_features/component_012_call_as_function/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05344fe385ca0ff636ac53b77ea12ac1282ca0b28a2f99fa52b0a7db7b25c209"}},{"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":"evals/evals/02_unique_features/component_012_call_as_function/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd8f19e9d17589070cbfc5a167563244d05bf34fad9d7946c511bc0dbbb22e6"}},{"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":"evals/evals/02_unique_features/component_021_import_typeof_generic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd356b71ff156a6b4b59bbdf35a911dace01495b5a62faa2994c8603e7ac572"}},{"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":"evals/evals/02_unique_features/component_023_migrate_default_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b326751f32c1a45b8f3c1fc0391d39a122a68b75fc88bbf7237a4b4bead3860f"}},{"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":"evals/evals/02_unique_features/component_024_migrate_renamed_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0ec7ab95bd7d85c0bfe8bc95a42b198e9e75e5440d718ff391524560a71ffc"}},{"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":"evals/evals/02_unique_features/component_027_migrate_generic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff2ec73de9bb3e7b14f0614c486805bdc0dc7be5492f6207beaa8d751b47e79"}},{"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":"evals/evals/02_unique_features/component_028_migrate_rest_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0893af2a002257b4fe25f9149a29e999d432db835edb1654086fc7104745a6"}},{"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":"evals/evals/02_unique_features/match_002_disjoint_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30e19ebbae17b61aed54fbaf6a5a667fcf6e442352eb49e23dc3e060f8cf1ef"}},{"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":"evals/evals/02_unique_features/match_003_nested_tuple/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3768712b17a022622ac771dfe1139d28b734e287df0842694233308d722475f"}},{"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":"evals/evals/04_ts_to_flow/opaque_type_branding/ideal/ids.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c2749e2cb943e20db483dc7cf46ab80a8cdc119380327d5b1f7f69d8717868"}},{"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":"evals/evals/05_code_generation/modernize_007_readonly_collections/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd1c119feaef2d5cd9a2770c4fde123b093815c1883c33c7bc16fc6add5811e"}},{"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":"evals/evals/05_code_generation/modernize_007_readonly_collections/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb066eccf261876e68402959fdafae2d268961ed2dbd5b7936e77c64075f12d"}},{"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":"newtests/lsp/selectionRange/class.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111d53713d19bebd1844283f383acf91899a4d56ad27e3f4e7797cadc239cadd"}},{"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":"packages/flow-bin/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee1f3799559394dcae03a6ca20716453a18e74c53f5e17b4a2dbc12a4f69fdf"}},{"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":"packages/flow-for-vscode/src/utils/findDocumentFlowconfig.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9058274abe891aebded9fc33458983027ea298b2ade965a18889652361a950"}},{"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":"evals/evals/01_error_fixing/error_014_method_return_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7b63262a0dee4d691ec5b5da7ee3bcaecaad46cc84014f76b9a897cc2283b"}},{"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":"evals/evals/01_error_fixing/error_014_method_return_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb297c7025ab5d2a4c86f7cf3ec24e6cb8283b921dff00fa96f926c8b2e70e23"}},{"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":"evals/evals/02_unique_features/component_021_import_typeof_generic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ce48712358af287d55fb9ff4771725cc5ccc004e016be06c284a32c865349"}},{"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":"evals/evals/02_unique_features/enum_014_migrate_keymirror/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d13fdf9b80baccd957abb30b803e612bc039889ec08d36c6dc6597f97abc7e1"}},{"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":"evals/evals/02_unique_features/match_013_ternary_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89c8820d19619ffee4dd66d8b9b340cfa26f65416de2a905fcbb8f568e9a74a"}},{"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":"evals/evals/02_unique_features/module_001_import_typeof_value/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c30ec223c8a798b7e0257c09adb145e6fd4c95a572ae815a6cfcb1682a3ef7"}},{"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":"evals/evals/02_unique_features/tuple_001_inexact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98adaf95ef5384f51c6d29781f9901238eed9eaada037729af0be9c6b5f1efa"}},{"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":"evals/evals/02_unique_features/type_guard_003_one_sided/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9691a27919f9e15b38a5b44df3b0cdad31dc6b70962cbe7adbc83dde129a286"}},{"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":"evals/evals/04_ts_to_flow/const_type_parameters/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9f1c8a9dbded4f875f27fa06639ff0c6b700fc5b8242574e496dc2450a998d"}},{"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":"evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19684e07276f1318f2c5ab2d8ba52605e6060167cdde993b2be527ec98d4ff0c"}},{"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":"evals/evals/01_error_fixing/error_035_var_null_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f84ace4b15f0337c83da155e55667d53b063c8d1209275558fdb286aecdb2d"}},{"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":"evals/evals/01_error_fixing/error_035_var_null_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c842abce22a971b176deca731a74fb0073dac5875f5d260876fddcd553cc8fc"}},{"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":"evals/evals/01_error_fixing/lint_008_nested_hook/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dd8cfbe35bffa040bb2668522d3c9b5ce3b7fb5e14d5885889cb2c508d4a0c"}},{"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":"evals/evals/02_unique_features/match_009_multi_sentinel/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1797eb92ee503b34dae46b6c3c30fbffa4b2500010d8f24c0f7cadaf3c275325"}},{"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":"evals/evals/02_unique_features/match_013_ternary_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2983074cc5f78b203f8731d47d0a76e2dbe023492c2d0e61d4b084f00cc8c82a"}},{"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":"evals/evals/02_unique_features/match_014_optional_property_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d14e63a142930676f59579f3834206fdd874c2c272d27599a3a9990caf5f9"}},{"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":"evals/evals/02_unique_features/module_001_import_typeof_value/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a53ee5ae5a8fa8e3bbfa75e93d880cee5ad48e9cf01c7e7ed8f1c9bfc119bf"}},{"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":"evals/evals/05_code_generation/modernize_008_mixed/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bda11cb007d17af05fed85ab341aac27ab734e53ad6180e249663f8fcd73e54"}},{"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":"evals/evals/05_code_generation/modernize_008_mixed/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f302adc4304fd0a9e5f280f7282cd5932f87c87f9532bdada916fcd186b013"}},{"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":"newtests/recheck_parse_error/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cc8d17f3448666a9ca52330619c4b412c8829be8749de8c4119a99f66c6b3a"}},{"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":"packages/flow-for-vscode/src/utils/checkRelativePatternSupported.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2bdff0df6a3d03613d4ec7288b9bab6e604fdd0c1f037b7e3f2a4e67dde41c"}},{"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":"evals/evals/01_error_fixing/lint_008_nested_hook/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"546cbd1515858106ad6f51f20fd3ae6f861bcb3b3be96bc989847eda5eb619ab"}},{"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":"evals/evals/02_unique_features/enum_012_cross_file_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b6f0e885413c5a1cdd299f54834c2213f00dcd58546aae19255a37f0b504c2"}},{"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":"evals/evals/02_unique_features/match_001_basic_exhaustive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8a010bc18585c71b86d4f5dcca8f771ad4559a3adce8fe58b582c7ca07fc84"}},{"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":"evals/evals/02_unique_features/match_028_tuple_multi_var_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62baa71fb92d22b4bca44d3a072cc7ab6e13f5a2322a55058e84de88738e06c5"}},{"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":"evals/evals/02_unique_features/match_031_literal_property_names/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6524daf59d559d4685248882ef94ceeebc79cece8559d392174efd04f835088"}},{"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":"evals/evals/02_unique_features/typeop_001_keyof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb081d1857aa1aa1b964877d77fdd0a99d1a2a027fd2f4974ece2874d2ff1ac"}},{"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":"evals/evals/02_unique_features/typeop_003_indexed_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6e4f01c39044160686219a1aac168f6e5c8b749e5255f27bb78ca2b5f8c3b3"}},{"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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145118ae5225178cf3323cc0324c1f4e4b676038cc1da9fc1ee87094ad4b26a"}},{"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":"evals/evals/04_ts_to_flow/void_vs_undefined/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e7cc34adae841123b87524da856e6db653722024832b4058bfb20b08a8155c"}},{"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":"evals/evals/05_code_generation/modernize_001_property_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2228d7f4b3eeba967f930ac2d1c94947d9f6021b562749e5743e209f6c9997de"}},{"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":"evals/evals/05_code_generation/modernize_001_property_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3282cdffaf186e069cf74ba9270045364bd668d487b0c24018f3e4488f4a6d49"}},{"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":"evals/evals/05_code_generation/modernize_003_keys/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ab5fb9f972cb122d1cd74db162a00a780ec466081d26e09480eaf9d7b0e3e"}},{"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":"evals/evals/05_code_generation/modernize_003_keys/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f570eb3362cf5708296c23e505f78da0d84f21b74248fccea50a2994aba873"}},{"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":"evals/evals/05_code_generation/modernize_004_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba51e465bb1f9eabebb44f007a4d07d065254442c6123109832c007767895c"}},{"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":"evals/evals/05_code_generation/modernize_004_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c31b9d2120a7bb132999b6296a45b72fe8eb7e8775d45bedd327e3439f79728"}},{"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":"evals/evals/05_code_generation/modernize_011_objmap/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5299f52e926f31e3e86b96c1f89e32dd9b99dc3bd6df9217b01938e7a1eeb5"}},{"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":"evals/evals/05_code_generation/modernize_011_objmap/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68053662f0825722501e3095b794ab31256eaf3416b1aea398daf2278f03e050"}},{"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":"evals/evals/05_code_generation/modernize_016_call/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"561a6e12d02d6ea9b28dfd03d90abdf4aeb21ffd4aa6f1fcc7e439cf6b0499a5"}},{"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":"evals/evals/05_code_generation/modernize_016_call/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9fa44038a974794b5fe647f6672e67b2368288c539d0d50d8870ab17103484"}},{"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":"evals/evals/05_code_generation/modernize_017_checks/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5567849659ed9a25b3b6d51edec3ba198769aa61050a57d4fc50759005134b32"}},{"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":"evals/evals/05_code_generation/modernize_017_checks/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba6d52e5d5e7478f0565ecbdb7c57d49a2c580e11c82b13b08e40074792756a"}},{"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":"evals/evals/05_code_generation/modernize_018_partial/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e7dae811fcb9f2ef78e5b86e1911b859c17ac762ac80c17d91b85068740f8"}},{"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":"evals/evals/05_code_generation/modernize_018_partial/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9d80bb49e2eb280313f5ba7a9922e2aed45626f93b3ca55f298fe9ceaf62c8"}},{"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":"packages/flow-bin/cli.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9a16ad86bb6e0df93e4d74313732f333756064d5fb3d2863460f6c6dc1bd00"}},{"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":"packages/flow-for-vscode/bundle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd23d350049b06f67f7fe356dcaa46df164401b6343a57a044301abe9df8a977"}},{"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":"evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e0334accfbae078bd5fbc0da050ddabce8dcb17cdc5102fc9fd24b6c7ed1e4"}},{"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":"evals/evals/01_error_fixing/error_016_underconstrained_instantiation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e025d56ca002a8a87e04ef83e6f66c3c2ba8938da0f2a3b4fcb7dd9369ed487"}},{"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":"evals/evals/01_error_fixing/error_016_underconstrained_instantiation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a94385a1f1694782d0f4138e60b9e2d33e7226f3dc79c69bf0668a37963bf6"}},{"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":"evals/evals/01_error_fixing/error_018_generic_context_var/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919b94ec5bb1e10deec0f981b174c9d768211e1968ebf3275cfd4a07a4c3a7d"}},{"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":"evals/evals/01_error_fixing/error_018_generic_context_var/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1496145a89d2c6fcb1a032205c977f179487ea2b115d178dbe47e9cbaa4c9876"}},{"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":"evals/evals/01_error_fixing/error_028_primitive_into_interface/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce3e6fb9c60dc412aaabfd5102bcac7472928fee49016fe4b2ce226dde0025"}},{"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":"evals/evals/01_error_fixing/error_028_primitive_into_interface/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af31b7efba4c5f3921042a0fe83f6f56306241c9326c90b80a10fa7c5850f699"}},{"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":"evals/evals/02_unique_features/component_011_missing_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42869c017b73456cb59f0c5411d2e3ce34d06d8664e5a3b06350bd4f6bcac151"}},{"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":"evals/evals/02_unique_features/match_008_guard_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84cb8da47ab8eb8b8936c544074e26845e981441261274f4c045beae53f2322"}},{"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":"evals/evals/02_unique_features/match_012_switch_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fcc5e01b7463fdcc07dca2ff4f13b11f58b66d7845ce9e866aa910bcf08d85"}},{"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":"evals/evals/02_unique_features/match_015_multi_var_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9d16bb53e8a2c0e335ed1e07f0d817cbf4e5486d2fa15e721d019ecc028a67"}},{"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":"evals/evals/02_unique_features/match_024_switch_assignment_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc65845bbfa65f399c598ba4ea1f0dfa384e25aeb4bd83a7e03f65043633bea3"}},{"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":"evals/evals/02_unique_features/opaque_002_module_boundary/ideal/Email.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8423a62122786e9c0111164f22abb694f50f33f8bff5f5cf3b3bc8dc54018f94"}},{"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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf02a952bb2e4d656754f8d859689424bac5c725a1ac1d9d17a9146d4ffc3d0b"}},{"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":"evals/evals/05_code_generation/modernize_005_readonly/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a870d6537ec72a1939be9cb41ab306baad84a01ab97cc729ad9c34d34dbc1"}},{"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":"evals/evals/05_code_generation/modernize_005_readonly/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fcd9951959e4063c0e7b2f0db3172ec0f7be38e92607c5735bb0f722f8be6e"}},{"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":"evals/evals/05_code_generation/modernize_012_objmapi/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66405ac0efa4a2b6e5ac1d0f7cac128bb20e33c8f7e4021cc1460cb1b5a4752"}},{"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":"evals/evals/05_code_generation/modernize_012_objmapi/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9f378c49c8d94e5ef5501ffa7553997bedad1ddd18a11d2f6125d61be2e46d"}},{"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":"evals/evals/05_code_generation/modernize_013_objmapconst/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cd33703ca553dccd6792c8be4e040cd1cb1acc1e21f83234fb4256123d286b"}},{"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":"evals/evals/05_code_generation/modernize_013_objmapconst/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492babfe577983ae99b9eaed38f1e6b2d5c9c4164f4061e06e331f6d311fcc3"}},{"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":"packages/flow-for-vscode/src/utils/assertFlowSupportsLSP.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f4f33e8d5886f1f84d4a8916bd745152e63cd3f5f1dae425d03d266db0f0ca"}},{"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":"evals/evals/01_error_fixing/error_011_unsafe_as_unknown_reinterpret/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dd100857e1ecd8ea7c10f5d7b060d1cd24cfb8c2a1d2d9930677155995d1d0"}},{"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":"evals/evals/01_error_fixing/error_029_tuple_spread_optional/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3d7be011c61ed9ebd64bdb86bd5c6c2913953133919b044331ac199760f41"}},{"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":"evals/evals/01_error_fixing/error_033_var_initializer_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f952b6259aaf2493f5f08cc018c91d0e607a3850aa44d0b42e3e58ffd5719b9e"}},{"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":"evals/evals/01_error_fixing/error_033_var_initializer_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"369cf1a5ea9835e84f768d5a86e5e6be3759c990f6ba75664b1343937ef423a7"}},{"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":"evals/evals/01_error_fixing/lint_001_sketchy_null/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4774fb07c5933a2cbef28d0e979a09e4bd3f1c5fe926a9d917ead17858d5c4"}},{"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":"evals/evals/01_error_fixing/lint_001_sketchy_null/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0443bf7335fdb98b67df63f971cfb30527a22267bba03529f16cd981a259e5dc"}},{"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":"evals/evals/01_error_fixing/lint_011_react_intrinsic_overlap/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc1028b084ae1fd1070a374b1d8f342d8fe58841b3451ad8fdb8a80b8486b2"}},{"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":"evals/evals/01_error_fixing/lint_011_react_intrinsic_overlap/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74850279ec43058b4cddf30c339aace69187108c31b40ecc29bd4597e9f15025"}},{"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":"evals/evals/02_unique_features/enum_013_migrate_object_freeze/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"493965e37a5733261cf31ea4d61e57d5053dc5ebfa81e4e1656fbe54ab467fb8"}},{"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":"evals/evals/02_unique_features/match_016_const_shorthand_inexact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbe3a0e1ad32c6206965cadcaf94107452ef92c74d158239d24cd5e82dc267c"}},{"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":"evals/evals/02_unique_features/match_018_invariant_throw/input/invariant.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f05fded0a1b265cd8881207e5b2dad0fc7997636cbbbaa4c55acec2c9ddb9b6"}},{"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":"evals/evals/02_unique_features/match_026_signed_number_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde8b57c1acadc040e3e618228bc19df46f2c32910e47e141336f41c830967d1"}},{"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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e69248037575777c23c602039193fcd6ccee0b5ddda367b8ac47c7443e960e"}},{"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":"evals/evals/02_unique_features/opaque_004_generics/ideal/Id.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f25f4ede86430177bd8f874060e8caa9813b6a4791c5dc1d41716585f8923f3"}},{"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":"evals/evals/02_unique_features/typeop_002_typeof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a77154843ce1b6814ea05f4b1a51bbd95f0ba4cd29fb21148c12c809f1221fa"}},{"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":"packages/flow-for-vscode/src/utils/getExtensionPath.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0927ace261e269d490e896da6a565f276c2a1723b402a1e34c19c4777c3f0c2"}},{"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":"packages/flow-remove-types/jest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c6d7088a270551a9da50aa23af7a8825ef38f5836d2caa15b7d94a45d659e3"}},{"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":"evals/evals/02_unique_features/component_011_missing_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f18e907b93b969c23698a8f9e5c7f66abe2914522a689a117056953a2f0635"}},{"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":"evals/evals/02_unique_features/component_021_import_typeof_generic/input/Picker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5565bb39e1ffa591d3d31ec9412521ba97ad721cb3549098d02752d990e0a34"}},{"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":"evals/evals/02_unique_features/match_025_bigint_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afe8bca5c020623164ce80805919e5a3a356776b3a6c96e68e206ceb2f16e11"}},{"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":"evals/evals/02_unique_features/match_027_member_computed_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dd471397117292279ebee1f4425856da2539b3d8ee6d8725deeb7aec0d2e00"}},{"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":"evals/evals/02_unique_features/type_guard_002_inferred_filter/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c452e2c0b40d6b8fe951b0f0730682d85cced900fcb0356ee7ea9064db5174"}},{"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":"evals/evals/02_unique_features/typeop_004_optional_indexed_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5accb06dd8af657123febd5aa8a4fb33a9992b82e39fd681b0b403d8ee72583"}},{"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":"evals/evals/03_project_patterns/relay_core/ideals/02_activity_feed/ActivityFeedConfig.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d800b0cf2418511fd08dd3de35fa599ffd554082f0842144567705bb9f526d"}},{"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":"packages/flow-typed/hermes-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32ddb04408d6ef62bc4c15163249aad4596b756acbbc36950aca1cfb16440b6"}},{"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":"evals/evals/01_error_fixing/lint_003_unused_promise/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7d54eeb50ccca3315cb795a1ffe7b4e50c01aea8fa2adf0fcfd7d45506151c"}},{"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":"evals/evals/01_error_fixing/lint_003_unused_promise/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"296f330ec2a9a85d9bd821f76a5255a0cc1e20ed903055588433f7bce70e03e2"}},{"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":"evals/evals/01_error_fixing/lint_014_export_renamed_default/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c811d696c1d880018f2d4ef4eb542f56c99fce10f6d2a88a1098365db2a3b5fc"}},{"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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcbc0d6785d276a259870f80c9ac14f242849b9447af57c8bbed78b2dea21b8"}},{"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":"evals/evals/02_unique_features/match_018_invariant_throw/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda14eca2a512641db347b07b0eafd8eb7b57861063c928085e071459fecea11"}},{"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":"evals/evals/02_unique_features/match_020_maybe_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a373758a3779a32acaef027df37b32502744f7f116823d006e62df00c5a75611"}},{"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":"evals/evals/02_unique_features/match_030_await_statement_body/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba91938d5088e59d2b5f3b0c9ad4dd895e4a29b7c24dea8cccd1a2c701f5957"}},{"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":"evals/evals/02_unique_features/typeop_003_indexed_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3af8bd59115e908f7d09edb69f0030ace09f5fd7ef8a8149e0bafab95a27ad"}},{"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":"evals/evals/05_code_generation/modernize_002_element_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fba3ab3d7ca93367f2719f5434c3f9286b62683bf3e5e3ba311a0e8f8fac84e"}},{"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":"evals/evals/05_code_generation/modernize_002_element_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb7cd1be52e97e8b5ed5f8017a05513ba68b7664e50fc47cb663e5116175f0b"}},{"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":"evals/evals/05_code_generation/modernize_006_nonmaybe/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e938cc7b7d28ad9544f307287ea341b15a48704ac6975f275c26fc79279012"}},{"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":"evals/evals/05_code_generation/modernize_006_nonmaybe/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd75e210c31886d33f042e623539202739fffe1a9ae9bb1c14a09d80b0ba1580"}},{"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":"evals/evals/05_code_generation/modernize_014_tuple_map/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f87b68f6f876504975fc82a39bf296d6a5f4005d2bfdc814a9de93755a5b541"}},{"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":"evals/evals/05_code_generation/modernize_014_tuple_map/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de484b67ffd49177b1b85b5db1ee9538d52aa626c2af0c03829cda80779baf50"}},{"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":"evals/evals/05_code_generation/modernize_015_tuple_mapi/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08c08e3b0293cb98add4bec292817ac2ae9144e032fc00292efb993fe574d6"}},{"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":"evals/evals/05_code_generation/modernize_015_tuple_mapi/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc13b69b3b090107ce8a1d0eb9803d5cb6b64549fdbfe6fcd5b7b0b788effe55"}},{"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":"newtests/lsp/completion/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6876d1eec040504f5d5d2e824497c9011452d8c8d2cd582420426007c7c6cafb"}},{"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":"newtests/lsp/completion/type-exports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90477226a5c7f076d9c5c3087e22ffaedcae0de835172b3b011053fbdbf6fdf"}},{"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":"newtests/lsp/signatureHelp/typeAliasCall.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c74a3e88d9b554f115ece96e140e6b5e2da89037abce8b2dc7bb6181ede34f3"}},{"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":"packages/flow-for-vscode/src/utils/which.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e56aa669a48d6b2dbceee80d1173530adf5fef2acf5923e3a4878d80af17e68"}},{"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":"packages/flow-typed/mkdirp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75519b2aa1edffd063c13ee5aec4421c62b2721bab87107cf89ca0246588bffe"}},{"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":"evals/evals/01_error_fixing/error_029_tuple_spread_optional/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"601f1c3156d0a75b8034504f8b9d9d65c292a4cf7c2c8f71dd9464c07225b544"}},{"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":"evals/evals/01_error_fixing/lint_005_unnecessary_invariant/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"761bb10b2b7dfe1d831b9950fabc8a4c37675dad0395f412de6dff05c0488337"}},{"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":"evals/evals/01_error_fixing/lint_005_unnecessary_invariant/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4e8377a084587c8618d18825528c28d8799bb7c93ff928e978f881eae5f15"}},{"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":"evals/evals/02_unique_features/component_014_invalid_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc141323ae1ca8f6a516505f5efc31c7ae4ada665b6aba6169968195e044225e"}},{"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":"evals/evals/02_unique_features/match_029_guard_on_or_pattern/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76d11d8cb6707590d4b91e6b984b3d57287bb8f84aea89725cd83660be3865b"}},{"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":"evals/evals/02_unique_features/module_001_import_typeof_value/input/numberFormat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8141eaf80761626d84e155662cce261416392cec960d7c6ee44e290329950"}},{"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":"evals/evals/02_unique_features/opaque_001_basic_nominal/input/checkout.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e93770dff1a903a12a61c05878e66e871589baa81601d80bbcfab60be5fa2e"}},{"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":"evals/evals/04_ts_to_flow/conditional_spread_union/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8070f1515907ea6bbb9719e947d08933b3f8862e223f9edf5d9d2d5f6061e0"}},{"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":"newtests/lsp/completion/autoimports/AllTheThings.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbdae0b25c78b2967b08b592c12509f8a7d570399448aa0f52846509b620f1f"}},{"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":"newtests/lsp/completion/bracket.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6a8e2675c1663328c9d3e22d19b13fe9e4c43038f8b14ae097695f21fb750c"}},{"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":"newtests/lsp/completion/kind.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c3da24453209b6b528dda733aaa7b1bb0f363efaf0f445c13b546cd23fbea8"}},{"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":"newtests/lsp/queries/coverage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eec166d4a4ab02110dcc3d632544b517b0b688860cf44fb0e2522ce4c50cfe"}},{"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":"newtests/lsp/selectionRange/template_literal.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cf340ea9c31dbd1c0e70ae208afc4bf422ad97a1aeb68d992f5360da8a05f4"}},{"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":"newtests/lsp/wait_for_recheck/coverage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fd33ed7b84c5110ac4551f27c090c993b6307b0dda00d54d8b631e59f155cf"}},{"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":"packages/flow-dev-tools/flow-typed/flow-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3903e477eac39799d9c219e14bf7abd3254b66daea295d128003c1054260cd6"}},{"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":"packages/flow-typed/typescript-eslint-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"402efee49d2e81d5ec3d739857d683acb5ee15b9af19ee0bda921bcd8c78b258"}},{"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":"packages/flow-typed/typescript-eslint-visitor-keys.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dd414d12bf8865c4901fefeb885f13b82bbc433fed093eb699ca3b99fbabe2"}},{"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":"evals/evals/01_error_fixing/error_013_missing_param_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c2fa6105f36909d96ad7fd95303198b41fbe11e7ea59c3dfb6b0984dc37b89"}},{"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":"evals/evals/01_error_fixing/error_013_missing_param_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f28b00328d4b6802010f667ad1e8f3e1986ae5f5bf801ac7422f32179fad0d4"}},{"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":"evals/evals/01_error_fixing/error_032_import_type_as_value/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfbfef5e9985885f21c59545c8f77898d3b2cc8ebae6331bcdc4dd29ff2da12"}},{"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":"evals/evals/01_error_fixing/error_032_import_type_as_value/input/user.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d021823c42526882ab2051c219227fe28dc5f0c8576b64d7cb4a6e82db43036"}},{"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":"evals/evals/01_error_fixing/lint_002_sketchy_number/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2022d7cd6390adab6017ae9e5d2f141b6d4867685bebb56316a3dd7a502f6eef"}},{"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":"evals/evals/01_error_fixing/lint_002_sketchy_number/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc94cd77a425311a53229b883f9e71cf8590b5a28708dd5e7a281b6136cde9b1"}},{"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":"evals/evals/01_error_fixing/lint_004_unnecessary_optional_chain/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d2d35df4aa1033583a136fef6150a86757c7221a005a4a4e11dc4160a14a5d"}},{"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":"evals/evals/01_error_fixing/lint_004_unnecessary_optional_chain/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682c8d71780e20de8ac16a281d356332ee165e3726154eb30293b018d70949af"}},{"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":"evals/evals/01_error_fixing/lint_014_export_renamed_default/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d2255add36e7130497b1cdde02c40b367dfec82ce1d29a81bf630c580b5e39"}},{"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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a5c036756c9ba4a71fe82bd19ce8aceb7fb048ab853301bc10d4d830c469eb"}},{"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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0953954499bb1a420e66a885c6aebf1a6f2eb71d68ac9ab31cac44c6b72accf"}},{"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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/input/Consumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e1c36dda6bcaae4b26e5ef186fecdb0c138c79c89065c158c214db3bb2d576"}},{"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":"evals/evals/02_unique_features/component_014_invalid_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70ffe97f243a802f04be79809b6b206e6da48bf284a53b13662cb9f773be520"}},{"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":"evals/evals/02_unique_features/component_015_this_reference/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7798497ad0fdc47c068d538ec3c3fd4ddc8e3afcc9cb23b5ed1a114f96c0449"}},{"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":"evals/evals/02_unique_features/component_015_this_reference/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceda1c2e99b7bc63c1de69b84e6fb9feca36f8a2bd23ceaf5dcce0a2bd4be0d2"}},{"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":"evals/evals/02_unique_features/enum_012_cross_file_import/ideal/Status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdce4e23e2b28b47ee4a4d8b80076587875b592782bf1253d2ace24eb2167df"}},{"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":"evals/evals/02_unique_features/match_002_disjoint_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c5ffcebef6d066ea5fa8086302c6f8675e687974c8ad2202e211037aa6a900"}},{"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":"evals/evals/02_unique_features/match_003_nested_tuple/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd633dffa99a2b3cdf10e0f915c13e934502c0091ad62a74b15c1df78a1e82e"}},{"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":"evals/evals/02_unique_features/objtype_001_type_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c57b2858b55a411ff43eee560000810c54932332c7543f3f78efbe94d27f78f"}},{"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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/ideal/UserId.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529c1e0984f84f922adfbdd82efc78bbef548cd1fc206e43a91bd5b073e47fe"}},{"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":"evals/evals/02_unique_features/typeop_001_keyof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8956f1b5ee17f1064ffdc25618dda9ccd91ea44428f457bf6f6440e2e097df3"}},{"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":"evals/evals/02_unique_features/typeop_002_typeof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488293d34dd0addbaf00d2c1af922f274f8281969fecadd19c599acc505c609"}},{"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":"newtests/lsp/signatureHelp/constructor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17852946ee4d40f31579b568b886284efe791bf313485ed1ae6037794f982e1d"}},{"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":"evals/evals/01_error_fixing/error_032_import_type_as_value/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f636dba65f28f8576bb374f0a9af12b6e90089728b6e85a32000372baaeacba7"}},{"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":"evals/evals/01_error_fixing/lint_006_unsafe_object_assign/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe4b4e3bfe53c428e99415b671c27038d3558135744bcdfb3d3dda8dd6d4fc9"}},{"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":"evals/evals/01_error_fixing/lint_006_unsafe_object_assign/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b622272f030f94d4f2e105bb6a19e1d4bd6bc796ea333ca98fe2b78944709445"}},{"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":"evals/evals/02_unique_features/match_005_object_destructuring/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf79962a6f47ccb4fd6d4f9f503c806b7211061b6305b09a7bb99ac028f672c3"}},{"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":"evals/evals/02_unique_features/match_011_match_statement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ee4863caed91c60b35129f62e1c532369811a01f035c979235b88a3efb73de"}},{"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":"evals/evals/02_unique_features/match_031_literal_property_names/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1dc8f6afb3976f0d21dc247470aca7ebb219e8d9a2bff7fe534df1eb3c9847"}},{"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":"evals/evals/06_config_tooling/cfg_002_expected_error_suppression/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec2f2876cd88c7b34b9f488c905b33e6edb05e29b90ddd38021ea552fe80fd"}},{"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":"newtests/lsp/completion/completion.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fabce178fcfeb30d34c3c5acc85b98e779c94b33c848ceba3c7927992f092a2"}},{"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":"newtests/lsp/signatureHelp/paramDocumentation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"849969a3fc5a962849b3030e65bd7f49d590ccd6a97c10370d9ecaec8e1e621f"}},{"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":"newtests/lsp/wait_for_recheck/completion.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d73e1ec768092f8797a389ab9b487bc4c1b8c95508e0bdb3221fef27cb3d97"}},{"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":"packages/flow-typed/jest-specific-snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ebd5e92108d9f6f5b5598a1722f0325f77e23f65737bf5377cc9a230d730e8"}},{"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":"evals/evals/01_error_fixing/error_017_export_signature/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82501b2eded47194203bbc944722c6246abe1db714c58dbc302632f759a4e4f2"}},{"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":"evals/evals/01_error_fixing/error_017_export_signature/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7931c361b659f6b506e96b7d9da164a5b855d70dbc9a35d4cb66a0c3c07ea0f8"}},{"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":"evals/evals/01_error_fixing/lint_007_internal_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acb58f7cfc3894014b2abc1dc5aaac141afae8f74426e2ee84f687963baea00"}},{"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":"evals/evals/01_error_fixing/lint_007_internal_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b141dfdc79154af5de1a648f86210a996b32baeb8f0ca4151fe1502b97f1b3f5"}},{"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":"evals/evals/01_error_fixing/lint_009_unclear_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0f7c16d225bed78420aaacedec4d9440a8ce045a39ab2932e2f4625557f01"}},{"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":"evals/evals/01_error_fixing/lint_009_unclear_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec63778aa72499ff0f951aa1086831c07d655e916e3380d8fff029c9fd18076e"}},{"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":"evals/evals/01_error_fixing/lint_013_this_in_exported_function/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fc35de6d68fb5d69b814f3c80458413f7fdd8114c3e08716a6a38df3dcf49c"}},{"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":"evals/evals/01_error_fixing/lint_013_this_in_exported_function/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a830658ae12849c3b4dd295d69cf8531c1e6d2af79afefc98d31a2b511d5665d"}},{"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":"evals/evals/01_error_fixing/lint_015_default_import_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f57a76421ed886c77770696d39d7d5e0efcdb617e5def8fc0ad4b874cafd6"}},{"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":"evals/evals/01_error_fixing/lint_015_default_import_access/input/Greeter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5212b5ccdb90f9465979500dc7ba3093ef7909115f8231fdb2aaa35422548ca5"}},{"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":"evals/evals/01_error_fixing/lint_015_default_import_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8563af4a49b176284ef4d209998251d7b29a400794f694ae09b34ca337d491a"}},{"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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/input/Formatters.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50853f4a92b313d4c2427086e575ac1b9a5dfe2ef5c9c7fd81bdbcb7c8cd44d3"}},{"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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c8b67a9e1ab912a72f04158936fed0fbc0a42b46eafbcf8e3217747ceaf953"}},{"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":"evals/evals/01_error_fixing/lint_018_untyped_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b58f0078faf2c9a69586d99e09b8ee8a26f3c2a69e7222827a41c550b3bd96"}},{"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":"evals/evals/01_error_fixing/lint_018_untyped_import/input/Consumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacfc6d07bbb17a2ecd83d2fc85854ffecc7af8c9ac18a4b2db38ccfe238b02a"}},{"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":"evals/evals/02_unique_features/match_006_as_pattern/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c25a9a0c5de4b0645ec1ed9fe98d6eace17b043ff4e1369cdd7c5f59e6d127"}},{"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":"evals/evals/02_unique_features/match_009_multi_sentinel/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fce0ff676fd4dd20012fdbf41db256855048766d64ad86adca1d115a519ce"}},{"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":"evals/evals/02_unique_features/tuple_001_inexact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5d78020e10e93003230cb368d5f56c6a9bdf1f1b14af7a4e15413aa94b94a5"}},{"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":"evals/evals/02_unique_features/type_guard_002_inferred_filter/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0936eb2ffdbb27a0d21471f1249bca6933b10a986c92c89d3a0340ca5cae53cd"}},{"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":"evals/evals/06_config_tooling/cfg_002_expected_error_suppression/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39258bdf41f2f860f237aec2b4abc2a83aef701db362d34840a130af2b5fca5a"}},{"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":"newtests/lsp/signatureHelp/nestedFunctions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fada82e0f5eb2a9321471ea1d4253dbc2b93a72c1f25a6dacdfc468ac5ea8"}},{"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":"packages/flow-for-vscode/src/utils/getFlowVersion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cfa2cbd6431c09c88966bd637f23895fbf0bacce5ef59d88d0389fa5faee00"}},{"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":"evals/evals/01_error_fixing/lint_012_non_const_var_export/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"477dd6b9468f788c244e17609344db8277d18c41c175c1caa79acfe76185516f"}},{"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":"evals/evals/01_error_fixing/lint_012_non_const_var_export/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eac68548d109209801c62622e798991d954ca89c9543349bb23a5722fc0afeb"}},{"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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/input/Box.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f075b48543aceb7d2a975a2a3f84f108a131fabaefe1b65a507a36adecded2"}},{"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":"evals/evals/02_unique_features/match_019_tuple_matching/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5667768aeede4486f5d86ba35bb710fe77b3bb185cbc3d7d64c9fdd73039a2bc"}},{"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":"newtests/lsp/completion/params.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da32a7b6ebc85974f26ceabef4fa789436a8ac0fd1c7b3e7e098b2d2d076e8ce"}},{"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":"newtests/lsp/queries/references.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"570e05390ecde8ac4db30fbfbf0cc99e8d197c932727c7570a9c2217271abdd9"}},{"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":"newtests/lsp/selectionRange/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f216fadd20be31c38a7af6b83645c1e97a4263f5235751cff1bdad5a4e28edc"}},{"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":"newtests/lsp/wait_for_recheck/references.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bc9f57db9a5e8ae6f7854ddd0c3bd04bfc2b425508d19db1b70200cb58ad90"}},{"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":"evals/evals/01_error_fixing/lint_018_untyped_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13bd23b782e9456469da20410ebe2d048339883eb2883df9f2a12aedc3a2f0a"}},{"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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a495b7dc9531566d053cc72828ba63d2e71c9ac96cb26ae0174e717e92515e7"}},{"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":"evals/evals/02_unique_features/hook_003_hook_type_annotation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a00915a1f9bc39e27d7d642fc045d8cccb9fcc8b2b2d2ad002fce31f9fa3a4"}},{"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":"evals/evals/02_unique_features/match_001_basic_exhaustive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c903c12df3aca2e806e25618ae859bd1ebdf5f78163bd9e89b72187a7eb00d34"}},{"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":"evals/evals/02_unique_features/match_008_guard_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e50254cdbd7105b4243e420e1a4cd9862494a6d53be471dfcdfd4836e01b2d"}},{"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":"evals/evals/02_unique_features/match_014_optional_property_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca177b640d8048162177afea12208b9725f75ebb210339b5aba8016e20709c"}},{"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":"evals/evals/02_unique_features/match_015_multi_var_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50382acc00a3c64a8ff9d08d0899063005347de44e266f92a1c6a67f92bcb6d5"}},{"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":"evals/evals/02_unique_features/match_016_const_shorthand_inexact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0b6b2c9ce7dbbf9cdd706661425d628cbd16a9b251f0a0d0f658b1a45764f"}},{"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":"evals/evals/02_unique_features/match_026_signed_number_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3179be0f67026028aab66cdfbbf127ce8f87c7a34ec535ddb42e389d3fa2046"}},{"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":"evals/evals/02_unique_features/match_028_tuple_multi_var_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0fb491c72dc7441c9ce2b71820cde80b0cf3a4c2b4544b63a9458a8679b87d"}},{"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":"newtests/lsp/completion/jsx-attr-with-value.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0e8ed61d6000ad5e95df42092c487df26797368be9cf5b17654ca75d096306"}},{"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":"evals/evals/06_config_tooling/cfg_003_flow_strict/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c962848b26a65b91139449ced70f411ccda2da0b9d742f0cab43696d72295c"}},{"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":"evals/evals/06_config_tooling/cfg_003_flow_strict/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6e2d3e204673470ed10c8a602dbe8aed7b82ae18cad13d8d46b0a4c12587bf"}},{"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":"evals/evals/06_config_tooling/cfg_004_flowlint_inline/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd53395521edb2764fe7b98851152df95b15c570704c45ff3f0819334dbed6d"}},{"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":"newtests/lsp/savedStateReinit/a.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"430f482f2ade3b5ab4fc33ba30f9f8fb54bf28140c84612a34eeffab0ac30f1b"}},{"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":"newtests/lsp/selectionRange/function.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ba3e25aad287553d8a336879d4569ac4b3caff256656317c5456cb4ec9b6d3"}},{"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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cf2445fc439324170b91186a442a61be65e9efae4a672fe23f4351c6922c88"}},{"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":"evals/evals/06_config_tooling/cfg_004_flowlint_inline/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cdf492ad8645f30a97ed4a615522d718850e80ef5f5d1b8697e15659028481"}},{"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":"newtests/lsp/completion/completion_metrics_collision.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f17691cc3a13f539bea943aa066eb64648f0720a101c50516970b1891a2d41"}},{"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":"newtests/lsp/linkedEditingRange/malformed_jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4915a576d46a9d485239c4c502eebf577dd7f1bab725d8f1d2d63082b758bcf7"}},{"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":"evals/evals/06_config_tooling/cfg_007_libdef_globals/ideal/lib/globals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee5c988bcc90356f604b62524c11a10b822ff5470875f9a8f71c946d3241a05"}},{"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":"newtests/lsp/completion/completion-metrics.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ad354eccf2e2f9ffa25125a0b1c018e6cb7fa2f4f78bbaca438dec6739a4c1"}},{"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":"newtests/lsp/queries/definition.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a280aa20df0e3b92877232cabeabb769a37837301893c00bbc91cda8ddbc8a9"}},{"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":"newtests/lsp/queries/hover.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae0639a9e8dda5ca6a62c6e9559cf47126d6065d71c2ecdceaa30b0f1ab48b"}},{"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":"newtests/lsp/queries/hover_refs.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472fe8302c5d6654f81db0922123444f4e2b20989c41bc6e67c62dd1f347fcf7"}},{"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":"newtests/lsp/queries/references2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e33dbc7d1bc262cf7ea14f1ed8799d76c8d3e015f67708b4c24fcdeda043104"}},{"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":"newtests/lsp/savedStateReinit/b.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ccda5811c46af986f0bc94e5191fee85632a385f7a9551a20a536489b1223"}},{"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":"newtests/lsp/wait_for_recheck/definition.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c552c9d4b1b7cc2fd04840038238e2f956c5dc3e727a3e13e8ef2db279ce0bf"}},{"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":"newtests/lsp/wait_for_recheck/hover.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1d5215e196f6049e17638169c424f7f49a7835d32f6174d78432ed9123cf1a"}},{"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":"newtests/lsp/wait_for_recheck/references2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d039556615d6f65130ab4587b89ee387c78df4515a8a72e829ca1a4dc42c00"}},{"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":"evals/evals/06_config_tooling/cfg_007_libdef_globals/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5896e05e7f609ae811c9621b1c051265e9e5794e5c900047d8aa173983ff28"}},{"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":"newtests/lsp/completion/autoimports/lib/builtins.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ede325ddb0a10bfdbabe719624bce8997a6258f188517453672a417568512b2"}},{"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":"newtests/lsp/staleTransaction/a.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee63a7c28a397404ed5a8b7722b6805493fea53bac4f54c4c72c49bbdfe6106"}},{"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":"evals/evals/06_config_tooling/cfg_001_flowconfig_module_system/input/Discount.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a6b25b8d2cfa3c21aa3f74bdd4512740feb63620740296f7323d26ae45c796"}},{"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":"evals/evals/06_config_tooling/cfg_001_flowconfig_module_system/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a551e2bd417ee0275d5d99664d4328591d5a7ffbb63eda2a4199a428dbc8a4"}},{"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":"evals/evals/06_config_tooling/cfg_005_declaration_file_shadow/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"061a6bdaf0e4345e8d28b3bff3ddceb18f7cf4e5fbab632371ace539d50fefdd"}},{"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":"evals/evals/06_config_tooling/cfg_006_declare_module/ideal/flow-typed/list-utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75896b51ba7d437e3fd67d4e7f31f888fe581f78d1c8d56c1bfa1ae1e66ec2b"}},{"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":"evals/evals/06_config_tooling/cfg_006_declare_module/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa62cf67754caa7881ac41c87896550838e385bacac97b6b9261b7e88d840c59"}},{"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":"newtests/lsp/auto_close_jsx/nested.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30773868bd27296084cf42223870fee87710ae201088ee8beb7b62d517943d5"}},{"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":"newtests/lsp/completion/autoimports/foo.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b113485b20421f316b094ae2a499608bae08f2ae8165bc29803a0b01cf1a75"}},{"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":"newtests/lsp/completion/autoimports/foobar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0baa0b6190ce314592af2adaf2222af8953c8109dff14d6826754cfbb66f6e"}},{"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":"newtests/lsp/completion/autoimports/lib/scoped.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20a43756120505f20249a734c427aa936c30a1c237cbc235ef0066dcdff183c"}},{"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":"newtests/lsp/completion/node_modules_auto_imports/nested/bar/baz.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106059d92f44cda6993ee43acdce970a3532643dba3504ecd415f21a017f557"}},{"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":"newtests/lsp/diagnostics/nodeModulesConsumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd5c59081dbb0ff5c624a34291a3db8936b38ef79d22a1748ca80eaf99fe759"}},{"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":"newtests/lsp/diagnostics/witherrors1.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76dded551483aafd620aacecd4b195124d572bb3d821563b0101c4f61962741"}},{"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":"newtests/lsp/selectionRange/array_spread.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd7c81f09fae01460f0eae68cce8cbddfde140f3de041cca36e46cbf580e0a5"}},{"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":"newtests/lsp/selectionRange/var.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d16320b3f0d208033697772a64e8506f3cd7d69d169017d45df2356e85a1a88"}},{"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":"newtests/lsp/signatureHelp/nestedClasses.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006f7eec93e14d685e629cd1447275757eafcf792706ff9cfb5851f4ac9e957"}},{"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":"packages/flow-remove-types/register-esm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c775716283f59473325e36c5262fe28df7fa44f6741591c54475ca00e4fa2d7f"}},{"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":"newtests/autostop/debug_sleep.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9029c2c2e633d36476d75a6c1cd16882c68062dad0fa0f06a2959ad714ced3"}},{"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":"newtests/lsp/completion/autoimports/types.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e4d0aadb79a4eba888cdf00bfebb82b1cf449a031869a26ba1784507e21a83"}},{"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":"newtests/lsp/diagnostics/witherrors2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca0e1228a837f0dcfc36e65039dc3fa1324a2cd84c851f1f502e6c3b22db753"}},{"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":"newtests/lsp/queries/coverage2.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e5bee0972ffcb3a215c394e9de587a18b8dd612216fa3bec0cce1b4d298929"}},{"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":"newtests/lsp/auto_close_jsx/basic.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec5dbe9848d4b684fe5c541b0628aa02a5af95f1caa94fd3c14e456c9f78f33"}},{"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":"newtests/lsp/auto_close_jsx/props.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c958524297fa572b65f4e0514d1fc9446a040dde3a7f7f50eacc63f85d9211c2"}},{"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":"newtests/lsp/completion/autoimports/actor.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837c3f3c05e9756cd68ca86c2ceb13d250483ba7c26e2147f22cd90c95e79ffc"}},{"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":"newtests/lsp/completion/autoimports/functions.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b222ab02962007ee52f2718ec6c9a5fc62e8029b848959f2ae8ca86422a030"}},{"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":"newtests/lsp/completion/autoimports/to-be-reexported-two-levels.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2ba18569681eef4d5ec7aebfa0c413228b15b0cbb24a4196cc86316d66d13"}},{"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":"newtests/lsp/diagnostics/dependency.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f154037dd0fb3bf8442c0bedac673f2bfcb2222f706a73a365b75affcdce9d3"}},{"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":"newtests/lsp/diagnostics/export_number.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"febdc181701c74e21caa38c07e825e3d9cbaeb88c95f2bd61a683d20530e8ef2"}},{"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":"newtests/lsp/diagnostics/export_string.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaa4edcc10cf9ff559ed3edb5848b90ff9c48c14b5691c5d5dd9238d8832a26"}},{"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":"newtests/lsp/diagnostics/importsFakeSymbol.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aeb760a66fc1c2cbcc1b659dcd5d10078e4179936a708529b1f849f2a027d7"}},{"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":"newtests/lsp/queries/cached_hover.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6520024866b70440323aaeab3546ec14ec8905ad1b6d7a16eea3971684c2c883"}},{"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":"newtests/lsp/queries/hover_refs_exports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29b6154a3a532fee67f74393e2f009b1a4d6ebf40d27c397d1e62a2e0e436c"}},{"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":"newtests/lsp/selectionRange/declare_export.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b1b9251af1db899a8083c697ad9f8b56041a787be4e8e5c7188ade5cb69e5d"}},{"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":"newtests/lsp/staleTransaction/b.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd16927a28d89ed3c8ed39f0c5959bffe438ee54047d97e5f6988d6397e6ca9"}},{"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":"newtests/lsp/detailed_diagnostics/file_with_simple_error.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c438ed8af4c493ff97ec64c44671706ce6b898ed008e5926b3ce1ba782999d29"}},{"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":"newtests/lsp/staleTransaction/c.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67daf2535d89750736eec26a3ebf6c8cac97dd3b1acd6ed202dc2b7b453016d"}},{"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":"evals/evals/02_unique_features/component_001_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7f0e465c2d7cb19bce26a01773391296ffec96e52a980d616e7af61fb277c1"}},{"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":"evals/evals/02_unique_features/component_002_renders_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c689e6ebbb2c4a17d1cbbab65ba1d1f27b324fc48c1d78d9269b08f2fb58d2"}},{"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":"evals/evals/02_unique_features/component_003_polymorphic_renders/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e07bd490323fde0c3e48d9947910afb6e132704a256a62603579d73f5150dfd"}},{"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":"evals/evals/02_unique_features/component_004_generic_constrained/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa198b0533766476fba86b1bd5f418d53b42d56e18d2f17a9ce2f23d7f01eb2"}},{"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":"evals/evals/02_unique_features/component_005_renamed_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0bdfd935b321ab2bb39be984d923929902d57e66663611608000d021a49be9"}},{"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":"evals/evals/02_unique_features/component_006_rest_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5abd8a0654a88e75f0b64abd0475812168817b4552196784ea231f0920aa7cb"}},{"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":"evals/evals/02_unique_features/component_007_destructuring_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cad2985ac83405a23631d350979c81ddd3a1adf518cff268ccfc2e1e28dc20"}},{"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":"evals/evals/02_unique_features/component_008_ref_param/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"978cd5cbbf482abe0a95509499a794dd65af5c3c3d47b8fdd5c9419050656c80"}},{"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":"evals/evals/02_unique_features/component_009_component_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b0367ba4cc83cbc3989a1467e72561f2d45c4c9171fc7b9b6adc1cf9a1c224"}},{"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":"evals/evals/02_unique_features/component_010_propsof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f64797f53ec2246ddad4d15768909b723ad858bae2c706e026c02f81f4868a4"}},{"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":"evals/evals/02_unique_features/component_016_disjoint_union_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b98dfdb30ecf1070525c12b84df64e0741a3f9aa09c899195438dc03221d4c"}},{"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":"evals/evals/02_unique_features/component_017_renders_optional/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf556e9f1fecbc91462927e7e4c79c30f4cd8925b721fc804d70357ee7bafcc"}},{"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":"evals/evals/02_unique_features/component_018_renders_list/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea2dc0d88276a77445ced4f50b6c3d214251b63c3ad78e15aad8b16083d4c06"}},{"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":"evals/evals/02_unique_features/component_019_render_prop_constraint/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c33ee93ee22dd9a0eb814f3b9d6eb615eb5c081e56afc72ce6ecf3d4afe0a9"}},{"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":"evals/evals/02_unique_features/component_020_render_subtyping/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d4951b6672708064f4d7e1b4e06e252a52a1b4cb98d613deee453601e6ce7"}},{"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":"evals/evals/02_unique_features/enum_001_string_enum_cast/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ebae29f4ac104755e195b61e08ca83501d1fbd80a4d79bfea3a1b00a2d86c"}},{"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":"evals/evals/02_unique_features/enum_002_number_enum_switch/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"703ab7a4ceb4c6b2be8776a16b24cc25706c5b94ada64470c43c24ede0a807ee"}},{"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":"evals/evals/02_unique_features/enum_003_boolean_symbol/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"697b3a8074789d910c101c47f62985a2ed05aff4e3ff9bc8e5c531164a808db4"}},{"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":"evals/evals/02_unique_features/enum_004_members_getname/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f09121b415c5d3918cfe7005373f2b6c4e2fef457e01e8a0ef630e62bd54da"}},{"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":"evals/evals/02_unique_features/enum_005_isvalid_valueof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"953e3698824b3888b8e0c83526fcc1439c76cf6303d072591afca4beb784a3d5"}},{"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":"evals/evals/02_unique_features/enum_006_unknown_members/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d941527a7b1851f423b10260008c44d6d7c58c0109511b082ba736978e4602cd"}},{"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":"evals/evals/02_unique_features/enum_007_abstract_enums/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133f78848afee0b9f28d382589c7438e53f87505cf6b5c1461bd757387fe32b1"}},{"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":"evals/evals/02_unique_features/enum_008_enum_match/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"599bb8e390edea3278d107d0967684d26feb9f72a449e9b91bbe1b46c1e09fc5"}},{"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":"evals/evals/02_unique_features/enum_009_bigint_enum/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84aab307c907cc1a53c77b7832db92dd7ce789d618cc5aee390d5d2fb1b6c87"}},{"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":"evals/evals/02_unique_features/enum_010_enum_union_refine/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a1436a543f3083a5ea0465fd509241d4c82ec97eeb72d6c78016abb25f7f9"}},{"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":"evals/evals/02_unique_features/enum_011_string_explicit_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7754dbd2c9d6ff38d22b5ca3340dc79dcbc345b4829f0cae5531dd8af118c2"}},{"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":"evals/evals/02_unique_features/enum_012_cross_file_import/input/Status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4da8804d7b62676bac176766157737ef9738f670a50bcb9b56f477503b5f96e"}},{"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":"evals/evals/02_unique_features/enum_012_cross_file_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe2a4d8731dbcd892c7e9ad585a5527b8a07f0ae0dfe039de1ac9ba714ad712"}},{"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":"evals/evals/02_unique_features/hook_001_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c677694b3944ef7b5e518c2de494554ef1353cc2fc258aa3f0497a61949d4392"}},{"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":"evals/evals/02_unique_features/hook_002_readonly_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b601efc2a4630e9f56ca68667a85d645481f14fbbfca10f2f0768cc66db2bfc"}},{"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":"evals/evals/02_unique_features/match_004_guards_and_or/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b96700ef15377c53774cffb6bf2939d61605781f8075ef7ec260af8140af87"}},{"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":"evals/evals/02_unique_features/match_007_rest_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c3a939805a108b69a0bc814abad3349fc0eefab2b831ad1271d91724610e01"}},{"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":"evals/evals/02_unique_features/match_010_enum_exhaustive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eb26a6a3f83f5851ee95678a52460a1eaaa7162f23804c3a112339087fdf41"}},{"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":"evals/evals/02_unique_features/match_020_maybe_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd0cf9882a4439145aad59d2523869649dbed1e1f807c439a9e19b86b542ba0"}},{"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":"evals/evals/02_unique_features/match_025_bigint_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ee8003e2b41d0ed41675e72a92d31712a2f2329992fb4143bd31be07aa97e"}},{"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":"evals/evals/02_unique_features/match_029_guard_on_or_pattern/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d3647ee7fb6f91f50f80ea41b89797e840f1eec8033ec3ec247aa9d997ff6"}},{"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":"evals/evals/02_unique_features/opaque_001_basic_nominal/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4c1941a39b7af67db1cd51eeb3eb697591f7d90f0a0851ab45e875538b87e8"}},{"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":"evals/evals/02_unique_features/opaque_002_module_boundary/input/Email.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e282add302f63c9a7e4598894d909baf333de16fce84f11cafa4cf153ea88c"}},{"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":"evals/evals/02_unique_features/opaque_002_module_boundary/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f24cb3030fc26cd8fd26f25c55e116f0114c5063c694c5ec761a428cb1a1fc"}},{"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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/input/UserId.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5adf4791f1525d017a033f1e297d05214f012610a182712aad3c6546bfa32ad"}},{"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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536acb526712fd7b4df4c0da959cc962c314a57ba515c88f7f944d0e84c7187b"}},{"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":"evals/evals/02_unique_features/opaque_004_generics/input/Id.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ab2e0ef24f34ceada4eecc945ad9a06ff7119fa2b48698d256ff19aa301d7"}},{"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":"evals/evals/02_unique_features/opaque_004_generics/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a56403b3aace1fcaba9f5d4d84fda8263a07149b571aa8866824852bbc8d3e1"}},{"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":"evals/evals/02_unique_features/opaque_006_type_predicate/input/Metric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89357dcf88ce60171ea6668feed86e1c022122bb9f9a6be1b1194671208e0ea"}},{"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":"evals/evals/02_unique_features/opaque_006_type_predicate/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662b2c11308bbb07f3881b684b36e7f84631e50fb60e6cb5703e3a20b0498b5"}},{"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":"evals/evals/02_unique_features/react_util_004_element_ref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e685cdc6c9842fdce1e37ad0c4c4949eda6d3976f1196e584b6c47a6256c18"}},{"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":"evals/evals/04_ts_to_flow/anonymous_interface_param/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33531b5f077533354a83815edda82a83e018df422e8f3dbe23aee1667d134e17"}},{"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":"evals/evals/04_ts_to_flow/as_const_assertions/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9dfa1c68edf70eb287c98b14697391aa1badc69b5f1c0df42294e3d63fe001"}},{"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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e548c7badcf27abb593963403fd374e517026779a09556ae47b2ff3b6a1588b2"}},{"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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c48e1926197961bf4ac33f75ce9bfa22c5667b5d5f0f89eae8942de7a0c697"}},{"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":"evals/evals/04_ts_to_flow/class_private_members/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafb65023418406944ac5e12d52edb34f42c4e6c9745a3516ee726536342566f"}},{"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":"evals/evals/04_ts_to_flow/component_props_element_ref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ef8150babd8d6305590913d3c89e7eb420b80a06b32300de5e8740b87656ef"}},{"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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1507e3c2b910c4d280b9f3543c7eab0a9b51cdd66115339a933cea2c97b762bd"}},{"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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75e2f08181a70b514adb5610c2471b8aecb17074a64d39ac733efdd5f9c52c3"}},{"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":"evals/evals/04_ts_to_flow/conditional_spread_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91178bb8d9173019ebc193c610f25163bad98926d016df1825534192a3f36d56"}},{"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":"evals/evals/04_ts_to_flow/conditional_types_infer/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92513f2f3569e255a78ffffaf7e7f9d43f0b13a8a184a9d6e70d8f47d5d4eb31"}},{"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":"evals/evals/04_ts_to_flow/const_type_parameters/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519e82a06074e9cd7fcd4c7729bbef84244f999c3d24cb03a1a72ccb3aa27a0"}},{"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":"evals/evals/04_ts_to_flow/default_type_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea72fff0cceedfd69e148c9d38f4c7eba8dd18d62f36f801d0696b00a07c4ff9"}},{"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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df53b5397e9d862be8b731fbc70143bb488b138fca472c253ba3f8a1bd77e9f0"}},{"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":"evals/evals/04_ts_to_flow/exact_objects_complex/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6c6fc1097df07331c20451292d29bf0bd5fabb9f865eb1daf7c2bd3cec767f"}},{"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":"evals/evals/04_ts_to_flow/function_overloads_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9100c21c96a502d477ac48fafdbb5c449207831150fdbba6d23dec745b31a"}},{"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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"788114e390c9aa3c9d95e9fc84e09949154937fe64d4a3876b01b12a08415fd0"}},{"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":"evals/evals/04_ts_to_flow/hook_utilities_complex/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4e00595e2abf9c3ff26832ab96ad909a0d28fffd934ba790a5ab1034c9e885"}},{"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":"evals/evals/04_ts_to_flow/interface_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5e2e4eae9d6e90b367b7982b04f23e8f403a9c0f63efd63264cf688d43cc8"}},{"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":"evals/evals/04_ts_to_flow/intersection_function_overloads/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"432699bd24636d515b7f4f873188508f5104a86c9e66fb9100f9044434b2331d"}},{"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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b1513beacf8c1e72b6a117c5c7e7c64e7010e3e85bd9c4a1a0e2dd33efb6c1"}},{"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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3540bed42a643a65138ac728349fdeff88f06557d638b5deb8c7f6e4ee6b964"}},{"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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970c2c0d04652589392960ae259b8ced1495db516d1c36e6d87894cf9a15223"}},{"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":"evals/evals/04_ts_to_flow/multi_file_module_split/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f261bf63599b8355f0be65b49c04353f402fa30ed5d2eec611ed83737db3ea3c"}},{"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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f256a8f403b0636c6da69c7d4639e9c085879f15fcc55c3c83fae847df025c87"}},{"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":"evals/evals/04_ts_to_flow/object_combination_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abe5cc23bf82c7cfb9a2b7d4578b0da2c36bd015b2a215b094b3cc9ea88efb7"}},{"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":"evals/evals/04_ts_to_flow/object_literal_this/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa6a2dbcaf85319b7f1cebc7fbc852c138925926e60c83d006ee19f5c7600ad"}},{"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":"evals/evals/04_ts_to_flow/opaque_type_branding/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41cefe65e48daac66a6fbb0fdd6e8231fe1b8446849e65be45529a0de97a757"}},{"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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b1adce76854be55bac64f7b792795ec53e3e554d33b8542f7c3313c1209d0c"}},{"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":"evals/evals/04_ts_to_flow/props_composition_hoc/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2964d1381fec85599a1a385fe70c3466b558c80c9eaad51479a054d6142328e5"}},{"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":"evals/evals/04_ts_to_flow/react_element_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b684bc6bb45a0b4a9a6608ec01f0c1bd476fb648a77302f7045d8b06e8b54da"}},{"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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bf53f8cacf76f2db88ab451045cdfb9de56d368fe2ce3f3657864d5ff5c2b3"}},{"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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3d685e2e192b87bf67d09538506ffa5cbe7a19a7551d05029c97eecafe844c"}},{"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":"evals/evals/04_ts_to_flow/this_parameter_types/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea445a5c69c0a0ad69604a896a5994287ada029935e9355516f50209e5d88033"}},{"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":"evals/evals/04_ts_to_flow/type_predicates_refinement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1175f75ebc05c33251ce483a7513404d5bdd46278e9b431a809d20d201aa7c"}},{"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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc9ca27bcb3d6cae86c08d1dbe83c5fca07cc17dc8653c3a002f345899cb220"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc46ad0c68a6dc00b20ae9c23a04da14a8dd15a83afa839928b0381e55975654"}},{"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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e185c314e1042306b343d559c1aeea74c50e01a2185ccb0560396d016311a"}},{"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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"731aa78a2364300efd4bc5a6f6e15a0faeb66e54354677e51ff80cb0b79b2461"}},{"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":"evals/evals/04_ts_to_flow/values_member_unions/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a5c92a71ced044756376b148aa0672467caf7c098d6086b7236a89bab57170"}},{"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":"evals/evals/04_ts_to_flow/variance_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"544e2edcb6efa526c6e55a51ffae90f32485ea6c7961a5a2e8bf8fd511459f18"}},{"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":"evals/evals/04_ts_to_flow/void_vs_undefined/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d09ead339c36e5ebb6b5d676849a9dd45739ea422dec16e62abebc72ab03ad"}},{"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":"newtests/lsp/diagnostics/empty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac96c6f434d0211b684562b8671769ccb9a1d0c3c1213b87c54f51ff36cdb401"}},{"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":"packages/flow-for-vscode/playground/try.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8766ca51daea92fa80244088e996476f086aed5ba04c7b438244d93b3086053e"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/export/module-exports/typeof/import/spec.js and 65 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-api-translator/__tests__/flowDefToTSDef/fixtures/export/module-exports/typeof/import/spec.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d995a6d4a22359387b7229823765f8fbad56bd953c4604d5fc6edf255a7840ac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10581 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/completion/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff65e4cfbe626943052b47ded4ef40ea5473b487e23896c0e1f8a6329070340"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6098 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-dev-tools/flow-typed/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c1d399b1c5d60bc039e5b459e85ba9ef2169d355496fdf2d6939a2cbde69fd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3631 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/documentSymbol/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4651f9feeb56d4ff3fb386ab45f76931e748b8521f39827c09e82be5bb69b532"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3604 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/signatureHelp/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a362e3f4612d69689afd6cfea41d14fd762d955fee21283b8644ddded9b0201"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2165 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/flow-typed/environment/jsx.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"327c82d7031c094927d79e314b0b7d67a5a014df4c78e47bb70a441b96968121"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1962 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/selectionRange/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8945bfe5b30b60fb29079683d757bea4738abe94401e95f631f213f6bc7566"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1235 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/jest_v27.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae9b358fd6b35243a2ba87a3b12e51165101c4725036d92b594ba7361a2685d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~881 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/prettier.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a545e9fc7332034337728f26c527a8553f088fecb66a15f8ea2a0a19abac7f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~871 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/fs-extra_v10.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfdbca8ea88cc8bea76349aab1fb4d2c3ef61a637dfe5327870e64b2d4ba04"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~799 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/ts_and_legacy_syntax/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"037526c513e60e6425c8e24ff7fdd033a5f83eeca86d7baea32e3d68de782c53"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~775 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/jest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526dd8f0b17b564a1e3f2aee8ddd81b52bc201fb3cd5b84b2e9b075a3512153c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~770 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/memfs_v3.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5c245efda898412fd70d3f9443f13922de872e6eff353cc97fcbc4ef4b720f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~687 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/react/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feec324f904a3772f9754deed2f34113d28e56baf0e8a2c52573caebf1b12aa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~624 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/diagnostics/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d74e6a28a2a4db8b8bcc664b43f8ab1817f7d203bec6d81bd572c8c45b7fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~603 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/match/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16893425e01c6efbed1b43db3b51620b17bbd59adf7ef352e38ad6c8e2d91cf6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~589 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/refactor/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ad7e64eac9f964ab1eb5a967e52cf38bcaa6b4ba999142f82a070a18e8088"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~486 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"lib/misc.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d6426ed7a45360631f9628dd4e3722a40ec92c80aab52d324422be55acd972"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~398 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/completion/autoimports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de39b15c8eadd92cb4b5d1cb2b3f12d6b9690b09ca7f6bd8d170f7854163e4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~343 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/queries/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31157214a55fb1386fae1444d78511731edd577fe9972d6a5df9df550191a374"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~328 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/wait_for_recheck/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89211442e378916adeb81983eb24dcf5658dd6494c0835899ac1fcd93314a43d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~316 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/yargs_v17.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97288cce583ca4869ec2c104dc360495f718af6822a8c8c352ce71f34c71a4c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~306 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/autofix-exports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e4cd30e47531942c7f4a117c190419ada832c2e875521362042abeeecc4838"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~292 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/documentHighlight/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4889566b5ee161da30212098f5fa2649c2f4a597c6316af94794d67bb1f49ef"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~263 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/linkedEditingRange/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9059a10e67467f87c97069a0e59e5592ec036192254274f52b11b50480e074de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~241 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/connection/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"038284f7f85c3994c7cf37e9b1bf0d2d34c496be6687c88de2047427ee138aa8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~235 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/globalReferencesAndRename/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04826533433141603eb58610b37029764f35bf376d0e38d80efa7a74cfd81137"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~232 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/semver_v7.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ea4c2a9ee4d96e8147c69a7f33a52f9d9ab87df40237ee7d7d194edcf73b53"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~206 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d3ac1f88001053060cc2c241741c1b79c90de79df1ad7565614c5088fe0a78"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~175 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b1e6565ff821a66006766a53ac01f0a05e3a2e9c60b30e59543d3134b24f94"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~174 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160f081b7b8bb01a77bfd69120434a4f2d91c5e56eaefff33d2333265666f7b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~159 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-dev-tools/flow-typed/npm/chalk_v4.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e09729e3648e0af878d62ae2f5f2bfc81e7e2a41b17e12799c778306c14cff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~142 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/babel-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492c844ec818cec20498a5e21f8eb561299f461f4e74eefd8de99df136f7049"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~140 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/records/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a509b8af923b8859e6170ca0ca38c3261d200fffa37741961eb6c0e77bc332"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~139 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/completion/haste_package_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4869518836cda9c3f37a151c550f1c7bbc786c0f2f54a9bab6367bac5ff4d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~137 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/package_json_changes/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ba4b42cd2bdca91eab1bf767aeff23c1f300778de733805d630f5dec4e0b41"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~114 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/refactor/readonly_conversion/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d67f7a72d915cc55aec873667aab5a378f470555fcd7ca1fef67e73bb3599be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~112 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/ideals/02_activity_feed/ActivityFeed.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1912eb99b4c65478b13a7d57a1300fd7bc92868c4ad8d141a765ece61bca9ce9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~111 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/rename/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6411a1662935f1fea212533284e21cc3508e88eda8716bbcb6962124a03d52e3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~108 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/detailed_diagnostics/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc86b968f89496372b3bf7f3c67f40e7e06bc1dbe88641f44b0cef15f3612eee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~105 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/findReferences/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb541d6ddd5a063c63b3749e89cf7f389552a9364afbbb19dc8609436c535735"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~100 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/glob.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d5a94b1a49466fa40cb7df3d27b340d6f8c5d10a369d329e3ccd964c9096dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~99 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/chalk_v2.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d99996ece7681fdb36b23899b5a6e3ee8b611a126e460d6bad242e98e31f239"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~92 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/completion/node_modules_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a590b4b223ee048b5814aa59682e800df502c78c7b1ca460826620946ec2759"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~91 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/savedStateReinit/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c0f1904430e43099f157424b6b3960cc1ac0b8ff26e62987eab50f98b28fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~90 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbaa37372af5c0fc49630b38964b75922a5807178f694c4d2a45c42b7c4de1b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~84 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/staleTransaction/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef237f9ad296b2c645c2a0393df1f257cdb6e0ffbe208cc4938ada371a0b2619"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~84 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-dev-tools/flow-typed/npm/glob_v7.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c381a3d3a69af690ce10a85fbdba11d78abfd13faf08803d6ae1df5b343c1c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~83 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/espree.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f182e51e7e5c853df6671bf398cd746630170445006ca7b15982786515413a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~81 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/auto_close_jsx/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dee64473e7f6cad52ab68530743aada350c2e8f51698943f86de978df4ae7a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~80 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e55e6e6613f491c5916094f26976b75758b2a4817789753b36a7a71f001445"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_combination_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2e0db3e2478853c27cecefe28035b40d0e77213942f32d877192bb9a4df2d5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/babel-code-frame.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f1225ca966328767e132fb37e00169eac6a78ff82147074fc761105c86ce2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"scripts/add-specific-error-code.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f6e8fe08c8e6991f9982ec9d16ce8ab0e36af20001c949109e2190611b3b4f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 test roots considered), but 6 in-repo import(s) from 6 other file(s) do name it (newtests/lsp/code-action/quickfix/enums/test.js, newtests/lsp/code-action/quickfix/match/test.js, newtests/lsp/code-action/quickfix/records/test.js and 3 more) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/code-action/test-utils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958089c94710408f20b4941f6666d4677176babdeffad78d0b4c2e2cf2d792fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~74 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/context/RelayHooks.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59b42522e83a47b8f0cd8696174703bf9f8e3072a724b39e42b29aaa55eebf7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~74 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f84b19f9d0827bcb225e0d21accabfff2a6f55ab1340b02f571898c7a7500a4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~73 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_008_ref_param/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05a89563d635ab56e3bfaf6e24de4efcf1da4d38975e49b60221a40974fa109"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/edits/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d136e38ed77b867eac509e4e19d0215abe12171f694d759193a40401f2efe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~71 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_005_conditional_call/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f0fcdd19e56b2daa3016c16d999b1d3902517f2d84e081b409618db64e4002"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc801f2fe6ab4c001e002472239cbd9789dff04595da201ce448ab931cee02f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/completion/component_syntax_auto_imports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3f985ace889c357c813c4c717fd50cb1f8829bed074bd5dd8ea0df293c9f5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/restartOnReinit/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b6c7549197c6da57c6994dac9e88125b7576aa4b3cd649d8db613ba76f3215"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/scripts/transform/genTransformReplaceNodeTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a753d929a7bc9e8904c93069554b356fc0a470fa60088415790a2d15eb8ce8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~69 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/workspaceSymbol/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f491159490aa88de010706e8bbcd3ed66abd08ec1df27325fce8e2b25013df7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~67 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_combination_spread/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2aeb5d3df9d5a1e70373b2da1d859125414c3514f1441476b07cfa84af962f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_005_conditional_call/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a524ba4737c64630e2c86dad62adc343acb6f3570772f579e4a3aefe9b311"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~65 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"427b435a217e14a66ee4ed40203596ec78e50ee185c29a63d0f073d14a9542ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/exact_objects_complex/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0057ed6244846c6a202c03c8bdfd3538b8afecb6f654a63247d1a64bbb8cb989"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_overloads_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09c27163be0569e33b7e0ab0abf34edf620ca911a150e75881add71dd4d732c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~64 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/scripts/transform/genTransformCloneTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e01f4309c17f6a8f822311c4ca8c77acc5090d9209edf890c99d099fb18be01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~63 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_017_unreachable_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cc0d18789fdedf214fdb43992b216b5e7e481f9ce79a4662848aad93609984"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_022_implements_object_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaed456f538e3f52aa62c2eea35460c2124ff221239788fba359ad720ef58cc7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_022_implements_object_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6285df8020532b5a44b3b4a404d6e21891f137e2c97eff0a80e4612afa8e5533"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12822194cec6820f896fd2103fc82f52e02563def69e5f247cc8ea07cd7eda19"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_002_number_enum_switch/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361156b58033440727bba0d314196e068981ac8f218a439521a1bfb5a2b85a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~59 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_003_boolean_symbol/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e114d8066f0b378d198a9fedc2431738d00116599faf408e02e637b40940cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~59 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_overloads_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4989debca1de67285685405183dfaa0a5f4ee0f2c31202d791ee33d2d3698961"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_002_readonly_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99970b6d75ee7d741a4b35cf41a08620ed99bb04a5f48f3ff1d5e3557d1ce3bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_010_enum_exhaustive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff45a841df30cb619ef18ba43a7137cdc7344fc18894cc5b0f83b53dc159754b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/scripts/transform/genTransformModifyTypes.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182aee7d3afbfef4f81e8e1ca12cf15194178ee9665831753bfa968dfeb7001"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d169ed8be6656d8ca0cf800d35b49b6d4ac6835b45896304d3fa2551cff2866"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~56 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29976dd4e908b660c9b775bb733ae48663e8a7a6c06b8503b956d66ba68f617e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_private_members/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c8dd424718ec732561606b4f3c345dcbbbd91791d49199f078b837d6367616"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab59f862d07b03c05f2e1c1f2e4fd95649c2ce4cdf2f8552185dabb6dbf9d799"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c425f975d487206a8126128236fe3b88e310ec9e62ccbcaf5aea19225926449"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_006_conflation_prevention/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f922e7f2a53c39a4ed844e28daf19aaa6424589b5d2562f77d2f792151b2c16b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_017_unreachable_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba325ab8b1fa243629047ba64a79b77c5be0ee943f540c731ac07e4eda5f55"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f2e81d96f941a144c2cc2b5e690631c83c3719ebfb57111ba420109ac75b45"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/exact_objects_complex/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44af7e2b2c05f47dab3feba388bcd847101cea9df999f39ea431f494575313fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79652a26935681bfef2af58b0eb16b001330d60839dc7f50ac2d12405dbf5d7f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/code-action/quickfix/enums/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0250fd0fc9f9fe20c3bd85391105d35343275f8b4fb15377d0bfbc7e7c38d4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~53 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/renameFileImports/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b95c5d4bcafed679f27eec272a7feebbad2f46b9760ddd281f80ef2736dccf1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8a41cf0957d3ed7e1a742341f84059aa544e60e255588fb049403104f7457e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68831c5c972b9a9c2b2f3e5f916fe6e90e86c1c66e98f9760cf65ae51185093"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/variance_advanced/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b7a7df4000403f9355c97e6be0ceabf15415c6cd8c9cc0a8c87df386af1328"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_007_destructuring_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c755e9a55b51d3ad3c26cbd02888fd370f826d04d9606a1a2ee5c307060d1d80"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_008_enum_match/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65653842555fdf818d463f07e0517ca4c33b704ee4432b6f88fd2a93541829f2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_006_conflation_prevention/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289613fae540b5fae0adc20afd63b16313caf201c30b2c6240c002208bbc63db"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0c753d88a284764158bc7aafe76194d1bfa6fe7eb1dfad68a1d7328f44b00d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf1f2791a6b16f57f268fb144d6f7239b6790a80b862c7443ef4636cc32e90"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/ora_v5.4.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395e4a42288c76bb554d2fce2be566d27394bfdc616362ca88c21a0a36847739"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_003_unknown_type_refinement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62f939154407f0121c95ca8c5d646f994841d5af7d5aefd77e570dd22f9bf68"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348a2e79b85a5231e2d68a81f0de00c4b80f268d8db1d295a9690dd3f988e35e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_022_instance_superclass/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5073c870e27e8ba7b16ceb9113fdd880685dcaaff9f554113cc81514afdbde01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_literal_this/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97eccb74c83467ed5fc8a67285d95da872bd0a3c3c35ab633f8b28f90c0d64"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_027_interface_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b90930aea63e97d7d96fc8efa9aa25dd689ce7de9107313794aed4d6d9d25c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_003_polymorphic_renders/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5763e277fe904bf52ed612c2d14092c8d791f664d7289b85ed96dc295343fc9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_006_rest_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec630ddd087c0d3cc9751ad7da36dd3b97d8b216d357d8bc714e3cdcfb450c0e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_001_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac87db91be0306cde41b71683efdc6bd9e89417b0732e3942dcb6f75e627271a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_004_mutation_prevention/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09d1dfa30d1cc8cfb83d87ac9472dfac47e242c9aa7fc88c26b380ab74e7451"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~48 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/variance_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6fc0f331766693834f2759d33a21ebd0a8cb96284a85f02b4b32a36cc63fcc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~47 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_009_component_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d3b7173994e6a2bd084409f03d09bc5b72de9dfd985e161de635bed9da102"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_004_mutation_prevention/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e65348f26648ea3a749ffa51b2da1e46e1cefad892810e244d8af069db78c2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/context/ActivityFeedQuery.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb7cfc6baf6b64ac6a4cb13486760da65368beb1f6dd2f04f6083d97dda77b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_006_generic_bounds/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7468f32b0ecec2bcae88c9ad72c20fd67b27630cb0e229c7311c0d544b9dce"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_006_generic_bounds/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ed409b2fba40e418b055fc632e5d6647d1e80bdfef4c58b4cbbd33a784351"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_026_asymmetric_subtyping/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"621c388e4069a6ffb4726ed5c2e97fe2f7cc983c15aee0b36b8707f7d454d8ce"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_001_element_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90252c7bdaa652ff9366b0ce7bfa43eddbb6a210bf5c70ba1328f8fe6ccf903"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb09f3d09cb0a685911c2fe55f49a8d38d645a86744e6dc50facba51d672803"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c3a9f97751871d51e65a3671c4cdc6ed3117eeea3b0fed71aff434ffa36bf0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f52f8abadb3535326a9b6413dceb14bd6f097ead22bbee3fef877e85d0a9c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/autostop/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b845a66a0191cdd5ad8a484fbb9b9bba23ac149cc841786fe6c35003513adb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_005_array_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e4a5be6f7ece1c10d635964c28f0954436e9931291e14b04f8d805eb896857"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_023_interface_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab57785d5904c5b97a5252eb1e1a52f19d98414296a23fa84d13dc4491d8fa6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_023_interface_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc17c8c59551f792c7ea6f93357966898c142f04cec5af7853f1559080e5530"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_001_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6026264d16b68e8044eb7da964ad4f765ea2e373d9df2a093d3067cdca576ae9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_020_render_subtyping/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5672ea98012be9b84e8b7b74d7cd6fae610f6ed0aaf84698e92627315442cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_007_migrate_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b546e6eb22a30d2533048042e32d1a3abefe84e61d2eee6417a97802b7f4aae7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_007_migrate_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02b3c39431a4afcabc8b95cc439936852b71a24770aa9bee55a83231aabad55"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_005_component_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66c15250223ecaaa34027f68e9572472551ccfb6c02cba68ff4a89b35879a8e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/ideals/01_notification_inbox/NotificationInbox.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4411e2ace3e9ebb99843da3fa34776717ae14169b4d2441852c454270a2fc4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4dea1b94778e6263982d6f256ec19a978aaca9cd1eb089ac7e31d5accbe50f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"126a680d7810da5e98d976b0a71a149f981b5b0f7437e55658d7e8ed34130ea9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2532e228b0a560796e8d34300096857baadf3afb3a4444f2d4c0bae79971ba1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c232284fc97e9c910179d974081072362a034f20ee53da37ddefea5d39a2f0f6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/props_composition_hoc/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135f37602d192416c678214506fd8ae6ec4d52cef0e616d0dfbd7f672e02b932"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_005_array_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a026227c16b7edf69b334af377e7ddaf70541ad994220002bb8c13b408cbe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_007_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80958d768d3d5ea576892a6acb98494fc93eec542afb5c79288f7690e9b5ab64"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_007_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f780ec0ecaa951b2a7f0deeb8375e743ce00f439108f677d7932cbdd32867698"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_009_react_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19274c991d6b2b274526e2b459cf0a6430232efa6ba88b3f478d8c21b9b740ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_027_interface_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74abe19c031933f15b75b72cea6bf5e23ab22f796013cabab08c56ae479732c6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_001_string_enum_cast/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f10d8eb478c37db2716ec732713967d41fd489291270d187a74b6471a299546"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_007_abstract_enums/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a25557f923b4b5edbc9adfbcd56d460501f2135b57d639048a8337422f0383"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~43 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2987a0983d7e3a7ffd2cf373ec99eca175548abaabe280fc5b52bccedf3e99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_020_ts_access_modifiers/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20a13e29616add255d09d09c630d8a786c42bae7dec0704fa64d137bf65f5da"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_020_ts_access_modifiers/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6cf273a50bb0bb99f4109fc06208ef930c6cbbc8fb86c46084f95763755834"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_002_renders_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f485c9d9fc4875cee0d5c9d9bf13790b06dd2062d3960436af265a3db20251"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b5599ff3ccf6472d30bd2a4d6293c779d84dbac74110c86e89192422edb434"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/react_element_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e657ff62ad997ba4a8884101b2b0e8af962a72dafb71ca4f51f6a989491ea9c0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_025_object_this_reference/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1cd6a686e735f904fde8c94ad9cd05d825aeef3f6bc9c15bc53473c31c75d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_025_object_this_reference/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98584dd1b202fd998ae60eda9af7ae3df2adeb46fa5e76808627c369ea3076ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_026_asymmetric_subtyping/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e7ef3ff976c2d97f62b7434bec827b7a5709673c407384c39383d75cc15a61"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_022_instance_superclass/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b7740f3582c0b8cecb40b1c3792b37a8495fd56e9edfa516e6a0458aca3578"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_004_generic_constrained/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5977c88485d628131e53f6e49e6175d9396b99cb1d94c4d8877ef854310e24a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_003_ref_of/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88147f39664af3fa4cdd58dfaf1543bc9cbca628e2622b7e5428fa939eca813"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/anonymous_interface_param/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"684685f23da0c92b9ae355d9fde4446340bdcd22eb044390cadacae70cf94ccd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_private_members/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"926547d0cfa953158c475748e468cf32092c35618d1eb8697b9a7f9fb8b7b0fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_types_infer/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631d485e3bc5a2e1a9f44a616e2358015e428b58e60e42120ce4c1bbf58903b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_types_infer/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394931ac642879bfb10e49f5c6217d070515aecfbb0d23ea8570d7ac10dc31c1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3163126bd5413a235309255820f0660280ffe70871e1eac9712ab495a0c34348"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/hook_utilities_complex/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c94bab9f6db8807b6c03a74cce706afa9fb01a369b5c4b387231601086e2fdc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~40 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f941b788a2e206a648640e1ccd2c3bec35f56409470ae2a3a0fce7049857d1ef"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_009_react_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f903c57b9cc7e74a60831082599bbe816522f6e6c94ab13ae1fddd516d6a29"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_004_members_getname/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcf767963bb8d123f1b6d60860d099ade55f65ced444babe5d7cfaf7ca04d79"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_006_unknown_members/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90a883ec6205a605983d9b37c45d6509f6269c3a8ace74745a5d6c8833d6606"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/ideals/01_notification_inbox/NotificationItem.react.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b201c028abecca003014e50f83e5003b0ae7a18cd33f29d334132dd46a5d940"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/interface_property_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce2e3a0d21eae9379e0ce9d27529ab06cc053948f9cd7f774550ee552a24691"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/type_predicates_refinement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dace1f19ff3020517c17442c99fd92d42dbb6302b462b3d44c42bdfd764631"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_003_unknown_type_refinement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e90ee490b05f7ae2ecd65b5a6b21e39580b4ac3171cff009c301b296dac4f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_003_hook_type_annotation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b16816e44d08362603acc4fb44ddacbbb06f0a670c95a424220b8290240e868"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2332d72ee09ae6740470af27fb6abd51cec5b35172e6593cf00a121cca52d7c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681d2f25a90bba085807e7135dff643c2c25177aa5befd4ae7b7d1c911a6064"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/opaque_type_branding/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a59ffc92a8c05d518b25b7e97e9270703fee65e39f41d2297161e439ded6f9b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/props_composition_hoc/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c140e386dcf4906c934e8fb491e6f3c00c94a670460b4e466e4d1a85b9ad198"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/version/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"638f2bef654399f96cf5d1d33dae38173d8482f5d4f9bd3f4a55f601a03f3c95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_001_refinement_invalidation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d795f96763ffaa0d7e374805ef600c8738dc1262074038adae816ba8a54414"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_002_exact_object_types/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"182fee733168568f9f54dbad9fe4d5fcf0c77a094c9bcafa48a9767f0c7aed5c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_002_exact_object_types/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf2420e2506baf51a08d102bd4fb124525bfb37b6a6a7123117e4c5a8b0443a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_026_migrate_class_state/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e259e27330ef716d29b10e33de2267289c976a6cfca22dfe386698bc319d704"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/opaque_type_branding/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96ff7d8fde2742847475b560738aa827ca640dcb1a42b09fdf4d15663107cda"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/values_member_unions/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe64b8557bd21c45ec51a4fc3e8ed861d0305eb479f3a9d23b6e5d678e1bbd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_001_refinement_invalidation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef91a284e735510940ad603f109df04c7d67776315f050f7a4045efde315b9c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_021_instance_pattern_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d64ea65f98513e70e0a985aa0dbfc9d6312f62a64ac68be55694c4eb1263a0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_001_this/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa98bbaa5f06c9e38c385e32136ad4074287da592ea0c08d724ebee3357f81b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e576175bb5c0b422af0d5e44e49ac0cc3d7967490210812b2100db183d4c5d42"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/default_type_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0cf7e01585c6afb46cc6c7309b56a58b3816c4d5155d959d2f462a9808706d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b843a71ae171fc0fdac4d14992c007134d4224d005fabc7ba9cd3cf67eecf4d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_004_exact_objects_extra_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d7eebb591cf452757802fc7fbc9810047d8cdd9d05054ec84bdbd54d821eaf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_001_this/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53f126ea65424356e2a00c8310e7946b18ae1b61cba0ff86b74d0401dbd2c8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/component_props_element_ref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"793da3a54bed75eb7419892b9429f01cc8e6782e235d3ac44fbb699e7157a0f0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/values_member_unions/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f77bce299818369d437e38175970a4d9f4b47e46a5437b79bdb7508a47cefe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_004_exact_objects_extra_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6784f9608f286d33e38a16cddbfd0f6b901349fa3e7299030dd85dbc989fb3c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_008_indexer_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a669764828dce0a40cd38e9a73be4e48c83b559bd731ed0f1109bea39f5eb6ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_010_propsof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ec9eaa747b281c4849059206a433b99216606937229e39f2bd29dece603e82"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/as_const_assertions/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ae772bbba144f03290ee3bda25e931563400555c07cdf9f4fffd09913746a5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/default_type_params/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0354aaaa018f0eb874410cdd5ca4103e5224c4e4deeccd45dfb704f7272e500"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/intersection_function_overloads/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2994bbb9fa951b8227155ec46da1814f457588b628305eba99ab16a76abcf6b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~33 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/context/NotificationInboxQuery.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f777943aefe52ef3f858a6ab210c9815bdfdac4cd635bebdb098737f1f717c5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~33 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/react_element_basic/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a1778cf5c1813e4de6fa805f3659deb4d42a2b5c59d61c06a387a26304ac36"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_016_disjoint_union_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ff0dc0a6aa6d7aa1a89e5be1b1af5ffdd6148c46e12f85ac89d38b0c2ec59e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_017_renders_optional/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c64a04f169ce724a11b4aa96f0041e67c91ea5f8bcbfa73ed40830858ea451"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_018_renders_list/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4db20d77b6331307bd84213eba3457ccb7a1e17de6d0ee55ac9a518b2ed802"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_024_migrate_renamed_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3443db28c10c144a8fd9ec3a79e6c5a3883436666f0558212288c748e862d7c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_025_migrate_forwardref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8407111b47410e52cc5eb25f0ed46f95b31616e7953fbaabd30a7c042f457cbb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_004_element_ref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fc3aa1381e6dcfe8399f4e6854cb48ba148121fc828fadb11452f3d9053ebc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/context/NotificationItem_notification.graphql.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc72edd26318ea136fbc4281fc04d16b6fee50a772c3c5e7be68221438d6ca06"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/as_const_assertions/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b3bc9cf7644dd70bc174084f56f8d3ca8b05da0577f0957904b6cc7c278f0a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/intersection_function_overloads/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71c2a13d28f1b7d0cf0de9d030916166a69d7c1d344af672af747cafd03ce29"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_literal_this/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb726b02b125363574ed960d777f498854655de28be3fe7715d9196ff562387"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_019_render_prop_constraint/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99406370f48348f14e7e2812b0e204f4d4113cf8021155abd25cdca02d5c1b3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_028_migrate_rest_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e809ec4102591af3983205b3cac041ccf74ddbac8cd9092d8474ca54a2cee8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_005_isvalid_valueof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd5682891b3cc5a2b72321c7afdc54ea8f2c18befc7c876a56f88764ed5f78"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_013_migrate_object_freeze/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8168c56d7936b13d74295669535853f16a5982b0b707e4548980e7da052c437"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_002_ref_object/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49edb7d1756b847f705c609bf4242cc3fc5abf0fcd8128b62bd3ab1d4cc66a7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/anonymous_interface_param/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b21be52e7d6db05054bebe03fa981111f9c3908251a66f49c8ed3334ed2274"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/component_props_element_ref/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e59d0f5c57f1302591cdb9ac2cb90555d2c8f48c10f463dde8abc09c5268e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/hook_utilities_complex/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d576f242eceaeebb80c7f5954d7cc43c196533341a1f23596d2abca8e12da7b5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_008_indexer_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd82fc40ad7050f37d96e13e99c831dd31a7f411aec7836947128453eb1190d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_031_method_param_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c80a2918c55970def3098224e11a57dca6c928196a0842ad58409d0cf0f73e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_014_migrate_keymirror/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdcc83a96622ad92fa8458c0acd9c4345483453f13728cc55fe7a9b505fc106"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_008_migrate_hook_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1cc4589ff0aafa41fd3d0ce2207a9c6063a1d2ccf5a331c1cb57ded6aff1a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_008_migrate_hook_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbdd5e3f459bfbc956ec9ff0efc9e9e91526d3722d9a1cf995ddae9bc5d60ee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/interface_property_variance/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c0030bb570b7ac8b226c120953425f9faa8662191ccb855344b1a1a7ec11cb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/type_predicates_refinement/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb65daf91e3fcd798b049c995fd6d8faff814a9eec328432f988b7e548d942c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_030_this_type_variance/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9088fd8e5d5fd0a940c27add169d57930a474fddcdca2a689800f6a9e0f0902b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_030_this_type_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdcfda3f2dee5613c7ec499834aa1e2bcc408f233cbeb3ae7279123d1ae06ee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_005_renamed_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"024b47468397db161246506992bf07a023b88b127677920ba15066571f2a3c7a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_023_switch_statement_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4813dc8b989be3125cf770a5d29ba8b6ec38d6c883445baee2b5843a85ebe7eb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_001_element_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8cfac481fbb3e76a01d2c31dadac673590c6e73dba267c4ef016fa80ec01e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/void_vs_undefined/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b469f923d33a6dc946b9f6d2e3c08fc4ab18a1890afdc0a64fa5c6d99d567d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_031_method_param_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbdb62d243618b3296053ad160bef672d70f6d432a0ff9445ef0b2ddc590b18"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_022_migrate_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"083fe18a44f3e96a7fb36d7a526336f7f56c0c73e06e2cefa077d52b577276ea"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_025_migrate_forwardref/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0370c06badf6d4bd2d30a27efce50174c9bb0b43aca55789b3f873fab7e00c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_010_enum_union_refine/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172c7d3608d015f88b4fbc0161461334bc73d9b6d280039dd5a0635670b84bc2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_005_object_destructuring/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5796e942486ffa3cb867ca0657637f694e40b174c74cd31f97fedf42cda9273c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_006_as_pattern/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54763d3c8dcfa560db0a60cf16c43f5b3b312324301fd34c9fc4b2474ea94786"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_021_instance_pattern_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"874eebd0b267664940062dc8b1971c5d47fe67bdd7448e6ae3568aaf29311c13"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_023_switch_statement_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9420ed5cde10bc8e81dd7829b04167dedf3ebdef4f1c9e1d1d64bd1e78407dff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_030_await_statement_body/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8104d35bd907451ef5605da22fe68b401be5676a34b3ae4922a02732e6c6797f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/objtype_001_type_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df39169dae022e9f719e59577560b5bc7ed0d6857632b3a1524e3889d78a2b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (evals/evals/02_unique_features/opaque_006_type_predicate/ideal/main.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/opaque_006_type_predicate/ideal/Metric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff63f7336d2d54e91e80c70416a1022c66ec397119b275050b1e6d886e2f74a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/multi_file_module_split/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac306c3a39facc9510aca70895f0b6b912e3d1ae8a7db72af34fe5aa44d8832"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa9f200117a8db4dad5d4dd7f22da300603e790ed8d1b542111f80cb07f4c39"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5d6f49798da2515e5074564d031b94ffb2b01dc7a0687ce3418ac359306f07"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/this_parameter_types/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cbcbfa1ad52f8012e5edcd33363626f6d04bcac00a285545bbc5694977d82e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_021_class_into_object_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fe791bbb18908d51c8db1eba2c0e750c5b5011347ec6c76a1c3b724f75744f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_021_class_into_object_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc55508e29e4640a7d32f022cfc181be15d3e026978971f973a0ba12a052fe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_013_nested_component/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553942a14c11825f5598406c7691852bcc91c14bf3151924ec7ab6932508423"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_023_migrate_default_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03da1603b4130b6330f7f817749cd18cfc357957751b10fba3fa41ae8e6900fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_027_migrate_generic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6f18cfc3710c5b53bf7a3b9b84825cb5d64a82a55f6c8b12b8e3edd6aa4ffd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_011_string_explicit_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b078c0806abe3043eb006cc1b439b415e3805922471c4563828a8010ba4e2f9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_011_match_statement/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e2a0b38e3476a306b4dcb8307f1caa5d19e95e760299000b1f3eca718c7ae7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_006_type_predicate/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"751371d5dcb3560f6b60b6ee030f4af55f0240501741e3aea412b0fc000fae6e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_020_react_element/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef35933ea468fc7fe3f6835e892fa5398d63517fba8ca54f9839d081db0e282c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_020_react_element/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1885e331634e2d8ea0c88ed00db8a8ee9fdb0ad15f6b92ec0dc77634ebecfe4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_011_unsafe_as_unknown_reinterpret/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958407151c520da4454b664ec439eebdaab043829411a31ca8351f3aa64db567"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_013_nested_component/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f125223ef8bc6bf10551950d81cc7ed89eaf71393b86852ff3770efd9043d06"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_009_bigint_enum/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"294d7efc69a614221aef18855ecd8d60fc4fd2294bf3487103b05227460678ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_024_switch_assignment_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"248f12d2f8310effa4ea5573098fbdcef3f8bd40a5a3cfed830b704dcb0c9bde"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_027_member_computed_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d135739ccb82d72e0d35787502e199aff73b43179f4bed406fc460a8529337b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_001_basic_nominal/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"321cd418e7fee13d8502e5d5754b4be942b611ef794b5b7c7b24c4af71db8498"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_005_component_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab2944aaa4ba542f95fd5c03d008e791f0d6c5869fbaecf0d06eb8c7ba472ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_004_optional_indexed_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4164e0e9afc05d2d53c2df88782871e279ad720f05de0ad12ba6edcb3f393593"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_spread_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b914c2d6185c2689ce4ae1f2b87e9d7ed0619a38c000be3d50c10c247816eea2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/this_parameter_types/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bd5d14b5fa490d34b531755b646fb01cb35ae463c045cfe7a7e9eaad1fb399"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_010_rest/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef085b7bf13fd7e2df5b0b25de5f4055df6f18ea29ed7213b432a6a865189fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_010_rest/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81db00fe0afebdc4b0c39ca84977b651b72648bc9da4ee6073cf8c92cc77a6a3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/lsp/execute_command/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ac986f8fcc18b22483607dbe749f95afad29dfdc93b7ab233dfa6aec608032"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-upgrade/flow-typed/npm/prompt-confirm_vx.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de368e787963c987fd736253b19514d9fb5c045b91a2826c857633fb7fac61f3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_004_guards_and_or/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22067ec8602c780e9a95c66b80c2b28fbcad7b4e8487763783fb86c46b9d13b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_007_rest_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ace412887f387f4f70a15c1808e4ad3bdc4326bebfb2f267ca60ef0e0de9dc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_018_invariant_throw/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03435172ee69bade06ad592a675180eedf9164b93d5a26443e78e868dd21765"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_019_tuple_matching/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd34b263810a97c0e630b041060c845cad3e4485387cf0844f7d57b5ed82fb7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_002_module_boundary/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60faeb486c52228fe4a8a693896a6f38d0d3a30e957e23d30225780f14ff3b33"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_004_generics/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c124f7a1d9caead4f04db2ef1b9a95b566c9ccbe265d26864eb4b5975d9ede"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_002_ref_object/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cde0123ed2dbc0c967be2d8ed2e721c422c3f58491ed2db485b560c3281ed0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_003_ref_of/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dcbb50a72dddd211d7da9098188cb83ecee1596021c68140f899305cf8dad6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_019_exact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa4e88650bda62ced3b4fabea1e6e62fe263eb86174543eb765fb0500506f3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_012_writeonly_property/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"403891de4a91d6dad30d9f2994fd4eebf70b441ea1d5d91fbdb999ccc99829a2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_012_writeonly_property/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25d9efcc113272408eeb5f0c1ba2db97ab204847ed5a4c47ec280f090053e22"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_015_recursive_return_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70beb2c128e77aa3ecbd95ef4313489f5b57677f940c86766c6a95e6d1c91685"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_015_recursive_return_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5478dc16b59138f7a035367e113cada4cb8ca258e50b55023b4a2691b53f4970"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_022_migrate_basic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cb0c03a23c065c0f9893b2e430f3e2304974915f540bfc31067258ac32da94"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_026_migrate_class_state/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4053f31e3a3f73dd9ddccb7e376bb15f32df97af8b16a8dafb45fc6e7be6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_012_switch_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e2195026a3512c63824b6ab16419ffb660f51faad1f416b2f156b8ae165e11"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_003_one_sided/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1bf58652de8d49a7fc2d75bbdd146b92b3352e9c22f9f7c781fec082d1d0f8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/const_type_parameters/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2df18befd9b0f539c9489801b2d489f0e89755c4bf4a520efe3aaffafd53d4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/multi_file_module_split/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e41d465a6ed06bbb68ca2d6035d77fba22c7c09d57e023f81ac36e3257d47c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/multi_file_module_split/ideal/money.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfdcbf16cc3e257ef7df7bba4099cf24854d4a8043f2c6c14a72ee58cc1f9e9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_009_diff/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9c9821e22c4d7544b62bfb7aea46c3010fe250e5dd9341bff0316c93a19491"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_009_diff/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdd9ecd83c494ea9ad61af71123ddf3e1915d24d2caedbf397cbadf4e593b0e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_019_exact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bb6b358af719f5b00bc5f0348cfdb7cb48667c0581480cddd6bc27b2bf3454"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-dev-tools/flow-typed/npm/minimist_v1.x.x.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22962ffa37d3ff0bf60266354df4e875c40c656fdf6d802b8ac0d16abd0807aa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_034_var_branch_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc576f73a52f919c525eb79faf1ce886408ada824fee19e176f9c12c95e1c5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_034_var_branch_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca31f8e2c8d67ed8c61f5ee3cf2365a05b472e806b399b93e27c10646d42000"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_010_unsafe_getters_setters/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8defb8dee2ec470b447dd965764a34e325cd1902226f9c487ad3df8675373a47"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_010_unsafe_getters_setters/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ffb52df1c4edb4c949928b3e89038945044dfe10a4aa3313bc85347f238e40"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_012_call_as_function/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dc1a54ccc005afecc0e09d2e3a777ccb7b592a5f69d9642f1b6037ddb7f864"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_012_call_as_function/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"499e922384dfcf988c58b9d63838bfbb8064e71c55ad1595087fc4f0cb8c4da1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_021_import_typeof_generic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0928c745e60f674e3239f09ca57438740b6980878e6b70175e2e6efa04c4a1c2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_023_migrate_default_props/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcff495dc8c18245b1791d50ba2f94072586c87c4dfac2616e0986f6ca11e8a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_024_migrate_renamed_params/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6a11265f33675f97039d98aabb93be5d43f0f5a7cac5d79e25f70ba1c7442"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_027_migrate_generic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"648824c9c12e0ce67f623073be7a30eba86e96c79476b19d03f9c1cb6595f45f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_028_migrate_rest_spread/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358ed728aabd45994e4d4d9c645786d9dd8329c5e957e8806f23379b511cbd5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_002_disjoint_union/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c432236274a2e8a4e67f4a7ac37c5a8f52bcc0f32cce04f56e8b353e4223c5d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_003_nested_tuple/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f30b89d5ce3105ef98e018bc4c5eb0ba86485c894ae394946800ebb86a5ba83"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/opaque_type_branding/ideal/ids.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ef3d2f76a7281f1c96d801ea79392a210a3949e4e081b2858325333243a3c4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_007_readonly_collections/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2177c21f62083658cef560118e71cd48b91a4e80f7e8a15ed1756487ef57585"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_007_readonly_collections/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa00ac3be2713933a6dfaf227c3790cc0e967397624108fdefca7b9fd873640"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_014_method_return_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7479df13657d399987a472df18790ba83fc5f709f117b8a1ef0cfa07196429"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_014_method_return_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9cc4d78ae06675cc4484e3b1a756383b30b511eb9cb8334010a774b4aa5309"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_021_import_typeof_generic/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3be5ea7a9395fefb3040ff9494523185c5a3b44657117bdf81f2f361d2547"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_014_migrate_keymirror/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f37eba803a5403ee173247a3137aedd36385b259aef58492bf2a198cba8209"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_013_ternary_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434993fdbea6223f659003562e82678d12defa556718577dca567d6c4285cb14"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/module_001_import_typeof_value/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3efc5f23f402bea39baf28d9a14b3e0856ecd1b63c036350e3a52f9f74a9136"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/tuple_001_inexact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47314409eb680d85e8cc766a64751612bf39c1df957ac1550b1b267a4aad9298"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_003_one_sided/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4090167937dbba3ecf2c8aa34fcc15fd105ddb640ca21532d3da3fc5132197c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/const_type_parameters/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f98a5a781e8d7de63667b537069c5253dcc3181bc525f258e93846d2e890cdc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64682adb4257eb2fd266adb18724ab261d5b272a0b823f54d7cb9ca3b85c928f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_035_var_null_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652deacbe455525551ab9e346435592b6f1fce0ba013c0bcec3bb6d036561276"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_035_var_null_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e6cb13e1aa9cd1728da3f4513d85d876fd655d6d58104c64a0f8fb7569353"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_008_nested_hook/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9173c5798a52a27f2ce82dbccf8b750b1562c8a18209a8cb05aa4b397d0ee8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_009_multi_sentinel/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"997b22c6f7a913bede739e7c8d1cad46e1ecef41e9b1c24b9f97a40d1f1a106f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_013_ternary_migration/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb28253cf842b069dd35b2a8ce6a2d1004e252810ed88f47507a30b8d424e7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_014_optional_property_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf08774d4767cded28e582c7b2be67604d67a4a6c3a095913b2d925ac16d80fd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/module_001_import_typeof_value/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e439fa724aff393aa8d24316f7d5bc5bcc174f729a87b31137e8227f44ebf01f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_008_mixed/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a33a2210d9fb38c64e660871a9fc368c2c49acdf99c7125dc14fa018276cff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_008_mixed/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1522f09265740ce6bdb549ac7ede818131dbcd3b3c19bdf80ad0a442b69bbf30"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"newtests/recheck_parse_error/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20e892599c2d1963c3e6844d39ca30cfa747595597b222ffb627511c3cccf3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_008_nested_hook/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91544c80c6b1cf055b7df680a822ef2ad0d8dc65b3be954d5d7f01decdc5bb46"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_012_cross_file_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe333a029da9ab8309127040a66d1a023e84c0f72c7a496eab560b0f767c11"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_001_basic_exhaustive/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7223acd88a7e0140680f639b88dd5cc057e3227d965b2523fd0869aacfbf07"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_028_tuple_multi_var_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8174232a9d1f88a810b67ebc182e35fde863c59e1e3379192ce28413163bd1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_031_literal_property_names/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58f644a9dea2bec9383a17d2a7fce7fb52b5b67cfcfd50f0d4df26e1279c20b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_001_keyof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cb6ea0c1b7b530df995d326b091428e6fa8a6b977f272d7722597f70a11874"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_003_indexed_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67838c3780b1d3ee2124293b51314723675c3c19551baeb8aebef39e9cf90451"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b806142db3c0fde18d861a036bb84c67c75142eae66ebf04dbc335783fab6c4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/void_vs_undefined/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1c8e194ac080f87f41ead701058b44ac736dbd7b09b637680fde235ea24edb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_001_property_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e9ebc5facd1c255a3988e9e6574a466c55b3c0646265ebf20408d3ca5aed58"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_001_property_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ca303bba8ffe13f8e173899d135bd7c88e47a9060864033827eaee777869e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_003_keys/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8552d7f1a6de280d90e45d752ec2b64ca5f09510497668cda2f1890c77f1d7fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_003_keys/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a38b2d625df016e17001fabbde5bb5e5a423b8281244bd394754e48266c7bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_004_values/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acbc123df5a3940dfe8e9d3f60a469fc9c4a61c40fea03d1d6c71aada6abcac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_004_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bbb26b7732e7b92c59aacb22481d2c4b12228360f54018717412956afc1d91"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_011_objmap/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4055ddeb690d814929aa657483fec184931c7520a8fa02f08dd1516a3fc579"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_011_objmap/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b3f1bee8672a7a9e28cb990e80079a47f997137b1aaa3df6332139e710b7de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_016_call/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ebd5838f0326a0f86d34562d62af9dc7f8bb48d8fb7e28e8b3a10eb24cc861"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_016_call/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"872fd00533871f697911bb7f8ab9b1378a718c1f5043321542030ea5d303994e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_017_checks/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"012e4447db23452402d5117f970d298a9d805325947153ba5ebc906cce2f352c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_017_checks/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd7750ee7031224a34bebc245b738c0107295000b38b30d63004bf41b75dfd0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_018_partial/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d139fd5b13dc2f9ee4d2317ec6f070d7734d7315119811b4faf47b499313cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_018_partial/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0897003dff46dc0441ec0d467c0e5e037928b0437c82f7d6950f438fc230aa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_010_unsafe_as_union_downcast/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da866061abd58cbdebce742b2c1aef35a16be990085f3a391157da31722285f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_016_underconstrained_instantiation/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9cb9b9f7c832ea697878e0f2001722f12498f1ff5b2062e1562da7c990636"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_016_underconstrained_instantiation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4771a06be123609e9e4c7ce6660565fc2ac0e23c99b8b70d1bcff27a62ca55d8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_018_generic_context_var/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e77c6c7b0a497a086d6507c73a1a390c5f5924e69d08269aafe640135647a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_018_generic_context_var/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f524b5a5bd91620c946aa171de1931922adfa70e336e3a6c18fe33dc4f051e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_028_primitive_into_interface/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6983c355a599efcf35e87cf5815494a70165feb9fc8fc8f36feab98494ef8440"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_028_primitive_into_interface/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165a185d91d36e099043cab1c9cb7d9cd845837be36dab8f240e4ee875a36c49"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_011_missing_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8503ff57b4383e6cc102cb3831b1214b9dca532bdbd6cb1d736e283d55bfb8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_008_guard_exhaustiveness/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98133baf6af0e36386a7da43f785d5b818a6ed228957e14a56a268b14517e85"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_012_switch_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71906661e63759c9b649f7478f2fc2f829e961fce56f204a168cc7ec20ccb98"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_015_multi_var_init/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb35aab2d1d7bf6b89164bf52ee14a2359b19a808dbb259df5fbf85e5538ed"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_024_switch_assignment_migration/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1936147fb1fe399cfdd5c67f37b28e1b7b80cfa17b59b096f2e14ebdf891662a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_002_module_boundary/ideal/Email.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c070f032816359d122c91670c7c063e13b69d3153cb0695cb171212b8fe22971"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6785dd34f892df95469de53612253b4a0e29b3100a4ce82a031477daa79c3bcf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_005_readonly/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ea96f89da229f30cc6a5a6ff1e460d1c382c118b29c0ff1cb5eb1c7481007"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_005_readonly/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d23ed7f1f8b41b4513e58857612f949a5c3f07f58eb6ff341a44b79d8a2df3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_012_objmapi/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06548d175fbac3a72a31180e8c7030df9856bacbe909f9662db628e8a0ac122f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_012_objmapi/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16979a5013e42263c4a8436ebcef9f7f1350374a6557fc0240d286983813dc1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_013_objmapconst/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151eb6a872d50ef5a20b53613ad33cc7fbafd9572d38187f2eec861608fbbc53"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_013_objmapconst/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e0b32f539bf5f010e2eb31b365e6ca8bcecf9668e21ababd1b297f45531be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_011_unsafe_as_unknown_reinterpret/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cc5e7cab4366956dfbca7be21bc31f42da0ba13a94ee0e8267a7902eeab9e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_029_tuple_spread_optional/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e78540893188d6769416eda3f3028ea965593c491ee84eac7e440d00b0521a6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_033_var_initializer_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e291fa1bb45586877fd5f9047bae1ed5b62c7c38fbc06b62ffa5e8518d377b4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_033_var_initializer_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c5843e1e4d45a7102336acd485b3736eb552e693575707e56f3b154bf1eeba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_001_sketchy_null/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f5e38aa04d7401c1bfb2f1c34713ab1b2e3b0fd6223ee418b7b3bd8c1f859"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_001_sketchy_null/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be3b12e49cfb32dcb89dc18fdb79bb6f40c43dbf41d912f96c416b293b0a72"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_011_react_intrinsic_overlap/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b57ab62b6124256af108d253ab4bf8c11ba54a550b243ea8a0b5b0c7f34581"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_011_react_intrinsic_overlap/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e66ac2384afcb298a24339f009ae130d5e6c7a59258b8deeadb460e12c8cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_013_migrate_object_freeze/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ab865503f185479a01e4b8eb52a3b7629e67f5871304a96d71a37ff84c9413"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_016_const_shorthand_inexact/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70deb5ded6147a7590a85e56d522d85400ca502d854b4ec7145da90c5c50a52c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (evals/evals/02_unique_features/match_018_invariant_throw/input/main.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/match_018_invariant_throw/input/invariant.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfbb875816592480c04aaee39428da1d42661acd9cbe00fd5d19a16b6717a0a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_026_signed_number_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f02fd1839e9a88099f377648a6137b50ebe452fb234e3981c1bdc7f0a7de74c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91e006c1d8e72b7824eadded6cbdde4d92b62de99e968030b7a78559e90e8f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_004_generics/ideal/Id.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad60489c75f5d16f9345f39b2507721f1a6d2633ebe979b080bf61827be7fa97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_002_typeof/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4787f95a2f86c7bff94c0d7cca5b762dff4ca9a766b24339eaa1eb88bafd1623"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_011_missing_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c202b5f745f63ca9dbd81289151cde9cadfe97afd3de487be4e9d43dbe1e5210"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_021_import_typeof_generic/input/Picker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fd0a3f0fa052cb49dd668303248430d6875749fd92993bfc15bd6097d229bc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_025_bigint_patterns/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8744b45f98314f21ef6bd136365d66be8959d0d3e1f90ea03482f1a06d0c7c59"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_027_member_computed_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8f845d778fc4202192204fa0366d296c70567f29be7bcfe0763829d1f8423d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_002_inferred_filter/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca355adfbabe232df3665e34763172a0e0e8cc137d922961a7d44c69e2f22b6b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_004_optional_indexed_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ea8ad29ef77007bedcc0e92d0604bb3b56edb881460726cab24a13ee43b228"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/03_project_patterns/relay_core/ideals/02_activity_feed/ActivityFeedConfig.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c98bd3eaff97b1d6915b4969140e1452f92d579711659dd2c74830b0f305126"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/hermes-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ab67c27b6ab7c24af51a784b362086f76596e0ffe1a9b5d9110b59508ef4fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_003_unused_promise/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"714b7aa46813696d08d93670a0e3f5e295f24cad5332d8afcafb5737fb8db81a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_003_unused_promise/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2e6d4a2c2af0f8a3c73ea51312d9327857881dda413cc6b65757eb17c75cf2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_014_export_renamed_default/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba4af45770d93648e55b1ba913903846736613063eca42aea030b3c8f99806"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd192affb5d1784cacd625ed845c3942223d76f41883cf99138c0714b4c3bb7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_018_invariant_throw/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e66789ca3859d25f17e1699bc5486e8b33390d42fb8bf15dd64ac12b154dba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_020_maybe_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35963e6adfe83883a1eb86785f6e0f40db75d91da01470a7aee5ad114a4f240"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_030_await_statement_body/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfe182017b5c6dcda2ef8eb2d6dadb5b29f5cfdcfed5c65d839a6b29fe9aa66"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_003_indexed_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3751eb13a97d44c59e0ce4ab206bdde91e4f781030e863a13951e2705e7e24"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_002_element_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b890da52660bef94492b8731d3e4874c2dc03f01c7604e78ce2d8c90229f0e51"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_002_element_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc791fd90bb8e1dd048f411a470908735c158d36196e7152b7ddbe274934a4b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_006_nonmaybe/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97ea082f29648b81130d503c1da9bdbabf10954d982ccf496fc3bafba5ad78d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_006_nonmaybe/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2eb8a0796a4116cfa3ad47626f588e05fd07e6146638599c8f6595ad2a2a1b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_014_tuple_map/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc1f689055ccba259f966b944f6272de1828607307f82d8679a33d92789b2af"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_014_tuple_map/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8220e24904a2e45de1eb7071417ff0b6a4983636dd02657a192c05c2af2d23"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_015_tuple_mapi/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10565b3dfce2995a27cfd64eb198b9f32f0c1551d3f5405c905775b578ca571"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/05_code_generation/modernize_015_tuple_mapi/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32305d665ec5f683682db2a671c5987838386e94fd96ca31a392ef00be1dd444"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/mkdirp.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6624c608b1413896242b13cc65d8fb3ad3e27f4f218f31a6c1910966936d9f40"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_029_tuple_spread_optional/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843a3fa62339a6d56ce76edc6ced7e020d245cb29fc52f6d38ceae5228935de9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_005_unnecessary_invariant/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8b6b641b8c26873538a0d728e45cdd3ddd61683562e3ca1c5d0f12146d19dc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_005_unnecessary_invariant/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b411fd4745c635260c909287cbd1e41fded849b632738503df3bedfc322e46"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_014_invalid_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb59052c923aaa64e6079a7b9b3212f53b9b7ea0f77b622b2ad263b96fe722"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_029_guard_on_or_pattern/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea357a6dce9eefeb289f097825a7acdef16239623d783ed2ea7c02d21c084d74"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/module_001_import_typeof_value/input/numberFormat.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d1bd95fb2fcb8eb0b5b5d0a97069f63d230ca5ae1982897bebf5aae073506f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_001_basic_nominal/input/checkout.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5326ac8c510c40637d4ce85cf63d4ffc86e92d1d34cf5c992e531d37ab2c2e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_spread_union/input/source.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc836f57d94114f5741155cb9ea3a1d5fd039653a410fc183a5be4a7a16ba99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-dev-tools/flow-typed/flow-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2430952d2004e651cc32275d52cfa28bbcd2f7a65408811661a4a0eb67f56b3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/typescript-eslint-parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"441bd691e0e3a6d46f92e064f08fe79b5572e19caa2751debf703aea17198600"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/typescript-eslint-visitor-keys.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7f7b9341d3b1b827194c6f1b58375c4bbf2dbb05a33ed629b3387c4e0701e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_013_missing_param_annot/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68ab48a992dcf089a32096dbc9dbeead114738ba8dd2acf59cc5e929f1609f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_013_missing_param_annot/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29702dd21c3948d24556987b33778bc554cc6eeaa9c7dc4f0eb0cfc6b1fc8fb7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_032_import_type_as_value/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab3ca8bd98df7a20c27ca4a6e2e7f48fb72a1a9cf7a6557b975bcad168f1ea"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_032_import_type_as_value/input/user.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a9b9957a73d4a1c95aee9ed11b849f5072b8554512a82eb0b04ea76321db69"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_002_sketchy_number/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b127d603c83242c8d54014c4f6ebf74c342e701db31716a6f668a8828846c03"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_002_sketchy_number/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e36a0a1e245ec34c63065e764b8ce4e3b072cd723de8d0605ba4b3b03235ea"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_004_unnecessary_optional_chain/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d10ca2351b78af514a01b05deb4dcf36325a6ffd1c3a8864fc09fad8e27e206"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_004_unnecessary_optional_chain/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33ba0dfd1f73b03689f2e950030cfbe8367181198b39dec3fe63ea4700c3faa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_014_export_renamed_default/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"808e4487a49d901df896b37ca59f9857903c82c0a40d3c1cd2dbce421e3a0ed5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd8be429e3073b296d5dca8d726a2f0d72f18522ff65eaccdebaca80a075390"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7300575ff8561f90007de34febbe5ad7397da61af6b2e3d085a0c0d10a4095b8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/input/Consumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa3e9a314f9bcdb67140cfda213bf3ac59666b7ea91c9f2c439c353b20063c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_014_invalid_return/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48d85c9a19abbf26792ce6946bb84c8dcfdb92054c750e14dee21cde9cca72c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_015_this_reference/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254b6f555b7e8f1992771de8e10d8acf7cb158aabb1948ceb24757ff92dbdf08"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_015_this_reference/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cd0ce00494d1767943fec8cdaeaa7028d67583538262e18bb8a156ea66d7cc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_012_cross_file_import/ideal/Status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706994309adcc9ed6fd020a28e9abe95b903e2c6a5671b90d5d20e4e0b0a20ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_002_disjoint_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2949ae7e70e7a5190f7344a8a2103e03ddd85995eda139d604f6c3cd20608ae5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_003_nested_tuple/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95170494ef174d34c2979af65957c48bf36203af19f23227637e4b7c8792c65e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/objtype_001_type_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5dc94f92c5e2f44aeaa368bf41838e199d6d953b71201ee8504b3be46875f6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/ideal/UserId.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaaeadcd5de8f3cb971283aa547a78da64d493a42488cb94469e8185de313eb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_001_keyof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"679f516f611afbaf32e47383c762b5ef82cb0de8deb15517646a39165093e1d7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/typeop_002_typeof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca04244216a81d447de22f4512f57ed005ae53cf94fc435fcc9f738ba51cd97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_032_import_type_as_value/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e3afe1c80aa74fc589780e7875728192c64c2abb23802c5da4eff30f74c4d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_006_unsafe_object_assign/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbd953c8591d675e5bfe391e827fc4ce0aa2760db8eee7f7e05bd834b7795b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_006_unsafe_object_assign/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea813e8bf3642b00e037208c6cacc95448e99bd1ad2e6369853edda6e11bb581"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_005_object_destructuring/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9a36511e6e35bb34a75bb63ffd717f547c1fbcfec1a709ba0de890eaa72114"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_011_match_statement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b37b6f62229a44af1002b406b6e300759ff22d41983e564f74fa1866d4217df"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_031_literal_property_names/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185995fefd261b5ce5e2f30bf5b39c50dc2617ebcf81df14e6bf80aed758c6d7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_002_expected_error_suppression/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ba1e62b11866d48f73b5073008881d8677ce0a86ef3beccb24edfc79b271d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-typed/jest-specific-snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc125a4fd9211baf1b1d23c2ca4e028c7b716faa481ddd1446d17e88c8a3272"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_017_export_signature/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde9f564ae6d62cfe090c4f6186e5048a1543b5f4e0d869840d3c2bac5af17d2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/error_017_export_signature/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0427093c5d5808bae1026abf7f5ab5095cc5e42ec8ee8e97b9ee14785d8635b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_007_internal_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49b9f0950af1f387a4f191dde5675df6f5e63c11e9a74596ccc78ab26bba5b8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_007_internal_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6093463b8b1a3e8ab66e16ccb151f38a6c7d0a659123d70c22366e22aeb11cc6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_009_unclear_type/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33fb6ead285cb914743ee25b8aa722e2e9df1e6e4f016e410627d55574aedcf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_009_unclear_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3a5ee151431ebc6349e8abae4a2cd654951098bcd1260c431e5cad33dabff3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_013_this_in_exported_function/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ead14c24576fdc12e8320ed4ce87341e9c339ed6b982e06366d1ced1fb78a97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_013_this_in_exported_function/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa24c595d0f3905d8623a0f9e82aaffb612214d0d45ddd6276923f8f6d88dc3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_015_default_import_access/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6b60068009582e1d2e852bf6e3030a430542cf48d3a3ea86c90b6ea02dbbd0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_015_default_import_access/input/Greeter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2400255e65801416ad63c691a43132b274da919c99cb252a906944ae99794e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_015_default_import_access/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cd1576c877a716e0c99574e0ce98c55676b6d1acac9c1808c2a466ac54ccf5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_016_invalid_import_star_use/input/Formatters.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ed7e5d8282072bbe00c7ee50286805840c02eb0abb8aa8009cb9ced1f1da60"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7e0057a94b7caff43e0bbe32058b2817c8ba81b583a138e176c1b8596923e5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_018_untyped_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7fb6bfc5143dcc6b1de350e4c0bde2984e0cb2ee7b43c023754e4d125f1b8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_018_untyped_import/input/Consumer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c8f482b46c1b12d1c0d4b786b094743ba298ae626137594408ff5aafa0737"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_006_as_pattern/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd7f74ca5720acbb9282e9a92c9cc90e08fff3e7d62f54dffae0e8f41c4dcc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_009_multi_sentinel/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0a50be61def286ceb64c72a84cac3b855cbdecf10cfa12fa7ad72b6a8c452"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/tuple_001_inexact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98096f64ed0071cba0cb45024da388e901b24b5cbc53524ddccd1e0abae0da18"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/type_guard_002_inferred_filter/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c8f4ccf5942adfdd6ba6c1f5d915b81c057d991e76b2b7e359fc768c5aaf9b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_002_expected_error_suppression/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6781c248a318bf57bb1148c61dcbb3da6e3e0e67071f154af910f4025cdfb332"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_012_non_const_var_export/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c1dfe9df7ff312d039cfda8467e7531812e8e42b5926ea08413d98c3c38e8e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_012_non_const_var_export/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4ba3cda1150580003b85a757619ba32515861980d77495127f03dbd917fc0e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_017_mixed_import_and_require/input/Box.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8438747651b6e8fc95b4bd471640ef574e13b4be0511e9441d8cb704e48d09c6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_019_tuple_matching/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15828fd1dd901ee41953aca729815eb763f0f2d49b59d6b2c43c712470705847"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_018_untyped_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e834fd572ca846db42e198c489d1e9cd66cac3236b9e59eea5c9b9f1660d47"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b764c95d86a133a6e5995c58c566861112b65e7b5adbcd21413b51b91dabb6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_003_hook_type_annotation/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc690d1381839599b32395152686567f539360e9dee285264e73c9e117ba4d72"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_001_basic_exhaustive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1783e085176cb50508da2018eccedfb1c02946b1551067c46c2a9ae5896850"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_008_guard_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"502ec8a14f9a2d5cd30901ed698455d8085941db6fc8d428511a1472173e792c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_014_optional_property_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af394d59a9e9c5fb72c363358c57371758220977a4be7f42f1882849c74ed76e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_015_multi_var_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa80ac66247be300793d9af3600d60ca52f6ca16e08e3fa8ab7d0ca85057e7cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_016_const_shorthand_inexact/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b1bfd52850a0f5cdfe4a6ca1b188f151a0b9b45890b605963a9bc6d952e27d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_026_signed_number_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a7320654d080df2ad69010493cfc7902128dbb432895dd2f5f3b10971004e5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_028_tuple_multi_var_init/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3c0dccb95367680cd8e8baa7dfbd82c4e29341d339b5dea40b3e6b1a2f80ae"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_003_flow_strict/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90dad92841f96300f3157f62a54f10fbe0117c9349abeed661149236d35b230"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_003_flow_strict/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d0d9ea96bc0597f09929d8a56946a3305d4d136ec6f74cb64d6273c30e478"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_004_flowlint_inline/ideal/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"358327f00a04bb11608d711b1987c7921c44426e1cea5e363357bdde888c8fcd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/01_error_fixing/lint_019_untyped_type_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4f0113c61e788ee4f9b1fffbd3b36f03e99d3c13ff384f154ef6f4abb3bbd0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_004_flowlint_inline/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae20fe44a4996189c164593cf5b8bd70e22a98ddad36900024b53b944cb6196f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_007_libdef_globals/ideal/lib/globals.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b126eb32706cb374c79297fdc1299f0c2e4d5c4d1b2c2c0d41bc1d8038053b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_007_libdef_globals/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0cae6b96e4888c83c8fce863a91dddea7100f25a26968cfcccd9f135b571d2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_001_flowconfig_module_system/input/Discount.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c2bad8059f993bd4b7eb22dae627ee2350ffdb5edef88cc2f98ae0270d9096"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_001_flowconfig_module_system/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa9c61d5faa2edf2272dee9c0e21a56620618963a5147e13e3d76ae0f6fa90c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_005_declaration_file_shadow/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"727db384585e62ab0755721fa5638c695db016e6b6e9734c40d50d7b1476da4a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/06_config_tooling/cfg_006_declare_module/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c0365e9f661ebe89111f7f0b2a8a70fd6f24b9802006306cc41a8757cfd32"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_001_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b039c9cd35fde5a44880862e1d0f1ddcf7869cbef7857616582f6042407e36"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_002_renders_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a61fa62af66b46fe547d13cf627ba2bf0f1bd8a6515241e615dd881eedf1e48"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_003_polymorphic_renders/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1511cc73390a098aa544c254eafd9ca60db5e8389205bdd478cfd2f4d70137"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_004_generic_constrained/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8298f458c72ca265ae24dbb663794b3d825c27f05d77eb0d2ea7404c10c436"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_005_renamed_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92b0c85ea5528eb98a0abf69f31750f6e57a08f97038ec1d75c127ed628588d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_006_rest_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c864bc92cc0d5342d25ceb6409f5206590d1ecca9b495b0059243faf9b122878"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_007_destructuring_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6121f4f1f76d1cac144ac3ea72d0ea039ae803563f7e15fc1c8ab2dd770399"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_008_ref_param/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c19aa6b6c1356e905b29ddc73e9a60c1c9ab97c8c4d5e51507bb401a564c7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_009_component_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc4a0d3048c98b5734d7e2ff900d25c25f282c5cdbc61cb7909bb3a1ffd89de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_010_propsof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceca2ce0349135ff29993bc81859b2a3a207b31158742fdedf4a17ab63032de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_016_disjoint_union_props/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f852860be1e70201483491791a5f8a542c14a9f27d114872a7f6133c73b6a42"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_017_renders_optional/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9928742eac72f221f1059ea6c7ad76ca711d77b2635bc934bf6692aa47b9c010"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_018_renders_list/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14fa870176472a11793e313337038810f3c9a4ce9c5e16d263df77ffc28e9dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_019_render_prop_constraint/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd174b288ae4e03cf467d016eed333a0275b09b7376b6b06cdd824b75d3da897"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/component_020_render_subtyping/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6984dc1ce4d48b2c7df7a4b344c95940e3462fe327fb4228723f2036ac19b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_001_string_enum_cast/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"854ab2980f37167e35df4304aa3f9391c58fd3f6050655d35f9faf017c2faf1e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_002_number_enum_switch/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"401b5d2f89e59c46d7ec91297a99210c1e53a6e1f2477b859be9672b126a64e3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_003_boolean_symbol/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cc19779275a5411ed428d85e2dc21918c7612da8e065dc52ff847717b725cd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_004_members_getname/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7311c72344503d0a1dc0376b5c979ac5a3ebe608d788ea8a4fa1228144d03ef9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_005_isvalid_valueof/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988734e20222142460e47b5e0b362bb2e7a12a73cf8f620a66539678ec92904"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_006_unknown_members/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5215a4f3bb89fa6874778236f9f2ae06619889a8eb0d8229e8af5c598f01d70f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_007_abstract_enums/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb803c187f9cd6b0f65b0d954457824fb69e13f6ce3b1b50214bde7c8b699f6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_008_enum_match/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc987f2ead329d3f6560da46887fbdb264456e5d17d7984de926d98f07da28c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_009_bigint_enum/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba08602f8fb8355f6852cd765423808d3bcf5df920ee2532f8dcd968be838306"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_010_enum_union_refine/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1556af9618de6652693611d250164b8d87dde5e3c9666931f60216b21ae071d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_011_string_explicit_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dd0a2b61ddf56e09c909008ddc115e0560671ee6e25f554e1276c7a7c8277"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_012_cross_file_import/input/Status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee66d26b069eac361af984aad70e14798d98bd07bbbdc306e32c9496b8aac3ac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/enum_012_cross_file_import/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e301a89d29c2359d854603eb938d1f234b0e0035dabbb0ed8fc807812c052a4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_001_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e6abee083cf9c00f94b0e59c59338157868f371e6e7dab149c5b5bf49b9625"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/hook_002_readonly_return/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce251bf044a4b919a7da4e4f50e60a7ef5815abe7bf996bd21a24cd44e9eb698"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_004_guards_and_or/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ebc0f6a3961d4be4fcc98ce564f9d7f617e9ea3fb244f296ec8da0f47e7aad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_007_rest_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f663c0add122e23bc84fa79e62439a50cdb683d0c7d7343af2397041ad0521"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_010_enum_exhaustive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4135a13c8a12987c6f8913c582a2c74b01bfe4ac6127b2e1bc1cad4b11502a26"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_020_maybe_type/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7f57f2b0fc89ae0820d4f8dafa1f763317847d13b515d78fc9824cbd5c04dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_025_bigint_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e134d9d82b4c3e22da4fc7a888a14a002be091a980c842eb3acefa151c83f3c7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/match_029_guard_on_or_pattern/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a17b55a22d9778e7d6aa6475dab03fb63d60d8d7c18271ed3e2e5993201fbf3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (evals/evals/02_unique_features/opaque_001_basic_nominal/input/checkout.js) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evals/evals/02_unique_features/opaque_001_basic_nominal/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"455ac2ba77888eb1fd0e0aafdf40b44b7c827f95d31ade284b228fb7a44f4c67"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_002_module_boundary/input/Email.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575523c1b4ceae86f6214d5edfc7f578792a21942f1b591caef086f6d917eb46"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_002_module_boundary/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"308a165fe6e972f1d7077d6204958da267f8d3ee59c171fbca5e6782e8402530"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/input/UserId.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a7f91670947a3266325a0843abbc3909943a54930117dfbd3ce9b39481217e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_003_subtype_constraint/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cdb3a8cfc741dbb230178cebb52e5024febeaea3d4de216255ce45c0f2b95a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_004_generics/input/Id.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2354edec97a4886b5fa4e5f7d00d8816643d1545293c19665ccc0fd721a4f99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_004_generics/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed157a54e6138e2010e84677e482b7a0adbc636892acc32c630fd3420f00354"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_006_type_predicate/input/Metric.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"217f049914aea62078eeb6a1d98fc7e7e559ecce93423412685e75b1aff85845"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/opaque_006_type_predicate/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb2eb93281f3bb39a7f6e0fb62bdc94f3a74e45e255c2a7a3283e0e1394e73"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/02_unique_features/react_util_004_element_ref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1015cbf459c09f37d1bbb71d625d96c0274ace4a1fe3823f70cae42cb88b6abb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/anonymous_interface_param/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f04f6f93f12a044992b497ac39c505c07e2987090ef2fdedf6fbabf6e0f3d1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/as_const_assertions/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d98a4dd91cf09ab58b34c4e6ad269b98c7f032c5a65827020c57aa444e065b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/asymmetric_subtyping_kinds/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dfe3700e77aeb5ddc91dafab23bfdf64d25cbecd2865e7244339ba9c632f6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_implements_utility_to_interface/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa08883344f8fb7f96e626d68f693d0cbc5c79101c43dc17b5f37dfa10ba1b5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/class_private_members/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa91b023fe9be9b03f13b2629a27493fa5e541e3bc18069205e8ac29fb154ec6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/component_props_element_ref/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f556cf638041ee7aceded287292423919802e10408ceea13a1ddb003761be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/comprehensive_dom_attributes/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f3c6a46769374ed47550fa2664bfa9315ed3cbb6b3b820b12838fe7fcc240a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_polymorphic_components/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547f3a3e1db60d024eb04db2485a89a7b7ef2b5a906abb6111467ecaa6bff04"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_spread_union/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3222ca9485a0459c9297661706bd3b28a4d0f12a1d7c49e0eccce0f33887ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/conditional_types_infer/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e454e90d185ef53ca3e201853595121d18b6b32eda32935427340e422f32500a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/const_type_parameters/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e57d352d3bb43d811e1d37c2141e5b49b9726c3b75577bd816285b97765459"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/default_type_params/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2598612752cb637239d741d57013e7bed8ca7178ff0977472450669d1fd28b07"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/empty_bottom_type_exhaustiveness/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e0847ee0c8c311f4f5ffe80f8da33ef360eff748847345685ed35d2c2cae39"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/exact_objects_complex/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4614970bd140882e1be92b8e701682d9d2658c2a18fae9ac416281420a658884"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_overloads_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76170c188429fe2c30624b69938055d2e4f170c88cb844477282ad0a9df8205a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/function_to_component_with_refs/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"244dd2c2577b37e016c3f2c6d4f8a588c2134a8a00db05d871e567532ba93057"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/hook_utilities_complex/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"863079c65218bb6984208f7dff63c8d7bdd99459acc64365e804320258c9d9b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/interface_property_variance/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57872d096b17e8583e61b3704303237fa43b69e9f3bfa1c2c0af7d62becf299"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/intersection_function_overloads/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bd65ec53d0fd99b9ce34ff617a6f5c67fe6abcdf6731559c435d350ff17398"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_generic_props_factories/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d039faebad1b2c169025a6185ba577f05a1eba92a75dae6f370edc9b20eaa91b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/mapped_type_modifiers/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b887bb8d25e455f1dca8739aedcb7d20355fe4dcf5116f78ad4ef4538d0cb31"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/maybe_type_introduction_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ddb117457cab8b2f424046c78c384f305398483dcbd3a47712a1420300243b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/multi_file_module_split/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5759c903caf09789fc63fa82e015766a34314df7bc1cecf4b191d113d9bf92"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/nominal_classes_interface_bridge/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada9d51b04e60829bafc052b34185d57b273c2c90e239da9739fa4dbbd9f59fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_combination_spread/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4824d0ea46583b387cd6a23cde9770b2a9cc1501f2543c03e695686559c3789"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/object_literal_this/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76e67f072aad6f56c0ffd953c9be2eb18b4deb4d9155971f3e893096fde9505"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/opaque_type_branding/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c8dbb72de9b9c739659bba9ad62a37020f458466898bd45b7b6d1ae387ba4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/primitives_not_subtypes/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b41d019ed63dfa00a01f20705c38fca265fb61a0889b2c2f34da5f4325fe354"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/props_composition_hoc/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1856d2ff5569776fc790e70cf7a6878033392372c7f5ba429b3449e010f8dbe5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/react_element_basic/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67601e6afb185f46c2b09011493527c158e34ee57335dc50c4bb518f89f8db71"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/readonly_functional_patterns/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5260f39156d03a74289c01fda524999c06c3a9c433666af8d702433669a556"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/sentinel_refinement_destructure/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc7b26acc4273edc2a6e3eff5bc2b943227b2a6a65671e26aeca84fef338bbb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/this_parameter_types/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf8c37a3e2f460b71d346dc754061f9ba633c80b3413226bec33569f2d6854"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/type_predicates_refinement/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f63e80b2e6aa26354a8db385a657ca15458baf3eaee4de187af194150a557b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/unknown_top_type_narrowing/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f18d9bc4c331a1c8364d023a80791c8157ee76fcefaf540e7646028eee3363"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_comprehensive/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28ea34fefde8e253e0e9b8e6cb0eee4b62f7c1c3ac2df6831243dff0733bb05"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_type_mappings_keys_values/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9daaa1673dc9cc66c90f152ad8e30dd14272e80e1bb86cc2a5cd9df6d847de"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/utility_types_filter_collections/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15fc6c14bf231c9d88534f4fd35ac0e917492dc741f82f153fe78f2bf51c911"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/values_member_unions/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9433e376866b353a3ea446a7903809a7bf514d3d4678f909f24cf6ed323e4654"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/variance_advanced/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dfdc3c717df33f882d14a9da95ada1a8c043594d738a58f90e8913a75e9932"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"evals/evals/04_ts_to_flow/void_vs_undefined/input/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d6f76fc891768311cfa68be923bdae10d93fa9e0384ce7fe784d9a7c462b2c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (1085 application, 212 tooling, 8951 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":"packages/flow-for-vscode/playground/try.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3f3fc6cf3545824ff65220e73d7bbfd66621b3d9553847455c5b26137f249c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ParserOptionsKeys\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/flow-parser/oxidized-src/index.js, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/flow-parser/oxidized-src/index.js in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/ParserOptions.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8d099a592d8fce4e211545f21b4360b14df61890c49d8e7f3f1f4c4ed1f1cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027insertInArray\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/flow-parser/oxidized-src/index.js, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/flow-parser/oxidized-src/index.js in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-parser/oxidized-src/transform/astArrayMutationHelpers.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e186cfd8a341a55fe1dda962df4dc1519d7ad70def06d23202b35e381ae0aa1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027asDetachedNodeForCodeGen\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/detachedNode.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c97dc7750a671bee16d5491a0d2c8571bf7c1b850a164b6a7815007a6879bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027UnexpectedTransformationState\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/Errors.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3625c890b760589124d2195b0c152abc1b1bdd0bc376a1af61934cfe5bf3e2d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getTrailingCommentsForNode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/transform/comments/comments.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9270b288eaf4700b864a9fe9c2648c46c9a39673fe32f0a4578aa01777dd67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027match\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/traverse/esquery.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16d11f32884d16deb369e7fe8b862900f4992de5f44cbba01128a31360962eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027query\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-transform/src/traverse/esquery.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59efb3ea1e52a62d12008e8fa684a6fb1fc89c0dd4aecc1b90f3f37033377fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tyrant\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/unqualified-type-annotation.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eeb1f46ceefa1a6b6e68243e003d76777735d80efdfb8f7db337cce27ac169"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Typeset\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/unqualified-type-annotation.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb00f1a83b7a7ca0fbe7289d42f34d11c53c5f20cc3e668cd5d7aba05f0eaa1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tycoon\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/unqualified-type-annotation.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"93206121dc3b62eae76a4564919a29fb35af36c96f26873eecbab6b0a68934e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/completion/unqualified-type-annotation.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3c4680dcd80b551bd4ee862a16443181e8accb86a4c22186ab03b371f923ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Y\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"053a7dc7574d6e88f7e7fa65775e1689240a3b2c9d1b290c2de5078ec6b5ea9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#foo\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c51eb69c58958545966cfe30ebec78d0f150e98eb2b16910b6730cdeb36f8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#baz\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bdc38d39af5f3204e845428f00a3837088ca5e668025496f188cd73d0d271d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Z1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"553806bd82bacca20aaf23c2006093db9ea698b7fd2bdd0fecb945eb0667b525"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027z4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9750976cdb45883939c2a4d4d3903977e1af9d2cc6cc69d8307e3d66bcab9d23"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a7ac05de617df3cf2ff5b9d7a5108dfffbec1518fc7ca18fa0e1838066dc6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa6893bf0cd6fad9dff412e20b048b578f008956c5743ac88b67a32af885b33"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92d1ee2d23e2d06986181fde6a501593441dbaa6b7768b9206fc54f1f81e492"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"26052a18c60b6f7522b67095c9933cf2274cba991af8662348ca6eab92144fdf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027I1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab597a231d52f329ee620e10f55ecb11105f598c3eed95cc6498029d95fca72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027I3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f43e9ada86a085e0ab8edc890124fab66a774314dbb6907f2cb01db8dd4ff3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027E1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"893f0702d7c9a7408e3e967a808a751b64645a6b4eae95031f534482d146edca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027loops\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/documentSymbol/stuff.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"46730964d901dc6f52704a12d85d96ab339b83d8e1435e008ad043e31a5b06db"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/hover_refs.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f32157ef2af6d17305114a8f0101033717d0779437bcfc48b2b65ba0c95fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WORD_REGEX\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1548fc3ffaa02d494008fd6620beee7e6703fd6e93eb9cce2a8150cc1948e4c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027State\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd557ee89505debe919afdb8de2e7441ab8930fbd3ac3e5e90966abecca39e6b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Preferences\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b32ef1aaa8bdbbe65a641f9156e5406435e83e18b3df73858c39468e6506ea9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClass1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4ef0b4c451afb82fcee0b8fa2e4bea4931f12af325d45509e0e3a3a196c226"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyInterface2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e06b356bfad21936f80dafeb9e34e9980345211a429c3189a579afbaa844f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myFunction3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/outline.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d33af540818e6e53e46a1be4dde56d7cf8faad3ed00cde176930109ef41d9f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027takesBar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/queries/references2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcfeabaa8500f07a43eabb6783704bef48def59b508bec7f9c57915d59e1f10"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d3a6278211c7fa8a560e81ed81ff74542c4de82872309de35072d376d45829"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6152469a4f60bd19faf44e761ac8a98615e32f28601a0e892f4b4bc78736ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4967cd11584d4a1b43fea07548b15b2a6d9f13e826f90b54fd9031eb6211cb2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a962aa75f3546c5bcdb3e3c13e7afb510d588e0e945340d75a77adec2ea82a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff69962a5a01095f1dddfc18c92704f1d36e856d78d4f2dc62098477bf87888a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922dc843c5ebcf36a230c5ac76bff99c0c23364cea105f149ad33a29d93aa0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c0fc9ff5aad10fc6e896a6674de92a91f19b19e3ba691e55dd7e0d947d901a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6a423aced663410390ccbc784e5aa1bf12a79d5c28c9321724704f361d5127"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba63b527f8dda2c816461435c7d0d9d5e28c923f84c5a7c6d0dc53fec51b9759"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testUnion1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7828f677e47fd23a0b303e6f9754b6be106502e9fa8721edfd3c98845508d68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testUnion2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e2037ed3a24492b62add3ec846e65f971ca1dcdc398f3d029b2f5da30a2b2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testUnion3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f719257ec95787b77791ca2dfdf9b0e4e3e21035459c3473627aa3d4b07200"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testIntersection1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"649ec1c7fffc8fd6d49f5db4b061d423adf528a98b8fe30d16581505cd4cc199"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testIntersection2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f80e6ee0778145f48eceac44d751f5df635c879ceb9cecd4037265a70ada95"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testIntersection3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dde17b8a82da70183e85c8289547dba9710725fd646d0536c78fde9447c999"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testIntersection4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a6183affaa4dc5f02892c5b3bade3f6a5a207b27936eb8ca7f02b345a40178"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testOmit\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c14639515a08061f70ec27a3330bcc4dd22b4233bea99234b0754dfa2ae304c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testMapped\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c562bfe806a09fd37d7d851d4316cb321d8cb4b9ebfe63fa4e42478cdf8d415e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6784f81a4a331607d6f8782d6fa2a7510e332912da91d6d8b775bac3c1728759"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d795c90023688129ae63ea4a30ba77f1966c25280de880a934c7cc9411fa829"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testDefaultProps\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff542a1917bd07d730caf2353c907f52c7a825dddc8cc7e0473c4da7a10a0d4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr_docs.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea42ec9ae87b1d5c1e62f947345942aee9c32fc4f89d5a1a0d26aa7169ab8dcf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/signatureHelp/jsx_attr_docs.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e6fce40849758c7bbba57c4a59cf9ce8a2f9cf24d5de2ae6e538aedb2d7936"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WORD_REGEX\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27a992f76b081c0cb445c148d3ca37da627a54852cf41cdb057d995b658f59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027State\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"72537170b1bb213f1cb5fc6d87628a037458a72453d140158a9e3ac4c92c10b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Preferences\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8ce653e8003a442f5a06555ef498c42932d4ecd550abc36fec3926442e55fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClass1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d14bbac206a6523f18777b606c635f21945e311b26ce339da0cb457b955f863"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyInterface2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b97495ec0c6f58f3ff5afa29e7f6d68b712e3a63635795430390d7c76a7d934"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myFunction3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/outline.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5873e4daedef40942496476f79fe47796e80be3e0dd101523f65c671bc15f6b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027takesBar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"newtests/lsp/wait_for_recheck/references2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5304dee22d20ec6e8e623ce62baf24274c2d65b6c59d7369f36f27756578b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"394179bf4002de5dcce3c5247013f79d948397aae49b44286d1ee036bae740e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d526a552c02dabbf3a4ed7b24542843cbe3e97ed66f94ee4ff005ef9a737e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6bf835ee4945e4bc71a80c5e8ef9d1a00c7408ef4d2733866f1b0d9c57b846"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"119c6414cb617f50f3b3ea082668b9e9d271209f2be0900a8374aaf32cc01202"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82a151d4e7e718b2ceb394007945262078b9b73b438cd6853c351e60547d076"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d4faedcfe6595b09a3c8fdb093dcc32aefb73ba49310bfa7cb5fbfa26c8c68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6fe38b2302e274c65e16b8d4b88e32fce6b1c7891a54ba424ffb11e77d90df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"10de54ff3810c5e5036677fc4d80b72fab1e40d539bc14a387d0979c03edb100"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9f9205febbcfb6e2b8bf7b004e1557c02f0d5ac259d4eb46b07e9ba29e0036"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b65cecfe2bfbc5ab54f4fe8e61c30b9133ce569aa2f79d3b6a56dc8401d4097"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f20eabbb0c7208c6ed94a85942d222f29a49c8b47734b7418a93264363e57aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a31e874c0c2215f08be71d1c3068a29daf5ea5e0c0a5960c50674167e57791b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173cadc97a8e8e813d0712b863640195127ea3940a49f9ae4e2b9456dd3dd7b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4afe015c6868dca29dda9eeaac4d1e74df0bef34ca39fd6261aa060b6282324"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e11a41535a23bca28d521d4b0ae12d220eace184d131f1e6a0587d04b9c1be6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaf4e79d3d59bd0c53aec074bee5e28f0fce931c74e1aa16c80e0f3e9704c70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de72f2067232d9935c0dc5603418c02279b24e25099af75a9137c4a0f42be2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bba46ca3d6bc5e9b0c2935bfe209e6cf0e04889c78218cfc09e2baa5a88a02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3f6353a512f3cb52833f84f3c0e015649115d18f764eaca10d699868b895d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f9965c99ffa3fe7803516e7b1c57f5485e3a00ac69ec0bd6d0aa5b01e318a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"184b79f6ffb1bfe4d423c542f565eba23be69d1539d0d82d0d8d1642ddee194e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f3bf76a3a4bac7478524240c84fe7aed540ff298911fb4cd2525e130f97187"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c158b1ff3851239d899534f1026b7aabc4cd0602ddb8c330b453e3fb60e4b703"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b98bd2f2feb4b3b5d89954e5805f472c8cce9f57c0242771bedc72754e13ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0f49c0655385855204c1aa15983ba65730376ed4e4b3ee552540fd63aeaffb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd42450317e181be3398082151fc85381c4dff853e2acb334e496230ffaa157"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b04cf03d28e58b947b0a0b6b788d8d923b1d44c674b01d4836edcb4c8eeec0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"948401b3d232602bf98ecb331313baadd859254b5230938f276682aaa5b1de67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6805cdeaa215289c26cf7a3aa5c44903a193f0666aea8c033dbd0b31ab7406"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45ed1878de694f34d65d615c8f25c1c06154e3b5634a3c85c512cbd58394ce9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b10e2b4f95115ff529f90abce1d861d1540363904bcedbad605c0ee1b1bff3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636e37808b48a72f9842528359ffd98f607873db0de2f97c81aa7e173ad23fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b4cb5d04919bd82b3e1c266155235356334b6ed57f29ca1cb8b270cd7ffe88"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac5a8cb5f4775646bc8621f4ee417d8a43f67764a12d4f687c877cdc64c1122"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cbe3a8d464d139b58c3d763955b82a7d4b84ec77fcbf125ccf17ff2a4d9d1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1552c4881cbf77f957ae4fb070bf58d345c29743cb9dc44d00f874f2efc75a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce22ddb10bd9326c3c390a4a34d3d6b8a744d6c9be5ffb3b84e5e314b844894"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84003935fd1921cf74fae009782158d053cd16f3946a00b449f305692b54223"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0048fcb4599e3b0edcb9457552bddc58c97843f360027c1cd720becb5501aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47bd3066e24a752c7e7955863e9d56a2e7264401928bd9443a1799e30347097"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2616d4ae9dc1fdc2e1c5e8fbcd952fc4e501f76213d04ee4732634d628ed3041"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d7297978d12e8dac46c185c28bcccd2ef627a5a660baeca033d8c223cb4c1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9764d8dde5ac8fc4b9b76fff3fd566d886f28816c280a3a4cc940ddd3cffc44f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ea8633c46c8cc80ab7e8002cb2d075162d03f35ba9d56f6203795630265334"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5737218e9d1b8385b25d572a61569f5b0a48313b08eb10d97f484050d5bf40"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d132d856e720cae615c73fd8734fa8512bf13bb128f7c25e08881e729aeca06b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c2597604ea4d5afdfb8243d0921f12db508003cff261941e544fb53a04975"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece73dfbf332625a6e3366f1195ae304df65033589155dbea3dcb16d01fdfaa6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad3bbad3c791773971d3210e95ad67c6257eaeb5a58e176ddb8bc64f208be8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae45116a3bfd9c9a12e10be1cf10cf4ad920fceee42e2a644b66dbf53f6ea99"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47fa1afb962e0c1f9c2aad8708f7ac8cb0aefb2e9fab15fc37ca9d7a97cc90"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ae78c443dcb84e2e55be5cc7e4d70d5fd9f77c725c0c73f62f6215d5705c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4655ecc94cb32c0adbcf7d4cdc76e0d58ac406d6b376f112b3d2f7387d77dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"1963a044f4c7ffaa56393670f8f88d7c71c1681034d53698f85a583de4eb67cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ebec12092a9de8436be0134105d88a36d89dde53af53ffcce3e0ee0cc8cb5c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e274bc0a81dab608262ebf1c19772eb133b78b5ef780c51e83238619ee3f4edd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d86dadc3316ff1b89e20860471fe1a5dd815f334447165f780bcff386535811"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68ad3280df206d2835fda0d756d7e286d5d0a6a6eca3e3220337f4a16b2864b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"444dfdb4b122272f132eb9e33a988b939d50005c1dc913e7b4b81773be9968af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8452c4ca05602867c7e19be33292f7c673fb7b30f09a13bbdadd530b6eb1ca2a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a05cb5ba7efb5edb7a8747420ef5251b3107dbef7d7ea25989f99f2e7e0391"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AbstractExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"168adba6b7d15a1513324d7e71913ab71475f50a7e4dbd17fcd8ed771a9cb860"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d3fa4c8d188f7dfcb9c13e99675d92734dd0c2307eaa0b12f70ce1d38fb6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1070fa05fd07c9c7f1e96136f1315e445e3f2634c03c5ba159fe218a94a986"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50f2644a251315e11c56b6cd7b6fc9ae5817022e158de027623bc8bfac6c0f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77787218ed7ccc48802329ab2caf0125fd29e591386736fa8d3fa2221ffd08c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5664a1fd11ad3016f965c80aa37e14d13188e4d81771b64365c74938dde37c55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb926ab16337534aec6168def34fbfb9228566f917930e1ed4c7c94d0330be8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bc2789dfd4e030b40f04d76570b87a6f168bf49d3415d93c66e04c1ba2c458"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dc9cb05b4f16a50500480abf2c4b81e273ba368f263c9e0faee5d8d0385db0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"38059accab9152282302e3fc5ccc91153695b4d93686294bc79c2ff7ead77b29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#privateDefinite\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-empty-imports.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15db5840eb2bc83ee3f452c3a3abef267ba43ce25d2e405523c106515736090"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9388c4d0e175c1f443c7f92d9312f7cde9e0a44f9b753756acff7188afe1c3a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d4a33ecf1b446dba865deee1b36939340614ff9eec74f207c2262bf9c36a0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8889695d55fe8b665b46b2e132cebd0c14fe051aff10ee085d2c61381fc421de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2da2767e0ca4da3ce6aa1b355679c99c4b4adc4782efd97cc9372539a6d7f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"33daef4d6c51b523eba704517fcd1ea023d761dbe5b874d084afe4c6afd7c6f3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fc694a0d6011e92bb341bb6e9cdbe3752d3319ad741f483ffa0db6744f69f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a0bdab27b36517765954e75eec325f54dc84126fe59905acd8a9b4bc81805"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3908e4f1a7c9ad37d7b3b7ff8b33b2ac7fec2f6e1098ae8d6628c60d3fbff2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"76559a6b9676f76b7b10cf9966d389edf0127823d58939734451025f416d47cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bcd04af6e6191739a31753e29f2578cadf0a1d0485f84726467e07384d5c46"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb068572f07a72ae91fc32dc1bc67cd4e30ba1b98955f774fb2ce937ffeb5a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f100350576e2e8fbb4e1efe7551efc2b912da5d52b8d7b2d679aaec27d8a6ab5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"345ee53eb8fdbbb0c740468a6e81b5c733b685af94da7047ff15f7482d3fee22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"51995a40049136fd12a541223c551b04d28e8eedc15d3e250e2416b23509f23c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3e5450abd87cd41227ba683e0a988ab5a067ebac27979ce1f4ad269bef124f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2048adf941f7dbd59783f2079e1c8245ed24dc3c1ecbbf8004c210746b27639"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1461d24fdada0cccbefa4f48d4d940268feb606cf977311051e3499c08fa0ae0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e976b2e7efd6f9a51a4c14ecc797a2bb4c22c64f0782e08fb6c0a441f5c3e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001e59d4ed68ad2dcea9fed16626f2ef3aaec590a408bc283c7645e782492e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadc5e670df636bfee0ebae619ff2194e374e24afedb3341b75f830902d463db"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a911561d772061df8962191ca656e8a078c42e943543c549ccfdac94ce5ea9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2485be8ca98f831f512bddb0bcd77f6ae901538ea1939b5f1073d9c2bc57761"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"80476656f8a420199f3f7820f4c1bea5add543fb4e847b714275046dad3e3f5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f48b390919ab8f1a17dc3dd3d1950bfd9cccc224cc682bac4ea8249c2865c7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"22596e4fd17382265fe84f9f9b17b6cc72c315831beb5be045602d6738960a3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5626f258596b7d548c592b74f22f32112e21f9b0cdc8d4fd3c5a80f9d6ce0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c269342c74bf49bc8f9db46381ef81977d36e9cee61c3c6a7251c7b39984b81d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a816a396ba637aa8a1bfcb1f679674a3d3825c7c9cd59fa7c2f63f5685f737b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"79808dbf97b1302c52693977c38d7a2176af88f6c0bc52ec08301437012ca748"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffdcd2d5aba40c0d2bdeff2bdd148e3508bf1c0da183a013b6a05c55acce1b2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d421e7ba9412cd7258bddd4ab252c665289630bec39cd5602d2aded30673e5f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"673673a5c255b2a3a14fd2ae6c4b323214b9490e8ad6dd618fd0b5b7a3822be3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4301a6404a6bb72d91e4a822f4752111208210530bccee6aa4ae2f902a6b216"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0f5399fa83de74da3e5dcc146ecfecca4e8639b1065d02914bf272ada3a19"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d478117142a22bc826485809921790f057c556d1d4e152ad1a8b0c2d43a83f36"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d061506ad55d0d422324ef9dff8b457051c013c40677e7c8cf6b3282b43d52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e930e37e726f576f240221a9ad3b76d758321c342f472d4ace15655fb518f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e406bf4a5a2d5107d1a4c8bafb6e99e946f8284863b47cc490912d8bb0dd0b2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef8a6a8a2935b27dfebed18ab3c0f7061b0acc8485c9d46f4e189c649a153e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d36ab65c6b755d480f57fd19d4bddb041f9a1042105f3a43b4483ffe3ff9bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9368541ae75cdadc741ff555717a55b77375d77875a89eee002f22105542e1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"281add8b1295ae9cd1f09c1adba0da00774c27b9cbbc778f8a6db19edf77712d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7de42e489796667995c110bfc8b0cf58f6ccf1ecab35104fbe660a7c12ab68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1417a75b35ad18be6dd6bbeeab58543d842b8e43360a8e16c92012380d91746"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7438ff3e54bb87a3030c7a337bee40d75d78906a41cdd93c2eb15b9a147a40d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be28c83410ba57f64d6eb6cec3e3e0a80b062e6289da7a66e34bf4990b5ef8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ba7a4becb5bb49fcd2a28a6a4cf73e7e232f0a3f56f04a078ee6bc1332865"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8610be9e3fecd676b4d617123c04616bb43fb513b7f5da47ccbce0c34dbe352a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e113f2fcbd67f99475917262a7588482cc358a670c70c9714dc51412fe3086"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9325b11c585552002229f15d48594fee8fafbcc8da228880a39e6716f1d80eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28613e1e0b7a8968eea0cada54317aca1c3bf14571eba56a46c892aa12e8448"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a89bd2bddb115ec9aa229a563f4fb4af4d586d1f98ae2695ad09be47408fa79"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"881eb50757dbdcab34badd049f70c784a1e7d55143689b64cdb39cf063afc323"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6eb330449cd2e9b46877235ec0299ee6244891def8ea47501f00a3ed045e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2fb37b1364664b48e313ca2422bb6aadbfd5b97f95ab44cb37de1209ccfda0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe18cb7c1b0ad133c422dcf6a9b1638e12582a02b28be24a3b377c5c9ab45007"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3729ea6dca048e7dde9ce19ae354e62e358cda570c0942aafb238a9a8427a04"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"610752be18ca8b592ddf49ba4eb8d0a4a8ce1d7a590a6b80bfd47eae864982d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b8d87e2e9a02859309e87fcf608b93d9f51e9ec48e9ab183f13c55b9020bfb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c9685b5a5864e14c32b79ae59e95467eb956d157e7a250cc59835a0b9a4068"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df35d53f7204581a46f5222faa8ccaae9d18186637f891b2c13e7560e251af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AbstractExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ff951d5548413c927223c63e07250caf8612f282ee4e533d92f3fe70627ae7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d34ca5a1ceb24d40d1859ad813b49eca97ec0984349537eb49ff58301d6122a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddd64bff609855b5e2dd4bf1c1997160024a83c8ae42d36e8d443df69bbc9e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0ea19e95b84c00fee9ce2866441abb6786e20d7231b0f424e90b196969a929"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e5c0a323a6be471d7bbf91d95a18ac5656fff26d9b7b3abb4163d9eb9ab667"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"6372223a54c90e403549b8dc35505394b506db25048fdd2bd9b3d1e34b0ae41e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93246d241f93f88b8755fa11a4d7519401938e4a8edf92f39e2c17b4172080e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb3dc75be485e1aa86753786c98a83f37b91edc28324bd2aae6d96f8f6d3975"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2351a39bf361c09d700db766846c7a542b71a6805e91c10f163350995d04c060"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"da19fda978399dc21892cde529dadb2949c82707ae996cdda556dd42f14b7521"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#privateDefinite\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap-stdin.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbbd657e8780dd7201d9bde01e00244ac3fc80ae1ccf8f77ee60b45c84079f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb1c3c39233ad92ed85f5c0269dbb413042c167598c861283e121dc3e57d141"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8b2a9072179c612ab6aa8a9541fb29fbc69dcdd175ccd007b5ccf7689983ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"170d5e6b4e09c03e7faeddf1ddd75e715795b082832a77be452418e0e615ff7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a4a5314313819aacd5a258d57823ff3c70e914dbed4eb0731a04c8bc2edff2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"312dd6e20600739235a772517a45e031283d56849fa32855586217acfddf4377"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4751c8d7601ffd1c659bb2020724b8096e5414f20c08718420e1e78217d9db25"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"991754fb7c91e31ff63cc700671e5d1f0c6c2071d83a89c1dda77ffab6debe55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d04c5a81bd85fdb6a6ab19cfc723f72d80af951b562fe67c7c85bae5e31b063"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f0cdb916941c164d804f285f40ce382f594dc8d37252053202e8dbad638c70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9002a80f2d7166c05d464687229e177e1b1b19e70673767b02cad900130a2c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60516c7b596f9807727a348d07d8a850acee5839ab4ea7aebda503d33495ef9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c706181f1bc7a26f94e800193570771d2f90bed473c674732f6b87a783bb05"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8da01eaa0b356aed5b220a95d7cbdce7f90d8978c29c80fbfc63a175b0e6040"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff16f022238bb09e6e71b6f36492a43bf6bad83084b0023760b3282d6843d552"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b471e6da33bf0be333d0dd6432f22a7eae0e86fb2c76fa845f1dca17741608"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4f1aadabb6e7c1db3c022f0abc7035ec007123f521c3fe464b79a342c50ee6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"961aa197b370c656e0b277e83cbf13261efafe458ea761756eb47cc87acf5249"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b0fcba8fb4fced9942fd8610f262a51629293149bdcc7b0a8f832047dceed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3af0b3645cb0c3a58760e5f403d4b2221bc458eaf59f3b90c9c4843c77fb740"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90edfe12f98124e4abeef9806b7037637a8a0e5c3307cd58e59c5f75fe94b8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a5beeb56f301546af0208d25851b1ff9aebed1bec28c5d4116cca63cc61d93"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7684100a18fa2c092baeb0068f06d55f9295e54eb7069d47a3e0da40365d8178"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f84a7f53240dc02dc0249f10353cf8d7948d37e4dd5d0d1d5c40e2d8f7b358"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e90ebbe4f88da1e01f881ecddb00f77f3539138bf6eddeb79fb8558366a3d8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5367dfc58afa05c6e37fe357c2c2a7a54e2a2d420d029aa030350cc51576c20"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0388867c08a813e5acbb9dc69c740c91b7ff9c3882c150781b74cc2070298dac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3046c9ee75a97dd18c22c1d41c06533380aca3607c30fb5836fd3f386778bea3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c289003e2b5a2ae8133d68f3c22f30639fe8cc96f47cbb4cdfa722240025f981"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17c4f95419c8f15919af186ce8c83dec73951701fea4fe0887c9249a3892a1e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00ea80e47ada32936a912ac963202789b751caedb241210df1e96d14d5825a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0c690babd41c0460a7d98f1cbd8f08806ab3cec7a2cb4304be53bf9b2d786e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"708f06fb0748bd3d7437864f6d22cb3120079effbe39433fdaa602192aa80fe5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3883c2e58d21283919c4643f62f87cb805a6efa11d851601aa256544cb83ca3c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e5e5a6b0489ec16d71cf3fd37253bc456b391a2bffdb9e52b3e78cd265793e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5853a89b177c135a9b015e15c1891c4f9d296ac5bbd66a6d52f7664b41df7aff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaea13aeaebc5eebd7dc9326303be538f375f430c1e17f478850cb9df528435"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"74481934ef2c63aa02812374ea0b16f68293edb95b65ca4757007cae743080d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7024ba78237c991b7124f175274da7d5b7dde098ce1ed99b8e25968f11e083cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ccb290d028e3b7e0634ab369b9aec4f69493241cc9d30de5ac9ea8d79b152c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcecd0b35f4bcf61734bd5fc1745415521dbed6c0fd2116c9aa0341cbe7fc17d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c33a787b47f0c72ba36db55965e77354098d8041581b625a60bb5f9ab6d11c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c04ebf0ea99bfef228d5ecfb8c3d44156446accb1136b2b30c9b9069cfab91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"812fb6d29b1fac5e147dcf2936a78a008face0a1f3ea66549e2c61132599c462"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7154c065942fd79d6e3ae126b1d5e31d6034f54a6cbc78af39169aa74ef26cec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7cee22a7622bddda15f27afc57371a98ffdf8c58ebff7b1fb14bb2b92bfef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e4eede5afe65f15e4c806132464b07f09c54453e3425459197dbbbd3429f95"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e08ab6ed201d74e0c8d5b8717ad81cdf83bf06dcd09389ca3043e0056e616"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"13be531dbbb1940c08b8ca637c36b107f108f0b0501c8f5090c12350981871f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d6d9856a738ca2e98769a29137c1d57527fe0e95e07c7224f464e326b53570"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"88166ddda9b443e6b35470c72066214d9285aaa172a061f7f3cda610994a358a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faf8efcff89e6616cc4c923cbc79f3d9399d2052639823fcc0a8cdc8da476a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cd021f57edd8a8986c022f8dac5982f53675f7c83aebb3722f496c7679fcad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b570ed13d8440c234b0e346311c7db06980cd9d6eeefb01a080c20917021e73f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9e4c6b1369ae59329f45b94c837aacbe5f66dd477a7af7afd4850120fe0293"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5004f644f1d55b9d06b2aa85f59a1dc7555cf9e7ae5958bf68ffdb1d569199d5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f765b82dbd4f8a27f2c6f99e5c5936283cffa352d821a87d90fa66ba957a7aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae14f3517378df4c6c471698eaae89231062d08fcbd55cf5713686fc5834403"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7927c8072897debe3f49c9e8d562d4ce902daf479d7809667010cb0a5bb88bbd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7767a73021aadc2e51a4f21593d61ab692d0c9b881a774a8b9858485d07b8bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3784f23245947e2e50760011f24f046b02e0e0a39ae2c34a75a3f887cace8d6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"772359e4202fad8f225a48a8c4da0b83a9873c47d9a3b36dd9801a93e4147752"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AbstractExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06fc50b652fc18d3bc2f501e1816fe0cce494c3c2002e4dc946c7eee2faebb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc9375e70de07f9368590986db7045aa70839f7090a8e06309c97cb11d314d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"798834491de606eadbf5178657d7f18cefce803a580bb61f0f471866880648e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f992953cacee6efc6721d35d50923a953bc78a07794c4cb71be3751ddf38df92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b4e52a26cd6f03309bc1b9453d762b00db5ac75c896b06df2dfa666c09907"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd56af677b63eddbbad5edffdf01a9ef9d560c749cb47fcea59029ee74f6f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b785fffdaabd2501abd8adedea4cc9f7c2d9d31cf7a59cceb919e0fb13b9fd0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edd9f41040bfb382ee144b6c06735164d8230d87e382385c351233294c43f72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c24f27a60db16caaea11adabba52c847686c6e4d300a1d520e4b38dc6c51b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f91872e989ddd0383033205b99f05440a1708234c2bec011cb5eadaf77ac0eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#privateDefinite\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty-inlinemap.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e92b9ee680ccc7db31a8d0bc71513ae3208edd714ad7b53a0854cf25160a78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a6945b17d212c4198e40a9b0ee7152393fd362301dfc764e66c2337ba14118"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ca4dad7d7b90c7b63c0c3620becdea8a76b13ab17fba68d5c274a48ff0f52e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"59deea8451042b6875cd87b16f6ee64f17a3efb11c8b02aa33fdd6f2bcc74ca4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b909953b21b26a597dffffcc58ae7dc13a9e6b9a1fff4ea535bcf2c4a5913"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae46b43025aaf03ef53f06e343f120a9b81de0f133dd2c1560b53db55dba6d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28f6bff50124a2f5e71593e157a6259dbadfe4ec822ba83ee9b8d693af60865"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3866aed56c1170ab0bdea0e3ea7d05bb7279b35726e0d8cf92d3aa3385cc5f18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d7a06788c701d8ac1e3f1e7d8330db2cf12556022ba476380cfdeed678675a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d704a79ccd24d441ba885d458251621dba21a9874f583309fac11be213d44"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bb9eddc72c96f8b79188d87a3f6672db3df2d7420919a7a72dbb78966cab82"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dde6215a075aff97b7cd25767c79f4109209a6aa46865789a9c4d5df34a7a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68e4564fb33254e19b7799bc14d84b8aa3ed795dc53e11cb7cf6749e92d5dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"af52cd4b405badd8d39834fcf2fd57c24d68bda7a1393b5ebbd4cf2d9a2e8a89"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"019046dded3a39bdd43070130d3cc865d5b60c5f721d25032e897ab035bdca12"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e11e6da399791df1be6b14a20397e89f8d527cae2f6fd3ca26fcede6cffd4f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5cbb09d7e05342ad682ce87876aa4793fbb39c1adbaff4e0c29ce84b7e6ee5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0793b2c8c533d13cef5777083bc7e1871dc803fbc75a1d21ad955e263be44c6f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"274b9524675e9bf9dd38b7db4898610cd3a314514875a88e1bfc78416b52f1c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d411d7cd35affb7ef6e9731bcba2a0bc7e5ab617b6ea7d1d5d2fd4c11599a1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c116c816bd210a89335d4241666d6954edbadcbbdf1b2caa9947556da238679"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a229655a01026c2ccb531ee6778c10f1fd7076b5eb6f78ceb7ca581d953ca72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1bc05c42cf943ebb8d7ea26daea5c5999a2cc221c5de2fb9daeea0501075a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1805faea68b559e8d3e39a800e241aba7e33a0276c6c4ddb9266e94a1cfc3b32"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da8e1530e948ae3e371c3afd46510b2ae59bef2479bf516d310c39fad458804"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"11160742e2e8ece29daaefdcb6622355c419a846a34dffc4da625336fd3fe100"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360d2a801eba07d9e5c1dc64d2949c7cdeeddd7a2b7723e0fe24021c6687964"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"65643cbe5e72d5bb8abc2202993e5b31d92aff0f4c64f66aff099670afdc956b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d914ab305960833644a876e4c07e584545e0c97898fa46414feaf33dd5471a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef70ca84d3cac4cf63de0b5a31361349bba700af3ad90c957f4ebcd89dcfc05f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57b3bfe8b6008fd41d60fc69e4f809b833e4cf3c2e132c02a46be03d3554fe0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f290894ba2673363f99a4ad0d2de98c5889cba8de1e2a77de55c9c215ad42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8c74386f078cd136ac9269447fdcf2dcb1841e45a45553a1a1d90da186d4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497c9d41717a3320ba86ee8e1c7bde1af2d408f57b07a81a9a7d7b4a56bc3af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e2d951a7faf5ad1bc9f06a1a5bb462e4deea7c3ac2f1c305ccae2de1fc5767"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2561ca2e400174e7383adfa1c56517cac4f5f9361f164b441eb62b19d1acae1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a007e21a1d92b0f730dbe0a47066c732492bdf11587d634a601f3bcbafa4db2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a72a895291d0145ac493094b689130f4b8aa00fe1300353b02e640de9e2854"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc54f73a63379db857f4df192b6058e142d7bb84a8e33a035d711e1a0a84c11a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f5f022f898bd891a448984f1d2d06090bbc8372d86ab5226c542d08010afc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b574dca21a0a69c42fd05013a01eaf06309e4a5b374130de82a11e033ec8dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"77676c48483b8006de54773bfcc9b7d6f56f1a5a4bf6d2932a76cb77a3a0876f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b4887aac8f5555d0355b345bed590fc9b5c4d7c57d1349a592646379e53b6c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fed81405602c80167e6f24b127ee4118b70037b9ca39dda1dbbe7cbc0574fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c938a43da7fb1b03432f79fc8d9c646974863cc5a1232b90180ee487edbfc8e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f81b061d229ff64d5dc05773816b4e0221ec94686fdbff8359b2f3c2991443"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbbd8418c8d00d673032faf9ebd0c72611b2ef19c094c1aac60c6dfad5e4286"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"812e5ff54db1015af7088a148d2ad8f9eddceeb092317be8b7b0cd46060b0453"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df6bdac6909b55f1a664ad8bf25052bf077df754e2b7548f4f72a237afe57b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"995d1daaea0575c06a3d477d13def357ee6cdd4561b887ef8335e882f271a227"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"779e039d7594277f905d31bf70b20dcb94ef7704a0781d4685ae004df519fb54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"065a586e3fc6b2b07c8f7b4dbc200841bdb81185667753902c7440346f40c5a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be0c906613f14a8af1753b9d2c3cc1d5ac4c29f212b9a2b52e0beed9cec0b71"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b2138c1f309ec8ccbfcd52db4cd607535fd914f54f63ca51e53e1adb8420c1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7253ba7d11f4aee58f084ef7a701d1d73789a8820105ea12f1ded4f3b30565f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37014ccebd7c8c2b591926399e96b03550840945b5fd4108f3b3b2b3d3aebc8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6309fc2f1b0a04d39b89fcefbe0fd6a849e474f9e0b75f9b4a59ff3528f469fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ce62a40926193f02d43b64b70c040f030564ff02c5d3d9344e9877d8653a90"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfec619cab98306637e33b6ebc0b986b9bed4efb0ca91e4b1bd44c9638de3696"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b319006abf8ee8264a6aeaf0a3153929d13ccdbfe0bf0a664a8422cbca17f0ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f07b5ec6e3f4dc744ec6a5781bd3918b99f647eaa6e2d532274f1333e59c96d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"287fb7a02448bfb95497a750a19b15b2951e13b6df91b42d12790a36254159bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AbstractExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fb9fcb765b5f5ce767cf7d1a05963384744325d641c7dc88d71d4bd70ed8fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e4bb62979ace2b6bda826e6facf64a7a73f897e811540c33c7bdcfa6dc8366"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21e10862582a5d879d28943f59163aba5194c2a0755eafc78173c0dbb317d6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccd0aa3022db555d8920f5ec8f79eb02b4c648f81a069172268716068e0511c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8058fbf8ab7e7254331a60cb37e8016101329a7be378b1a4d3daf56119a5e13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f2f791834c2a11a9cc6a56e22c8169f04ec270109a9e3410f24057d3deb005"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d69b01b0733a622103a68e419792dd22e4d5d358479c0e8792b2e1e2b0c38d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"879fc72ecef38f1cd3061584a6be1bcb2a5617b4a4f13296a3105d91003598db"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"da687e8673f3a2ba87e426e68140ceb35ea0fe06ba74bd4a3b75f7e91346dda5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367503f9fc950d7d0ef4ba87022f1b7c3bb1701b8ad6415a20007075ac06c8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#privateDefinite\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-pretty.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2967d1cd279c90d607c33808c51667fb98755bb722aeb4ec8effebcfc6f1764"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1b668680a2812c4d07b9d180aa444698554495d1a8af24d65dbc4f1e2ec92b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1dcbfc438411c4c01b134aa21ebab353e84c484e86a63bfed247d0921f4108"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c073a200c75783e65fbb59d87084b6fc96ac4c7934f764372012dd4516ab6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f55e89e37d422fa79b9ccad2405bf4273ea9ab583ef945ae664c64966415fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6af54b0694e85810c74e58432f7fd6635b30ad9b479db4d94775bb3674171d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c86c00307b7a25a3d2eb22901de8541c4b40678366b3280b42da2088f750462"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91db8f262c59b25f34ec3dc9e136fd3f8cec81c588ad8aea7d9d761c99a795"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf031be0248b20a96682b5f5c98eb237cbe316e81aa1ed05d5f86e7bf95766f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d544166fd4c59d9f94da2ff17652467c29ad36ffa63cb15105a00fc18c12a967"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"484580aa057657aefce55a0ac4e8a5fd3eb72a1f2d0b956fa9605e371a306bdd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5973bf03cff22934bc7341c8306c7e74d8e7b8a24eac1e2ea2760670dee7fc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80afb9c947ff04c1f3ba637d339fda5539da45d619be2747646025ffc9e427a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ee5bfeca637b92a012c8f1d9d4cc104a003eebc4c977f3125980f306aa8487"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e90c6ebc6d0f3a39493f2f8f9a681c176c8bc74b35706eb34da5fada0f70c5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"538e4a535d282f7c35fa7eb5dbd7992933cf6e1704a6e0bd6105c1d5972a0179"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"be56bbf298bc8499a5a8b0ccdf1d601729033172b515cb03fe21d402c2b9bf8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2cfc1bce49ea70d65faf7001daaadfa076309661f7d45ecc2b25acb48c2db1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe28e0a480c9ddbbf4127efa4d94ed69ded2c55113a18f3fbfa3d20f7869e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fac7e1891806f68b6807ded6cce29978f881587a9a69f6e7b63cbbdaaa76b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afb14bb262f5c4c5d1737503a63f43878953da180b7e777e1e3536d9e45c0ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a8265c225807cc0baa6141a202dba49857e2d6e1302f5d0ebc52fe28a1f678"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa508dffaa6a03416a392efdbfa8af5d52305a53fcfce43bf6966e11391d5e87"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2823b8fdc9f410c7395936f097d3ee9478583e78b9bfa9abc13c8b1afed46148"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf92214613b39858ff3509f743b6151b2ced44578fade6c559aa2d307eb776e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adc15490085b0fe700ee8b826be4d664c71a46dfe01f0a069deebd1b27b3df4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5b3527705452d84915fce38a0390c53feb38409602105af499188ae218c2b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8270de1aa304bba7814c76674710704b6f8c9abb81860b0ad6198e126d4d884d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c743da3c9457edcf1c694b294f921f25c978e046538e84fa64914ff93a3f0b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c4abe704250275ae689dc01529ef4c8422f454e4dc636bfc0d5c1cd65a718"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"149734f08a60b5b53ab3d93eef77eb7cbb7cf9b0ddc3975932a27f0dc7fb87c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b029c9290babf87d4b4f1a394a35d431859476d9202b622ac6ac8c973b232cb1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"913596baa6b6af658d7f384cdac9a9497654bc69f30770c89a6a1ee4e2a15419"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8245a9924c5009aadeebb09436cfff260342ab1f7227d404088cf2ad1072ba1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b56fe365fb347a3c8796f2da1210d18f7d917473b209f51a793de47f4faa7b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8500944a210190a55525b923b901a4d8116c057cf28b2b5427da93c1610bf74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f94f5c91d1d6b90d292b29f370fe81b129b2ae131fc9b38c34f39302066ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"680127647b28e5e658822a2433aa386bf5da12d1436d022d55ad07289bf3e49b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf973f0d8a11e6d370207d063770d5e3d332e726d298a8b002f1b03ae293b59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"300c687668664e49df8ce508c3bd1ca332246e6ae731c6b353c61573689271b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ffd7f99802b1d56ab451319f56261238f5d46d3f81908992c230109d911d0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7ee417eb5c309a9de28cd9fbeb7fafa6d6872618f51951f495ba7f2f5c4e48"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"699369681aa5826ca0eb823c33df5867ff8078f97f9c0492fe50a296d3d34d37"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc651dd9816ae0e9aacbb2aad4029594287d6b60c9616d40c98d95d54bd6d0f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda072d2e4590e1acda93ac9f930557b29ab55bf2a60cf531242a8bed0bcbf0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a9906d8ce5184a3f3d60f181ef3c900cb06098b852196ddbe2212e25ba7d08"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c126533a13386a6061d8bacb80127628e2f008f6f9a4919dd9cb7bba5044e4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ae6237b4ee3872b879df6bdca70ad83c79ab4142fad8f85efc26352dbc08a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e241d5e02783563aed3f80984a66c7244786fc3e240425fdcc3898ec191c159"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"321e5d1e393fce02948e8154a685e50f1f9cfa6310c9a174c30bfd6550d0bee6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2a04de977c1c2e8aee41e6c948bfaafc5a4804ab85018e46a98989dd4354c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0906fd349fead82c69855c37e12e5b373ba8e6f162168483c24e1063ee6d264e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0e4ebf5f441fcfb977352a363c65bccfa42af4be87e10bb8cd353ece4b57c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a40241306d88a1eb867962771fc691420b5dbab8a62a4e014c22199fca3844"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8541e7291ab062ee7991da06d133bd2a91165cbb629e9329d78c33297b3decf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"001d4ba437b20bebc901310678a8aff497130ca625e0484a53731aca663af8eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12266a3d3f946e22c50c2ecd6d9b3373486ecd16f6cf306f0d9a52c8d43ca8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e927ed0780bccc4494006c7f6c585754e52f1676b91d989f7a89511e5836388"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"144d9909f663f1da597a55b1571358cf5a966b56a170c29f6d0cb2a7ddafd85e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0695ef7faf8aa87b27c7f515120411a2b9b9c3a14f128310b0f252e15649510f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"085f6ad28428c506f7e7b7d9e1b7d9e7801e3b992067c1eabcb7bd1673f1c596"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc123644bada02a23c048bd929ebb042037eec5a97d2d9d269fa5b596c64eee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AbstractExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fe1c27178264a41dab113073b065246710442134d61cfe64bcb56b2e7d7324"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d9effc9d7a1b5e695255e4a07f6fdc55bc93d577e956db22e8eb657453dace"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6bdb2912d405007a36e1438aeb90df86aeb5644be328a97ca654abd1b926aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d5fa791af87ae367457478b7d831dbe100b41dec5bb148572ef5fcf3098d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89300b80dce5910def979173ca7c50eefac2859c41e1a16cf3d4dc0594d67bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116e014486eddc6ad141015a67297f041b1f883d9b2cf6811aaccde0fb36c9c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"620959b481b1461f8c6ecedbb6f556207f9ead665676b62de254e64c6321a7a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cb852f4b897f6ed17aa95c17168655dac136398a50afc6147823aa431b92c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/expected-uninitialized-fields.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfdd736461bf9de42220274b5e89286d577d94479e2c1986d92b205519a160a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ca3e4e7169e0b7400bff4b9e3c4bd600ec54ecd8e98c856060fb31001fe56a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SillyFoo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d46008d706eaaf19d29d04c6169be1f753050ad97f6c99ffc8d4d27596297b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e49af8f5e44ffe5b2a850da06353f4558c6a3b81c09311504003ed0ea90e73"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SomeClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b6d5a6124bd30773c4a5ccba7388f433d73276bd7f597f687a3d7c1034632a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringWrapper\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecaf674ae9af2219362bb54251af3833989da535ecc7206edc602ac8c9c0b39d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027someObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa416ffe383a292f17c01da6fdf5821ff85b559e00f30e0661b62c4aa6d445f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f01698a4d35d3a33b1d8bc1b1fadb4e023bf64241dbe4d70ec8484fff4d788"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b62af983861c9871feec1d0de594e908474421aade3c785ef6efa0e363065b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newline_arrow_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc631c58dcaaf780fd373bf64ffaa18ec41b9a19f81f880610df0a2185960ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asyncArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5d3fa732b84b8a58b43d8e14c6168d7562d44ca9c538052e05d5ae600ac284"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithDeclare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3265930ecf70ba98bbea34f6de8712312cf8a9a4ca2beb519248bf4571978093"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClassWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e3bebae65c6e7bf32b79905fd2a904e86e16e732daa655bf77552d60696588"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05caa64cdd91a81274013da1997192f9bdabfd1b3568d1f22b9ce17b7a58bc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredPredicateWithoutType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e4cfb2725ef5f6de01b636a353b118c8290d0dc43017865c130c927e0ef5e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"76178d4b71f203e148bb7aee2d617b24c3af92aa3d32faf75076f4da6a41143f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardArrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aae77678f146ebe72eeb4d7a919188b4b890cf70b683845f2617b6bf7c3761"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeGuardInComments\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a905f61a7c96f12a8c722b90d93284d3c587608547e5f29f040d326786cf5478"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafee4d1246998a35cd452b3e49df930deb06d68de8c2cbdf566f0fddbc01906"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeAssertsFunction2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bf30b62e637c721d88e76d36aca12563aea5003de2d67b0581769e638c8356"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionWithDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb21949b312b241dac772af069f88beada5ce84d83ffc123def8f8e2131e7bd4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ThisType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf8e349b8cdd4a44a5126c1d614ef003e319135028f9245baec82f42c7a8d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c06a8adad17eb29b35307e25d970a657756051f56999f506d932af82601a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6646702b1da3f4c7d6510c4d8d6afabab0e74b672884e3b3069ff9135ea21af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fbf08291798d22e8cdfe05fa36ea02001163a4fe9f5b2798a2bf71b16e2b35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b55a55d086aed972e20045c8d1e1c8842001db5c6aa2f96686cc0f8b4338d29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"698c6ce49bbde0d1fcb171bd180bff3aa0a804979255985fb4bc17501a756543"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b14b728ad123867446265b4a22d3420801b92003be56b8a4d0f7800614e63a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8625b02bf71de06db492d7777b26fc378a375d9ec1b888fe1dbe9d374b93b14"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParam8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"78936289e8216b0508da0b13c6544b4c5ee2e99e894fa0e327014a55d515b40b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ca36296ed242058e4454499180b66a23585285b75e2ca0fb0e16423c2beedb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a1f2c9de9442ec10c0e24fb42e45fc6f26beadbb734daf00f990de0beff354"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"937e461e0eff40e95487b965744fafd0b9d8202a527aee147c29297a9b8446e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"55401f3debc5ae735d899f4519eaf9e3f008e7842d5ce1e507c7bf0c1f05ad9a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisConst5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc221c4d4d7dcee9166f6cf5979511e78d65667328c851734154caf8f1e5f9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b937005ce3f7d4d8187134a9e165ba024c02f0b50f12a4ea4e99fe6766f132"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde7e840ee59e1cded2af80d509859661c8ed7228810e0900a3ddd5607873fb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigIntLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca480b0bc594a757fdd3a73f4dffac812158bc597dcd5df4cfe11f97e432659"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBigInt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef84a26ce6ba70c5d1ec78c0953511370225458da44ef398453215a9feb7f8d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBooleanLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7f7436590450ac27d2e2425013a9cebd913cce39b6c66c8fec5a0b75377c91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"38904e3713be3e268c3bb01400d749d84f1f3f44b3f8e14ce144539f8ec1a109"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asEmpty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08f8b4937001af93cb3eeb943ef61a8633b31fa35b4efd58cdf134fba8452c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asExists\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0582e58351c0fca724c5250a3f9e545dec173578306dbb419132919f3b18355"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asKeyof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d1f7d1b486aec8c3b0668d8bd4419bdcf8a89e601536f3d71b74a9909c2c8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c48a0a199fe05a303adf1438150c7841dd425fbc1936b2da72f293f6e12b86"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"15df3737bcae9d0829d5af96613754f2db8fd75e67f0dfcc5f2d7a37bbe36feb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNullLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"339bac4a0aa90cdcf472c21b184e95bc0e57551ca926feea0ba96d483ef80248"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumberLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1f9cc9257a5ff4ede0cecd90f5d763852ad54e3e2a3b43495bfdbfcc6a4b82"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a895fa6313567a46703c3593193e7d91199c657539ec656918892d9d139244f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9956bc7b27cdbfff074cead9ab94b3de42da7a212b358bd52c31f6bde3212f62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asParametrizedGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa96d0dadee9209f9212c10749f57703270a27613b2a7627f29eb13bb1070f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asStringLiteral\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e57d89ad25e56d704512aa65b594f961fe24b6345c6fe08ae30c40ec45267"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d5bd847d5bd4eaebc8713b653450bca9210a52bb6d0b9ac20c5ac729a6ef1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6765b298cf6ba4e07c58f96752a162fc3e350f41535550516402f845340c256"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d2c33f64859bec7a97e063754ce1543bc04f4edc0095780232d8d66386e30"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asConditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cb52392c70fa939457e6233b0b7096096e4abf366a61558e69e33a1f5b4940"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"930f3e36c2caed88e70e445d8ec7ffeb38fd2383959394472b4a1f16628c5102"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asInfer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"815bfa39c0a1cdfb735f0ace1f83f9ff9773d6ad36aabbd3061a1d197b5a3b3c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIntersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d2418f0df7ab4924b165600bae511f67504638681e7a397cdfbc485a47f90c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asIndexed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c94be32ed9dec8331584c856343ae5f7ee8ac28187d77bafaeb935a989aacc1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9794d245fd32a1bc5a2a0b93f8d1db1ea594d0e3b76c309b18ae68f0165ea5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf8eb16e7c5a126ea30aa7c829308450ba78de75e966ae37b91f44012877dcf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TemplateLiteralType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba2a0563affdce699d6eaa2a4a2db38dd2db51bc8c9c7559220c00afb032c4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ModifierNames\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"64366351b573ba6151d0aa2d2776d5a9824804a99de75ff4005ad577d79da9e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e017d1385fe4b486d36d42272f14395ca92a062d320326943b4dd9d201be3499"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82ac3bdca845121d1406dfdc2fb62185817ac5360e62390193264d4d865f8a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"567b2bf60dc2d7b9ba5e44db242be52fdcf5c88c47e322f27eff75a580bd5de6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34f1db80d5f99d6f12627158539a898555b07a435bb16af170e818d886fb9ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027satisfiesTemplate\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d407e19f23a4e6bc6a75be7f292330e8652be639c1d1d1c92f82e9f1680d4e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14070bf1b4daec99147a9f661b0ba0a3da4bb9dbffb18da8818811aa9e41af6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e11a87e355350140a398a15d2c5f90c722ecc435dc089ad2801b6d8d2a8417d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefiniteFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb33c575f7c209f7b8c62c72717ba096346a4b1558295c3afbf29ee4b622a782"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#privateDefinite\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/test/source.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d89148a50423c6f148139dbcb660563a69d51024bc6a7d52e719e8fc6dd76f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_declaration.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69b971cc7302c32bcd4a5fea0caeb3397a7e8cdf1cefa50c3375eaaa67a1a2a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_declaration.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac87099cee93b141a0bb0b2960f0e92be714ff4c964aba784d7db69caa00cb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_declaration.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4c2955408705fad45e60dc2f9cb5c9f682db05839a6b2e48940c1f19268da1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_declaration.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"951b581463facde2e2cd1e5221c2a7e1c10f2bbe66a664802b383df59d05e1fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private1\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_property.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf3d6f9390d6e7a26d8ce56c529ab60d22018c2bd1b9a8660134e7d974e42da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private2\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_property.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"45101f219767c3aaf10fe5e9c94f521bf1889f8fb0a64e9cd83fd5e07dee84b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#prop\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/class_property.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"895472d3ba253f710369b88faea865929e367474869818abee0fc0b03da9c731"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/function_declaration.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"518507995de0fbd7643e92e1c2aec222cb62c55d9a1546bc3eea1e73ef5c36d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027metaProperty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/remove_expression_trailing_comments.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8fcf8ce08c7b76110b9a7bc74643877209a3134bcea00de2032273f837a9e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generator\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/comment_interning/remove_expression_trailing_comments.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"94785c25cf22530fa7add6c0d07de5262d5567c9780a8f2101d948d675a35746"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/computed_keys/computed_method_invalid.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a997787d6f94b031c21080f619f14df7396969fa602ff26e4a549adf947b274d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027U\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/computed_keys/computed_method_invalid.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a9dbfac00d0ec173020c0cf9e7a9c2597b2a38c761c76798913557287725f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027V\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/computed_keys/computed_method_invalid.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bbe4fc10762d5bbc196cee53832aa82fc960205344fd872b44d2084d3c398"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027W\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/computed_keys/computed_method_invalid.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3b212d26f2e570f927f83c74dd1352202d5b25d3e6514194dc6940b35e8e4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/decorators/migrated_0005.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f240d673c6de2de61db0f11f2ff6e4e3ece4d02d4afade377e4ec0e937bdb6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#b\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/definite_assignment/class_fields.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3a16cb36ef47bee67ccd2960187a5d358e319bb97c87dd315b7920ff5e194c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/export_statements/export_default_async_id_and_named_function.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f15c624b2cfb0d392daf4aee39d94116519c53eb78b2538b63478ad7face51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#m\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/getter.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d9c5e2aacb167d8cbfefd537b8c71b0d7b7ea055b00e525cf2b06a6d245291"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#m\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/getter_and_setter.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"64794df27626ac4ef8cf8748b469ae073ec847017cd37d705de8358519d1dfef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#m\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/getter_duplicate.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"388522003b2ce4652431f9d7421787a27764982bdd8b673475951b59a0b89727"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/getter_whitespace.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b1eb11a390e9a29424d8a03c0d756333ca6d47ab59b743fc689a6154c84792"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#m\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/member_whitespace.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4306013aa9626db81e96e6729a15e535df4d6766aded7228055f79fac1552"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#p\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/multiple.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa2e532351298aa9ccd6c6eb54e49fa279fe8dc90282012560d3d6fa330d874"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#q\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/multiple.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd048ea197e5d1537e1c50d25847ded84b80851ec621aadfffa717a4c24dcf67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#p\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/nested.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e95daaa392c252e8d4906d102fa165b721b55d28e6985074a2760f988ad328"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#r\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/scope.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deb5d046b255d763b4063af978b724367ce54bb8082e53ccdedf710cb28bf2b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#m\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/setter.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c314b7dd7bc2cfdd01e74145b93383af7e2f1b5b2dd0bac84864ba47d0ee19"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private accessor \u0027#m\u0027: Nothing in its class reads or assigns this private accessor, and no string key or test reaches it by name. Remove it, or use it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/setter_duplicate.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f11ec647ca39e28b16c72b9520a72651d19b955d5e1711449f88ccf1b8b36d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#foo\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/unannotated.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a20ef3b39b40c85af29f605a69d43f7f320e2e6204ce5f6f0776e8666d9ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#foo\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/unannotated_asi.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d0d733c62fa0169e67154ee01cbcc9ca1407c4fcd483bf56c8698081e9d198"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#bar\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/unannotated_asi.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca1e2e02d9d83dd4639d00abf58cd21ab29ceb50e699d347d0115451c1201c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#p\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/valid.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9de7e901598ace5edf9f1247b565199fd3285b48e1cb4f06952deb25e78263"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#q\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/valid.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6978575481873e0d8557224a82e2ea56aef158c37c44a4d7bf8a91c05a4a38cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/private_class_properties/whitespace.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afe6a8bd6800658295f277e5a0ca8be2196b118ef0081ba5e8a2b85a4ac3336"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027destructured\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/function_overloads.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5cb12a54898363d6fe9fd9380bdbbd322b88a76061173ecdbdace10dcb4d4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027newlineBody\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/function_overloads.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f379a5b024fed8a785083163a707d0d952a9c23870c48374ec5cc1d6de4abd3b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027asi\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/function_overloads.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f0ca3384e381d1198d7443b74cb58710900c7f0cbc0f725769ade42a134eb1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027eof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/function_overloads.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"730b3aed409b587b3108f97f6ad087ca6e60518b80dc2bb320989db69a5aa1bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027privateGenerator\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/generator_modifiers.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c8cc70db31982ede8a34c16bfc3eb69c4357aa56446374d2b1784c563e08e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#privateName\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/generator_modifiers.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b518973f6a58892dd8b099759d169d355dbbfa83dccf738412f65cdd9c037"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#c\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/optional_class_property.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100c3af79c87301aeb567443d2a7852cfb1ae2fd9479fb737047aecd696cedd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/private_class_field.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bde74a01226872fa1999812714093c78d170b9b2250af54f2d8863b8104c7e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/private_class_field_invalid_static.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"539695376f27869a99dae885ad1f4b75a2643956686c893a02e7a5bcda8e2b1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/typeof_import.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5199e8d980c6d8dc36e5c8852a7f5afc1a99019d68235d51a211988d0dfbc4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/typeof_import.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca865b9139b23fd7148b755476d1824ce0f2c98588dbe39c6e84dcb67b5d1697"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/unique_symbol.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f57dd8c5996f04835f9cf6e757fd12e187132f692dc3adee6ac5ea1fe67abf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TWithComment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/ts_syntax/unique_symbol.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be1785e4ae3f47c90abcc21abd8625b8dc22e55ab5ef5af90aed20d85210c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027M\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/import_type/import_type_basic.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d228afc41bd6e87dff275e392831ad3c1b8232eca3d849b32b141917d8bf6f97"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/import_type/import_type_basic.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"631126a9fe1120e23af1e10c1658fa258537176cb9de3caf4bd7e1c573eb88c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027P\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/import_type/import_type_basic.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6e2876fe8ce4675814e8750f4e974620471189eb21023c35cfcbc563402f8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/import_type/import_type_basic.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e859f5fd44e40ee5f0f7cdc9d7de7822d09d44e2f2ed6c2c90537e4869e13515"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/import_type/import_type_basic.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f04bce0e40e4f6eba7cd14a819007d965115688685efde83f1683b37a5c82f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027y\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/reserved/reserved.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07955cdaf10b1fd467f654ebf2180457e2ed7c4a4ffb25e81d1aa4175ec5f937"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027\u00C5lias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/type_arguments/renamed_fields.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ae336d74153236f1d5dd53d8264939bbf67c1b263f41449a06e94d3b6f655c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/type_arguments/renamed_fields.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca828d9cee7a9dec6e522e73e476ab69ea2f3c1caaa51ae8b08e61d98bc48a8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/type_arguments/renamed_fields.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ebe115302de6db2a548426065ecb96a3e79b348d37c93bbf62b02f1c14832e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Imported\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parser/test/flow/types/type_arguments/renamed_fields.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1750d766c9236e2bead61e920bf75d2439ea584ce047d19724eaaef68bec6677"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cat\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_classes/cross_module_basic.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d620eb91d2f1234c2e4ae5d58c74766bf3418542d0dcb7ad91a4c602f6281b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#priv\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_classes/es6_private_abstract.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"18890343a071b446b4a7433933741f1d803b9f854d397da55c4db95e182724c1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#priv\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_classes/es6_private_abstract_field.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a8d632ad4a2ac78e56bcdd4bfe791638f13c0c21ba3d91b5efa6090d8dfac5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027priv\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_classes/private_abstract.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b325fae2d968812af7345cd9ff2824bdb946f6c6727df3442ff479659f611b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027privField\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_classes/private_abstract.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf2ec0b4acc0c78347b449a8346580182248334f7b8a7c5cc9170927bb3ebb2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/abstract_locations_minimal_merge/impl-dependent.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03f5d0c173fc53f062a6f5654cbe8c57ed7521218f4f6a28009c31f083b8c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027str\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_namespace.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92190a6724f456a6b27747dec012939f91a07dbe9f5926c776b23139c6d287"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ambient_declarations/use_namespace.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0bf092058374920d4750e3e0cc7135b2a86ab0bcd24df8af224cb450b089b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/annot/any/B.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed12cbf94767e072a8afcb80c3f0f6a4dd4bd7b920a5d5d3a2c845b83054fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/annot2/B.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dcd0f8aa2efed9f7390c4d31a5c9764b5740620c46df62b493728ab0ae4e5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/annotate_exports_reuse_imports/import-default.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c404ba04c665a5d4dcf0d9de95b913cc567daf67fe308a4625ca57783f55d4e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/any/propagate.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"672fc586cde3a59d3c219266e18d0d433ae9fc3285914b34886260f34eb32d85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/any/propagate.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa63f7702dc24c83b1a760670973d6aadee3e3a3182c997959c23f38ee49034"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/any/propagate.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"65078d62e2bb457d1331aed72082b5b8b36104167bf627a09949148ac6279ef5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/apply_code_action_command/test-quickfixes.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4cddd97a880799a7a791708d181a8a5fe39026ec9b6739c5740e4fc682e26f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/apply_code_action_command/test-quickfixes.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ef9b0dfd31d66932cd653dd7e9789d7c92d29cb2e10c8c3f27cc97e5b796e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027alittle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/arrays/Arrays.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b10e76a9b33c3440b07c09a6aeb568fce883810dd8bdd49be369429b436531f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027abig\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/arrays/Arrays.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f44c8482aeb32cc09e5af910b55f47f72f10996d6df822627be5122af8e0498"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027abig2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/arrays/Arrays.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa9bdc45a22b246a63f15cc3dea7588db3b3401d16c90689ecd720616f212e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0bfc6339ab47acc05d8d4691160f7c0ec53fa42982eb99467ab0a6bb6febb7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad8bca9c8e1488e6cefa02f52102e09140ab9d7bb3629020e34e834118d8723"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76a33eaf27235131dc982f5a72e6947350894ff14dc29dda77754a56b1ad037"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c15b324d9347fc3dcdede1536c2815b8f99d773c11073e5c296480048c90c51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47cc83af83e1ec5f36690d0af2d16c1a7217fcb21633d7b4db1a3df75144320"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63bde95c7e6a90848e2d3b37676d65f52eab4b51840b8de4aefdcb36c8e2b98"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"003013f2dc3090cf867f9dd382def531ec1b7a71af2687d94721435e59420e4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/array.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43bb9fdf95613242dab276eb6441e070c87660729450f962e9396a8b0652e55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-array.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fb8e1a9376d4ab8676edbbcc1e6e40a8f0d7161e9d3f803931eae346d6a1c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-array.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc47ea57124058599d3a7d0458d3df926a4e1d33e9c638bc594584939ac1cc6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-array.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ad56076e17cc015472ed12437af20a8a4b82bae3da5807d157728406359a29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_arr8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-array.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d672b3b8d1ae6f7697099aef0a6e848ad48f1cc2efd4b978d515b5fd7dfd1ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b3420a35ac326c7e7a0e7f9407abe4073e722aaf095ef7762b475e85b66b60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02df88f1c5dcd4c1bcfab1c4cf7c5b16e475f592a00780312c4a9eee270230d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913453e9949ff8e74060f254f363b4baab76a09b4613eecf927469687ebc214"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c62e6ae2ff914aa72abe38e74a165f8c6202d8159fb18ad6d134c6f33e5db56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6b851eb70bafa7bfc0fd5607a25f11bfd9e1187130adc85fcb5f06d2c4beec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7b9689dbad9a34817da170bbae09c99ed7e8bf72e8ee85f089cf9d8caedb43"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ddd3fc55ea9ad0789249cc0c22d61ac7a68afec0011fae531e81620448cb9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7fc780bd6f06a765d4fae08ef61c10f52b2c418bc790e0a99b891a8bc6861d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c91adf70a8ca5660ed5fd276cfa08c1bb79b2ededf9f2bad33394e386ad91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-object.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e508a4ed7a1637e15e8f16daaa77d58bca7d748731e5b375e1411a69cf850e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_numeric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-primitive.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eab7dc4c139b889e810847068868d7e690e5031e644052ae03cb0de1dfb92da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-primitive.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7375a440bafb3b4c99b0a5db4add9e05bd1a51656fe1559babc35d0f6f39268e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-primitive.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5870025fef76724c3dc47210e6b5b21c66605559917d952fa694a54fcc9c9d1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-primitive.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d3ab84fbe66dcd1652a5f704c6ce30fd6d00c8011b1b9586a02f48b8548f4f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_numeric_negative\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/import-primitive.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398ce848f9dbfc6731ec64e79e6470afce29b26a86d71d6af476980d3718a5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"190782db2cee87d3b5ca644fa7464094b6f92d8cd8dab9ebf1f445f359130b90"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf5022e176265782e2a6db53003d86271880061ff1403ce45fe8d9b8c35c0c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f82eb2f9fc7255a143f955b4e929ec2d97cff5b2506d762ef4594a8f141aa6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd6b11fcec78bfe8d40ce95ee7ea4b323df2d92417b302b8e84cfe04713013"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eda0c5377b7281b50055f5f96c071692763e50fcbb77dcd802e33cf43e7147f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d40347604de60f1baa8f7accc97301c447ae67e809362818b87d97fbdbec92f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0492af11e73f7e9681c23c242ef02fbb75fc29463aa050956e04a7403cf498ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d704b1ec3bea02f0148f7373929e6af4791b146312507a6ae485eee37476533"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8db104ee512847e739e411b5e1b1afaf107bf42e1308458df48116ec5a42aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe60560d5fe106235d4f960d43bca550d094cbcb876780a883a7dad796d97d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/object.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"526b6be6629b49ee867bb87ceadd172b2258352f5a916fe607f2f799ce48b6ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_numeric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/primitive.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"44db229a8fb7dddff91746d2f5f1539f77c3b128e697cf01e8c5072b6c3e7a58"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/primitive.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b3a7ac1553824019608b17607d6ba992cfb6ccf41a13c02ca25ffc1841ad70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/primitive.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9568540a69a84111c996f54bea321843ce7dd9cbf1af3a17b62ea44542b599fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/primitive.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c79bc9459b8dc81ffbc98c553745120cc71323eaeff840c218f6815c7bb59d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_numeric_negative\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/as_const/primitive.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3228c076d503adca621d291560e1485abf77ed3133b6cb0596feb204a4431393"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027named\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a147a63f120567fb5733caadef5bf9966ac6a62e04b296cebca69b54cdcea6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027renamedImport\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a04697cec674122229d14db5206a902b773990b230518da1260be6ca9f61a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027defaultImport\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc7df9ca569a38e782d2edb3160f9522027c34454b866dea4d3c4afd6b0c3b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027annotatedExport\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7470882af070d5db93ab9bb6d0c27663b728f77e5159e0e7f1314f071c9acc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nestedExport\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9088d47cf9e1544cb4b59ba05ce913f71186d24772a224f167572e0e973a06a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027namespaceImport\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"682648f768850edbb941a59bf7d5f3d45ae1dd52ea8e0180d56aa439e59ad32b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedStaticMethod\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9756a80a809c65bcf395d59be70aec4295f9147ca8ca13bc1de3e866bb29cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedTypeAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da7e5b2433313ec04167986da879e2c525b6a628a97a3226ca86e8315ad6079"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedGenericTypeAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"82079ffb76d10f96d55372138e40e6cb35ceeafae380609b442971f2b9e66649"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedMappedProperty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7020d1eca15520358ff00187a56e036ad9223a0695aae26eeffe4780df180a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedAgreedUnionSilent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cc5ee96beb3440d296bf31310130f65e58545697af816bd19ac1d60ce8f99e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedGenericApplication\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"880685c1bab029c49554f32262bb9276bb2cd0fc6d0b21319f37987162e57670"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inferredExportsAreAssertions\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/imports.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"33089a151fae3490a15ef7c00377ef9a5fcd8413ee8c1c48343639c12d74f02a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d89792fb3e839a81ffe468750b91aaad5c7ffbd23c96d7c0cd844653752ce1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalMethod\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1396f42f85924b5173635224ee5eefd88977847c44001fb86ea462ec8b6f42c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6c78dc75cf77722a4301e13f5d9646eafb8f034576b5e78b9c5538c3a48a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8563c297d8d33f07a4c7cfcc2f2181d1a01b7f27dd891fd48c5e0dbde6f6471d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027skippedCalls\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffb968192d1eeb4b9da6be16c939fef1f5981e17a05ce4605066aa32202004c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalBare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fbaf330aefd325a80df8002f676a9461d49a7ff29a2d8888e5d4ae39920c24"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalCondition\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aee983498142121780c1fad9cf413098c6f177453875dde18a747d29d2a3786"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalFalse\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa259fe00962053e10a6dd263a2f1bc1622afbe0382e27d36fa34b71f91654"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027skippedFalse\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f1cd041a647159822afda96008129414d50732d960766ec21d56e28e5b0808"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b8b4750aa08ee6799b3a72ee7cb507f134c456d4084855243a445f6906704"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalSequence\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d9829f6ce1c04069b44a8ac3eee1b7f6a8d3ea8d698aefe67c28ab68035a97"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalImports\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f25a8012bea9d7e8712c23369d990dbec4be04f3a2f079e200ce10ce06f5cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027laterArgument\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cdd8543dd05319403a053fb6e7ea6fe752ca2f9e212b64ea5d011417623de5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OptionalDerived\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f0f70b553974155fa0583ddc9f7b29a3b2b6551c1d366d16591f7d59dcd0a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalAssertionReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13242d418821c9d6fe4942772cd7f6ba51c99f9be3c9f503f21efdce0cd401a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nullableAssertionReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"191c5f47821e6f908af15febdb6b8cc52457aa00c317eca036f4552206e67a57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unrecognizedOptional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a58fbebcf87d7183a25d94ecb5f5512bc46d48330d2e7cfbf2664b1f71bf25"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalMappedProperties\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/optional_calls.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69ff5b8f5e4c9ba085193582e95851abf48dcfb0c06a420352e35296720361"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027objectReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e885a298515abd0a4b49088d6631985df45ecb0f6b0792acae4fbb4fdf4d0e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nestedReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"be664728ff266e98ca2ebb1c8859d9b542c2e912d14279eba8add895ab8d1040"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverExpressionPosition\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7897bd07775833a010389f804d79be65489390a0e53794c297143df025785ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverAssignment\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bb253e7ab1bc30a21628f19d64ffb9a663e025523c4061722c246ff9f2d863"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverArgumentRead\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"96abd086dd7dd7ad73f6dc74e4f6204397015c5663e0686f17cae0e58b37a65d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverArgumentWrite\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97a0d6b6a75becb557602c3fbec8773cbe2e8bab5c7b9ceea69ead8cd484342"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverPropertyArgumentWrite\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d62411f2dcf2ef657d690f4cd95f593280afc069052a7f2be578170935e285"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverArgumentCall\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3a9720093538de5a34eed5e5208d9f0c1bb84dc135aac74ab1e0bb3f1bdeb7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverPropertyArgumentCall\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fea19a76aa3c1b4d5282e2ad9bc8a6c62bcac8f2bad5b32128ff8d817c14fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4189a9e6ffbc76b654da696bf1365f336d16e9293b9b4c69b4dc78e5ed56d85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027structuralReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"143dd7d633077010a3455fcda0de13b1403e4c0a5baf5137112a516f4512b175"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027localReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba0ce9f15b470ee7aa14d723ab22e7f4c0e06f5821a5e24bc52524f9490872d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027structuralReceiverWrite\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9495136a152085ad4272b4098b4c8d9cb7259d9e736f1a144c28dabccdbba88"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027genericReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61e4f9dfa65edaa37b350d209bcaf5015bb57eddf5c2dded68982d3cb101ae9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedReceiver\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddcb426c7ac266611a99fc118279829e29bf2905021b189fae47dc7d179aa52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverLoop\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e430a9b88200059cb79e1f243ae6d80be1e358cfd88cb7794735680018796278"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027receiverComma\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receiver_assertions.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"374c27a3e003fb748f507192a7d4c30c5ee773abf0e49562447b988edbf0bd62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Derived\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"250672309ba52fa890308b6b55d240c8e0f102a91daebc524352fd9a579aa63d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027explicitThis\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d8c4d8da01583a2b72525c2b1460404601009c6222f9277b19c9bf7ee61e3b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027explicitThisExpression\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"35daadd2fa55b2490e9f40fefca96304cb3dca1afcdaee87ca18ca99b5227c9c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04dcbf816642f0513a1958f18a463e29efaf0599383c9f6625b44b7a72abdd8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027localClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7e90578b9055f9190d24a3620a44a7df878cb24f8f9fc64760b0b7fc7e1fbb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Anonymous\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeaf15e3210827288e41772d7c6a3614716943575a2ff26ff999ca13c8c144a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Named\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7196a78b3502e38ecd31879f553e1a4256d60190459622a73b9fc5bd870f9634"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ImportedBase\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/receivers.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"219e8932ae1a2111f00f9ce7191c401d7ed924a4539a6ff8f8740b1512ab6680"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cjsRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7a143263a2789f079afffd8d0c497072a973374d5989b44042ba5a5abf2d80"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027templateRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e088d468a62b38a7b1216d5f8eea5a950fb0572335ac3121f08b2f9f1abf41a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027multiArgRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa89502ca8b3bb717a3b2f3acecf900d1a3bb91ff57f4a2d389c5a005db2510"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027varRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff04fb78af8f2641caac8ee68ce6880243fd3c6d09f9d0688a8afedebb95ace9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cjsMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcfc6513e0e9aec07732636b311f03a3c23f63a01b6284672fe2e75213fd55a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cjsBareMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8021a5d6be4d18ac6368d6e5adbbb4596e1a6ae4a640891b5959076e5deeaa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027esNamespaceMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6109c121836885d61dbffe6abab2664f3664bdb180171b925376f38ca28a72d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027esDefaultMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1561a40d719bebb86da6d287ffa6e5ac6df2160b6a35b4146ebf8fd17015cef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027esBareCall\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e960ffa1808c25f4b065ee46362306f32c54ebb4b1cd4aa23c88304e7c6a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027shadowedRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions/requires.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e98967083df4dbc87780752f5cecabf8c0a9b745cb050966a156784c30cc3a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027localCallableObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_callable_object/test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e7857b2cf682bfd64026d51499c7a2c3d8fe7ed707cc918fc5608d66b746ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027importedCallableObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_callable_object/test.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2135b6a66624cec21cd74e19b6fcd244a1e98c99736cf67ce845675cacd9047"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027defaultImportOfCjsShim\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_import_cjs_default/test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92a286a6f8ba96f615bf23414ceba43463a9b8371f3b4c9798d817bffbca5fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027commonJSRequire\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7d07ce3ee9014669c50d749df3b2e0c586b229cb0f4de83c3cd7cb052cbd2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproNeverReturnsInMatch\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84751c5e97a7c2b711eed79023e62194e81be3e6e50aa7619e68906a362aecd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproNeverReturnsInReturn\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de6797cca1462747a9c9a8ae15cd2a8a867730f07851a7558f437dd62f15074"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproNeverReturnsInReturnWithMessage\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150f6a62b208f921ae2b7f8f44283b876d0c649b15ed38fcd6d4febedd09b02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arrowNeverReturns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2566a9f981eba524581a5339d97e723c4cec8af1141d02a597f2887809567b8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproNeverReturnsInNestedTernary\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b100fe52ad52ddd3ddac5a2612f2b112072be85dc4cddeaee04ac2b1db8b0586"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sequenceExpressionAsserts\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8be9bcdcb5da09d2cd91a223fcb5dadfe44ea94b5086756623912c09969c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027declaredInvariantRefines\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eaf4d7beeb9fc67d95fd7f80b5b6dcd2fa47690eb25453a90a300063e8f390"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027expressionPositionHavocsRefinements\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_jest/test.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9ee2c6f1fda18527362f120a3bccfa6f883528e9a57b27984a6058753f0c8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refines\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"810c0af98991afcc1d5dc08acd5bae5b6729e3822d9ab67d668f6b0258bccf8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027neverReturns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26d836055a653225246b4c68a6c13878e72e4c1a555b0672c49713ae57e88f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refinesDiscriminant\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2ab8c2dfe2833022b6e3525d26088e4e723c437a80fef6b19dbfdbaf18978"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refinesDiscriminantAgainstLocalConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"950d4dfcd7a948142e87f6529394d5d5ccbd5190ae59bd348a9f4cbdd4a02540"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refinesDiscriminantAgainstImportedConst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a557e072f834009d4a4b15360d1e682efd6c8f5bf6f0b660570305746da6a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproSwitchNegatedTypeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2c8b918bea59cc362be1a3d7fb4d58f5904306fe67b3374c984b621d1a65e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproSwitchPreservation\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8325b28d35d6c1b7423a9e04fbb3da3b55d27782766e6d266555a0b6864fdabe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproSingleMemberNull\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cdb9114219cec5ab7239e65413bcc2ba9124b9963e15789a8d95a25f3ea801"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproTwoAssertsFirst\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd73fe067d683b02944946f99e812f09d7e792cb1610ba09959d24468bbad542"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproTwoAssertsLast\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7391ba4dd66c22fd3f58f1371da772ae735e2e74a063eeb09e51200d61c92016"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproAssertUnrelated\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc48333f6867701a6aebd98151e58383456970906f09a3e83e019b72c108773"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproAssertThenCall\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b5dd483b0a5fe04a66efee4891db81deb2b5183c76c9ba56cb0b1fd686502f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reproSequentialMemberNull\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_lib/test.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"390259081ed1a1ff6bb173a344af723cfa8f01c18626d4192d4b786736b1a140"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bareFnDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_require_default/test.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316b44e8c932b681a361b7808030ed6004c6a0e6469549af9112e93e514ff91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027memberObjDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_require_default/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"93280b91c8a8e665cdcec2605598648901c8e4d7a035fd49597cadbd0826dd69"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cjsPrecedence\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_require_default/test.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b799b61aad033b8695ca76625b66f99899b4a8122b7cb5d62d6e10a0b55cff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nodefaultMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_require_default/test.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8113242efc00b15165f19b36430df154c5563fb579a3ac35392623fa1c60657"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nodefaultBare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/assertion_functions_require_default/test.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a93ac0759e5242d1809226400cdae7f62ceae7d14bd9fd6b0e820b86ed95c77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#qux\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/optional_chaining_continue.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fdb72e9a8156bfb2340328be037f84339271d1794ec16c912c29178930d3e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#baz\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/optional_chaining_middle.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d485b2dabc55f6d689bef2504cda239b50876b41a3b1105c09c3b63a7f90335"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#baz\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/optional_chaining_new.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64fb4bbc6c1c513af1b2e2bea7c6ff58861b89fadbafb56aaac88cbd071b84b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tyrant\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/unqualified-type-annotation.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5423bb224895bcdb19c59d5fb259e774266606c09d0416f7bd116c701143127e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Typeset\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/unqualified-type-annotation.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b76128eb948ce70ab1f7dcd1df627e1c501de67cf6d972e6fb41724dfcbac5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tycoon\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/unqualified-type-annotation.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfeba042042a239c68c8b4ccf79614b81644c6db1c7be2212a3c58365d5f81d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_m_to_q/unqualified-type-annotation.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac80d2256547be62d28d6b78ca3b76f488c3db551804035d0ab08e1ea4b2a03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tyrant\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_r_to_z/unqualified-type-annotation.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b6c8f9eb74ae2145242f8f6400ed500bda6de45ceef1c64c8c3327289df623"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Typeset\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_r_to_z/unqualified-type-annotation.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3abb949666291a1b3f56f51549feb64e957e2922c41d53f30b76777c1e94b6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Tycoon\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_r_to_z/unqualified-type-annotation.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"000340d15b289794fa30cde14a58e3793ddd1c4ad0d3a627bf1b6d41927a39d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_from_r_to_z/unqualified-type-annotation.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"85beca87997c121aa06319545c5741b26663766e640a18521e0b533ce3fb0388"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/jsdoc.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa210fa9b10e7807494845233698841e7b844e999f7eacde3aa99d8e3b0f3eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myFoo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/types-jsdoc.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff6a31c3589917a5b43d7eb40596d9d4564300c9a3fa2f9c01964ce02030e64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myBar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/types-jsdoc.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb37d7e3eefabf314ba8d53f8c01d63a75409500902a744b4481ed90827898e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/types-jsdoc.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbd01ec30763f6ff1878b7aa8cb9ea8fbcc3f591176fccc6f15907e49f0b702"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/types-jsdoc.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf89f21a659636fed3145e5007a80e28c6685c0eea47b50e557d3c5ecb9029"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myEnum\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autocomplete_jsdoc/types-jsdoc.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f608e99e03f524652a371164a16752aa364e0651a99c2206e9723f6d933e763f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Exact\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autofix_array_literal/b.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4895d102aadccf74321e0fae64ee2ad640909ec12a6c51fe578baf67fa55d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Inexact\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autofix_array_literal/c.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70cf2c15151922205d77df66a4cfe03428294a9befb668a0d4f74263e2af122"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/autofix_class/a.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7c4bf6a7040cc00f6bb0fb912060e83c4a669c7b87af2075f587cd14ded083"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027X\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/badly_positioned_func_sig/test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a8e741acb2c446e41077c4bfe0eded55ae983e6b04ac981747dd71a3d6c06f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FlatList\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/badly_positioned_make_exactt/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8c39be470d54f8676c1c92ca8e0c405a9a5eefd2089adb9bb991c9780ab37a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#c\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/binding/tdz_class_fields.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d8e5032a163c76e2dd83402a4463326c166d7f65cea7a0ddb99876054f80f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#d\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/binding/tdz_class_fields.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6ddc49a5010ff4eca9179d1be45ac0b8d2b941557c6465749f3aec7f8e05fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyObject\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/builtin_flow_class_statics/test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad4e963588eb7c747b705c2a45936e7732a29c4e48822beccfcfa2a62140294"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/builtins/array.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f1ffbb52f3f3293f74ccdd09100a6bfec3130f3354829dd3067054ca8235d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/builtins/array.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda492c76c9934d16520c612339e8ede72ddcdf387f4228a55d76eddae73ae76"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/capture_avoid/cap.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d75d8bc90f94d64ace5bac4130c673028a8cae0851f69defa373517f50c202"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/class_computed_props/annotation.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e70166bb802957ffd0851353690daa738a621a79c87bae646b6c877dc995ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/class_munging/with_munging.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7286cc9d72d7a511e9d6c1126fdefa564b550ff1a320e79f6dfcb997090f2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_static_method_to_class_coercion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/class_statics/test.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e966dabb851a58d420ba6784afca51db08e6ef20635f49a95235fd74610f85e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/codemod_remove_react_import/still_useful_2.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a551dbe4a1c0ef1d651107df80f8b81df250001096a60e150abee900163fff5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/binding_rules.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"984a1e86090302dd3428c4b0f49b4c3fa40b941ab7203d55b79bced35e80f3b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027paramsStrict\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/binding_rules.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"687ded33ed69765f76e064979f4faddf6c70c8c5ac190c85362f59bb61ff92fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027params\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/binding_rules.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa9ee8a58e0bb431a0a569f8d879a3fcbbe2515cfe4bb9c6fefb4059313bf79"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PolyNoTargs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/component_in_type_position.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ce1cdc124597505c85b816e5bbf55a66dd341538a0a2d0442c94223da0147"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PolyT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/declared.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83f9c98bb67f6f9d2397b08f5008aee470178bea34f62ea028f059e3a9e5837"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Ext\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/errors.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbf2980c12594f3a8d1f5bbf350e428138833e3dec1b574199bc6ab38a41a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027errRendersMFoo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/import_component_in_type_position.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3643620da5a819445a42cc849e5575e94aa307660645b3a1d72beb2b070fc285"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027errRendersMFooType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/import_component_in_type_position.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79aa2987a90983dc5a9e31f30f53078b2c6a3800d3a2e4cdcf3733226dd3590"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_syntax/procedure_decider.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7551dd7798cc73055ebd8530a70495ee1b44967d08276c3b3814d4ef8935d19e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/component_to_component.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ba5492488d7cd5a3a6eb7eacf4591dea30cb295076a5799b2271ea7e532d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/component_to_component.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dc76e590d3c84b17aa345e677b2da467db9880f0147dd3ce4dff899ccf31de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/component_to_component.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0c5af29af90bd4f00eb943c394c1f80c2c01d50d224ecac95665be2329ba8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/component_to_component.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d807e9aab58d6e21c8d9ee0a3e53b61a35bba655c00ec5adf132221db8ff31ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/component_to_component.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e820fc287233b17c3d5d36891c562b510ef038e6fc32b0d1f25a4c60005e763"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/config_HOC.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"52aa457c47ded1e16b140377608c73279c1cca5234ed1476d9534af28967fd34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefaultProps\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/component_type/config_HOC.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef773837facad25598335b7bbdc5017403dddd5fbfef698292665270385b8d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bindGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/conditional_type/rest_args.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"024b971c1d5b00888a98b9868045e0453480b65c6ecaee0e559f933806849225"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Controller\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/conditional_type/rest_args.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8bf7da4608fcf84f6743ac64da11860e89f06da16f4c4eee92f59efed7214f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/constructor_interface_statics/test.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0b3670a0d74ffa4166587b299ac8947472bc13e76c6ad653b832e29b451478"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#privateName\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/class.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd02edcd01cc7c132d32e764f638a81720d7f60ec97fb524b8ce055384d60954"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"430de7da564789e84d1c2a07fcee7cbaf6fbc2df53b1c2d217b6dcc4a1c0c89e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc313a58123d436033d71ceda89ece80a036f60e06876766e0fa6fc5a6def2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aa1ec41de7a76e3aed20ddb69af77a3c8ce72520f280be629546346d139058"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b614a45a676a53f32632b207177c9d39c179a850c1d12c83f74733f55146fc2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"254f7a7a9c2ba3a67b47a60c04e750cb90159a129c26dea5995c59e018adf030"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"381df51d71f2bfa5759fa2833a8bbd41dcde57db92196900f73e39641894ebb4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cdf811461d5dbbfa9056bc58133a23c817b3a0a0fc78d0f9a12724af1e6cae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3b03054aa8ee456ab19f3157da07cd9a9a5492d2ccce2cb4586f6b8d45b68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"13293c4973d6135d4a9c99b0650c051b86c136c3dfde09c793a1cb20770c59f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"05783b57fc6f058b2dd2f2597d5503e225f1724d83cfc6ea1a76da7a82e5d84b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52c5d2e753ea1a17c6bb909dba337682a94e12ca3d0fcb23cd94844cf3ea6a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f5ed1fb792236491fbefc5c55e76c850fa9cec13fd23917482d8d9badaa98"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test13\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d2e2f2d3884c99e5694294b25aeb995b033c01600d6e1778e10943c3b26e9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test14\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6e52067ed609f10710eca6622d890083b01fe9b36c2ae418e9417c616e578b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test15\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2c4f6b90bf5175deebe3998dc82a9ea5fc07ee3d2160e5a37bde529d471b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test16\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e59bab605178227de424a0481ee5cac23849664ed91b3559acee3945a9f507"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test17\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df0ed0aa9ed77dc2277214d563257ee49ac8fc487dbb730854a3adf4840a56d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test18\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e91a5b2cc4cf36b05a2aa54f4d6ab770b04c92cff99ffaf1f24c2613082a61"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test19\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"254b68f9587e7a2cab8b1471126bf74694643bd247aace7bf4acb8e74e40f495"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test20\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f094f50688ac53afd2015cc096e55d38a3bf98df57c0d3465d6f3b27fbb6fa2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test21\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/implicit_instantiation.js"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"64debf8fc1550b789e0848cda9c1e6ad773a45221955c223ad503b90dfd68a7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ref_tests\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f819fe1f5a9698d6d2e53ea38da099e6c63e4e15bf33bc7106674c4c9a61221"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cannot_resolve_name_regression_tests\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d6a5d62f54b3e2c7694611c148b9be87680b78e5422c8d7ef5d8789095497"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027react_abstract_component_subtyping\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b638f8725d990c69e01610a162a2939ab05db3f71e80e16383c82c51764375f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027jsx_function_children_ok\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c8d39934913a2b2306ee61338d0d04658aba661276aaebf9cafe880aecfe0f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027jsx_function_children_error\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e48869779e6a66c4c44b0610120c76c602419167df6915bbd5b7a4f7359edd4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027jsx_children_array_decomp\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b2f1914e08a35b38f06d819ca076c909e6c5659fbbfbe6ede120938c1a6b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027jsx_fragment_array_from\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/react_tests.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbef3dcf3b99ebfb121a2184c53aac1e2054e9df10ae3ab5d17d5d60d12305cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df412007ed627ff1ccf40456c7e8383a023a7e341f0d9074ff4efc014a16c1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ecb1d7f543a1c4e7495993606da7e890e8dc699fe743b43bcac84dca98c47c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"290424897d08cf2d7ee48b4b89df79ab1a6966e9b09614945df0799ee80df7b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"086eb01907119fe94a958aeaa9c898f3679dc5973ea15ce790f8591f621b8de9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d85d08f4f1863a83725f904fa89e125d40916ace548fd727bf9b34330ed984b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff35246bc7cf8acdde61f59d635b8fbccdb98466f093d4c7c6e27c52c8b6428"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"33da0a8be48faf745cd8a7662268fe4d82d48201c49453b11c36e07d207aab3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd7d740aadf7f1f93f24afd5cbb2b01048aacaf1c39ff431b400ab63514e9f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f143ec3b882dd16c4c215182be3de554a9a0e3df5757c06f076388be1c06eb1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa77091bbc06e1687c8ecc5ad22345e59208e22fb2d933c8e7394377a3892f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0892c6a450cf9ff88bcc278fb3696f1157f209a3ff012c2c2cbeff5a583f4a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd84d5590120fdcf267df3fb02b1c6675811c60bf2479c213c5d865bef9b017"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22bc9557154781f142012303328b3d6a0f754d83b29779bb5a61c5473cef4f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc15d1f5d9a878481777875ba6edeb6e2ec6dcdeabfd3d645aea7ed34f12d13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ff88df4921bd1555c9a79a4c20862e8d11698eeac7c65ac810afd0a39bc50f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c913ef3b092a674b93e70fbd823e9393432faf9d3846108f5797d8e549e1276c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59747b9fcaaf9fe49870a2dfb11759ec135797b06eb0f9d74c75f411cf51f5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dade80e68373cb21f32cc1c8bfb74aa59cf98514cc14ad90e33e2942641b7f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027numeric_sentinel\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a9d63377a6b41c09be022aba3cf7fa1e4bf44cab1e1ba4b969d35f233e9de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027function_statics\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contextual_typing/sentinel_refinements.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d75b43bdf9935125b455a467010200fb22f22a02760bba30e5a6cf40bfb75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emailTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303839830cdcbb962cddb465c3f3053ce55f65809d3924c8c92d7c53a250093"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emailTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeb2cc507723c9e4078c3cb537678822b66676d659c85cad3c66fc79cff6999"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ageTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0716184e4dc67838f9bd0e4d118e80bec51e9cd85706955aaa02a8b33378f5fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ageTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f7fb9b6cdc554d7ea7ab464c93e2d40f47f422abd7b0026f36be0ae8088d33"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027profileTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b834481325342ba6bd0147f30b8dde88c586f6b692e6e2c0f25993287088543"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027profileTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cb3febf7ebfb930611c53df85ff81cab0e792b20ef025193dfe0d6044e5b83"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027profileTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"64531348f37a1cbd0aa1423bd04e2e8a8ce8f879b8539eff20243140daae0c90"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027profileTest4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f382a3c61d04bbf7359e3657b706dc2ac0692a00d51b7efe0ae10506587f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027validatedTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd0dbaf1e16ba23575d39428779a8fbdd6c5960e112ae6931602208ec76bd0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027validatedTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b1891d3c57f4be3d4eea94ee1520e4d1514f29bfbc6c21783d9215686d747f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027validatedTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c7969a093be1f23e57dac132ad758cab89ade23e996ec772f902f054d46423"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027apiTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea96f743b51ec2c7b2f9ff6fabbed15c0dd83b2cab1ee7026f776b3cc3a93274"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027apiTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f19d0059dae4b91bd9518a1ed7bcf23b916a62714e94044d7501ef3e350da2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027apiTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e9c40984dcc8f71527721e45f91f1b9019c763a58f5f632eeec3f0d2b2dd6c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027apiTest4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63c7158871f1bc5e24c1d1f3e2f17312b4f68ae13e568745bf001d6d0a64a8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027idTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e4776ea196817c376773a70cc0a293a421522bd94486c57d22c985b82ae621"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027idTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb371755d1b8d66a935d4991769ecc2f535259b727ff6ccce1abfa51734aabe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027idTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2218d1fe053616ab5ba5965568541e6249a71b414518d1da6ac0854eb74a7a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf652be87a516edf4117749f272181fdec3cc3a1af6b7a212fd4af1415dabfde"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc188854aa628f8bfdec5e75a63439f221beb160a028c8fb2fb88edbd901b9b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ba9ac1b717bc9f1f077ccb7fc7f72bbdc65c8c941eb3fb90ce796ef5b2e6cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027pointTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"328d567ed52eee4e62425b8bee98238f3ae45a32abe783a6f71a2fa2ab574a64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027pointTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"42054b9d674d7aa1db378e31f4e3d15684452caaca90de5ceb984818be392111"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027pointTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"80af3642e5de63091ff313162b03f0366ec5980019333ed177d4ae2b0b613d0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"569b0bdfaab6dbf913752f5042299b1ccc9626a69508c26d8a717f43cfb9c79b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"40eff4e5c931d6368508b6652d5653e001c81b2b2748f20de9c5eca482ee61c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fed001042c2ffdf337d80f1de515f392bc00d5784eb5dea7506fd6e77bca5a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorMapTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9d1d400c3db2b66c635a4d9246a2b739fdabc122f571bad3029526aa03f1c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorMapTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"758d6197c4859a1e3ba0b5cfd3badc876a4007c8261778c6c4515a3360831457"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorMapTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b4ed82ddef6ba6747f877e331e1bf92a2682e98e27e5cd118d829e5efc6be4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027colorMapTest4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c3ecff548d0404cdf6d571a6f136c29de5ae606caa5500a066b866ee69e3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027callbackTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"619fbe58e518acfea984e9971c330e5c9592e30d12630c9517fecd298d396509"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027callbackTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d7d717e8d1b26b50451f54f50fb7e53118d99c2017a28b6b0b470590972c84"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027callbackTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"02accef3cf54a187d4199e97e087c059baf87ec3b2372e5930866dbb8762b80f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d568ddd263ba162d2aa7df4e7f32bfcd90abe0892d88f76187f347c0f9ed34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe1e1336b0bc9fa48ac57c033c98ce06b3b743bbd645e7c550b842a1e837142"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalTest4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d682e8312db2d421454ddf8b8423c27765dca015221e52784cc3ee5c67e003"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recordTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0998261e4abba4f6b2b1c7e84edade5c2500ab9e56b794ebe0101b12261d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recordTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3107a884237f2e147afba90fb4300e188a78c044b2415c2b3a9d045620ae9bec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recordTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1947f8acc42a12f62a0f27ce8cfea156e63a318f6c2ab50f0e4c0daa64b5eb62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recordTest4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"aace74b0441a6b909c311243f0751e23be4edb66b2a5f09f9f9e0afd628c256d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027enrichedTest1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"337918a3153c81288220b78e73adbfdb7e5f2458fea1afa95fc740b6ef0d2b2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027enrichedTest2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"54460e3d2b5fae8869fe1fe31868ebb0e14e784671fc0c440399b46385ea6b68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027enrichedTest3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/custom_errors/imported.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7ce1f0c397a23e7b1f71c77d5f69fb13f54af46b98174b75b59bb13edfd43e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cyclic_elab_overflow/named_record_export.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d920ad8d88c5226ba464ee4892301bd654b53303348482efde93a901b90404"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027value\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/declare_global_scoping/test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e48ccf31a8ce4725fa9ce0abbdc10c8d25dfb75d73c9b76208318d6baea573"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ns_type_only_ns_tests\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/declare_namespace/typing_test.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fce35c68c07f50c613dd3819da18c1aa255c9f6f19e865ec3a76527bbdb80c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027k2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/declare_type/import_declare_type.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"24925d675dc15aefb1a192d97bc3c05e93fd0f0fef855853cf136b0d675daa00"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#secret\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/definite_assignment/enabled.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7bce486495a57b6ec847584dd9b22dd67340bbb8699274f4fe1b1488e4253a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#secret\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/definite_assignment_disabled/fields.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef4a1d3dc6c002a3e83678e89bad461537259862eb5af51965e53bde448884d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#secret\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/definite_assignment_disabled/fields.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f6a6764d1ac751275d09eeff80e4a7290b619ef8ff579b7dfebc6e76b8f30e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027extend\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/destructuring/destructuring.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5730de6433a7fedbb4c8018db1859a0ff925cfc135bdb21435472588cc2901"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/destructuring/destructuring.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a5d5fcd0416b6fc2a96489176928970910a89f460f9b7c2d5801c1c8ed7144"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/destructuring/destructuring.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2b9b1450e8b288fa9ecfd2b622563b26640173a6d712beb8bcf1e22c93f020"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/destructuring/destructuring_missing_props.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6195684b96dc3284404e49f74da5ce5e7d1a4cf336479072173cc20bc1545"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dir_coverage/cycle/cycle2.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa01290856a802ad9006eb043706e85b1c5d3e23a6335ac7064751f89436fd1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disjoint_union_perf/non_term.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6371838098dedd003d935aeb26c67b3a422853ab4e911b813a3b840c413ba74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027toMetricConfig\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/disjoint_union_perf/spread.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b186ef7a026d7beffd708f372cb0315e50f480f8f59e5c5a64fcf10445c8dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027esm\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dynamic_import/test.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8357fc330fa34b5f8a26490d3ec3a21882d207638ac4cec5ed51dca14e453dd2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cjs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dynamic_import/test.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd24487baf27bdf15cb419d4d6373ef1f01da8eef2567a14db37a3acadffad3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/enumerror/enum-crash.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a02056071d260daf2ef6daab3c8ab38bc30598b79a66d864cb4e94e67dc39d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027E\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/enums/const-enum.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6657ce61eb28388734c37737620591882abd86fd793b83903386401cb7200fde"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testRequires\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/es6modules/test_imports_are_frozen.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb3c400d784179ad9cd12b4fea749c37ebfed9d8e2ddb3a313b8db312672409"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/eval_union_perf/test.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea02268ac8e92978a651d0702b4048576b7a333acb8022c3e1f59379013c55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getFlag_ok\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/exact/per_prop_subtyping.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ee49aedf32f24db8b2d133961582c2f22352de2f4a0697e6e53f0f34baa0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Arity\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/exact_object_type/test.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c24406f2a74615817121be395bfd2e531440170beca21250686f6fe066cbc1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"589b65fa49b5a69ef71bffe19ac305ca70d6b3591e61e9ba820bd0301d6d227a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1fec648dee39e6db6df573312cc89862ee0113eb9503c95e63e61e9198f584"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7e74bd3faf17d53bab5a89be5e070ced215b132fcefdba70636f68946680d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dffa42b38332e0c059758a49983e4e418fc015156c4ed050566fe1f603ad29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dbc397bc6800d64da3fd2ce6da4a72c0652e0cdc6c4aba42222aba7365c9c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8488252546de29b15cc72982f8fe6e22cea1d7d8e13ad5145ef7896dc956e6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4704c1ccfb3676ec3bafa1081095a00abba0a8117c8636da0092fba31269fa86"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027h\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc1a9a328c7a09d9dd45606dba6d9edb8006db2655fa32188d381adfc2ea9b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027i\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd20a5073982226d8bdf960f9d0e02a717bf71b4f21a73ed5c94b668f7a52f5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027j\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ba8c811f2831b35e7ec9074b64e2a40e160be40a1b36d9a7a0f51d7e0c8758"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027k\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"71496c9b4d49b0296d9b8ce8412bde62852d761eb6c0f202e6f70664f4bdbeac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027l\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"619ff959bddbb38592f28a4429b290b09a430c79bf7f910edc16385ce8b8f7f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027m\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb938b273f415b8228348c5181fa31adf13d7d3c2c53e6fbf5a5cab064cb9a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027n\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/importer.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d5b2f08ba54df40c7f690f936c00c8d0ed8d29748e9db77970a9b20b13be5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/types_only.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4336a91617368ebadc54e9fc23e3e221e83ffc31ec0e32dfd55b11e3fc8679"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/export_type/types_only.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e37d73b39e8a9403c9cf2d89592b3d01c311b149e6e1c35e44331f3b1bd89a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/focus_check/other_root/other_root_file.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"be11a700f2f9d8cb18515581f2738b3d9a2ca484f5bf43a346617c7ee5b1c8e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/force_recheck_focus/a.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba0085848f5042755f5e4899967378930df14c90270b6009670524d3251d165"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027locallyDefinedTypes\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/function_and_object_type_is_no_longer_any/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d15bdb03d5352df61c272e36f800d199b731566f48ecc80c84bd9d8fb599f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generic_escape/import.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17b0d9ae4778336b5dd0908ef72b045d707243a1c57e87e281993e888b3b336"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generics/detect_literal_subtypes.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e534c97e6685c536e1b3bd888ebdfcb21718966952154ae88ac5d845daa78bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generics/detect_literal_subtypes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91b4305ab6135498abf8edbf4f965c52c72e146fa3eb193421d2e35627373e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/generics/detect_literal_subtypes.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"de093a52e4e9d0064fd6b490d0e4735073965e960ac8cc16adf1f1267dace98a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027re\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/get_def/example.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f0ca154fc7e02845062bffd42821caf3f849fc3e52ed6cb32f0d8c173f327f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/get_def/typeof_member.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0c3b43f2436034b9c268ee70ff637f3db8d69962a16f8a66fa1bc7dfb26a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027U\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/get_def/typeof_member.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7b98161daba6e4d5b059a169b336a2863aaf0b1734032bfb087738b75afd0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027V\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/get_def/typeof_member.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ab0193561ee442b1fb5da6d90759f840b7e87e19fec50d0fd58a14dbaf061a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027takesFoo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/get_def2/import.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"de231fcc5519567866b7ac76f4b1a28c58128a90e69b23af56b8db74e4c31c8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027z\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/getters_and_setters_types_first/declare_class.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a73ff082170e45b0b748a3b46cb87c3dc17762bd8ed3f9fe9673f0b832b6b8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027z\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/getters_and_setters_types_first/import-object_type.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"17753a2a195bab3c9fd39efe1960bc7b1fc77cf7747e16a25e7698026eaa59ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/getters_and_setters_types_first/import-object_type.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aef08c1ee1292dbabc802214a108d8804a83b60bf205b452944d78be02564b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027z\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/getters_and_setters_types_first/object_type.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"85357b52483eb8b14dc8c8b8de484bcc5a780e36d3ee8a783900996e64b647b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/getters_and_setters_types_first/object_type.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"006353318b6cacb903df646e8078fd13af848cd24188f65196a430f717c6727a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAComponentOrHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/hooks_in_nested_callback_or_class.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a4ce986fb12166f7538e0a29c50cdd5b89c12677a8d83701377bd0ff2718bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027HookInClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/hooks_in_nested_callback_or_class.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc62019dbdff82675dd9864e9eb0c7963e797ee7e18dd8b33f6021565fca927"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027callsUseInCallback\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/hooks_in_nested_callback_or_class.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b85d94b268c4fe11f1296234127ddd77b307081e40ddde9ff0dc5d3f7293cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponentWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"addbd42185532ea85fa07e360b47145aebef6d9dececa6985de8a6c17fc04dc6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c1e50039f93dc602c1db26aa9f377b8d49defc79d0c876c9e10ce88c711083"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithNormalFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c536a5034e2e4b43029fc9fe9cac04c932f7301f536469fc4509af6b97f05e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithConditionalFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8f8ba2e5f47bc07068079b600e5249534d6f892649b8a22a70f1b1f78e9aa0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionThatStartsWithUseButIsntAHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a825edde539e91e63cf1f8d0a8a91b306e740b379bdac9fc1bbcfef6e01858c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c573b888d83b77a89b8e6d6f225b791fef4f82b5f4daba40b39e686809e261"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d949da8691f78489596247e141a3b8b03813e199617741a76209abc01a11d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027makeListener\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f754a59309fae1b781f83ecb7a5b731cbf7654765e69c95f6bbcfc08c62b66"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cy\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b2a930b5f883f2af5046e337d14fe5a9fb838449f2051c5bfe48a829d2ba1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c8b1c96a996dcfec364157e6d176867beb2060e7f6f51d8cb3b92450240514"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35cd3add0a11c1ccae81e62e16aa0e857892f5c4a85eb4f84d95acdf6406e38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653021e3d7143e83f9abf6f6071a7909ce6bac8f63406e4fb5f66f806a99e50"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponent2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"7076fb01be0c8c5305ec2e6d9ce2b148fcad51e8146a759a368948f626977eae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponentA\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f481d745dbecb9609cdbf1cfa1911d6584fa4459777c873bf20628794d908435"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d383b943437fd48fb14904a731684968d13834cdfcf15b0ee8cbd3a560a8f576"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_normalFunctionWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35dd9492d47489a0b9fb5657c32483216f673ef0332a35cc3dbd6b67ee51683"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_useNotAHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d79f7251a802e46de6f147cc1dbe5b79932bc0229ef92afb9fb906f1d6ee03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithConditionalHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"160fd9b856bfc63c7289ead3af3a12334ea4eddcfbdd87a71125762d3844792c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ax\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ef90ce447bf08b31f9783fda2a1539da75f7c942ab39e847dbd862063220ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027whateverx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b8e96f0969e88b8d2e9cafbb5a8333ebe199104beac7f418a85e7ebcedcc3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0bb4d56a2f1816405ce56aafe904754683ef69e357a3fb9aa3489115da0132"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027dx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd82aae93a00a74f6d081a6043b881d239517b8e3dda6175a65d473d7249c89f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClassComponentWithFeatureFlag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3727e50ff72e37924fdff82187df95e37eee7abd87d944215340989775eaa29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClassComponentWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"73477809c4dc2009b43ee69f57e82e8731e33fb8dabd5441644ab8d76820b8b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AsyncComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f020f228299c4ed91c75b189ff633cc3d8170dbd8877b91709a8511855635"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6e5f6aa39ed9e5d519d6bc4c67b8d20d5d37415ade74857b7679f318014714"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a7dde77ee83fe78fe4d6542b9aff6545ab7cc03cdd782a209c24a7bc3b6ff0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FakeComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/rules_of_hooks.js"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d23574e7438ea8e76872a4742213afac8e16d32835b1f9176319a97641cf9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/syntax_compatibility.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b60a69b37aaf4c80576e64d91295fdbc7ecd5dd12c3431f5e6ff26ce2da042a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAFunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/syntax_compatibility.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"739a7b1271173fbcdc62e45c5d94c1484791822b4e6df9d8558626d0a18e1488"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/syntax_compatibility_import.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"67955764c6a5e8a30a3279dfff9c5fc03c7a028b88e621f4b1594905eac0ce75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAFunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/syntax_compatibility_import.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e80a273d81aa3a02780bed2314ee908b22fa6f03f0fc9444ca95fae052a5201"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax/using_react.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb4745d8bb2869952985fcb6ccc4990bacaf99530b9da768df311dfe608d51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Component\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/hooks_in_class_in_component.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad71cfd4d939af8f4eec3eb52d59a452efe6244b7d8625296f8e4dc6f710ec64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponentWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea81a37cf789f6545f063e2bef27c81f0f6c53ecadc7a7bc9447c5f66eb6d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"33494f2810b110e7e71402f2629a1f90a7702da961d0c0723d433e3cb34fce35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithNormalFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77dff89b5b80815928b56c6d69abf1a2710c429ea5474beabaf65938667f470"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithConditionalFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7c08127cd815b1daa421b7bb57619673a1ad7b85f73327aeadb46144f68667"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionThatStartsWithUseButIsntAHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed2fc025c08bb4f5db98fcee60abe00587560d2a176db9dd30de8b627839cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7466581a84bcffbe8723c9b9c44845cbc57d13fd1bf2ec65924f7f1dc3f2f96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8743577bd7182f68cef3c18b6e6d50d2c5c9b8b3a33b44d8bcfeeb8b8e8f7d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027makeListener\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db182cef5c1c72842ac106c3fd5ba6704186fc81af8b6c35f7e67e461c648a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cy\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"2246648c128f54b0567bbbbb296d1248b2e184ef76b5c716029c48cfc45dda94"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59417cb816d2a85c069507a845b8b6376c954545c245157c1c8750332d5798f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2a73e12b7030a224071631430436f23768f151928871411df062dbd462d9a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff1c199683ace0e9af93eaa2eea48036a887aa6111341914b343deec00bee9f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponent2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38a0e124857d077db3c0acd7954d7187b07d33dbaa91315a84bea59a467baf3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createComponentA\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe8d7e95eb911a0601c5e699a6cd1f8819d91579bfd0b3bd4ed37f066229a78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"867cd4dafe0250ac6727d14a2bea6fd0247e8ed45b8e2929b3c94752faeef87b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_normalFunctionWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d32ae413145e9243e8aed83bbe62c80974a01cf41d589319c193a7dfdf5ea3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_useNotAHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"0425ffd94cc6a6a51eb76e53881967913fec88f36505bf78fee3f0839bb038e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027normalFunctionWithConditionalHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e12955ab173eb4cc155bd762d73426659b65e2d376e61eb212551739927da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ax\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f562f0e0ebbc92558f6c397e9256337b3c71d055018b98a58588ece666b18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027whateverx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e6fc97ddad4c91247decbba6404a20a50c086764565c8f9119f4c21ec30de7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734d2f903e5da1c57a4cf5b11576c3b386b21005ae34eaebe8cf25632439ef3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027dx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f12a1ab2ce7ce39ac9f443d8877ed0c3ff02f4b0f83830a5794fc51a2df0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClassComponentWithFeatureFlag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5006324edaf1c67e37f9037325e92061c7971da1546b98c381544ae0bb2c750"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClassComponentWithHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bf31933738e05bd63dc0f54511c2973ebb2efe2afe5b0ffd6598b3b3aa553a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AsyncComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65bdfb87396d5182f38a487298d67f3575c2520190c4300e40eb37b226de336"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf3df207ce496ffc1d4c29864213a84960adda8b3ef8deaffba4d8561f157a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/rules_of_hooks.js"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"78723fab70112bbb56c1af3b02b3a929cdb6b184bffb6592bad557cc3c6e4d77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/syntax_compatibility.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c0ce68190df24419539b4c727c26587d9c3b027350456d550730a171411698"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAFunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/syntax_compatibility.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"53241ee6937e73c16385e1ff3af0b2e7492d63b88b1e577cdff75492377a10b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/syntax_compatibility_import.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17591c483e1f564f7c27dac66cd5987b30e7935850242e571f1207f4499244c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAFunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/syntax_compatibility_import.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ef72425727b24652607fd535e2f3988a4786e9e42cc0f81796c7323efbd28"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/test.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5af9caec0e5645e383ee8eca0636e891c163c93e8c07f1093088a75b2d8c61b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/test.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8a0ceb6954e2fb34712737785a5f9255a0672ad4259f30d919ac5919a07fb3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myHOC\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/test.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"534aad449153bbf1413bb158553ab8b0989d9b95d312bb6d3fdce2d2a91b9c3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myHOC2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/test.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9c09d636d251c68db8c1b2a03dd2ac0f44a5113491b6ea4c93522fdb2096b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility/using_react.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c629649baff5176b93cdbe3de241bf6075a8a909ad642ef420aa431c69db949c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_excludes/__tests__/excluded-test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f302d6d1fb014868add36158e4802a98beab1f8a2a49f452def8e9956d33a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_excludes/__tests__/included-test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9885ac3c9cf84a062045f3f746d646ed87ffa4652b8596ed4b4dc3a21e7b3d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_excludes/exclude.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e1c78333c57031d0e3a9cd02e47348cf2e301fb2281c847422b02a152df016"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_excludes/include.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98d3b39f30202eddc501294b1ce71d95ee311207ffcbe528eb4fc4bc8843905"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_includes/__tests__/excluded-test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba61dda3b538fabe4954eeb95231b34e3a5bbae08bcd9dbd8f8fdd44fb0c7446"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_includes/__tests__/included-test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a519bccd46dd5b4fd9e44d25fcd0ce7fa1dfa360aeb3218bb70bbdea36a7a2ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_includes/exclude.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5017261f1fbeb52d70762c449c3446a5c20b5e3a750385b3347cc99c0667e70d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FunctionComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_includes/include.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"337de0fb1ce4e661c889f71b3dd5ab802a3a05e45a0c7ce66c6e50b2d2a1ca8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notAHook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_ts/consumer.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ee5d39e80a5d0b7dde5d9c4bf172bbfe5b058dd3174707f374e89e69ed3b9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getDouble\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/hook_syntax_compatibility_ts/impl.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce7d5c934b848a17d53f3e13ab458f364df5e99f184ecd5fc6fd9c77b689b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation/eval_cache_regression.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6414ff0e85cff47d0613d7920d2eee1e7499ed4c364a7c7a6c27e752cab0e7e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/component_bound.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8bea48b3b446e075f3fe23208db7a347cef37b2f65012900e558bf3367cfce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/component_bound.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d9c9a3feed5c703cd898020110d647fc05f2e8f343b08f0d3d9cd6c3065f9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/jsx_props.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffd452fac9d065be4244bc8d71e0f13333b4aaa936741aabf521785c6b1054e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/jsx_props.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec1457f7a6c928043987db091acd7665ba7a54297a4eb2c7c0c101e76ed6ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/jsx_props.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4848f6551a514d5a90ccaf646d707a9a4798951b4a2a86af19c41601886c22cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/jsx_props.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3eb238ea4495cad0f3100bb9bae242ed144bea5a96d4b751c9fee6998b71bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/late_bounds_generic_bounds.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48bdeeb09d13e526d26289c98cacce429d41dfe6b762749a6fc57ea4ac8ef8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/late_bounds_generic_bounds.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4093d2d5d8ddd4589881f08666ce01a6b7b655c49cc4299d50c5f86243abb4a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/late_bounds_generic_bounds.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ec3ef2ccaf11f823bccdb3be970013364c1ab3850017a9c8d15f809db12a2b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027case4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/late_bounds_generic_bounds.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e0c3cf13159f8aded6db426e39e9a3d50fd0a4c00b12ff6009e626b7a3f094"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027F\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/readonly_spread_union.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3fd37d22062969d9f4de65add02a111229c57fd08bd3c117f563319788c79a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reversal\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/implicit_instantiation_walk_regressions/upper_bounds_merged.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e43a642e1fc5c85dbb112d49e76492caacddb0b7a9f41a2b8fd91eb060f79e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027read\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_redeclared_by_hoisted_declaration/component_import.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d5ab8b1f88843196b8a86569730b3c59f1db50af27e3b113c73b284d71455"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027read\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_redeclared_by_hoisted_declaration/default_import.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd251615a1ce593162093d6790f4dd2517e0e188f15f7decf0b5aee6765acc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027read\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_redeclared_by_hoisted_declaration/named_import.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"901082a49f840ebd4e3663b299e85255418173834bd99a6484343bf566d163be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027read\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_redeclared_by_hoisted_declaration/namespace_import.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"21212af3fdd0a3ad5dabbb06fc03b91321a717d4f4aa4698e5bdd312c806a9e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027givesAFoo4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type/ExportCJSNamed_Class.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b73a5d46d00ac0e5bb3dcc44f155ca299ca0936efbdbd9c1fdf2e1ac16a9f34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027givesAFoo5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type/ExportCJSNamed_Class.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"366efbc1d42886f797a4468f62ad75922de71d1076a9fe74805087c41e575f95"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type/import_type.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff5d364b2128f77080fe957503f169cee3de0267dd882b9e78be5f85bf84207"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ImportedModule\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_annot/test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff825eb51be28c1532d893c4a2df143c0c290d32d941cdac1409579a9900bd0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e06cb53b593e95f3d6253dab408f423ce3fb95cdfbf8ea91819cf8df39b11a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66f3fc7ac99a3401203c6fde7651f115a5f302c9c70273c4a53c121008ff2dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c4b665643422e98f4b4a4159f2b9b9a88aa5de3a786af9c6c19e8063467ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6d8fcc6b85b8efded037c75625f52868bfcb268c53d7deaee26824d640f3d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62daeb0e8017cb91bb6658e8ba673f938bb3d27e28730377e6cf76f8a3db231"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabcc6f2e357a658d36a21f200a3ba7aa163b6abb29ef4b1f09dfedb1609678c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1782fd431db9d6b152a14d97d48ce4019775cf9f7e66330c1de9e863a8d33a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a088c6dfb37c3339b200d7ef3df9d6ec8ada643044bde9a1a490b8bd0e1a565"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"848a329bdad5a148086d1c96a91ebf221d1e07e2bec889390c4ba067bc221a12"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027F\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/import_type_star.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee776aa3478f0973bb721a64adf78830318d7963ef5cf414e03f0a138792e09"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/test_with_react.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a138a14e8ba6bfb1ce6e29581b0917654f47ee23029922446f00329fc2f5b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_type_star/test_with_react.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"929247022e5c05e4858f3a60c87f2ab1f12f8e64d51f0763972bcb4125831bec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"72469c3df8de4634b23a46deee164974a61c58d510012ef5e291bee2f5ac41f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6234aad5c2074ea67352160aebd6ac4bf2e3d5b7421d4b5e554cf8f7f7d608"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a902018c2e5424c8ca15c5209c75ff133c2eb718e21c18f61026d9897493e5e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d617dc49d0221b4337ef268b78f1e39a60873da86ae03c45327d6c38af7d2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027h1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b0069121321fcb8d8a813ef9f53f6cea112305b740ad801414ad43cd22a6aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027h2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcfa40d800d87f5cc3bca068d9f263b0986791bfbee242cf3acd11e579f72a8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027i1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9200632c0f9e1ebe3acd964408aee6d694755271504be17a786e55f10bcd7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027i2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3140e0d35ea0e3d379152a0db2633ca8d4af422f6177ad2188d04c3cc7366f21"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027j1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf2fe38067f4aba8b7c511e837af509bab07432666db23b0c6f3a36be843add"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027j2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/import_typeof/import_typeof.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d73fd24b633ef1edc9ac6eb711ff5ce212f5996ccf80d80a0fa4f1342259e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle_unparsed/bar.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dbba3a448941e9f9499a5fb419f8c28d93338e082d5c968d6bb2073c85a55e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle_unparsed/foo.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"780883b5b712ebc6b6c5fd9c0068df1d7377df04cbb752e5a34d8a27e0c0a617"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle_unparsed/tmp1/foo.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056b49b5c68d3e370cff26752a134e442c0a738c60654b9be66c62d9d2f2086"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/incremental_cycle_unparsed/tmp2/foo.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7584e0e5c956a34bee71b62e146f4470b19fa48c411cb7a3c8329169420190f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface/test2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bc6002af51caa4a6483d4e61ef35b94ab39f8550e7819a1b83d2ed7715d8b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface/test2.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"64089df2250c609bacacf2dcc1dcc7b6c17d072b76a8347089ccaec7354355ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyOne\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/imp.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b8ba828078e9bd3e0929c4bb3e115a784ac67837a7c555236dbb97367824e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyLabeled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/imp.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd33034488596d3ecd7f93e5368c2cad738b2b5d68882ee25930914415c928b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/imp.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3a76d29ad4a6600b38e7d19b9158adc79abb99a0a5d97d633b974bd42f3b5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/type_keys.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"77215cc5660c85c50939a71957836848f20c98a509aff5a930c5fbaa36315675"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyWideStatic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/value_keys.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38fa3de6e5ff9abd2325ed90711bd81363436062478678d0677fbcf4a58a828"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyEnumMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interface_computed_keys/value_keys.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83fbaab327958a51a55d54bcdab7ea70b33ebec06b2cdae2246a6cb1f7372ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readSetter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/intersection_normalization/regressions.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffbee8f6505b1250c2da0b859a1d5c48dfd85cdaa579442dbc48399c8d86222"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readGetterSetter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/intersection_normalization/regressions.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b353f059d3f3aa552417c3e44d9319e32f7ce8234e9d2e1c1d0077c898560888"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readWriteonlyProp\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/intersection_normalization/regressions.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c5d6fddf1a0ac68e352810469e126142827e7097921452cfa195d4b2380ddc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readWriteonlyDict\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/intersection_normalization/regressions.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b58c7f9418e891ba022d7d05d3348214344a6ee4ead6136e1e652788694bc57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readNumericDictionary\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/intersection_normalization/regressions.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6c13c79635af6e92eea35bebf02cd92276ea5db22c45b0b5626b88bfa6e5bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/liberr/a.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38be722a8e40e188269fde0033b4d144b663c16aa0881a5edf48bc4365de74c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Class\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lint_suppressions_with_errors/lint.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a90eda1302c10cea39fb9906cd468a1d3490b00fa16ae50cb91a55983aece"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdebd1fce17c8f5328a78c77c85761ba1be3fade06f7aad4bb990c8e6cc6e5be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ce3986f81b7fa1fd8c820ac4df63cd1743de36fde8c9ff18b3f71f1f130333"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e53c9e80748162172a92193a2c41f5d28f106eef1007bc91905a2ef4562472"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#priv1\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"063caa31270b6ccf7f6d83ebaca7f0e3344c2618df5438384f8bcea242796f0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#priv2\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf713ec43406a7f3d98ffa6c15a2f31195fec2d65d331abe8790ede875cd360"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#pmeth1\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0e0d46bb43687c91dac476a2c32a11646f6c933699a4cb3967145ab852c8d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#pmeth2\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e430cb9237964328dcabe4af2b5aacfeb710589cc15683f0c83076f51c9674"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sanity_check_that_we_dont_error_on_non_method_functions\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local_inference_annotations/class.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8852c20f8e572bac82992974bd07a7ee869c7abf25552981778fa292888a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027identity\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7784572a16c7fbcf16b283f289d70785c2c5f9fd6fcb5621deae901bce4aba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027property\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d544af2a7b7776bc683c0671281f37482abdedb3ccddeed205c2593a211da7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c508eebe08b98db97ca0cc45e360af9093019d34852c8f2b9c142b6d13d452"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tuple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a85142245d38ba7c6c3e968bd48ff9be267c9b1e66a4e4027878afd439eaf74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027statement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc99615511f66d8a74ff326def5c2316ca8339cd6c9e95ac4042e0bb445a10"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027union\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa8b65737d42d3e92adddbe7110c8c1aa170a8fe391e4d9cba2610c92f4146c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce75fd83bdbbbca80c6e659bc32fc7ab5e8b215b2a24ba5f490ac276f011c04"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalCases\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c50438cc3df3dfe52db8794ebced8e43847057a84645438a68eafc6083150b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027star\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f60d2f9fc6420bb7030ae30ad45179c33a25052736d381c6ac9cf41b328c39"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027starCases\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d6b73543f82b7b17ccb1e02a9223b5a2928585a2e8124563a83570e82d57f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027genericObjectPattern\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0817c10e659bb5d52809679f41909e0aaee81563384b38373c7f4a05784fd7a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027genericLiteralPatterns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd3b23c47aab4cdd44527e1ebc25f69ee8f62ff4c0c4ce519829c3148f4073"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027genericMixedPattern\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c26e15070ec8e7d27e4f797b7cbc9dd91b6e7e2faad95e5b9c8c38707d6d1b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027namedAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a2a9b11d6018a92b639334528d4350820eb4419e9fcf5e0f2f5aab97c16bb0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsOther\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf1f5ff32e38623307d893a332d1daeb0d152866f5eab155d3d0bc334fa2778"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a6bed8a218935531075b801533f5c0e733280db280aec60351db346c143121"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1935f495ca473cb378d75b1f4be10423fffffa1e6fc704f21cb25e5420ad62b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsSvg\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149392d903a747a30c462a848a78adb3341bfe0a8d7d6ac049abf2e4d813f86"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027notExhaustive\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908b477a907020b180b34fcd4f103c670e6a7f44e77b455207d5d5e41da4eb9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027explicitNullable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e02844604fa689c93f51f22ca1c57bb5fcbf16fd205a6a090288fb2f1296863"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsRawSvg\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2701781c09fdd868e3f7eb53c0927f546127b21fa0bde8594334ec4e12b3cb8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rejectsArrayAsMaybe\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d94ffe800f5df0de20abf503dafb58f34c817d72be4dcb4e5b0f6d2ada237c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027definiteElement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match/render_types.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0337d9eb8e65528c6fb436f5e1d028e3dca2e5a20572d3f976b2b0945f3212e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/match_failure/destruct.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"82623cbc158e7d3251a54403bacd2c4bf7653239a48ba60ffd60a5fad1355324"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb37ad2cb74ac69be0cf40599072d0af499f8cb9e225961b6ed1439c0ed257e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae4186bb02ec8494392fb0d99c9f4409025f500788e161228cd9c8016bcf8c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"222ac327b82b3993cff38434346ab8563e6163b17443554f4635b39ecf939b63"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e4cce3c0a9cbbb70237d9773ab4dfda607028dae1d13d63e320f5c69471bd1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b809c5e55fc0635e4831543fa7bd2e6ad48acc27d1891cbbe5bff548b30b9512"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ob\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_extraction/test.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc5f1747abb6deda16b13dad123963ec8a576abc910bd13976a62c0806ea83f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b43aa7c0ee12c627b1131eb97141656b3a6689da74f80ee10d5222d82d142b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d6663f8afcaea20326e4aa3184da56cac25b21ef81d3c6952b0257b5e96fa2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b159b7da6347213ac13b599ec817fc86f4a8c0904e0231ddfe5319b26574caa3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fac08e45122352444ae01e59563175a1f73646e84c65fd9c0ef17533995197"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"696a356af70fb83f3f19badfcf85326562e9cd9131a94bff73e6450cc2db95ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ob\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/method_unbinding/test.js"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc3c3ff4ef2ed7201772f93ce6a7e97d66173b586c6f428878296a52df56605"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Condition.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79902784dcfacc7cba445fa1afeed9e99def584f55475560ab8bbd12e0edc1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027goofy\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Condition.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a9a8d4e5bbdb5270ebf15c23f69bc2cf2f343e0e6daa5c6194181b6c3f7322"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027goofy2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Condition.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f2af9cd028cfee198aa1d98a179b80fb38bb7bba44c248d2a1dfbfac34a6b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Sigma.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"00279555c5dcf2b761ab201cea9e070753fafc7305203a5c3ea0893714937bdb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Sigma.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f851402c88c0d601203b8f9fd7179dfec46e35f5e1ad5f0550910acd1549df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027baz\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_path/Sigma.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcdee26cee639b68d9aa303323ec66d9b77cb61a009b1707fbee2e08a09fab0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GetReturnType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/more_react/react-copy-write.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7500ae64c9eda6881b63d2c545dd7e5ecd44764a1f9cfcc8e6b3c0aaefaf1e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027s1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/namespace/namespace.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8945411074db846010e83197db679ba16e84947e2331d51193da38ca332ebd2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027s2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/namespace/namespace.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb743b7bd321a0fa7c9900fbf30a1c253254b62c4624958861353837a7cd5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"223690584800c84d3d2435503211856225f188d407b09f5ffa899858dfdebea7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_number\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"770edabf3280d04ff4e60ef725ab81c767834fa189f2f22346c0fd6c2ec0e5ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"48030c2512d530804642c3320e7a60bc44a7d5d8a13445f77fe1893f38213463"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fdd50c70b87d3f0699d4622a2ae445de88cc72a4129492f4759df84c3058ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9d70fa6b659b10e4bebefc473974b35377dfc98001b5afa0175fd704608627"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_number_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d53b13fac73d4d22e3a7e07959fabfece6a322918e4b1dc2fc5fc63c6c18ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ddeb1a286f1c22a0180341ee9b2c6bbee71257a33e644eada9ac8193d46009"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09842a2c494d89d89c293727a1729fc219a6024a8b618c59347f9bcc802dbb4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c345f73dad4c233435bb21150103038ff246f73568bd59910086e80cd71ce4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_spread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b965b9538c88d67fce57e8ffe456df0afff66877cdd094ce706a40cf4c804f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj_refs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2ac7f19c81ba494b244e30ccf5f7a6f63a28c76b5f02a4ced0cfc4170c0196"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_as_const\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23f47004795d93dfecf97d328ace42d612c9cf927817607607c671428320443"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_typeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de7e45c079b0550686bdc0ea9444f62e3a2294c09baf7bac8d05d226399b251"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_typeof_obj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"913fa196e55d54d5dbbf705ab3f61e5045d7646d69bc1ef8aa5d75b605455303"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_spread_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6a4a13075fa44d9e7a6f89f846e98bcb1979a45d6b5238cd99eeec8014a5c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj_with_typeof_abc\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf169106822a81c158ffbc64c58bdd3450724d58bc156a3657df4f7e0e5ddc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5832ea7467f92ffd1694dcea64cd37f28e4f8c521cd94b77d7fa7c3c8425b4c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit_as_const\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf07f922dc61e2fb9c8a8ec5c6d9ff422c47ae0539426cc8296e4dd12eaa699"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit_nullish\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"575296f037efc45e31773c2397af6d4a3081902a99edc3981ce16df3186124ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_conditional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29f7f9e4ec0f398d2cd11ca760d81ef1da383125cfa79b5eee0cfcd7b3b6e4c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c668eba5a36be8b60e510aeecaace3d56c833a1661a9dd48c576cbc4262c60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad226c394543f116866bf43f1bcc4d4b6b00723c8b116a77de5df4f67fd01aaa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cacd9a3b32fc893c79c47041ef31548bc38f51b2421b1b4fe35cc4ed3acb3c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a4ae19d8771a486c781c819eac3978aa7102f187ea3083a09f50ee6c8806f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbd8b57e84b5b11962d12212fe62fb2ed95b4d1c87e2f22c19ec5f02bcad671"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93abe608c69886b986057b2b5f312bdf0bfd91c310d493ec7ecd0589765a2a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a568dd2196646527ecb0a8da1d9ffa4048f4948013dd3ab6fa9eee4fde082a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a359deecb65cbce7d32d085db015bbea76ee1a264781380fd0638b37bffc6c6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"867265566e0eda0026fd59eeccf45d137723dc0c900109b6bc748cdfa82e1953"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc64017d41b47baba63a57bcca3749953ad27b3bd2d43dff9dbb8fc20429e61a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_apply\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a197d6e6b7dde5635ce799edcd60a2aeee8420afbc5b414a5bd2222871a942a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_switch_case\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad6184d7404de1ad77758b257f4970d308284149fcdd8089016976bf102a2ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_eq_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ece00686aff99aa7f2407caeeda1dd8e590cc586ac491abb0a9753341e0251d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_nullish_coalesce\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0d483dc87daf4f7562880632e1e186563bb0d3611bca76fb23941362ca0749"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"963b041134869aed81c1bb9dcd6cbc5096a0cb0be9e8dca0bb52af1ca6539ff5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"115a1bec8a16180c5ffdb137950fe3c6a1ea17242164d1b8fac43100ba1e232a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_sent_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bce87ba985aa074a1225658bb6893c52d74aa28a1e7dad9f71beb365f64b64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_logical\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc6e0d8e8d25fd7b3edfc909a693e82285e1c0d5bc4c44d06a08a1cba89ae7e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_hint_passes_through_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"330a32984a92d4bf59a1d7878a39223f6dc778481e6138b4d36bc3d041385d5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_hint_passes_through_array\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b46a031b50547102e7fca094b1b04063ae2626960e2fccf70bcfc001f8d168"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_pattern_match\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6025346b4fb213440659bb4b8747dff5fd21be64409b25ddcda6ce4ed26c0e7b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_assign\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55ec6b30e143ec5fe871166f9d28445f7045ab6ed9ea70c81e66862f09878f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_reduce\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/imported.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa37dcbbea3cdb5f184a110c73522af079eccf312a4ca40b55687839b938ffc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"61226def6658f3c4bab14ecf523f6e2b63e0830c1d9f41c50caecf1d8e461c17"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_number\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e091804df2606a7b1baa4fe1fa08b7d2f4675de1e4a68da5866affdc885745c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d53bcf82a206e13ff69a3e56268fbb445cc5052724784b20bbecf599928206"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ada8811ea2740a0045de2c7c7a3ae5507da1387be98c64cdb1d289be378356b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_string_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"46df367d5fe8ba430c5814fc07df88b9658e773af642dae85c0d4af1c6961aa3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_number_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a76dfa6326cde3ed5973e55f99f030e509ea77f77ae5e6110fd1a9aef2c0849"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_boolean_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b105e8aeaf4085f4f63b1f527c880508c0783b8673977c7da4ece4f770f9031"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_bigint_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca7ec50266d77781579d14ebc7ecf86aba5a39f8915247273b04ef5391b96af"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fac24703585492bfd07a877a1406d3af196ad0feaaad0a0fa23753e0b86a68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_spread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"173fdb00c584f6e3bfcc8c27b0585967c01f4573b60383c5d7eb8d3031c7dfcd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj_refs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231f57803bd452a17be4a1c893e3b06accef3f083f56c4f84bf9e6dd46a0000"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_as_const\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e4d207046c08904ab2b76903bfd7c277304200de012d145c1614766a7fbeb9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_typeof\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"be38a13003c30a6c91ca72ca6090b379c8ee760b8563e6f14f355dc9c28346b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_typeof_obj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8260a4c95735ac0743ff87561772610724d0cd611c434f826d7af9492d27326"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_spread_ref\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ebebd423f2416e4d665c63fbd4d2ea2ff2abe610b7cda211a189a9f22b93aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_obj_with_typeof_abc\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c87f9f82125765ec4f72c37c16a74e0843d05ee0f171bfc3161443ff791a16"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef75630c0a4d56e3572f58eaac1702c9df652e0b7312981e0bf03bc83e110b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit_as_const\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2239100b32696d8e87c2d2d1d3a4fdada3760faa6007ee04bfd4027af641e0f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_objlit_nullish\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d70b5455588bc512b247a5fa4dd452947f5f1fcc3e491a0ce567d9563ddfcc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_conditional_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0c07bf5542da21dd26c75bc65583c49915c3c4b2e19ee2b15d39e9d6ec239"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_conditional_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f43791d188126f3824d284d15ad09e1e90b1838c76f438de62dd9e54f3503d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b5b936f38863602f29a9633638af80ac8ed2a1f4db80c9740c46fea0163134"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac131ec3899d1831c542b928f2d8ff076ea9f4b869fb1a8ef30626e9eadcd1b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"726d1c8427dca1bebd5081588dffa197b508abfc1cfffc831166833bb12b6d1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba836d9062776c6b67ca89017668fd545fa7d5d761abe312c178ff1905fcdba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d5940cdc557602c3f61723a0a8d7f3c2c779defd9f1b2a1e0a11d07d5ea210"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a0affa1442ad17fb1158a41fd547d8a965b0a08407451ed3ffcbe2b84c08c3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1305e7d7a456064a76c0a5be29062ee222e878fadbb43a9f72925a9ce1feafde"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a652e8cc30b75e7fcb8a11dd0c832aefee52a2c82324812bee3b3a643398878"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"173468b5afd8b2f2a771f8256f8cccdf3c19793ce9847ce661dcf6470ba5b462"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18396b990bca67ee3e0c6978026b17ed63772d2d81d3ef2fee7bad91e9128fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_apply\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fdf5ed2b4ec118861b950c6970b9b6ca69031dff8bfa1b2718cc9000237771"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_switch_case\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8415ab37b535063fbbbfe7d25e618c5faccf5c5385f20203137bfb08d1cb0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_eq_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0675da1f05b42b9181b6cafb5cbc70715021dfd0470ae3f9273e87571338a57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_nullish_coalesce\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e785fafcf5e2c14cb62840137e1be1a72f568e467a29928d7e84e1b759ccfccb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc57289c5779fe18220c0e0c9253339444d39e87980082a680b8ff7fcfb620fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f019eddafdba6651cdb458f40591ce7af6ecfa241a7aadc29569524213b0d868"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_sent_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b8651f29d270a0072e9f148ce8e5e7f5d1b7a706d1313350af5981e728568c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_logical\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe4669a3bff945dff58c590945c2b901a1a6355e38b8579083455eb9140f899"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_logical_literals\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ad4212141dd7be8e369b5a4446010f681e4e9e05e3a8ca3f4b78b82acdb2ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_synthesis_literals_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec8d73016a88ddad12e269c6e79f98fada31a8d3083fc741284413e4d990df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_synthesis_literals_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"71996ec616bd0fe9ec750c593f63bef43966cf87fc503967c03d9db323afb58a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_synthesis_literals_3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ea5b6ed870aa51238d99ac391cb65e30a285aaa53e2b8595b52845ad2e9769"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_hint_passes_through_arrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbca3a28fd73adeb065e6888ce26c928bee3a56c3c43bbc86e3a26994606fd7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_hint_passes_through_array\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7a01d90c0a43022a96832588283900014a71de85688f3cb0f3a855b00b73c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_pattern_match\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c9c763c0959d91035c413f4db2aeb0c3e4b1390f73859b185741a3409faf51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_assign\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a2496b510d5f056f0d6470adcb01995769dd2b652cc66248a989a5eb84b5a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_class_bound\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6ea537998cbba5de4aecfbb9dabd1ccac8a3fcad7457217765b9ce568974b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_reduce\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5ea803ab6f19f23f3d57579c862b0a87b86eee79a96dd72962eb46eafff4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_logical_instantiation\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d387c1de98beb50f0f8037b98a9d01271ff8fbf3569f90b42644b8eafeb90366"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_destructure_computed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c5c90ed8231ec6e9053f7184c162b7d3c9e6840d4536ac05aade9ce88883ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_hint_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"150e59ec9f5b58af96dd83bb76075d09a9b5af30c6940f0ba4e3e493af015b42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_synthesis_produced_uncacheable_result\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7247fea38580a5aca300ef2c12e504c1198289e4cf8007829db7d249686b1d3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_computed_prop_hint_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"3831c8b872e4cb9080a91eb75d1e00746a8901fcb73e4e1038c7f1da0e6f1757"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_conditional_pass_flag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d67455c65d58b7fa40ee89c80991ae668423a72321c8f999db3c62c03429b2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_generalize_function_literal\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cda0d4b138075f0fc0ff1efd43190cc62b4e5bd13020655c5f7b6f56c28ab5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_async\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a609f6e8a96fe9df5c5b3602739f3ad6100280cec3f44a946f8907f7fc895b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_logical_nullish\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc494c0c8539bbb3c06f07d9bfc46abde3669d51c3bbedfc6462838b2acb0d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_array_elem_union\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2996551414afdedf53119e91344b7204a7ba32a91397331fc4c3ac500f4fe32"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_generalize_under_intersection\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c78bdd181b98e9b4d6e35bbf0ca9dc87f80d12fabba19cbab65dce529e51f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tests_unary_negation\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af3d98aa48bb5ef240d1109b9e22c03c8f3e786060e9d9cc15ae6309be73ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_nullish_coalesce_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b16019d4a1d82acccd0365aeedc3e9c2643e83644cb71f3141d3d724c1789ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_object_expression_hint\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22ec546ebd6f3aba35dd6088dd1fb1ae29edec876c71d6298e33e1c0ce03838"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_template_literal\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e33487c731c87b4ea0d50ab20e3a7c029841649fe46facba4890b4f7a86d0ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_generic_call_with_elem_t_bound\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"197c84d88a329b45f28df643361d011cd741a2f40471db238137f48be538dea7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_type_guard_context\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3203911707ef16b9ea4410438c56070dbaeaa03842112aafd5cc2b85ca0ce77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_contextual_typing_rest\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa258e0e50200985040d70c9287b78bed9f7d2d5b05cb6f23a13673f0618807"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_useState_12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"06070cc7055b986cdc1ebd7d7ab8b317e9b9b8dbe49502b129fab8b50ce0bc8f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_call_enclosing_context\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive/local.js"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1590cec4af9d0796d5f1c916c7e8c3d538728ac6cfaa844280cdca3d35eb8802"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_default\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive_exports/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84fa7183e4238caff06af227c7f56cf7c8ef179c6f7e59865c61b758095bbab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_cjs1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive_exports/main.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f902df93a701eeb13c94ae196b191e71930b60040398b4b92a4ab62221ebc9b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_cjs2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/natural_inference_primitive_exports/main.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa32b1634540dd93d63cd3781434140f066bafb1f6fd596ce5d628b0aa95bd3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_generics/detect_literal_subtypes.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"685e96adceb6697b82a28a6f8fb4e6f3af853caf55f96549bb29b7828ace36f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_generics/detect_literal_subtypes.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce08a0ad3629efeb8e73c849a6dc079df4cb625ce9922f1eeee2601d1f53b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_generics/detect_literal_subtypes.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d367d5284f1213505682e543d431c2f7f5ec3f381200f60cf16d9bf55fa721"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027o1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_merge_fixes/main.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fb58c0d68b09e8ee64628558c07741c18363816b47afc86ba7b167a2e875e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_merge_unsupported/ops_on_react_config.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d727ff6e11d07c727233087a70039e5ac681fa81e6f06f176f9fb8823898dfe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DefaultProps\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_merge_unsupported/ops_on_react_config.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2c1f4ed5af0e1371d71c35d4f48bc4d9a84f48c861eae5737243931e254611"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/bad_default_props.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb3b996ffbd86f1d7dfde7849929b2a5d0957a32d9edd978fb6d9177e676df6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/bad_default_props.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb17157c61e6bb9d1d0149915c94a84994712c6ead9e489f9cd24feba4387f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/bad_default_props.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d6e33bb88cc7eeda19013a24762a368900f2a10706f1174ca665b2ed7acb4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/bad_default_props.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ebe6215ed93b33b645bdd571954a205b16ec8ef2b248ba629360b5430558d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_y\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/object_component.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14519734a1b90f004181eb69927ea5c82cdd4d771fd6b4a80d3e3352d0a73ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/object_component.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa394ce70de41d11bd247a3230059c35ae33e9939a6a0a725a1fddf8eba6c2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_badProps\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/object_component.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a836ad73245b374e310d19fa6acc7cd9fbccafafeff3536bf7e5cd76718f6b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_badProps2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/object_component.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e5d551eb481049851e17d9d88b266ebd5549865fcde153afad05911ba24b25"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/state5.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57117084d186cc857c26192efdb0078b16214fb9b9cb4c991275db8e6fccffa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new_react/state6.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9c7b60953f5e63787ee920a04a2b9043e3728d5b373b109990602c5c7aeee8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyOne\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0e278f955d49a423349fb51352713b6317f8d79620f1500e6827003f410738"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyWide\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1884226c70aaa90aefdefc83ad4f7975ffe427b943f650f5ab749ebf4c1af8aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b282d3e612d3b70af5b8d0cacfadd8205e7543e482bda8f4cd775715649b8710"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyKeyofOne\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c51eed4c022141d61659dcdd5f5fb6f4bde18c61b4f9ad5852e911c29cd0d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyFromClass\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc04c3e5356e2d09f4db5d76a7abe3903a5cb86f628d887d93671b8ed891b7da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyUnlabeledMerged\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d902246d78c35cc24054bce156b880b8f519ee1afd716ae0edeadf7c26101cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyLabeledMerged\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/imp.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b44db4364afd2be7fbebeb4eea37230769318b8a412e24d9dbfb1c91ddd7df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyAlias\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"994b51edffdb4b3e5309a714c957a112c97f971bb4a606420526763f429cbd36"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyAccess\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8721bd56068ade199252b24e970feff3e543a2e7b1609922a125b13ecdecb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyKeyofOne\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc0baf09e5c4d364ae22536e86326f5468e71a33ee664f45fdccc114d67dff0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FromEnum\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"750e68e96409c2979bf101c4f7dfe95de7123e3820347d52a75c630f5a9e2e73"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UnlabeledMerged\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"678889e3eb69d11058740039aa40823417c7cf27d73b1be38cae8f73334daeb6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FromNsBare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/type_keys.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"40df2f907e45a907c5128749e1a5b5c4a88c720db69ed22f1f70bbc2f9713e5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyWideStatic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/value_keys.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d06dd2564c2d3d93cd628c223b6cf2b89b72e0ed3f97a116daae6e408b0af5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FromMissingStatic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/value_keys.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"278d0a022ecc0e605c1e63b08653d3195e7c419e13784cc23aba06d621c7bdc6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyLet\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/value_keys.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b5f598edc765f47a254f859969d8d69700ad5861e31ef649fee107759f6b9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027emptyEnumMember\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/object_type_computed_keys/value_keys.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7b936af40926e710e8934bd25d2d0fe22f2066ec57cbcc66eb859a8f4b70b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f79e9089779fe9d7d1c357f99cd4723613015ec152fa2183a4b6daeae01a886"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c4802ec25a78dbe2813da5f9f37af7f3e88e22b285f1262907af5906c2f7dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb5c1e0297c00d23f34171724f8c8c877f52d28468e50e2872165ec652d1f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"738e9744b2b17e5959e4248e48d32189e3aa764e9ff35f946d337edf86ab44a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"98abc4b0517ebea445132a4170c51e8611da77956fe17c0a1ba19cb7555539f0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"19842b6c16121c43f9fbfe779dc722869e619a8ffd388506f166892776b51ae4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"072e8436c9ffc1234a4097399d380c6c21febde2f795b32837ad7d5e7b4612e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5c0e074f7b186c300ace698904bebbbd22e3d1273589aeaefdb131c488c19"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest-polarity.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf5de91baad8aa57565799142f58b9c1a9bb17abcad511c2b8f5075d74e893f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d86538ce68f0a9e0fcf0bd7fcd4c451925ac42ac89e6a0f77d7f8cd2f6ec9a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4037bb05764b3dee5d4cf3b3582399ee9cfe69d8f19a8d2991d6d594bf9a408"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"72613ec37ab25a93950c085ba7f5e3a0c6338f979ac41ce51f6bf9b7be21c14b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e1c864ff3f18d84e195a13127754d320847b5ad2ee3da25375734c8f4b561b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c42bd612923cc9698c570940618acf505ef183c43dffbcf97ca7d5d417174f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_generics/importtest.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"536f12298f23eaca1e0a72e0374023f1566772d830b50a3bd36ded20eb82d504"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d71f93bc8c7daa8b798a27228e3b784a4b1b3d0bf12b8a2a2cf37048c13c43"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fc0ec160cad57c26a058c42ed3c1a5b4b8d5dbe464822f513855f8a978e0de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2262990f681e9e23eae988ddc22bb5f490e07b3192395a95f25d616449a3b7b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a66feda768d7f021f55a5162b77da5aafa140b19178052f34f2d7591c3a3f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb91145eca5a872bdde3119cc50513cdf6213e46733169b8d5bd656ccea7535"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa98a7df9327e00eb447cc838cd258e1d952f77ce0768a787d6f91792588571b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ba96dfb0ed5fe83757e4ff0d4fa80d4bc8708514ff12f038ce19e606e086e5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dfca2e74961848078be268c7ddc010f47f74ce705c2995b104b7140056f2bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"799b572902894b573a7fafe0966e9dcbf4e63ca8c385561e60f35b6c89dbf0ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f170ced30e589e424ae6c60383414bda60a9d4ac6dd46129ee349188d2ed750"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0cebb51941a63918435be49ec75c543d3b90a54eb29305f78f92321bcae17a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8860be6ef28fe82e38729d2c61c9bd72590d2c7534122ad7e01de16dfe17530f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test13\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a152f694bf9b6f1ecf76523cf9a1d94f495ef536671e95f46fd4e8f26c6bf9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test14\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/importtest.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0e041059f8f0d326402253cb6dde6860e4849ff586285c7a143ea37a87d29a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_subtype/typeapp-test.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b8af307faf46e5d260418f0afc1700f662d90b17eee3f59c0e0ba53707fce5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_cycle/test2.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5078ff991ccf2196ddafa69a47d749ae78089e667b68b1d9c82ad313757c93bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_cycle/test2.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b2affc4f72f17ed070f5cc69856a70a64d11617355cc30db9c6f28432bebbd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_error/importtest.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cf55c904eb6d4b5aef3bf9cb150cf9b59062ccefaa5b55482b635a21d1da6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_error/importtest.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ada2d5edfa815b88de0e92e3528bf482f87e50ad3c317ccb279e1d66a7b239"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_error/importtest.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"de96b2ba7ea5d7d702e00545cbf7ebb856ff82f7e5a386e81cc539d1a4666d9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_error/importtest.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fae7f98f155a97f9dfa8943383bc8773490370f8c2ec98692bea00d4180567"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_printing/importtest.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"761956a8a1e1e33a78801922bc4741fadf6c2c4ea72e93ca038af801755d99ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_printing/importtest.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4467534fdf50d925ec0be6dd4c253b34f4b4e367d0e38b4f607224f1875dfe1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027convert\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/test.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f736e09735122b6c79e2ea661f76ae5507897ce0ee5a9e90c87d5e48e848e89"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027subtraction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"db537efd68f8b3da2092eaa0214ff5785c15ac84b3c0c779bf9745dcffb5f00b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027castTo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e05226e04ad01e2a9789b8af7e74b598b6333fe7ece9350939d552adc17c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027identity\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0546384d2c677fa8df615c8ec3d3fd1595bd3e5b7a5dccab8b69f7202f8fdf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027caseFrom\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d4f6e3c110da131be3736b6859daad30fbd9b11481c0ea413c5060eff6ecb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027toAny\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c208e31e1eed5213b2f0ce162961551f48a950eeeb493037b8603cb1d7f22531"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027toIDT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0364bc8064ee834c0e1e3a35f11160ed489fca39ea12d2a415502a11791bf0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027toID\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed94ffab7198a55e798196a7b78bbdcf3b6d8410879569e44fc8cbabe391dc03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testA\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de41bfb52dcc6655d61f66940380145ec17c8f44ee1865269b86a38ab4a84cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testB\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ea3f356753f243fd95ec7686bbaedbac5de43a0d1e1a68f593d1429ad1b976"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027t\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/opaque_type_success/testimport.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"960fd6b67798538ea0af4de94c3edd9da9a6461ba6eee39ac4544b836e4fd2dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Cat\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/override/cross_module_basic.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f524f46e5fac6543f15ee4c8f91f64c40163ea3318d4eb8bf3f8dcb568edfe7a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#foo\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/override/private_collision.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9b045927d9207ec07efd18c285e066cee2e6f8cf42d154caad35e1e0886465"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FlowChild\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/override_through_any/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5325a7246f55cbdf2689a1f9d2c7ead7802c4fd1045c2ae367d2a75925472"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TsChild\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/override_through_any/test.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc02549b5f4a0ee4385dab6116442bf0d783509e7f892a66fca6b52eec4d861"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mybug\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/parallelizable_command_cancel_recheck/dependency.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ebda7c935e1a04be731653c1ab169a4221391baac1f5f4afcbf3f08a5f25a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027shadowed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/partial/deprecated-alias.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd2bca1b76b89012877504c937c32cce1729addc9e6f039ed2621b410cb45d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027h\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/poorly_formed_exports/bad-uses.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff18d1e328a6647ce6037ab57d72cac3c3dab04f8c6de3ad589b9846caecafec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/poorly_formed_exports/bad-uses.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3ebfa60b96d916ab0b210d0789772abc0cfa2f78336efedcae84d1c4453941"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/poorly_formed_exports/bad-uses.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e63a1c4ac6e243af341cb3bab54a3eb08aea29d7b34ed19379ab2f0a4326c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/prepack_rec/global.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc50ba8cddb6219bc8cd46fe3b87c424407f82b350af5ee80eec2e06d5d193f"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#outer\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_fields/test.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"747dd780c8b79250d0745acd5a2e465452d85989bf503eb309ab579310280938"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#inner\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_fields/test.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"086acd44821dea9d44ad276663227be068f5ac2050000fb0ce9f18e04f305a2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#s\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_fields/test.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"60df09f4bb66be6271c34f45291faa33c04d5a993c769937b9b76a985ef3a95d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#sq\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_fields/test.js"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbe970440bc364ea6e4646e9203a97149006a4a52609c7fc5084e53309acd38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#ss\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_fields/test.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30420b108e63e3a20d4010949da7ff2fbf15a774059e39783a3ec4d07e027a4"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#p\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_methods/test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e368bc93ae693d018e611bfc97aead95fb4da76b2b25b83eff6124950d635e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#privateMethod\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_methods/test.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"897b2e6c61905f7285df7cf7b89c0fc1c936ccd91a635a6f3af697de44009342"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027#private_contra\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/private_class_methods/test.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84b89ea998a1be250513aa8453112c9773118ce9d6cc232749bccb892083325"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027havoc2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/provider_havoc/providers_closure.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0da60c5054e5641d5d6512fe60a680a65f8de5a158de022b109198f3fed8f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3cd3f4397dbdb4e949a67eb498d047e77bc8889667bfc93259ae71ecc3195"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2b8116f31f64af4f56b89877c68dbf61efa3a9328d985eaa13fe4cadf301bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e45e1171a335a70c01af1cd650e610f03f0030ff852312bee33fbccaea783"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aef3192609489c69a66a66dd264592ec8f29af4a7db7441d4d2aba60d62f3ce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a01ce71ec37aa123d88f22e2ceee5bbe0c1bd47ec562f42d9d983e62da0767f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae556e7576cf26448fe0104ca3a7d15e4c8f486206b47bb3463e9ab0dd6fb81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b74b5358b18d4d1051488dad163900c26558c19835031a9427989b8d622607c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc19425e70759abe7c8b43755dd7cb29c5661be3cd6a4eb8e33ab5f6474179d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f017cc931d5a41ac670e2c02117a3538031e3ef65c7bc2cdb362dace14ecb2fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27edd8320e09d96c10187c56abfcb299fb9a046c9ecc045cf857105a5f7431"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c57582652717295c5e5d67329916037535efabf6944a7d3d465a1f5b5f1e87"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/test.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0586c187463be3c1bdd02efd1e81495c698feec6fe39cdf23efe0b09cc76503"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/qualified_type_namespace/union.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d170fde399f7a5a10e46f63fc82d0b1ca25b0f95b6fba87b9dd6137176a9be3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/createElementRequiredProp_string.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d78cabdde87b83d7ca9a615293d7c4a67607ce81c3d69d2fe187c4050247fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/createElement_string.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d51bcd179007923882258756bde9ba71d9b7359ce0d1f0bf3c2b9efcc121aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027config\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/default_props_not_in_props.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b5d1bb05105ad6ea755330d2be89b910d3511c631badde9b2229a671266c0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027F\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/render.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"500f951fdf0ee602bd1e11f809a0707cf3f89a00671759023cc4555b9d415229"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027G\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/render.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3c75eda83cc31f8395ae33612861ee5a227d652e8cea0270dffd829446be3a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AddToCartForm\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/useActionState.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd806da4781bd62a36ce5f9ac2c642b17c1b23b39863392c1e54eabca77ea82a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react/use_hook.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4df58ca30c809c32180b5bae517da7b6dc2117f24f5dc30f5199033ccfc56c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027App\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_16_6/lazy_ref.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44ada2ab0794bdd5e7365df35fa6ed04b2ae4005a19f0f70a7eed8023e694df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027App\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_16_6/memo_ref.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"900e089f91a858aa76893fac37a716924d9ba229512b5b7e0aa8dc41fbdf3365"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027onRenderBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_16_9/profiler.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f5fb40b4c6471a905e959c938da1f6626e3c1733df4b2aab1b4eb3c5ee9134"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027v\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_children/api.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"953bbdf6897cb15ea52717d84ae3ae52fdffd9cf44ea84335a31a1b44e471f83"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Parent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_children/issue-4648.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57197f27a0f59963c85160a67fd1d2b27dbf98701608bf7e02ecaf1918a9b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027cloneUnionElement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_clone_element/test.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a99c27e0db16b5806f762c434656ddbf1a5d60711529973e88cab96f5d7f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ThisInJsxTag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_jsx/test.js"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6f3898ff69830996ce672f343dfcef974d3e7e0565d75dae2d91cf40dfd08"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Component\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_rules/componentlike_name.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"87db22846c14ca965986a0ca0faa44fa3f42e96f31b4217292a561437f0e661e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_Component\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_rules/componentlike_name.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d78d703c60bbb261e6f7f8d9bf09768f632aa83dd00d7c3252edde17982e7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/react_rules/componentlike_name.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"317d1190f3009a7dce60b80d2bf1341cc3fbe0fa813ae751d9b8b79589fcd3ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/read_only_object/array.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f6ace6c3bfeb468d5f975da01e3cdfcb77b2c1aadc8c235062358df1ae7233"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/b1.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1e34d4d1b5fb57b323153a9adbe4b6fac2a21b8b6929d04c0ff65bf8a3832c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/e2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7c5cd0d5f18918a4294669a7c2a644cd48349912a85e683f86dc04b072166"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp1b/b1.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e6345fbb248f1567cc71335fc8a8d9229a40f8941103eaa10c4cde1f406691"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp1e/e2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec2cb46eef225dee4125359bd140cfdbd1a09a97d07c6b56f164330668c75bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck/tmp3e/e2.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3d2c30f323183af44397311ad06f96fc933e84c19ca574735bf9e6405835c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_poly_id/a.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa685a3c7205a254f350d436da771629d2bd31198030b7144eba26e5036818"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_poly_id/d.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"235a3a8c09a25a3625fd0f3dc7f321db8f3a9c0b3f419947a6de6dd2b563bc84"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_poly_id/tmp1/a.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7654e2659035eaa9be62cd12cef93597ec727ac448a2188b00e245ee722cf3b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_spread/commit_a/test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddace60b68f91b3d51487b462dabf8c0010dacb357bc97932ed3daf0e534b032"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recheck_spread/commit_b/test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61218ace70fd1f9f1d0722dee91e5bd7b6f33224a96732568f3264b66ba775"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/opaque_refinement.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f8fbcffb784b933497ca004b75c621dad7b62c964c710b5915fc3cc36e0694"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_refine_to_nullish\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/opaque_type.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcc54c481405cebc7aadc0d0415fc2f456766071f3e587b8c527e3c883e833f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getTypeASTName\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5b5a70492b329d10b4794b0e73712172ec40ce9b754f2b491f1e894e296aac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2a1c8f5ee2dced30aa4c129b3631ab4370fd22a7038ff6666a17ca6f4ce145"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027qux\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0222d47278da776163933abebfaefac131bb30964b9c51d3acb59073e7cb300a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027check\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35d3ddd2286593e8aaf06340fe9737a2a30185dd140aa4604d1e9e184cb8da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nationality\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd4bd50af4bef48580f1b2fc624e0c969ab144eece22987f8ef89da7f22d43f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tests\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa97383b171a40f2773e9466fbff1c5116ff799a8f7450722d386a72a605584"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027handleStatus\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/refinements/tagged_union_import.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61b9c279be7512f8bb41cac289e5629a59f844469e2e7dc5ea7ddb55c89b7dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/poly_no_args_import.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec0e9291d75f26a487947c2ef00e4d8a1ce1cf148ecf793ad498eb5af42267f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f438ffcde0129ead0a479df05e3d508cbdb08bcbe46d524986259262e6a722c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3920fe27d5024ebdcc8f7baa2b0dfd2abe3b50e68b3df0e68e8be66fc053c45c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e624bac02f26baf0cce32feca4b2d690ac90d0d9bb07b646fe3389b45eb2d39"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"445a8237defd5e76e55d3cc672ce0bb004926c2733407d311e62bb8bd707fd01"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4003113f0e0092dce24aa5fa1272ff0076bb2671464c7f378a70ff1d23a629"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e893f2d01fa364ece00db5c37e984e5f36ae5ba3e11c972cbbac92e016e1efdb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7482feb5fc5b93b3a6811583ebc9b2d735ede2f87b8d0f6286675f94d06136cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2812a1cc35f3f35ac8b3eb5a927cc67354529e454e77c88061b7a619652cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab14e8deae2930fd89d02758329c6607fd395c501e7f29a6cf85c4020d04e7fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBad10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/autofixable.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb57a13f9abdc51e90fc4f0ad0c96d14fd3277519ed6d3dd360ee73fb89aaf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RGood0\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6680bc6683d5f600264a791f84672f6bea664d924647de3698989a46bc733744"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBadDeprecated\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0257278307c0c20fbb1ed7e923f6c0c83e1ce852f27ee0d2dc443a99e212d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBadNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14afe619a0d8c00da24a22b39ac8af8a2fbc0effb05939f91ad5fa971519744"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBadNode\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3941a8dad847a4be3db60751fbf69c833057931cc5bc4f2271434d6503e65272"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RBadError\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a871dbca3f681e51d1c119423040e38adbff1ecdf4f77b7056580287c9de167"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AllowedGenericRenders\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7297cd3cf90deb557b1b20103906d0afa111cd153af329e7a91ab16336922e78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd76729fa324d6108f2902f3ccb2edb63bc4bc92c4abb7824c3dc0fef243a2c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffa1f41ac495e0bbdfce9d088093ed35e95c108055ea238937a2ae12b0f5411"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5883459a4556c8d60bcc014992e03046b1a7f98895c89a85d57a04db2df16c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"67627bdc054ea3010c0df373199ee6e26d310b6e4842c420408f6623a0056c5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7724d99200fe0e5d789b315f1c85c91265b1079a6fc1387c6d924ca4cdcc8a96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadSpecificRenders6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b13ba605b0d870307f625c5eb946785f61f24a4d5cf011795df4ee8f27c6a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7352c230ad6b92636b6e221a1c0d1f0658608cd6c0c5a029a62bb415619bda16"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadStructuralComponent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render_types/validation/validation.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6664e4dda66c1ca95f2b6d2c41e7e71a9bcce2ccc68078657f0d93e4610612"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Unlabeled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca10c56dee99e76fcb01e0fa4a78cc20ccd296a7d580b6801ed935f034202636"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Labeled\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"60842a058f6628c6135815f5d79077e23776bb615b335a17dbc5c78afeb200c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ReadOnly\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"730d033e65c74b478572a8d0618018db42d0143f788c88429e139913b67449a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Mixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ace8a9ac8420c92f241af7ffa787e5ca934dc61811a7894d5dd3dd51f180083"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Exact\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae443bfc2974e7116e5b5eba336315c69f1e651977b1ebe46cc0b255acec7e74"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Nested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd309bf6eb7b6a67e360167210727da91f2e049a22f3e13c09cd36e261b6df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AliasKey\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad63c168a1184c47b501f26d1f195b0df296b33ac5416ee6ac7285408d36aed4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"219bb757d2b23d56e13b70c7db328cc838629f334ed63a12c64ebc5cfb0c6eef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Union\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d749b90fab895c5728b56bc22104208daa89e2b1f668fd6638ddc5bee4061e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Mapped\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c5bea3681aa748618a3ed02d6331520a71f1925fdee0c8a56eb367d9437f56"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027StringKey\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"774287eb7c35a1e47d87ab44cadd8020bd14c6315879548012c4566de2e75da1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NumberKey\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f429a450ff5c6267c9ba669d44419ed4252feae36a6ca4a655ba3ec89f8309b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ValueKey\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3130093cf7ecbb8de146cb089f0d819749412b135f94bdcccebb6fd1c496c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027annot\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"599ad5710a059cc0dad6d921d99b19a11bc4166728771b08463fb133de4c7a00"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_dictionary_key_label/object_type.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9fbb9f53342f08b02f0484f1d8694cc3c9ce4b6e4c50c390767c97ac1d1bca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Unnamed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"004873e6693eee03ef7fe7b56d343445036b16588cf441edc6bec30f7db04f55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Named\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0fc3eba0cb9811146cf8860d5c9c651c9b2eab610a8977b79c185b5a8369f8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NoParams\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61aa37901a6b90b7fbe61e87a6a0adbb8576b4ba9854e4ebeb2b651038e8ffb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Mixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77097076d26a9b71dbe27d11497a560760c9ce4d484cea96dee8056c74da614"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UnnamedRest\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7b9397e49ecbfe7a66244ae34c9b946ba3eb08f516115c66cee2bb973e06a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NamedRest\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d106c945b54e0125642f57babef6484d751b094a2186ab80b78b64b982db30ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ThisParam\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"869d590eb2f978b8c5d4e6b2bc1cb8a7b5fe2ca9b4446e6ebb4628b756ea4643"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Nested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13bc20e8d0cc7611d11f4e028cf03fb6724d7939837e05a4897938eaa5c5e0e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NestedNamed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed0fff1514415a862aa0e8abc9ea781f668d0372bc6be51ae75821e3edad677"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40070bb9fefe0f4c58b70c29c310b77b804715c7083d8ac91d81c2cd969a628d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Hook\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8cf9e2f0b25d8830c1ddc2ad16861f70fc60eaab83bd8d12d0760dccaf469a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Optional\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0b86950822cf9a6fb31770e7a22d684833daf0d50a14255871bebb5058b17f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027annot\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/require_function_type_param_name/function_type.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e1a5aefda411bcb3a60ca20b0e0a8cd7238eec64a3d017425953decd99c422"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027w\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/resolved_env/import.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b402cd156020f4778dc15200576ef4b74f212f8bbd45d1b4081cdf9c525509de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/return/function_return.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cde66b4d818ca42f58867c5d7bec0009e8c3d5df2c6cb0ffb92fda16360f31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/return/function_return.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"810745dd29ead49a449f2917b6cebb557789e41ae218ffd2f18cb458c30cbae1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027h\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/return/function_return.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aee8f107a33366b037308bfbe5f5e9e6b70291f35db01ecb5a86fb970c484e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027i\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/return/function_return.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b29cb1cf7540bee34b301b1faffa57dd4866a858bc471d10f3ebc9bea457ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/enums.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"622912f1b76848650bf672fbbe669675974dc73a09cc7a3a87e2ab0118e1085e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/import.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11a22c8de240382a7ca0cb734e0940fa4985bac69f932c077f8964a553626cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027y\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/import.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6191a7be75d16cef51872a32362edbf7dc512acca38b48e485784cd3ef52201c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027no_missing_env_entry_for_delete\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1d44d5216187fcc166ee32e6b860158dd272decf622b89829fa796c9d3858"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027no_missing_env_entry_for_illegal_type_binding\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e5f90cd8a9aa0717959a07929afcea2ca25fc550be038c1991dbc3c388b890"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unresolved_class_self_tvar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa7cf46c2320a36884c3f09361570ece9092e440e1ad90067f16f58f6826581"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MissingAnnotations\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"856592d2aa32f7bfd973f9e0cbfa5c153a97da564c861ff0228277044d4d36f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MoreMA\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7271ffa32a791b27ef4c4869e1cee20af9963e774c359c4d404f1c7cc80dfd8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MoreMA2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d89b44d4ed43f43fef521be37146d38f1aa1897b8177e6761c4a0836d0caba9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ClassMethodThisAnnotations\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbbff9be59e6bd484841d1db9419bed4338a214c529e8e267deab9f1bf6532b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TestArrayProvider\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d10d2eb6f30ffb4b2bd60ec076ecd47ac89bb2b7ed31b9ec34ac57cbc41a39"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027InterfaceWithMethodThisAnnotation\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f3b930e653e17c43c50199561664665ca4b1b437b79edf38b70d6b460e11e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027anonymous_functions_this_type\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e9acc3e34c36881b63796045458cc736f59348d14ef0b5359299229d3dcf96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027non_assigning_member_assigns\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sealed_tvars/regression_tests.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f7eb65c304a3e79919eb68193be35c46347eb0ea50364b5cd57d477f3a4aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#m\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/signature_verification_failure/class.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"07685088abd07126b5d2b9bdbf2a92715f7214e97d9ef2286501503f4bae4ddb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sketchy_null_strict/non-strict.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ceffdcb68d172e2cd3af9d7898943ff710b01766b6816f3d493778cfa68c70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sketchy_null_strict/strict.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aef1b0d89b263519a5207820cfd8b7f191e57f01a1ae81da1c8516c9a9a1d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PitchWizardDataAction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/import_star_invalid_use.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"13983f6f8c641fb3f8a587cf51b16a005797a4602362b1e25d73d18e0342b1c5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/import_typeof_star.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cec6bede4c88da6ade6ea11fc8122c6ae17aa526e54bfbcf928e3f50260d565"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027internal1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/named_exported_this_func.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e796e5bfcb93ad3af4a1fe312e4de4b27926bddc1a1516ed4b267d3ef7afc762"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027internal2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/named_exported_this_func.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ab69e85e09166c2fdebd60095e9cabf725ec85d21434b1e6831fb5ab97b345"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027internal3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/named_exported_this_func.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f3c7ad9206ff0ac189fa1ca56f504e8484bc48d578bcca64cdf688e1ff61bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_es6_import_export/valid_mixed_import_and_require.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2a707480702e83cb1a8fc24cdd78a2b0607928a1397f3e2fbbbadb7dc538e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_local_mode/test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc90b41c04a8969b84ce8bace9206fab00bea37d64f590fddea59f2123bddb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_mode/test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5e9822d30b64283c444b9bde905ea5f023c2c75d4f47f848129e116f855fd0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#value\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_property_initialization/basic.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a439dde08c2dfe1c6ee004a0b8f3aa03efc30fb7030a0e9b945cbea2866a73"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#other\u0027: This private field is assigned but never read: every reference in its class is a plain assignment, no string key or test reads it by name, and the instance never escapes as a whole (so nothing serialises or destructures it). The value it holds is dead state \u2014 read it where it was meant to take effect, or remove the field and its assignments."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_property_initialization/basic.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5873f177485b77ebb80338ed0af558a79fec2c8f344704c3a863c497ca83afc9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#y\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/strict_property_initialization/optional_fields.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da8681b813cf6a4bce7b7d5ea3db6045c615da92ef78cdbf134c5018994948d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bad1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_case_utils/uppercase.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45585afae8da203383d45430324be24e2b13ac126b4f0445a76dc5185e69ac6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bad2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_case_utils/uppercase.js"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"777697694705334ebcef2f3ea3677a21ba5afdad10b9843777f339fb9c7a3c84"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bad3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_case_utils/uppercase.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4a0280613d2b4d617609abcd8ce767a6c0f566d2ca826b647e501505056353"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bad4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_case_utils/uppercase.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c02024dd0781cc1b5eee1b7b886045c89dbcbf9a06e7ab2c99bc9038cec09e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Bad5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_case_utils/uppercase.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"38766ee7a7a6344d9c454a36479dc5ff20f9da1b039fe65f7b851928d6d2e692"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/prefix.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeaf2a6333d1b2d14133ebe824c766f509c8d56fcd0b777edb12e7d0d50c36e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NoArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/prefix.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c98fc94439a83810613096b7df018bcf262e83dbf98c9028583f3e4e17f559"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ZeroTypeArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/prefix.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfe7b4985fd77e321f58e1ce3b06ace3aa0841cb64f967b72c421f9ab369747"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TooManyTypeArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/prefix.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6049505a365665af35cbadef242c021f2e968b816512a800fd241bb8ee6e2ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RemainderTypeErr\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/prefix.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"acab8ebec3a66ba445e2bbff87cf9a5d2387057756c184dbd13b57615408cb87"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Err\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/suffix.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b216fec6648da641e639a5a9f71850dc70e725dd75e400f58802dd3d23dd96de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NoArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/suffix.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf7a00ebf29c1f69993e406a0f029cd54d274c44862763bb4d1d178abeb598e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ZeroTypeArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/suffix.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"86704f7de66d89eb4ff67bee191687df5e9c0e804589c3231d160267fd12f996"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TooManyTypeArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/suffix.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaccd466b3051166a659f585273395e9cfabacfd111f10be283db0503bc8f9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RemainderTypeErr\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/string_type_utils/suffix.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa258a35b039f047274d3a3197be4cc3bd529cefe3796b10267771c61231ead2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/suppress_unused_lazy/invalid_export.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a9755b7121afc8bbe9b2849f5a1654f5baa453847fc90e371a0e73c0a125a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/suppress_unused_lazy/invalid_export_suppressed.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a03bcb508a321099c53e156dd5460bea877794c465bb6dac6b70beec9d887e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027in2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys/symbol_index_consumer.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fbc84e1b3523a9127d349c5a0d0b9ab4defa8727ae24dfd772f9f2a3a86918"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"411eaa01d4cf13ff63699cbf6e8448f87b8cad5b92edc773401698d0cda27eda"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c1e19986ce35ebae0caec492b97b5269bf8843120e82256f06918718beff52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c049981eb403ed345be7ef53e399364e89c8c31a06d0921349357852b69ba"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06863e6327690f591dc8e6901d69f5c27c572aeb0c0c62746d99e3486233864"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97f2d598a6fc4edff43b969a599a5f3a906486827280df28c56ed0c0fe568c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe672ddfd14e9eb6cf4f1fef03fb3727e41670dfa86a9919b927270b8bd44c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027obj8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/symbol_keys_display/display_named.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb25ac7c443788cac649171792af2a24269487ac2aae859a44b48e33cc5c641"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TooComplex\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d031a2f4c599678f1401f43645e51cbe05f43b10c4ca0261d6456b79c1911f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FarTooComplex\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278409bb197f5adb0bb28300a58a8b4a1ce1fd9d59f2124405cac45e5651480"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa928d10a816e8a367cb817449ab32212ff1f98199c720896ff2a0e416deffe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadFunc\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5823eb6853c8f7c006a164a4b94a70a0ebbf4888589d48f3198faa6c608ad59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadArr\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c0011f84380e030216a3eeb09bf5378ffe12ebbe8ecf472638797534fa90a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadMixed\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db7786a0df6b5847d469c454edeb2f71783e93725950f4a00029a0735d186ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadInUnion\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db1558d47f61bbd2e8bfdcaf5553001b0d22cc7aa653ca4bc730b7f6e7fd36a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadIndexedAccess\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e310fe41af41300ab7491c74652c62b959db78c9a00b1d9ba52b92a30bcc99"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadPropAccess\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fb03468ec8faa2969d01e2ef0b29931acab0d29df9c92d83ceb2c847cfdaf7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OkAll\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec94aa3c0a31e31023507f91b243a03d0384f3b8066f125dcf5ec740deac36f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OkGeneric\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e2a00af778c7a770a94034dea30fb2aa8ba652b443d8dc448649e141f0ec7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OkNested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"300aa8ced7d9628f2dfa04ed0ab033d40ee28e0316bfc21ad907ba860a2700fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadGenericObj\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4bcadbc4e37689950e8eb461084112f29c581bbd6be3a4faf4424617093009"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadGenericArr\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/basic.js"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd74c29021cb7c8ac23147e9ce676ff7a9dd6b23bc912c3ec515758094be746"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027computed_keys\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35fca9d8b2c118ec6a1a82ba36351961cf0490755cd8c7d49b8a35b09bc8560"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027computed_keys_annotated\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"756f4a1d4f360bf725b907252f166805061f0db8518e3b3d45c3b0398ac04eeb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027computed_keys_indexer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4dacd5c6f733016f787bcd914b9e759fc8339e40ec507c7ea9d20d1120283b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027compare\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c05cb837c701e099d78cccb4f42b5c09ff4cec227e0a2006791cb15eba08e35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027array_push\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e1e619e6ec75020093bdd22d8a0617dad456ef069d4ab775aa1af35e83d719"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027index_with_template\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e06b5d4c9f0adfb6aabd95febd23c2914de858dd8a2fb094fc1f3dc9e433efb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027jsx_tag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075ad21050b7a104bc9b702b5baf67b28d5ee631aa946f066d644950ab60011"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027folded_union_keys\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5e48975dc80a7b8251a6dfc4d2f2a691ecbf5bbd30b448bba7059146c7e4a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027literal_union_keys\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"306176603db53ddc010acd9ea9a92733a0f94e43d1d29ba65c134f3d0dc45f8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027union_keys_value_conflict\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"183c312a88e1ef3458eaad1a6b852b1b5620822a382bef833290db62d8539acc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ordered_comparison\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ffc819d1a774a0059a629c88d2c096750eb4190f98107d4af4965236f0ca5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mixed_union_placeholder\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"af49fbd1a1edbbfafb08b3200d2a09fde8b898979534df6f3ec88914092ce2e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027literal_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/template_literal_types/literal_precision.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eca16307bc15b398eaaecd4450117840dfa5d4b8160cd2b78d7e27c186332d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodBarrel\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/barrel_consumer.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d5b3b6d0587ff4d7f1d03412eb5cd7bd3d398220f167859a96b6165805778f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadBarrel\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/barrel_consumer.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a6903664d1d352e29fcba1ed11b442af05c8d71d072c8d79bd4541ca4d2ef3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodTwoStep\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/barrel_two_step.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"715e846930ba3fa2e2cc4df87569cc3ad2a7ae17a7ed2becef31d0c5b521cdf7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadTwoStep\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/barrel_two_step.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf62b5c3dffe70a6e180f4a8565f14301eced263b07201354d8680beae1ecc7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadCloneSub\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/default_import.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d684f1dd17862ca38c33b9b9f80dab4b91033d552b20edea5d2933dd9385c9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyClone\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/import.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff2775c4845075123222ef8252a5d1b91633ee316d495e4b2a92b0feb9a589d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodCloneCM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/import.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d4ccd6b7427540451ed4cfb06b02ac8238a4a85670408e72a6d3faaa767df3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadCloneCM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/import.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b5ca3c5d71a1d2cec5273ae926ce0cdae43e83ed2ffe9640901a2797cfce6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type/lib_client.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76db6acc4e519406d6f0736ff59be78bf0cfebad109637e9225c253dd71573b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodCMT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_type_ts.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"23938de44fdfd341e54357974c8584ce6004a965b5784035d1e2145111191f6b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadCMT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_type_ts.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c66a9597f9eab55ddbb75e8328d323c759688d8a47f18b1a124f24d6d0893"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodCM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_value_ts.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dbcdf5c544dd70c71c2012ccf1602e67c800d7e1b0fc005cf087261bd0a83d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadCM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_value_ts.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"76be9273feb77299b0db7c1a74b338c2888644f5b9f7c8cdf143c88e8fb018d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GoodGen\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_value_ts.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6202cebd5443a6ea5214c112dd49adcdbb1784fdaef2b512b154e07d34a66c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadGen\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_type_ts/import_value_ts.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191e816f685a85acd461a503d5c073a8a31a914771876210fa6e3c0b62ff2f3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc18d12de8388abae505b4efa4ecaa40116ed6c0b652ec8f81de1cb7063a4eeb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d21fe09ef5e935e48d9f0845f257d4d8bcbc380f919acd0d1676673f32611d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"97873fab04484935f5b17225b3405682448dfee54972b4fb79a6ae04c9c5b42a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e452d6ae319e39167cab19fcb320bf6b8a5b199a6dd37538d33dba6efcc6a91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"824e0a441c69268b0b2c4c8b596eb9f2567362990b7803adea7f55768d6bf993"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dcf0ccbe14f676ccfce51496213cbf2f65e66756e63ffb385264ca962d86e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae18fade8073e8a8908c42f4d611517fe19db23ccd4e0b39f37213ec914e95"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c22bd0f7d27ea94f1e255a17482c164adc5d7bcae2b7613858a2b4f035a38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0764a8f7d8cb9663c0687fcf9a69771134ccc7d338c9b9293f52819527b51a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a51695103f0ea93020126709ab9c6c4d1ec9f08cd3704026e6ff72e21bd65a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd6e94c3c0d74d426f8af5414c585da6888ef59e234b633f8bb342dbf1cb9f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/class_method.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7611f526fc09b5186d1742439b3ff11395f8406223ce671bbe7df131695048"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f704d78270d5cebf9addf94f0258c8d8c9d4a9827e354decd0e3bcd7bd1e19c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20204c5e5c6d29bea4780044328e326b31d0588c26b534db3aff624c7b8f94"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba4fc7716b51913437c52543a002bfca844257d6111b0f11c090ae9fc9707a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"749977da7a16ed446092971ab189ce872c532fa8b888f78de104021908e89578"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf3de983e7c5de93ca96e0fc9c7763ed9cf57fb5339068b3584b40d24d61dc6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"de25e1f1acdbbf2baa785e1c8cd9617c18067a3fb50a87afca2cf15aa75c7d96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed70160850c56008832806127b6c477a44c1e8dbc493e96b861ba5e1d67425f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26784616db6ad3f2e3e2999d2c91aff32a3dde6c32f946d51e603c715c47a55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a26831ce8cdd003158f35a6528cdf5bc3a96e886620d982a67ff2e70911f92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f80d35dbb18f5e3b9d88b252a40a2ecb3778329af8ac835221d4fce6c230eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f93934cab5d645d1c5a32781e535fc7bb5ddb0cd8e084fb3b86fe0758ed0f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/declare_class_method.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acbb9277e9be4d01b91f3a316017f267f2b14d4a5bca3e41c6ae8d00b1f1d36"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cafeb3afcdc1456f32c89ae2493699926b3cfbab9637c2d863d81cada47aaf5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c041b6bd31972a5cadf703786c267375b96c66e863ee2a5cf6209ac15e92deb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f1ba7693a0dcb3f651d6673c531dd3d1a9eb8d7c0644c24342ffa41e6b2f60"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccdb1924cdba3a0f7808b6d69e4c3d993cc57b0b0ce6e8783068b18ecea1ba3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6673f87e5f5adca028370eb158287a2f37018c70d055fc9f79a91be2be803a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027_6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/interface.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e960301f613a04ab3dda9c8517c465bf382b8354d9bd7a62e0d9d8d1b80b35fc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027this_default\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/this_typing/mixed_inference.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad531b9c1f14157c54b09ae915a01fdba60067934d997af980778907d8ae19e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inherited\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_class_statics_keys/test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7c37b39f68e69dc9a2c75c524b73e2a4f79951451b84576bd2d1a6899be45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027own\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_class_statics_keys/test.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e488b7faac28547c092b9a4abcb7fd019af74d1fbe3680742cd5f2154c48d7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027twoLevels\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_class_statics_keys/test.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5dfd0c5a300165506ecdb3025f88b6590326898e7a1ed5230701fc46a13b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027missing\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_class_statics_keys/test.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5110d0d4d062cf3d8073a5d464bb3c00982e0c145df27f5f63bdf63612fb359"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027flowInherited\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_class_statics_keys/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d218210f021d6b54b1677d6663c927bf50e7da77c2dcde118335e037c8243d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027c2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_enums/importer.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd4ba653c5421c7b1aefe5e6ef3d1e2e4b192db0ed82a80990b6a1e3e73626"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_enums/importer.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbf078efe9d9e4eb22b890dc29ae84ed22cbc260b0327782e9f67984c79f9e1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027xbad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_enums/importer_type.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"62038eaedbc698720bb773a32ad0237d8f8bc0225bd6002dc27324cb72ecd451"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_enums/use_ambient.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ce8d9ba7d918c73c862a36794c937df5993cadb0e3cca3470512682f2e224"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EsNamespace\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_export_as_namespace/test.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9a274bf810b1917f5a309a72ac126780b9e852a06ded0251fb5b04b81198d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027attrGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fa354a3fe6747848ff8fd4ed9f9079781c2d2fee6312366d58f938daccf512"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027attrBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ffc9ad785ac9635d864ad088b9413e507c54a7af8fc48f72cc635ffd8dee1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027parentGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1f1880e3fb47078e936d2a9c8f4f614fe6ce85cb04e119fb9be032c992e80b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027parentBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2b3e5b066da3109edc67f708b50e478d1b442b607b0a62e2e4b33e805d411"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027selectorGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10bfbb985793b8add4f8ad1713315313d1854516b0b38800a1ef56f11ec25f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027selectorBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba682991e91839ed339ec8a77c06d969b170890671d520fa65e9c3d12dc3f6f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unboundedGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb3c59c1fc569025182801e8a15efdfb80fe57ce42525b27e54594db86b826c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unboundedBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0cc0bcf888547a4560c87ac1324b180e84aef6b7ca405fa6c3249a409a9d1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027keyGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aee84dc0b910b1e56cbf543fff463c1c8cecdaac603d88b64dbc81641a9cf0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027keyBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_imports.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aaf336195fdbb833c83efc61ebc283ea19ad0a62d544e0c657baaac179a9758"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027localGood\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_types.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66850726eff75aa51f7b12f431fe84fe24a8a44f46de9aa203d10cd788cc52e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027localBad\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_ext/template_types.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64af681518fd98be6e21ff1c18d544ea069fcc9b902d2c7677585ceae24ce42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027flowM\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_method_bivariance_indexed_access_repro/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"55168c5c5bd5233eec71d0907b0beac4c50fb5c574598a94ed0b9ffc11b2e675"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PrivateMethod\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_method_extraction/test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe3b1096fec2f74472530f0809dc491af9ac47c2828dd75c5257f3675e8f55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PrivateMethod\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_method_unbinding/test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"034c58ef7f7d48d177505dd3a7f8bda6989feda9aa184a4679a9c09158a62797"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027item\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4488e598c99cd31edcd09aae31f2c101eae74e7fe479ed9147a90d9f90760f06"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ac1cf8385d1b87b4afabc19ad720af2549171d4fb23e94019fd36b0d860cd9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027plainItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"59289955499b043c65a2e13de7499806e59e047e2023cfead9e7c44b06ae5d23"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a657c5e78cf770fb86cdf51a59201a0b79392be2d4c8be61d06b085ae0b685"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badInlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fc7cc800c6a46ced476da57e1111573c272cce15e6067c47a3a61afe223e96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badPlainItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38e341e17d1cf57555aec1590e06a33aae0151157c49b402794f3fbfcb8832"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"396ba4997933424cee2970eb73afd25c4b3729cedce59a3af0cd0c4e8baebad1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeInlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3cc906d7a39acdb2258e75a57deb05eb23f3ed142a993ddfe7a2b1c7b65d17"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badTypeItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9068dd95d2b53faeaf2528c52a00d5901f37302a2d3adea4db91d1ab88a205d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badTypeInlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf7f81e3a0ee951af92c88a4dbc5ec9f39dd972734699459f6ebb511dadfdc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027shadowItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"444247ca0b1120b060813149cb7b45bfea5b4440ab09e94f2755fcf19ce467de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badShadowItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec737759d3799a1ac6d815514fd352f76175a14a8b5595c188efc52c24e0fad7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027forwardItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"993ef1ab32e22a1c7e573776dce194f0c1c81616bbea141979160acae56125da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badForwardItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"350babef314562e18c1ab4038c1bcd3d67b4de90af2eec635c1ef73305de3123"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027implicitForwardItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c875be70c2360fe4f1d86b695d6834a780ef1816dddb8a239de6944cdf0859"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badImplicitForwardItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8a939fbd238ef82e6f7bd84ad9571f2b638f2e1902ab20eb9ec6c3dc900785"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b1bc34716856d5aebb0ae81df20679fe7de79d147de86e5833580e9af4e89a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badFunctionItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b42c7206390edecf4f205c486fa52ece2864bcc1e5848f69de5133b66d3285"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027classItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a9bf23fba2cf31c76a158f9bb10be88136b7be5a58380375d9e970b01f7b1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badClassItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c404c2531a4858cc5c7e55a521aa4d113ae40b54bb3831aba9e4f0472886f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027beforeClassItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"12617b146cfc837eac36739efb9dc4d7cc0bcaf646d63cd46d5d30f5f94a6921"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027beforeFunctionItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/consumer.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5544fcf7530fb4eed915a021cb768b61f0e82fe4b78ad76f21e7b176341df622"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027item\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdf4842775ae8e3a96517ce15ed42d574f55c70c6776966051ff613d4698611"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc0d82fd6619725e86a59a7857f061ca410b3342ec31e59126ae268a81c522"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8326bc4001fd6333ff71d8cda8d9cd64e4f9a1d96a85f4ffcf0861f32befef47"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badInlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f38ec7b18857edf868d18398e09d41229315cbbbdaa390401c37b5dfb8cc70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027beforeItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3cc383e0f081cf223a33a41da8dadd866792139887488153b741c182711b31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badBeforeItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b9ebb541847f9568ef4db0e0341a199ae69334ecfab376a1cf66e85978c27f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027classItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0a8756074ffa3d3498988523044c1dbe75c2614d0ed521f7fb5e42446ebd35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027classInlineItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bce4eb9ef34cc3093e726b2628aae989d41f245835e017f572ab547b2bf5e30"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badClassItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06633a69490beca364fe151ada5d70940ff852238dfbe4f60d13403f05111c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027runtimeItem\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_namespace_exports/merged.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eeb6b07be4c8ab3a694735815d789db3a1574ad601b6affac68ba1f6bd5f0b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c45c529d0eb9561760d66408c1b329a9b248383180977f7b32211ee2bf92e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fee7347fc94602c00f6c4cc497f94724bab30279eb1ec1d1621f6af33d33a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027e\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b268c3213ddacdc84338db6a6e7857f747ec31e1aa50cc51014cde182537e425"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc79142c84915976ec18ccf614bffc51d3ed769e8c592f0c60849ae9278c0cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54a1d9263ae39e8dca3aac9f2ee275810f974c8d5868b20ac4d572df72e486d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3bce905423887c0a551e8ddc1e49cad1783f709cce3d1e8274db601c59d2f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79f72c24a20bcfdea1fe7e34a3cf947132b457b52c764b40d18e65bba8bc827"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2241dbde733a727da8ce46749dc085844d785d6097686a13c089dc5424d87"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_object_type/object.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd90d6eaaf4a253e06fc535f1b3374a0f2ec1844c6181393cfda983f7eb9a6f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027JsImpl\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/class_implements_usage.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca5d0102044f9b4801dcaf578b299b4dc2fba4485918af7eb78461de14e7502"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadNode\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/constructor_field_usage.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1762a979c871f6107c406ab877c7878c23ed4dbd8f9afd767f5847a0a4080c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027JsExtFromTs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/interface_extends_usage.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3037f0b8f89906812e84bcfa92bb79373b9ca761bda346f38f30a39c98df97e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027valueSpreadAfterIndexer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff16b2ba4be42e7cb16da9a0300780eff42fe053c69d30b930d8427eb458a3f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tsOrExactSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb24a6abeb605b2425b2b9579967faa5d9d123e8f150c76bc6fdec70fd83dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tsOrFlowInterfaceSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c8c8757f9e029b50a01b4214497d86a428e02a99034fec3eedd5724aae2a18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027flowInterfaceOrExactSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eceb5bf742c2cd848ec6dcdcd4a191d4ea0a4c5674fdd7e6e32071e2d5e432"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tsOrFlowInexactSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1b39df96c00d2e1a29eabe6330d06a5c776d9c4230d52776dbdd4135f0768c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027flowDerivedValueSpread\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/object_slice_ts_interface.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6369d1ac6ad02740819ae314a28b757bbea0d997b9373cf3aa5e7bba796645a2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NodeShapeWithOwnCheck\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_objects/static_method_override_usage.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd6876a3f0daf1b96a6c2d49086a55860f9d52c43d9b175c294a4c105e48b8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/readonly.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b5debf12fe68ccee12897ea3498405a8ba07c5f5d059cf90d791cc9041dc9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/readonly_type.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc038b3dab120a541c6b47d55c78ec9917a872068fe7b9e3310cabc98cb121"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/readonly_type.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df9b637333c94871012af8bce38446f11ebfb667cac34dc14e8589c660ec17c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/readonly_type.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d7cb65fae75f67d4065a91d094ff5c26919a1a5a62f6f1fec7aa34f4e103cc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027b\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/readonly_type.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8782981abdfc9d6ade6a307e22b8c730389c00d710c8ecf8a365b694d44e68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/type_param_colon_extends.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db31a4c688b38dfd4b930da5d81e5bb75ae07a8b32e6c0d966483a6ecde9a07"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027B\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/type_param_colon_extends.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bfa88cc36dcc46f673686ece49be19ef1a77ee303ff62a35adddfd67a80593"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027C\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/type_param_colon_extends.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e19e32aa6dd7060518b34fe0b38fff70ec5960803f386176b533711a004150"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027D\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/type_param_colon_extends.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ebe3aa9aeec2d57ef0e6897f0750acc2f0e3b4d39200ad68d7568e73a62b8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/values.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb006d30cfa0ff667adfa834b8199a9f9e8185a3121c42a5013cadfdf4db11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027values\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/values.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b1546417f559fffe1c96e4dea7700159d0e2aa6143ae7853c59ce495634f36"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/values.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4da8d44836bda39625f6c84392f25f43c8785a112847e315ff0677654492a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax/deprecated/values.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd9e8be726afe1a0aa73e5f4a23094c2a5bcc68480357c2468816e91161dc22"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#private\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax_allowed/private_class_field.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b4cd4b76c3d9ebfdee160fb821e5e6ec75e1eccc0cb50cd5a37f17e1a8671b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027offsets\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_syntax_allowed/type_keyword_member_names.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d4717dcafece3fac56980881cf62e584fa225201f64a4bf3a85f45d0c8f15a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027empty\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_this_type_utility/consume.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb94c5513ab1b4db3e4161ab9dbccb2d2e4fb2554c49cc1b1f0b56d001b671bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withExtras\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_this_type_utility/consume.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1754655ba85105835576a2cb0b9aaccd576800f51587538b6cef9a5268ae589"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BoxView\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/cross_lang_consumer.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03db15e5932d01bd492857a3c59ddaf8b9d9dd0d886ba4d033de0cdb9ad66da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027InvariantBoxView\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/cross_lang_consumer.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8717020339a63db8e8458554eab4cd063b57b47462c8bea224ae5efde912ffc9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027m\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"044aa0f6be5f9c27ee6458119c23b32ae3ef405fb7c4570e84c2b4b3c3fb56ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027a\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9ef8c30a6c93d1119676746c646053b2a7c68fb58c5905204d73fa6283c6c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027methodAsFunctionIndexer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8baee57bc445907529101aa708ed05c93d62f783df5bc87793896f9474c4ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tooManyParams\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b7edb95e7ed2304afe7c649bde1b8f752b7e994ff2c692fb30af284ceb3448"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027g\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a6f96a62efaa2fac30ec446d1adfc0edc82d54dfa14eea1f244b24749ea9de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PreciseEventInterface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a0fa22d5cabcffa5153e2c65f485e710c3d1929ae8717d6bcda6b074179425"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027oneSidedOk\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe81b029196550c938bf61fefc1195f8580c332e19711e874536a858b6bab82"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027oneSidedNarrow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"da966cb6658e24390515da3764bf43f22980011169e3743c2fd7ca67e6eca529"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BodyElement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b89ad8eac4d06888925287cc428ce54e2df0dc519724ebad618c0949b49c43"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TLSSocketish\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fc9fe00450003ce5ea574e09994e0c2240116142bf16d5594d7242c68d7760"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027m\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/method_bivariance_consumer.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3ef59d8ee5ecf897bf57ccae02bca773802bec15de54b9f40da438250dcb13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RequiredReturn\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/optional_methods.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e168212ae8f6edbb68463b048db5b251532b5746722cf13caabe6f19f52f3e0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RequiredReturn\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_variance/optional_methods_consumer.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfaf1e1def14121e24ebb5cab7c83a0e4bbd002a4600d40abe9bfdda6fc3d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_void/inferred_return.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac04cb2f0cd8fa917f1d2328e5d6792e814eb71f2c658a7d784ac8a48612d678"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_void/inferred_return.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f072bfc3ff9c2f618bb2aaaf70daaad7e97f98135e5863569a115da64021f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_void/inferred_return.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5c5e565353b21a6e3fe6726652eca56a4b67bb467493641ba5378fd8b22120"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027f4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ts_void/inferred_return.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6907ea47de6b2865370c453e08e280c69a1e7119a71912f36911df8d74089ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readPublic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/optional_class_field.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c45deeaccd60d68cae13927edee2c0f8a29409d8d04c3aba1092f0cdc06086"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027writeUndefined\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/optional_class_field.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a2c8dad74e481fe4722918cc8584ec57187354b25cd4cc641c6804244e3c7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readStatic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/optional_class_field.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81c5859ad5f12534d40759ed4d1d948d26ab807aa64f5c8986e6caba8e823a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readImported\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/optional_class_field.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"181f7dc668f155d3a7c29ff961d0bfc81a554cb325a3b2b884d589dfa930008b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readInitialized\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/optional_class_field.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4995021b4c477eb0e9dce20ff7eb9b450bf787bd26b8ca4612498a807ebdc475"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027A\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tslib_syntax/typeof_import.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cd874295b80a60b6147055f0de5a37944aa0b6da7ee5977b7b678795f7d7e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unsound2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_any/typed.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fce16f4aa53e4b58abb39f7ca164df2286fc2274c4475490839de3d82e15be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_any/typed.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf93f090017062e17960af7c5764f3fb88cd8e4032e6424a9a3001dc3689d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_any/typed.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8fc0a2d49988f2201defd86b1c42c5c855ea76aebc0689b6f20de95212523b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_const_literals/file.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653dab751fba0880217d90b4764f5b9d0f9f5fb153104b6acfa21844d0b4c34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_const_literals/file.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62d76bdd0e1c7c4569b3bc21e68a4f694681a18b268a288175751a585f2179a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_const_literals/file.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e689fcee795397ec50fde514c60be07d14662b640d5496b71988388eb7dfd1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arr7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_const_literals/file.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"11662c748e4670077698127a274660936d476f1ef351386d8bbb0f12ccc7d4e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027T\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_enums/test.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e473a1041103cf14de52939be38774fe0fad0f70fd8d45ffd349cb2f99afd605"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027k\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_enums/test.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0128cfe940e0ba60f3f55265756954e0fb5f050922020babcd757286005ba7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_function/function-poly-6.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d234bbc5a7b1c49ad1be6d226b20bc785cec8af973608fc2741042bba00635f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027__\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imported_as/main.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb50f0547e19b68fb06504c9c1f3272db11ca186c49b539dd2aee856d347379"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Nested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imported_as/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf40f4bfdbd07c1b4be51e2d007895293d5672f89bd352478d5cae5662ab825e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UseAT\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import-alias.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f051dcf54b9b0347687366caf18de50498cbf356d1c1350f3b093c5977cb1e7b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027UseAI\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import-alias.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe25b22ae2ad7d7dbc9689c9c441e270cfa9c2baa8ae4cfa9a82e3542567a8c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SpreadTypeExports\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import-star.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"664ec890a5a705301e695b8e893089db32ab839e2568288bde0da8c1590b7824"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027AdsULLogger\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/import_lib.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e605204fe36c29b82408795d329d916f780d54a2827912ae493390b21c555707"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/test.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3185953882907efbcc3f5b067b7a95e69b7acbef34b0e56f5bcbce1997d7f0c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027y\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/test.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d4d0a1295343901be906e022213737161578d1a79338d4fd11ebeb500787d6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027z\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecfadba579fee548cc9c95cc08cb40b9796260bf4eaee4070d652d741358108"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027w\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_imports/test.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"502b0d78905c712cdf99eaf6a7b1809e206acd13258dca957c5c130c911aea42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027p\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_json_pretty/main.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f063ea618c0d0ec1d899110b9253caf93996da8a713c4da40d3f21a85ad4f3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"829edfbb199994ea5ec691a750578199f67593ab5ae02fef2f6422db03cd68eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Explicit\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ad6f686c90b7a0c0d55b70887bdd67b63e93786e204ca56d4a813aaf9a569e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_error\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ba657be9224374b52a1adb0892514b5258e38b21bc25e306d3f635225d6e3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Expose_Any_Propagation_Bug\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c7659471ab6ff669f9faab0b07370aaea2b40f27495e69c8766ba5cfefc2ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_union\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a3e564e0b81894699cb43647b4fc0ab4e744606fad3ebe8e214e372647f0c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_inter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"097da9d0c003c9387dd18ca7bae1e9e1c4cdfe168d3269a68e5d9ee859635c9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_intersection_nested\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0481098a0f9ba7a88ea0ed87d15aecd36a21361a448012477fbfe44779fac7a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_union_of_inter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6ddbe8c88720961113108c1433276c0fbe73c45dab2e1f8dbce1280e9f183"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_Nominal_inter_of_union\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c60fe5e30a91d63719d2e3d72e0615516c1931411523fdee79e8f23cfa2cd5b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test_func\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_jsx/jsx_instantiation.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7c509d533e73f16ac8ae1b8ed450d8beee8947abb7c6ef1e052dee1e79af2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Welcome\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_react/react_component.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19d73afeb3f8ef5a6968dd3932c19f1edc6fcfaf5dd7260e9bce59e11d184b6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ReactA\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_type_destructors/react-component.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa189d0b3a24dbb35b85b5d716c902a1d4b7683c047b4fa7793cf897219ee7c0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ReactAP\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_type_destructors/react-component.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9570f982238a44fc21db15606fc7725c0b8bb7ffcac96e560fc98c7f963e618c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027conditionalJsx\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_at_pos_types/opaque.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe5803b2baca1b43da41568b26d5ed85db911dae855fb4be934a2d7aa585b66"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027interfaces\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bca834c1ba2eb5bba95b8ea43044288fa4909c63803c384085090ef7832c18"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027non_literal_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c08cb68b9a8c21c056cf016a55d2383c2ee57b653fd8536b722b0a345f4a62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027class_and_interface\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"31335a6e95df54aeb40a97035bb124f7cc09ada64d7c8cc9f9fe8f6cdfedcb8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optional_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0f26c17aecdb98894ba8429e4822fb72ecf1115a53039a008c5e52eca0d2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027write_only_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e1934d75c83637e49066670ee7703ac4dcd43a6d34e21ecb944ee351652664"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getters\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7c8ec336a278494ced2429e0ba9fb9276d71fa9b010308f0dca0f299b47531"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027union_guard\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc13bb953eb94fe8bc91d54673a4f88c2b8cfd896a08e46f8700289c1a8d514a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027uninhabited_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/disjoint_properties.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd5fc74bdaf8442b9284b5f3be4a04b6a8705d0e06dda8ae4ac1cb5d8a3949"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ddb755590364ecafeb5007f9562f3abe40060222da578dc81be0ab705480a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7676c5d316e5ef28693181d21d52351348a1d87d522babda1aa41603af38be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"41445a2f03c92ad590d0ede907ca12396b3398b542915cdc04ecf9ef6b399bd9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c215db95d0978096e2252c6442b29ecdb5cfa84bb1cb1a94617f8316c98e9e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7568525a8d9ad5904f9271b30598df810a4a646ea88dc105d748815c8d42ccb1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3bec3b245018fb1b78720509aff7b5d2aeb77953ee93ffae1b15c124c608ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79dab96e8d72d5be921654cf8d5d3f26f327fffd529e83a004349dc3de34f7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test8\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e811cb5e27f1e156f5314092dc3909788c486a416767d7ce3f830733252ba6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test9\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd1fc64a6cbba3f92e3b49e7f473c5d6cd76d31dc49df9bb4f64dedad0bac57"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test10\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"df977c58f04e1e345ef80cb447c1f9607b1d54887d7efe4d7151be0d71b99f75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test11\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabaa58a1d7385b5381d37b5e74a9d6c7970c5b9684d478d39aaece5c3a17db8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test12\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6b6e36c1618fda4022eca6a3178c37e176235c2b5c93300e8916d846b5133"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test13\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"059714f247d3dcf9c7f79d4328203c9bf7c26a47857de4be4c67fa5a06de9a6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test14\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"04efb77b31b2535f8659921c4c43020dd63a26ffdf2fdefa3e98f0ba2a1f8b45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test15\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d04d24f3cea6a1489d1076bd285bd1e3875a316821d60760416e0e1c0e0c3e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test16\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d551e0db1a43480c508a399e05e148ac7355ec41d7f179067978cc1cc5e7c810"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test17\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d030148779c65c18363e8ba98f9aa37d886d408e469f5ddc073c044340a2cf1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test18\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/inferred.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9959489c1ef4a0219c9c6a5f4063f3df09f928a05ffb7d7e99a9ee80db6c2b86"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027basic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"661f4038adfe9e36aa577a660560d8e6b3b5b9cbbc1bb30b9f6d4748fe1f70ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nonMaybe\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5362053f36d34035b436f9f6bc7de0d30f5eb826605e13455736d0f5be025b67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027array_filter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c040c1dfd94dd0e24b61e91d14ee6d571c6d613d664c53451368e1bd6c373de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sentinel_simple\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b857145ff4baee6550010d54910242949cf93e839e79fc279c802440ee6eca2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sentinel_readonly\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e6916b881fcdb078305ebcb54f64bfc9c78ffbdb2ee6d1c8f2153532f3196d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sentinel_multi_tag\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acc147de945775f07251f09f2cee91edad3fa32ac9cb7aac4147aab475e8a9f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027negation1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"37998d9219d8fd6d3c38c03d51f71bbc0b2f1f0b562acc897ac7ed293540a2a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027any_input\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b43b8303c9209106f5941f30e753e9a7578b9846638dfb73747b8d9e83469"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027any_filter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4b106952657d045abcc2143dcc0c1742f1b64c906c4af3ec73bc45ff502fac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refine_any_to_type\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c0b1063f39569f727bbd1d713ad4406586d53058abcc5be0ac5f2767e595c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opaque_types\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c45a254227eb3a8a83e2547786bc55b151752ce878224b3482f71009063e559"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opaque_types_imported\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bce56c06d1d4075dcbf0b09272ad1b858398c3f81fe970604c6731b6321b42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027union_with_any\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3b76d82cc1604d9acff732ebd2854f615d3482a1318e703460964ec44c081"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027one_sided\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7a2adfbeaa7e7830b8fb8aa04228c1d47f720513f0eb2e31346a6367c99578"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sentinel_refinement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a03cc250a039d4865414191740a7c66dcb18bda9521a75cf74d847978752436"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getRaccoon\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"051b826cc5dd1af4dd09eb9899815f7ef3501bf4d48f583a4cc2cf4298157155"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027negation2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4d67243691bbd51dc61d24eac6e5bc67dfd5bff634cbd08f0736a304c9e6b7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027negation3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"328593659725f44e4943262943ededca0b27b7bec8e1dd5490d0f96f0b380b4a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refine_any_elements\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f500300bc4618059a165348d40e18b2674a611205eaf12adc787bc14fcd82348"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027refine_resolved_any_props\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/refinement.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eea1e47e34ab5591db1bb2a5f52f886801e15fdfd636ddd6117f08703a2933"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d6eef4c37be5627b749b0bd7174dfe5ca316b0ffd89c5b2f76540d633483b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test2\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec00c6ed222d53def4494173a8b5c59d4c5e6efd37f0e2e86059a23c2d5d956"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test3\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d487c39a446d76b08861547b813699a793311f994d50d995c87c5581a6955ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test4\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6329afae859980edd187e5d1be5ec3ab6e92f750d45b159b8260a90a4da725"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test5\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9efd7d8a15dbb6556dac6ce9340b9aa458f52d0e9f22d93c2e759eaa3e6de12"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test6\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6dbd1f8b3afa0f53b17cdbc7b9e19d7be8f0cb1d38217c72767f7167088c7f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test7\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7541360ad2b4b0cb1e1555c8c6a4ed35422b894b3d07c1750e964bbf6bc58888"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027subtyping\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71018837632edc9cace5ecc241041bf5cc8abb23519f31c29e4eedd2db3ebae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027overriding\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b42d3908741ce05b914fbcbd3ef008529f9d126e6c30551195a17192b303c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027delegation\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cd56f4ce3702524657c65ab3a3accecc22f1acec0f46e945afe84cdfa63721"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027havoc\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c3af038fc26000c15cbd59b46e7942efc4d4b03300e6b2b6ff8966c18d9952"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027returnPositions\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d354064ac509e29e190b73a92172a06d1690013ff7fea7d4d14330b9bf6803"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opaqueTypes\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb073a9b4f30562b5c4b6cd5b10ba8311256370a2cec99ef3754136c1e868b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027structural\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1eb3a21323124b6829ae7115d8ac365705b345d232649e70bf9aa12bf0e5c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027objectGuardTypes\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"067f6185496a146ca1b702df0a2c965c28c38920fb49f72987021050244c1d27"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027classFields\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"621abea0ca8b340dab28ecb7fb611df1310f1c53174069c756446d472a641775"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027crossFile\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_classes.js"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b078aecf2c1685d09bcf22c57f93b5bf1fb9418851b87798c52c117a56b5d2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027classTypeParams\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_generics.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d391c398c4b5fa492045695433e8ea1f0c37738092107034a51e86c2b273b9cb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027methodTypeParams\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_generics.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa6402d145e878d194895bafbc546a2dab7ab6157525f32a34f0033945d2eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027variance\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_generics.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a876ba50442a72bb74073057990f61d78c93915a7436434de35a888eb925f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bounded\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_generics.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf4c1d6ab708e33ab262bea8b3dbdf32ce68ec2bcb497b956b9ed8e7e064ee0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027crossFile\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_generics.js"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da154b97b0207279728ea0edbd4d1920b7e39ba6d18916abaf5e29881c9b7ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027withThisParam\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_params.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7affb5c58b2bbcb2b0752db3cb0556e0fd451b5e3eeb393fda19aad58bd7c01"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParamOnNonMethods\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_params.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a6bb742cb7832564d21ad1943f788ac8bfe6808964ee70dba2dbb9ccb7979f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027thisParamAndParamGuard\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_params.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7ce7020b917ec6313c8b260d8018e6e0041b49bf5b6b82e7eb50b920c1bbf1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027crossFile\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_guards/this_params.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6888010ce729f8a1367a963c59d824c7de4d9327d7fd7f3ee6255434cf555ce9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myNumber\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f217a53f203b3440c1d3781ce69e5a13c3f147de3992f08e59d129263c20ebb8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myBoolean\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d16b2cf26d22939424e29c7bbc81a77f23d469346186bf6ba214fce6ff40a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myArray\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5aba2b1e3447eef9db8894e4883092c9a1cc004ee3db61b65fb98b43e0e27a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027myFunction\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f678a8badc244393a2ca0f86c8c08f4fc05a9b68546d48277336d7e937f19a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arrowFunc\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3466754c280214adf867954a36470e1f3a3b4ccf71d22c1b014fd2af3b80d09"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027typeVar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0abbd05163c63c8e5a9318aff6bc1dd802f6c3603447dab160ee38787b9404"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027letVariable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8d219d20fd494f864e9708f595d708bdaf3822727a231ca9f52a91ed1fe019"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027varVariable\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a72775d65e337f7efb84e09c604440d320ad308611ccf92a72d7fb43894af6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027optionalString\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ef693bf4fa706065d931c4a4047db0d8c792b797dea608e525e387044b384c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027unionVar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3694311538da4f769bac4b5a3b6a1930a83c9368351c059a09971ec35997b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027functionType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e731bd48a58cfa486101650b468bbd6b8f4c768017cce8ee9a579694b07c02f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyNumberEnum\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"147ba99742c1b560263a30cd77aeecc7c1ddbbfdd272cdbd88cf57aa6d1525c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MyBooleanEnum\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b310b8479942a94e5f19e21f30f8e438e7345cdcb0a54f6a15e6631bf31d15"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027LargeEnum\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_of_name/basic.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0131d66efab9e6c5332888fc90ec3a226d38e6d7152ab562110eaa126d582d32"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027chain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3c6601c281ba1fb07831f748c5a4a84421303fa6e63a51f6dd548fa51e3a4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badChain\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c69622157f2444fcd9aa44162ae4db7bbf796cd7d2a7627e52a4f51eaa0bbd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recoveredBadDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e5e057c644ba16e6dd6b8f241242e49cd71715ae98ecf086fe0fbbc3ed66d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badShadow\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02071ba2b16f69ea5cd05b7af15d5a429dd43a33747edc16acd96256e8e84e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recoveredNestedBadDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd9cf9fb3e241d1f0547dc72ffea3a2f8daa0cbfb1bf30cd2bf052a22a4531b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027badCycle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb48648f2acc1d27e94f2a4fbe9c530797f085a4206f969caa4a1ae74a9681a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recoveredNestedCycle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e070dbca607ddf643db5445c6c076b57759070ed53f5158dab10474c52925e80"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027recoveredMixedCycle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/type_param_forward_references/consumer.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fb7337259928f55b41282573e8422a3d684e82ca14f2f60a8a713c24c6336d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test1\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/typeapp_termination/no_weird_empty.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"04197769d2b8548e10d446c1cdd93f3865e109d7bb40b3b9babc9d190d7484bb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027openModal\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_keyMirror/test.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"617669dafaa23ea2b3946d4be78227665537ff4b31ededc8754344aa3699fa71"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027G\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_let_bound_reassignment/file.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc707c9858414b731a087d947350dfda210199a987b30a962f4b86b27fbb2e1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_recheck_opts_regression/c.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ed55537a7c50be197e754dfd765a011ba263d5229bba2917b7efc126bfb1f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bar\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/types_first_recheck_opts_regression/tmp1/c-v1.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbc1ef5e99caad40b5b5039e8c0075e0997d80f52993d1fcb1de0f5da8c9813"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027x\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/union_circular_imports/two.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f472664e9c7e2ee5b0f9e1dc75242b742ecdbc6ae5587e748413dc2a2c5d5b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027node\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/union_new/issue-1455.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4c9ca7e7ac1141e5ed13faaf6a72d41fedbe2b657b60fc2210a2aec98296f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/union_new/test22.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b81359b2c4388b7b418e2194dba235665e94937a98a16fcee5d751b772665f4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027test\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unreachable/jsx_unreachable.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b86a564f57a5d99b5f222e86df48195419ea0a09a2a192d9065732740d201"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027edge\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unused_promise/edge.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"996f28a3a7542a4d17c7fe655db72e81f3a7ea5caa7a828202214feb8ab0e5fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generic\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unused_promise/edge.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbef1b9cb925efe28a1173bb0395b94edf9d20b50ea299a21ee18a9f57f9b1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027opaque\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unused_promise/edge.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b35f210ca0c28fc7303dac0a6ce3920bc3168b8982ae5e207edffb262a39a8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027superDependsOnTypeArgs\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/unused_promise/edge.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f99e36d68bfb3fad1d7132d1ded7e1ef1d874a7ca05f8c99a09750a3ec0001"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027OkParent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/value_as_type/test1.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d09f430afabbfe1e31f2081a9e344151f72792086cff2b31f643e2b782ee4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BadParent\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/value_as_type/test1.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c7f9d900f2898e2d66df8f14d0e7c893127a00274ec9e50545f4f0f16b550b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027foo\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/value_as_type/test4.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a664c8e942cd0f648e612816ec088b4f8d6ca0bcf6f8f5dddccf29c919f168"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027source-map\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/__tests__/RunnableJS-test.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a51e118b0be4fd0962699b68e9b021bcc29af8d9caa63c4497888cb0f2668fe"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027esbuild\u0027: Declared in packages/flow-dev-tools/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":"15a4af57dc312f8c815b88b4eb5a37db2cfa4fda77b3535d74f60295f0752c37"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027builtin-modules\u0027: Declared in packages/flow-for-vscode/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":"8d6841cb3c51724f4c49bed08fb70cd12db386fd825a2fef3fde13abe3b94b15"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027flow-bin\u0027: Declared in packages/flow-for-vscode/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":"e489aa32732f14227ea41116bd0521da34905261deab9ed427c0db5f02d55d68"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027vsce\u0027: Declared in packages/flow-for-vscode/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":"61661520983b6fa38f1427ce4e03b7e1973bf96047a2dd6e50a63e74f7912463"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027flow-remove-types\u0027: Declared in packages/scripts/bootstrap/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":"ad600e29623abbcf8ab76613306194538c98fa1feb5604d83219355a002bbae4"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027esrecurse\u0027 in production deps: Only test files import it (first: packages/flow-eslint/__tests__/eslint-scope/get-declared-variables-test.js:39) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-eslint/package.json"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"982ac40ff5670db27724d1bc801f8cb04f0a89e6ce4131d04110862131ffe516"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/flow-dev-tools/src/command/allCommands.js \u2192 packages/flow-dev-tools/src/help/helpCommand.js \u2192 packages/flow-dev-tools/src/command/allCommands.js"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-dev-tools/src/command/allCommands.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dc814f7c54f3bd722fc707b32c18da87748826fc6ca45c3bf4d1f4296087a2"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/flow-remove-types/loader.mjs \u2192 packages/flow-remove-types/runnable.js \u2192 packages/flow-remove-types/loader.mjs"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-remove-types/loader.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe5bdf473106e297179f13618f1c7a73be49be1a3f526bf60c1eee74ec78d09"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_socket/src/socket.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"661ac547c08d7152e53ae63998ba6c25cf23fc143db4b7750d4b9eac8032c64c"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_common_socket/src/socket.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"581f5441258502d30268a0e91ace974fe33498b0fe30ccd8a371ea336b4df9cb"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_files/src/server_files_js.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ea44e04e3eb6c234dfd0d612bd9909fb028a346bc8ddcde8fd1d6eaca17d64"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_files/src/server_files_js.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dffdaae8b0e231c282b49011216b378fde24e6360a850a92cbd7e32d439198"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/workspaces_test/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":"tests/workspaces_test/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a43d7961a1e543333c0f2e6057fc30671f94d9c3d577dd60f9e38962f3bee"}},{"ruleId":"X1","level":"warning","message":{"text":"\u0060async\u0060 callback passed to \u0060forEach\u0060: \u0060forEach\u0060 ignores what its callback returns, so the Promise each \u0060async\u0060 call returns is dropped: nothing can await it, the code after this loop runs before any of the awaited work has finished (a function that \u0060await\u0060s around this loop still returns early), and a rejection is never handled \u2014 in Node.js an unhandled rejection terminates the process by default, and in a browser it is lost. Iterate with \u0060for (const item of items) { await \u2026 }\u0060 when the work must run in order, or \u0060await Promise.all(items.map(async (item) =\u003E { \u2026 }))\u0060 when it may run concurrently, so the enclosing function finishes only when the work does and its failures reach the caller. Where firing and forgetting is genuinely intended, make the callback\u0027s whole body a \u0060try { \u2026 } catch (e) { \u2026 }\u0060 that handles the failure, so it cannot escape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flow-for-vscode/src/index.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d863091de865a1903e74aace81f3f280536a848b00e1d153271e1f3e2dfd5d28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.length \u003E 0 \u0026\u0026 message.length \u003C 160\u0060 appears character-identically in 2 files \u2014 evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js, evals/evals/01_error_fixing/error_019_class_nominal_typing/input/main.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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f683fe2d47d69f38dfc6e026529c2b25fad02d944ff076a7014ae8d002862"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.length \u003E 0 \u0026\u0026 message.length \u003C 500\u0060 appears character-identically in 2 files \u2014 evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js, evals/evals/01_error_fixing/error_019_class_nominal_typing/input/main.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":"evals/evals/01_error_fixing/error_019_class_nominal_typing/ideal/main.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"86298e4ef7adb568d72a7e35218071b9633aed33b40b5d72ed5d75b71646d7a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.importKind === \u0027type\u0027 || node.importKind === \u0027typeof\u0027\u0060 appears character-identically in 2 files \u2014 packages/flow-parser/oxidized-src/estree/StripFlowTypes.js, packages/flow-remove-types/index.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":"packages/flow-parser/oxidized-src/estree/StripFlowTypes.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a1c9a85d37fddd093fde736c5b9901a119bd7f4c6b7686e70dcb085fc80595"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.sourceType != null \u0026\u0026 options.sourceType !== \u0027script\u0027 \u0026\u0026 options.sourceType !== \u0027module\u0027\u0060 appears character-identically in 2 files \u2014 packages/flow-parser/oxidized-src/index.js, packages/flow-remove-types/runnable-wasm.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":"packages/flow-parser/oxidized-src/index.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8e0610b619534e7c0591252a7daa2d68662714cd0a3971a1f07dcaadeb3460"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027linux\u0027 \u0026\u0026 process.arch === \u0027x64\u0027\u0060 appears character-identically in 2 files \u2014 packages/flow-bin/index.js, packages/flow-for-vscode/src/utils/getVerifiedFlowBinPath.ts. 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":"packages/flow-bin/index.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a77a4356ecea3bb38a4f7ae834b3c79ec5802a879feebe000a0c63ccf8c3bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.platform === \u0027win32\u0027 \u0026\u0026 process.arch === \u0027x64\u0027\u0060 appears character-identically in 2 files \u2014 packages/flow-bin/index.js, packages/flow-for-vscode/src/utils/getVerifiedFlowBinPath.ts. 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":"packages/flow-bin/index.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5729e55c406adabfa4a77cb74c8f1abc15abc4a165a00b1e9f426c879f905e1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variable.defs.length \u0026\u0026 variable.name === name\u0060 appears character-identically in 2 files \u2014 packages/flow-api-translator/src/flowDefToTSDef.js, packages/flow-transform/src/traverse/traverse.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":"packages/flow-api-translator/src/flowDefToTSDef.js"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7da2bf3997432728d0d3f193e03ccdae77910501266a6e30268a5a87a1937a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060def_t.deref() \u0026\u0026 o.literal.is_expression()\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_services_inference/src/obj_to_obj_hook.rs, rust_port/crates/flow_typing_ty_normalizer/src/no_flow.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/obj_to_obj_hook.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d1c613a3b3bd5968a81ff9ab7dfe0f660e616a337424d2b8cd749adfc5f075"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.starts_with(sroot) || files::is_included(file_options, f)\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_server_rechecker/src/recheck_updates.rs, rust_port/crates/flow_services_inference/src/type_service.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5fe26f3178b11931dfeef3cf23e9e298d2b59135e09c5e0ad1dee83d379881"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060files::is_flow_file(file_options, f) \u0026\u0026 ((file_options.implicitly_include_root \u0026\u0026 f.starts_with(sroot)) || files::is_included(file_options, \u2026\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_server_rechecker/src/recheck_updates.rs, rust_port/crates/flow_services_inference/src/type_service.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c71a7474104fa8b0d9370e8649997ab5d22728bb70fe45f5de2d343aaa8418"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inner.quasis.len() == 1 \u0026\u0026 inner.expressions.is_empty()\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_parser_utils/src/file_sig.rs, rust_port/crates/flow_typing_statement/src/statement.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser_utils/src/file_sig.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec92869c9a5fe84d41d0bebc46e2da33c875a6569a876f9fc8936fe699529612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060json || json_version.is_some() || pretty\u0060 appears character-identically in 3 files \u2014 rust_port/crates/flow_cli/src/check_contents_command.rs, rust_port/crates/flow_cli/src/foreground_check_commands.rs, rust_port/crates/flow_cli/src/status_command.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/check_contents_command.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e03e4b01aaa80d2d7a2cae359138536b63fe57180020a73b2aa48264f6cd29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(data.kind, ImplicitInstantiationTvarKind::Inferred) || env.restrictive_frozen_tvars()\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs, rust_port/crates/flow_typing_flow_js/src/subtyping_kit.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_flow_js/src/flow_js/dispatch.rs"},"region":{"startLine":10067}}}],"partialFingerprints":{"codehealthFindingId/v1":"76860aeff327b07b012913d67c6367acceb4a400dadaba6cec5c080bfa7a44a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.enums || flow_common::files::has_ts_ext(file)\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_parsing/src/parsing_service.rs, rust_port/crates/flow_type_sig/src/type_sig_options.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parsing/src/parsing_service.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc487e1acf8bfdccf4d1f5b41d3130010ab55cf07f32e47523a4e38bec8b71ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options_flags.quiet || json_flags.json || json_flags.pretty\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_cli/src/foreground_check_commands.rs, rust_port/crates/flow_cli/src/start_command.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/foreground_check_commands.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"04391fa5d424a12651da826e9b1e2e602cb9bddd42c2ce8d4cf3eef2ed685818"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060params.params.len() == 1 \u0026\u0026 params.rest.is_none()\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_env_builder/src/name_def.rs, rust_port/crates/flow_parser/src/ast_utils.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_env_builder/src/name_def.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebdb5c297c17f9f13ff2d9735183b9175478f4b82214abbbe2171625dfc87b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060postraw.starts_with(\u00220x\u0022) || postraw.starts_with(\u00220X\u0022)\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_parser/src/expression_parser.rs, rust_port/crates/flow_parser/src/flow_lexer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_parser/src/expression_parser.rs"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8cff5d960afd18c64ef5660130b789afb8275c2bb01859dea92cf72ddaaee5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.lower == other.lower \u0026\u0026 self.upper == other.upper\u0060 appears character-identically in 2 files \u2014 rust_port/crates/flow_typing_errors/src/error_message.rs, rust_port/crates/flow_typing_type/src/type_.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_errors/src/error_message.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351a4fd236123e104b3371633b6ed627b808df9da226d263891bfb293a211c3"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 1723 (\u0060u32::from_be_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 1724 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_env/src/server_socket_rpc.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625a6f6540b0f7a29a475c0a7561ffad46577ccdae31f7931091f7e31680a1d"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 131 (\u0060u32::from_be_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 132 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_monitor_rpc/src/monitor_rpc.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"743b23b837f06d65f925190ffa0e07ec7fff60de44cc3b4ee9f8514bf1470d03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 130 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_concurrency/src/thread_pool.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec784b03f3e00dc9fe29ffdd14ef7c435b170238b5546222465051bc04fe4ea4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_concurrency/src/thread_pool.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d79a1d4205fcf391628fc63f508fd6e8ffe2702c7de8555cc0163fedb48be5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 143 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dfind/src/lib.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b7d4ae356989af1b7789904b53feb2c550ccf6ac18d7ed05ee548aa5d64e18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 187 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dfind/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a61d4887e1c7f900441825445b63d1318ff825c18e1a17c025e1d63e5562f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 282 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d1b61d66d815fefe2a0d2584e896087a389c0999c8ed250e41beba8519107b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 406 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e6911ca3287646bd9ae68050e05ad5aa2d662274e60c88a1da4edb6cabb3b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 472 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aeecde650cc2a9392a7e3d2417f63a238dd1c77c81dd702736e4f91bd5d0b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 480 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"11be82c4cf8aa659f69d323ffcfd109062ff5e9cb65b56c6f498dce6e76c9049"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 610 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90d5293f3da13db85765780f2b03adcfb22c81a3dfb62abcbfd5bc855a26d3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 613 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_daemon/src/daemon.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"192704824b35a0aca2200664ec0f3dce78bae994a13a33057f7b8dcde1bd04bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 95 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_codemods/src/utils/codemod_runner.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734c2eb35823176534bb7a07c5386e2aec1046c71553f9f96321ec3bd0dbe34"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~1.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 7 assertion(s) across the 5468 source line(s) of the 86 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/flow-for-vscode/src/handlers.ts (7). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_bin\u0060 turns every \u0060Err\u0060 into \u0060\u0022flow\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/dev_tools_command.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e292b2d929167aaf3947d980082062410da0f81df7e16fe36f7af00842e7bd7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_member_def\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_cli/src/glean_runner.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a98317cdcb2b304d3d48d3d08bafd31488408f0b90ad969e05a923659e39ffc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_dev_tools/src/runtests/check_annotate_exports.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f78f535e8f1dd882fc72d72809894ef01217efe9254fdf764eccaf03e46dd5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060add_missing_imports\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_command_handler/src/command_handler.rs"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f194e5fe8e4781877132a297b00ff36897d7c8865e1d8ec8d3424470d722cb13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060assert_compatible_flowconfig_version\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_server_rechecker/src/recheck_updates.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2f0d2af0d3b513d0b21d33cf2fd5fba0cc868b715e5f7541ccfe14a4016e3f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060insert_inferred_type_as_cast_code_actions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/code_action_service.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c804712b69918d6b60e6e145b433d2c387b272669c4bebee33712e26e044940"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_from_type_refactors\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_code_action/src/refactor_extract.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ec9db1dd4fecaa3ede9d41a1c615100e3c7a7d102977e0b690679c45806a54"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060assert_compatible_flowconfig_version\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_inference/src/type_service.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964014d6e806f14d190149279306a1ca877bd1be948e27d2a4ba2d8358a3adb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_func\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"171d4efeb461a8782c43ace147bc7bb8a050f21f248b9818ff7ee25c5a18df97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_prop_of_obj_toplevel\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_services_type_info/src/signature_help.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acdba79e801a2c0621bd4d0d37f549d272bf860e9de064a6360353738425f53"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060concrete_types_for_inspection\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_typing_utils/src/predicate_kit.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffed0413365c7d489fea69286c3d5e35e5e73aec523c36bf2c0bf4a48c359a1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060hh_readdir\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_port/crates/flow_utils_find/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f20b6cbaa846599729c1a8453ac7e96685e9f2a4a0cb894a8b1219d55439a7a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":210,"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."]}]}