{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"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":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"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":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"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":"YrsDocumentEngine::apply_compiled_transaction_with_history_and_context (cyclomatic 86): YrsDocumentEngine::apply_compiled_transaction_with_history_and_context has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c1ca262d477c2fe12ee3cbe7b63e7c1be4ba4fd57bc19d08fe0cbb5bf48339"}},{"ruleId":"D1","level":"warning","message":{"text":"useEditorToolbarItems.useEditorToolbarItems (cyclomatic 84): useEditorToolbarItems.useEditorToolbarItems has cyclomatic complexity 84 (threshold 15). Most of this is not in the body itself: 1 of the 84 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 89, 221, 352, \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":"src/useEditorToolbarItems.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f8c1b99a97fb1cc8cb79bc59ec74e3add73e52eac5637f23c0198ddde3531b"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.prepareBlock (cyclomatic 77): CoreTextProseLayoutEngine.prepareBlock has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50f4fbb90bd988ab315fe641bcff143884e3dba7e00802bcb72fb5df3eeace9"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorPresentation.useRichTextEditorPresentation (cyclomatic 77): useRichTextEditorPresentation.useRichTextEditorPresentation has cyclomatic complexity 77 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 32 belong to 14 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":"src/useRichTextEditorPresentation.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63d5f16a9d2f71a9d0c50bc9f53ca83452d0227b9723cb21e25b237031347ac"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridgeElementsKt.appendElements (cyclomatic 76): RenderBridgeElementsKt.appendElements has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"733c8bd7886c7f0bf24da6807e2bf4fb18c69ce8cdcd84d88b4750ba0493b6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.moveFromActiveTableCell (cyclomatic 75): RichTextEditorView.moveFromActiveTableCell has cyclomatic complexity 75 (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":"ios/RichTextEditorView.swift"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ab6d0829289b913f511f660c4dc888091bcf8482de4b4f1f9afddb8abe125"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.renderElements (cyclomatic 69): RenderBridge.renderElements has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa202655e6dd6951ac7838a6723f928df4927578b8762db9fc67661cbc8700f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableIndex.stage (cyclomatic 67): EditorTableIndex.stage has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f1421ad7bf9502b1c053409f1c29d33fdb06efdfcab78ea5a8178322ac6b0a"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.prepareLayout (cyclomatic 66): StaticLayoutAndroidProseLayoutEngine.prepareLayout has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"194abf7168320351d9090e39b4868ad5e36f068500eba98df05bd031a9ff6b28"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makePreparation (cyclomatic 65): CoreTextProseLayoutEngine.makePreparation has cyclomatic complexity 65 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 3 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97f630e747c0d5ea0f380ddf75fde65026be755f337f336f451d7de4ead7166"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::try_new_with_budget (cyclomatic 59): Schema::try_new_with_budget has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/editor-core/src/schema/construction.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e7cc3df7970fbd62b6cb34f56ef45bbd49f2ad4a815647c619a5b84b95cf1b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applyUpdateJSON (cyclomatic 59): EditorTextView.applyUpdateJSON has cyclomatic complexity 59 (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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1600c6188ebdc15ebac25562a4114c7fbee967cf5c619fded43dc789f7756e"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaNormalization.normalizeSchemaDefinition (cyclomatic 57): schemaNormalization.normalizeSchemaDefinition has cyclomatic complexity 57 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 11 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":"src/schemaNormalization.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"af381884604551f41288de0095b9141e9e881a931ed39adc1f5807ca4b43d0d3"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationCompiler::compile_structure (cyclomatic 51): OperationCompiler::compile_structure 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/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5087e2fa8d4ec4890dc0ec1c6bf2e003af6a2ffa9c2df5c5ba42954086e55d19"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::semantic::compile_transaction_impl (cyclomatic 51): editor_core::yrs_engine::compiler::semantic::compile_transaction_impl has cyclomatic complexity 51 (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/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"91feb9bbab71c6d6aa6869846eed5d45f4ae863dc98995ca3702c4f3e78541e5"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaResolution.resolveDocumentSchema (cyclomatic 51): schemaResolution.resolveDocumentSchema has cyclomatic complexity 51 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 5 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":"src/schemaResolution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b3c7cb4e4d2803cee96f3c063f744919c0566dd076e515703d9020cba88955"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerDocument.validTables (cyclomatic 50): ViewerDocument.validTables has cyclomatic complexity 50 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 7 belong 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bc38f37df3989fc1c29c0f9d7c50a78fe3d1fe20214eeeeb0cc3f9c30e0add"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerDocument.lowerElements (cyclomatic 48): ViewerDocument.lowerElements has cyclomatic complexity 48 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 8 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f91b5d9d0b34995ae3a308cbf925d4bbd03a5db2c636a7812fd116a68cc0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorState.useRichTextEditorState (cyclomatic 48): useRichTextEditorState.useRichTextEditorState has cyclomatic complexity 48 (threshold 15). Most of this is not in the body itself: 15 of the 48 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 224, 241, 271, \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":"src/useRichTextEditorState.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44e7b76c61baf2afd25a0dbeeb3a7e360f5e0257bc3be7e05a9b7a60eb4f9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeToolbarItem.parse (cyclomatic 47): NativeToolbarItem.parse has cyclomatic complexity 47 (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":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"220267b1dc2d195b04168057ea413bd2f1481562d6cf720002cabe311d0cd2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::html_in::clipboard::normalize (cyclomatic 46): editor_core::serialize::html_in::clipboard::normalize 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/editor-core/src/serialize/html_in/clipboard.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a118d51bc6fafa6463093c1db69f5b88f7f6221985424a4e0841986876bb27"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl (cyclomatic 44): editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl 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/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19656cf59cfc0c0b577c5f8fe022d447a71666a7c6d29eb7de98c47ab249f8e"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.updateTableLayers (cyclomatic 44): PreparedProseDrawingView.updateTableLayers has cyclomatic complexity 44 (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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38516df443d48614821f85fb147d253c95304f0f88fcb0fbcf61da659036dfa"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::apply_virtual_structural_splices (cyclomatic 43): MutationCompiler::apply_virtual_structural_splices 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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e561eb8a0bc728b885751a1150966b97ef9b4f8dd3c737c2be075844ebd61a"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCreateJson.normalizeV2JsonValue (cyclomatic 43): NativeEditorCreateJson.normalizeV2JsonValue has cyclomatic complexity 43 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f18eaf7a675090ae1512f3f0cde44d3e5aa6bf3bcb88884b81278f25ec6d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorRenderNormalization.validLeafRenderElement (cyclomatic 43): NativeEditorRenderNormalization.validLeafRenderElement 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":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a91424407a6c9d80fca78e04292f0604b088ce39149cf684519523984f200a9"}},{"ruleId":"D1","level":"warning","message":{"text":"useNativeEditor.useNativeEditorDocument.refresh (cyclomatic 43): useNativeEditor.useNativeEditorDocument.refresh has cyclomatic complexity 43 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useNativeEditor.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e082afd561a97d2021747c529e464a04f3ad6368da9ffac8563674f29ebc9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorAccessoryToolbarView.apply (cyclomatic 42): EditorAccessoryToolbarView.apply has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeToolbar.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b01bb8657078b0fc4ffa95c6f586c02d9dce837b9cc4eeb88269601fbd64a3"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::wrap_in_list (cyclomatic 41): MutationCompiler::wrap_in_list 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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4de69b2ff51c0c10c7676a8c820a210735a7f6ebdcbaa9a61559f161bce0391"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::index::localized_format::localized_existing_textblock_targets (cyclomatic 40): editor_core::yrs_engine::mutation::lowering::index::localized_format::localized_existing_textblock_targets 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/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b739c1f1d400a1e278659e7f6f54c946f637404a663f5cc57820ee1ac58369eb"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableIndex.stage (cyclomatic 39): EditorTableIndex.stage has cyclomatic complexity 39 (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":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3a441f2ffbdf99b0a51c78320e159d6ce88ed3ffe5011d9862df31b7e44980"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDocumentConstruction.constructDefaultEmptyDocument (cyclomatic 39): schemaDocumentConstruction.constructDefaultEmptyDocument has cyclomatic complexity 39 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 23 belong to 6 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":"src/schemaDocumentConstruction.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0e117c36201135ba00c0b9a0fedc89adcf8861b9e346a33fee08f46a887781"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoViewToolbarKt.handleToolbarItemPress (cyclomatic 38): NativeEditorExpoViewToolbarKt.handleToolbarItemPress 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74326dda2ecc8b80239d002becbf8bb13544009012338561803d2d61ed8a86b"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridgeInlineAndAtomsKt.appendStyledText (cyclomatic 38): RenderBridgeInlineAndAtomsKt.appendStyledText has cyclomatic complexity 38 (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":"android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e5deeb5363e9946c4c13cabaefaddeda0741156453e0a0b5ccd16f952a0dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.isValidRenderElement (cyclomatic 38): EditorV2Adapter.isValidRenderElement has cyclomatic complexity 38 (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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"13399f749e4b96678ab5f952ee751950b9ce33ada97c5979088ced0bdc2d2439"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.attributes (cyclomatic 38): CoreTextProseLayoutEngine.attributes has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1788005a3de908ce72bd9503139cebceebc4f8a34f2a48d0ecac6a083a46318"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.markSpans (cyclomatic 37): StaticLayoutAndroidProseLayoutEngine.markSpans 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57fc361b38c90f26c5b10abc6c824ae5dddcb500994406f9d22261e10dc5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderImageDecoder.isSelfContainedSvg (cyclomatic 36): RenderImageDecoder.isSelfContainedSvg 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"765fe87f6b00d2443610807af6b679020382c94c86d4bab5669faa7057ec0222"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.moveFromActiveTableCell (cyclomatic 36): RichTextEditorView.moveFromActiveTableCell has cyclomatic complexity 36 (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":"ios/RichTextEditorView.swift"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec5d784a88d69dcf3889ea2ffc09e0e78ed3005680ceeba37489fb56f84e479"}},{"ruleId":"D1","level":"warning","message":{"text":"useEditorToolbarPresentation.useEditorToolbarPresentation (cyclomatic 36): useEditorToolbarPresentation.useEditorToolbarPresentation has cyclomatic complexity 36 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 17 belong to 7 function items 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":"src/useEditorToolbarPresentation.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2ea7b07ff4b68bc24ec897119d919e063a64a5ecacff0ddf74e1cd54f48afa"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorMentions.useRichTextEditorMentions.handleAddonEvent (cyclomatic 35): useRichTextEditorMentions.useRichTextEditorMentions.handleAddonEvent has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc3ed04e5c83a29889dcb4461dde83ebcebcca52386eadf40cc94e490c9633"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.moveFromActiveCellByArrow (cyclomatic 33): EditorTableSurface.moveFromActiveCellByArrow has cyclomatic complexity 33 (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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb10fa81a6b21f09d933d58e4a96a5f9e8e4631971d435d86686f6dd2c3fdbc"}},{"ruleId":"D1","level":"warning","message":{"text":"useNativeEditor.useNativeEditorDocument (cyclomatic 33): useNativeEditor.useNativeEditorDocument has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 7 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 380). 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":"src/useNativeEditor.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0668f2751bc3d5d26b87706d4995675d7e7b4e0334e46db5e37ca81bf7f171"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl (cyclomatic 32): editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"520100684486f260fa3dcd1820c3f76d8c4b27e2c7bd9dfe5dceb034cdb2ce2d"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextUpdatesKt.applyUpdateJSONImpl (cyclomatic 32): EditorEditTextUpdatesKt.applyUpdateJSONImpl has cyclomatic complexity 32 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d08f28f2cc69b852d4c782b5aaff30472a87c44dd2036c60d8a03a5f423912"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderImageLoadOwner.decodedDataURLByteCount (cyclomatic 32): RenderImageLoadOwner.decodedDataURLByteCount 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":"ios/SharedNativeImagePipeline.swift"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a42f7ef754064cd471b0ec556e2eca2df670a566f8bc51d9666e191b7c9c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCollaborationTransport.normalizeNativeCollaborationTransportEvent (cyclomatic 32): NativeEditorCollaborationTransport.normalizeNativeCollaborationTransportEvent has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26116f4a24b87be98d474d25f66465ecb44fcfdc826289f9045fb4c569f6c22"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorEvents.useRichTextEditorEvents.handleAtomLayout (cyclomatic 32): useRichTextEditorEvents.useRichTextEditorEvents.handleAtomLayout has cyclomatic complexity 32 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. 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":"src/useRichTextEditorEvents.tsx"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd9706b4897de085e01679640b33d827535323f3a60df2c35945c4980a92cd"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationCompiler::compile (cyclomatic 31): OperationCompiler::compile 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/editor-core/src/yrs_engine/compiler/operations.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1fd113371ed4fce59ccbe1ff29c1a2ab96f920431b840ebf9a3c054905457f"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::alignment::targets_in (cyclomatic 31): editor_core::alignment::targets_in 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/editor-core/src/alignment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1402af161c5b26c39f0b88c60f1d692edb968f2465f1397f65d898927c23e3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.textViewDidChangeSelection (cyclomatic 31): EditorTextView.textViewDidChangeSelection 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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b563f1ba4d347bd885f55f8407267fe2870f884a49f20341d16bed879b9bbc0"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.adopt (cyclomatic 31): EditorV2Adapter.adopt has cyclomatic complexity 31 (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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff63ea188906a454337dbefe2dc5eeac6e09fddf81a431536184e229b6672e0c"}},{"ruleId":"D1","level":"warning","message":{"text":"TableGridLayout.relayout (cyclomatic 31): TableGridLayout.relayout has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 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":"ios/Tables/TableGridLayout.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b20e87ae91780c65c2ceea394a46a289193c6a60095489dc09e1acd0398d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::split_block (cyclomatic 30): MutationCompiler::split_block 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":"rust/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"549c0c5336f81b8cf3ce85981992d81435048491974234d8e7abc32732cff0c5"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.prepareBlock (cyclomatic 30): StaticLayoutAndroidProseLayoutEngine.prepareBlock 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae1021d9547a2a4ce88dced49e34af3cdcad32f4b7e3c9bf5a0d6aba45d1ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerDocumentKt.validViewerTables (cyclomatic 30): ViewerDocumentKt.validViewerTables 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f48af28cf1e6dc6722cfd58077718acaa596ae512b94bc13e2f021771b5fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.deleteBackward (cyclomatic 30): EditorTextView.deleteBackward 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":"ios/EditorTextView.swift"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d0cd8594637d229e8c44b0d7e79801076bdf93fb9222483cd65927da73ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.selectionHandles (cyclomatic 30): PreparedProseDrawingView.selectionHandles 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e93b58ab295e0a7b633f5d010b6e8c9489db70ad574d1457e2f753e95ce4071"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDefinition.defineSchema (cyclomatic 30): schemaDefinition.defineSchema has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 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":"src/schemaDefinition.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a917d6844b6438b369853a5bab67590b9ffbe0f55b8567e6be6b7c58a995596d"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationCompiler::compile_marks (cyclomatic 29): OperationCompiler::compile_marks 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/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cce863708dcc9245faa71476600e3033925920be7d6489b306b3afe2081726"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::commands::tables::plan (cyclomatic 29): editor_core::yrs_engine::commands::tables::plan 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/editor-core/src/yrs_engine/commands/tables.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed590b91aa9b26a68c29a0d37a7cc9d903e24a6009de82f567073f1dabedf0d4"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applyAttributedRender (cyclomatic 29): EditorTextView.applyAttributedRender 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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f8729fb08b9ff1bdbecca5b118d3c6eca5a331495e32c6ff30623c753fb36"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.stepDragFrame (cyclomatic 29): EditorTableSurface.stepDragFrame 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8cde5a998ef7ccbceb756c3b25b279d61207118422979d7e09d18811d97483"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeBinding (cyclomatic 29): CoreTextProseLayoutEngine.makeBinding has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 9 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76c9b48ecbdddbfe3558e121752f1eb4ed4c243431126d662bcb9598c94ccf8"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCreateJson.serializeV2CreateEnvelope (cyclomatic 29): NativeEditorCreateJson.serializeV2CreateEnvelope has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"3565b4d4130c959d7b6c0176b6846487a591e07e15f0f83933ef0e2a2b9a2ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorUpdates.useRichTextEditorUpdates (cyclomatic 29): useRichTextEditorUpdates.useRichTextEditorUpdates has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 577, 509, 309, \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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a822fb49a20aac3032741f7def15072db7395c6663637fd2d3715d73fe7f670"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::unwrap_from_list (cyclomatic 28): MutationCompiler::unwrap_from_list 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/editor-core/src/yrs_engine/mutation/lowering/list/unwrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3a603a374d38f5c77da1637cf17db5cea7e479907e2d2d7f82c80124957ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::tables::reference_grid::compute_map (cyclomatic 28): editor_core::tables::reference_grid::compute_map 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/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5ac5942ddda36370f4410717b32b63661b4ecf675d4d29fad99d3f6a180bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextSurfaceInteraction.performAccessibilityAction (cyclomatic 28): EditorTextSurfaceInteraction.performAccessibilityAction 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1cf32d056dd1fca25b385a362b082a9dbbf22b139937d821a4190534e0546"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.refreshRetainedPositionalMetadata (cyclomatic 28): EditorTextView.refreshRetainedPositionalMetadata 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1235e50495e2b1eff4eeee01397ac2d2e3892d9e593ca6c26c1ba1cf899b7f1"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeAttributedString (cyclomatic 28): CoreTextProseLayoutEngine.makeAttributedString has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29e3fb3028fa7e544057a494352d1e71357f65fa3adad7554cabc323ce0ec4c"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.hitResizeEdge (cyclomatic 28): PreparedProseDrawingView.hitResizeEdge 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2bb99c68c5fc8a183cd27deb4bb55e37cad66c7b4b1db5a7b6d9789e350278"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutRegistry.measure (cyclomatic 28): PreparedProseLayoutRegistry.measure 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":"ios/Viewer/PreparedProseLayoutRegistry.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"529a10472acf85921eff8ac79084fec4d4aa0ff486cd7736189065ffa9c1d07b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalTextComposition.parseNativeCompositionResult (cyclomatic 28): ExternalTextComposition.parseNativeCompositionResult has cyclomatic complexity 28 (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":"src/ExternalTextComposition.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d226023c766b0421d7b6963d9ad74a98d98b7c4ce18bdf0808b61c3ef8d0ae8e"}},{"ruleId":"D1","level":"warning","message":{"text":"useViewerAtoms.parsePositions.positions (cyclomatic 28): useViewerAtoms.parsePositions.positions has cyclomatic complexity 28 (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":"src/useViewerAtoms.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3173bee998af21183b0312be3a68caa684e034cfde168751e20acb869652a"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationCompiler::compile_text (cyclomatic 27): OperationCompiler::compile_text 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/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec98bfa36549cccbe33ee6f7638659b911918b9570ce42733316b951a9053843"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalizedTextLeafIndex::carry_after_textblock_edit (cyclomatic 27): LocalizedTextLeafIndex::carry_after_textblock_edit 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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"0493820a3754eeb8bf0dfcfc7a5c32e784173e2a087e8ba00a2122e6cdb6b99d"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::delete_structural_range (cyclomatic 27): MutationCompiler::delete_structural_range 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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7e5255e6ef1db74037d07ed3dabd366aa2c879501ad97cadbb7fa1d9b3ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableCellProjection.project (cyclomatic 27): EditorTableCellProjection.project 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b13a1d6142d67a1b3339493ce05a8276c4e0ce077399a80649d01cc0b8118ca"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.refreshPresentation (cyclomatic 27): EditorTableSurface.refreshPresentation has cyclomatic complexity 27 (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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5414aee5c7b9ab49a745f4096e3b7669fb5ae41ad99c0ea27012cddf962343f2"}},{"ruleId":"D1","level":"warning","message":{"text":"TableInteractionController.onTouch (cyclomatic 27): TableInteractionController.onTouch 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":"android/src/main/java/com/apollohg/editor/tables/TableInteractionController.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"95150e235e56d388f429ffc0c384fe5303608117503d9c3e767a881c83500236"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.drawTableNodes (cyclomatic 27): PreparedProseDrawingView.drawTableNodes 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"931765374caf0e9be6f71585896d2fa71035790eaaab6ceb5f09aa12a6af233b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.reusingStyledParagraphBox (cyclomatic 27): EditorTextView.reusingStyledParagraphBox has cyclomatic complexity 27 (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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f7231dc3d1c575d47865670f286385334ed9239e273a4e28505b63446abffe"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.isValidMentionStyle (cyclomatic 27): EditorV2Adapter.isValidMentionStyle 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14abdf71539bce8dbd49415376aea0a651c85afcab7edb00034d12514b86654"}},{"ruleId":"D1","level":"warning","message":{"text":"attributeValidation.validateAttributeSpec (cyclomatic 27): attributeValidation.validateAttributeSpec has cyclomatic complexity 27 (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":"src/attributeValidation.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeffa308050d9818383d7f72a732ffe0f96d1a7560a18b178d10d3cfa737ab7f"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCreateConfig.buildV2CreateRequestUnchecked (cyclomatic 27): NativeEditorCreateConfig.buildV2CreateRequestUnchecked 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb7e05e1720f71ca03c4287e596d82febbe9ceccbaa3ef209c0d61f3cef80a"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::commands::clipboard::plan_at_selection (cyclomatic 26): editor_core::yrs_engine::commands::clipboard::plan_at_selection has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/commands/clipboard.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb49007897e03ad3118a2cfdf4cc082113832fdc9b8c5143d3d8ce7632d907"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextSurfaceInteraction.onKeyDown (cyclomatic 26): EditorTextSurfaceInteraction.onKeyDown has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc14c82d8fbebbf06474b9bcf5ef0aa2ed652d9d0b0c06575d698f74b0a8a01"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.nativeTextMutationWithCurrentSelection (cyclomatic 26): EditorTextView.nativeTextMutationWithCurrentSelection has cyclomatic complexity 26 (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":"ios/EditorTextView\u002BNativeMutation.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95766e5eb4a0f152c95dabf5e0a993e67edcd7451328307f0f473429b40f497"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.arrowDestination (cyclomatic 26): EditorTableSurface.arrowDestination has cyclomatic complexity 26 (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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fcf6b73858aed62cacd8800e4b9908f4fa24bb9ddb4af9d3530b7c7e56f649"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.prepareEntries (cyclomatic 26): EditorTableSurface.prepareEntries has cyclomatic complexity 26 (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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9700608a4a8d8e50c52c154e85260805e3f6149c34815daea36ed92cf2e6a1"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.listPlacement (cyclomatic 26): CoreTextProseLayoutEngine.listPlacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"957665ba11001d18c64d36ff84a2cbe35cdc06d1036982e364d0276aaeabebf6"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::rebuild_target_layout (cyclomatic 25): MutationCompiler::rebuild_target_layout 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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"698a4a89d8ee161502fe79aa2d3236df217d72ae3e7b9c95516e9b9edacf45e1"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::commands::text::plan (cyclomatic 25): editor_core::yrs_engine::commands::text::plan 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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc57134f97d03c544043dcd28f615e3fac437a58a6cf716bc188c4d6c7bab324"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextRustCommandsKt.insertPlainTextRangeInRust (cyclomatic 25): EditorEditTextRustCommandsKt.insertPlainTextRangeInRust 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"752bad2744419535e2f393a46135df24d5c6aa2e03acb52f27e946286b287513"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorKeyboardToolbarView.buttonState (cyclomatic 25): EditorKeyboardToolbarView.buttonState 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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c9389c63bd933dd460a5c126ca0d43c987cc9eb98001984ec5898aa63cddd"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applySelectionFromJSON (cyclomatic 25): EditorTextView.applySelectionFromJSON 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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a4a008514d21bcc12eb01bcd8a2f32ef10dbb514474cc8fe9ecd76e6dbe762"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableInputCoordinator.projection (cyclomatic 25): EditorTableInputCoordinator.projection has cyclomatic complexity 25 (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":"ios/Tables/EditorTableInputCoordinator.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec7cb92f4f9219ed7a866e0b88689e1533067e806358af090676fd7642cc4d"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.paint (cyclomatic 25): PreparedProseDrawingView.paint 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f40ac71dfe8226f2fa15fd2849bd5593450b3cbf52a18a1ecf04964b847f4cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerImagePipeline.updateVisibleRect (cyclomatic 25): ViewerImagePipeline.updateVisibleRect 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":"ios/Viewer/ViewerImagePipeline.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ba35419f330c11866330690b4d524c2cc9b5c3ca9a318ef2f7de710bf665c1"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaDefinition.validateAttributeDOMRules (cyclomatic 25): schemaDefinition.validateAttributeDOMRules has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. 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":"src/schemaDefinition.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12d37df0db422b701b69cda474ebcfe23e1c605f6576a0982d37a4dd34f75b2"}},{"ruleId":"D1","level":"warning","message":{"text":"OperationCompiler::compile_edit_structure (cyclomatic 24): OperationCompiler::compile_edit_structure 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/editor-core/src/yrs_engine/compiler/operations/batch.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bb691f87fbb1a02da25e85480a7ed71396215bf0962212d364ddef72d15f89"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::render::incremental::generate_block_inner (cyclomatic 24): editor_core::render::incremental::generate_block_inner 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/editor-core/src/render/incremental.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3cc5c40cdbb4b331128f30001057f4428196ab5a26d0432e8eef737b1f6576"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::markdown_out::block_kind (cyclomatic 24): editor_core::serialize::markdown_out::block_kind has cyclomatic complexity 24 (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/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"77756dfbb8fb5c26ce9b10cf515204b296fbfcccf83d49bdfc7e2b0fbdd1b081"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::commands::format::plan (cyclomatic 24): editor_core::yrs_engine::commands::format::plan 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/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc50cf23002bc46272b7e12c4816afbffadbd41ec4d2c81a565d08e6de78b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position (cyclomatic 24): editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c87e5e0a430c6d841cea3a4980edb58a32e60477c5aca6d76c2b150704576f2"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditText.dispatchKeyEvent (cyclomatic 24): EditorEditText.dispatchKeyEvent has cyclomatic complexity 24 (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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e740d11933ae0fc75d412ff8742230e5a9a61a99915cd547a188080a2a7633"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStyleSheetKt.overlaidWith (cyclomatic 24): EditorStyleSheetKt.overlaidWith has cyclomatic complexity 24 (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":"android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47206d9042c810729c60e033380c24c70d2ebfb04ca7c4a9bda50ffda3ef346"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerDocumentKt.lowerElements (cyclomatic 24): ViewerDocumentKt.lowerElements 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1066824112cf1964940d12bc048e81d5bd9a0b3d6a57e11be512d67327c8ac"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStyleSheetNormalization.normalizeEditorTheme (cyclomatic 24): EditorStyleSheetNormalization.normalizeEditorTheme has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8571343023600de77a42f61cbfac8de0ee5ab6d8166fba2512cb4add7ef76eb"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorResultNormalization.normalizeNativeEditorV2PeersValue (cyclomatic 24): NativeEditorResultNormalization.normalizeNativeEditorV2PeersValue has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3187d2853c6d4d01670a8cb6ede5a05be10d8586484ca447284dfccda880157"}},{"ruleId":"D1","level":"warning","message":{"text":"AtomHost.AtomHost (cyclomatic 24): AtomHost.AtomHost has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 126, 186, 196, \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":"src/AtomHost.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"256248bca4612dc43288afbf9fe6baeac48fc4677ea4f0e999b7f937c1aa8b59"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::boundary::write_json_frames (cyclomatic 23): editor_core::boundary::write_json_frames 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/editor-core/src/boundary.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f176c7fdcdb6c93e57ca0d57ea7db67888e2732d796ead3f999a3a2018e157"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::command_planner::text::plan_delete_scalar_range_impl (cyclomatic 23): editor_core::command_planner::text::plan_delete_scalar_range_impl has cyclomatic complexity 23 (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/editor-core/src/command_planner/text.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dd192d03e8fef9781a7eb8b8aca7300459be75b615710ac13c534cd3fe9bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2RenderValidationKt.validRenderElement (cyclomatic 23): EditorV2RenderValidationKt.validRenderElement has cyclomatic complexity 23 (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":"android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbab54cc16e3616b1d6598385b16cdb9c53e40f91c2e3e87f188e464745edb56"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoViewBindingKt.setEditorIdImpl (cyclomatic 23): NativeEditorExpoViewBindingKt.setEditorIdImpl 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewBinding.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bbda8789edd20d6560b2e562803d07f437824bd4cf2cfa83fb4548eeb9446f"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.bindCellShape (cyclomatic 23): StaticLayoutAndroidProseLayoutEngine.bindCellShape has cyclomatic complexity 23 (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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"7176d9ba24b63d96ceba72be9293a22b8d46110e3b39f1e3efaf108c7d311c63"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.onTouchEvent (cyclomatic 23): PreparedProseDrawingView.onTouchEvent 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"094b3bf6cb84ad38721ece85a4c58b8d4aebf1fda3b8a763aa8ad61fe48f39be"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterConfig (cyclomatic 23): NativeCollaborationTransportRegistry.parseProtocolAdapterConfig 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":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7541264b018f14caaf6478f960f3240d105863c8ecb7876be2d42d4838cd9378"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorAccessoryToolbarView.buttonState (cyclomatic 23): EditorAccessoryToolbarView.buttonState 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":"ios/NativeToolbar\u002BButtonStyle.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"15721e7b8e5c44e90ae9e079771c1b6cb444cd006beee21f61fc99847e6f10b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutCache.value (cyclomatic 23): PreparedProseLayoutCache.value 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d4d2b6fde661c3ed577fb838901ba1333bf856c27de2dd0720ca48c0a923e"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaNormalization.normalizeNodeHtmlRules (cyclomatic 23): schemaNormalization.normalizeNodeHtmlRules has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"src/schemaNormalization.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaa3c5ae76683c8cf880661414f2cf05a6ec53803ff1e68b4d6eaf9dfd929ef"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCollaborationTransport.collaborationProtocolAdapterDescriptor (cyclomatic 23): NativeEditorCollaborationTransport.collaborationProtocolAdapterDescriptor has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85c0b34ec911734172e9cf60df711805300fd74c9798e7640e1fda644dacf45"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeTransactionBridge::submit_native_intent (cyclomatic 22): NativeTransactionBridge::submit_native_intent 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/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0e4deba16657dc3b4701ff8b8e2b648c15556bdcf256820fce9e01259145f"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::from_json_with_limits (cyclomatic 22): Schema::from_json_with_limits 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/editor-core/src/schema/json.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3081a6399c78afced45207da49e89791d6240322f4cd20dfac1ab2e8176ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"AwarenessCodec::admit_update (cyclomatic 22): AwarenessCodec::admit_update 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/editor-core/src/yrs_engine/awareness.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7511199dfce465408440101e27973881801e869ef292405118fba2fbe7e77055"}},{"ruleId":"D1","level":"warning","message":{"text":"TableCommandSurface::is_available (cyclomatic 22): TableCommandSurface::is_available 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/editor-core/src/yrs_engine/commands/tables.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fca8facf31db9e1938ae58d738779771a691a1fc14fff2257cd6dba75eb4c9"}},{"ruleId":"D1","level":"warning","message":{"text":"YrsDocumentEngine::apply_empty_skip_transaction (cyclomatic 22): YrsDocumentEngine::apply_empty_skip_transaction 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/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8389f674bce24750728fe3b6cf84c51508158c40531e4940deb84864c9992851"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::tables::reference_grid::reference_pass (cyclomatic 22): editor_core::tables::reference_grid::reference_pass 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/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5982bd63a24c91264f5807864abec6987975cc17a5ed05996435be425cd74fe"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2AdapterMutationsKt.performNativeIntent (cyclomatic 22): EditorV2AdapterMutationsKt.performNativeIntent 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2a3ca9732197ecc6c09bbf5e20b7e8e7c921ce729aaaf6c5d1efb52a6de39e"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorUpdateIfNeededImpl (cyclomatic 22): NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorUpdateIfNeededImpl has cyclomatic complexity 22 (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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b89a201a70e19ed8ed2ad078c4ddf4ba29aa2d66740cf45e470dcd1a77c7fc"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.submitNativeIntentRecoveringStaleEpoch (cyclomatic 22): EditorV2Adapter.submitNativeIntentRecoveringStaleEpoch 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e4b943d5b020dd82f231c397748e06a175e2e913a20068dc83b5db7787c02"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.performMutation (cyclomatic 22): EditorV2Adapter.performMutation 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"862548e60cd2f59cae3479f0d68f033dd0540e1d52518dd446dfa6a1e194701e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.commitNativeTextMutation (cyclomatic 22): EditorV2Adapter.commitNativeTextMutation 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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef554cd35ea03f4aa37358163076f67b185da8143f7f779428857e0905f39db5"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoView.handleToolbarItemPress (cyclomatic 22): NativeEditorExpoView.handleToolbarItemPress 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":"ios/NativeEditorExpoView\u002BToolbar.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c950c8a064895c23fadaa327bb0f8ecc3abfa08be3be592604e15dd7275a672"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderImageLoadOwner.startLocked (cyclomatic 22): RenderImageLoadOwner.startLocked 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":"ios/SharedNativeImagePipeline.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d36a76ea1ba263836fac98f1dc3d6afc6c83cd2aef078699e23bfacaa0149a1"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableIndex.entry (cyclomatic 22): EditorTableIndex.entry 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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18757b504c719c362829d67ef95b79f7f0e2235eb52b8b8ddb4f56942bd57c5"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope (cyclomatic 21): editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope 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/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b7075a36b67d1ebf81c29ea22d508d51cb6b60e4463bc5673a971c09b96a3"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::selection::selection_plan (cyclomatic 21): editor_core::yrs_engine::compiler::selection::selection_plan 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/editor-core/src/yrs_engine/compiler/selection.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"494607b5047ffc7a0717fbf3f42c691101c9dc917e53a629286431a2144660bd"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::range::text_targets::drive_lookup_materialization_collector (cyclomatic 21): editor_core::yrs_engine::mutation::lowering::range::text_targets::drive_lookup_materialization_collector 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/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697e5b0f8eea6669a414b4579c4cdc1845d565cce73b5487ebb1b0b3a8b02da"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorResetUpdateIfNeededImpl (cyclomatic 21): NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorResetUpdateIfNeededImpl 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"846799e50c9ce173b670bda3b11c1aa9b649dcd0b0f89d916374b63a20330fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeToolbarItem.parseItem (cyclomatic 21): NativeToolbarItem.parseItem 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":"android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c72da4ac452e7c6e60e11d5a2f20180b6292895afa7dd52bd367cf78cb98f"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerTableSurface.replacingCells (cyclomatic 21): ViewerTableSurface.replacingCells 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":"android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6035a48537da402243639526ec16dfc68bc6e7e571ece111c4dcc0108b9aa5a6"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.hitResizeEdge (cyclomatic 21): PreparedProseDrawingView.hitResizeEdge has cyclomatic complexity 21 (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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae9018cf6e652429de850d6f8ef6adef57836e96d3bf08189e35b60597a8536"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerImagePipeline.updateVisibleRect (cyclomatic 21): ViewerImagePipeline.updateVisibleRect 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e034cb7a2bfdc6054eb75eee84907dfdda11f64ba3ef8bf32a7c36287007401"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.adoptExternalReset (cyclomatic 21): EditorV2Adapter.adoptExternalReset 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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f1f8436f3086c92ddc4e0c048043db7e5f8bfb0658cd235e22e35a13315b69"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.paragraphStyleForBlock (cyclomatic 21): RenderBridge.paragraphStyleForBlock 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":"ios/RenderBridge\u002BStyle.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a584e746018adbafff93b7e89c8a5891c16edb6005e59bbe7465f28ad0ead133"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorCellSelection.resolve (cyclomatic 21): EditorCellSelection.resolve 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":"ios/Tables/EditorCellSelection.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23a36e0d7ba06c2959a31636ac2b9224dbea7737cb9485edde8fe347b90cfd5"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.measurePlainCell (cyclomatic 21): CoreTextProseLayoutEngine.measurePlainCell has cyclomatic complexity 21 (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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78060a51e19e14880dee99fd516948c3e507cb76989b8e94f928807c498c307"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStyleSheetNormalization.property (cyclomatic 21): EditorStyleSheetNormalization.property 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca4f2ccbbde7b73ef0cc0ed7b8783d7a7d227e0d18db853b076f0abc1a8624"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaResolution.admitSchemaCollections (cyclomatic 21): schemaResolution.admitSchemaCollections has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"src/schemaResolution.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5238459c5cb4a0b6dd54ad5e7e57e58934f3a52878f9c752b3b936ed743c63bb"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorRenderNormalization.normalizeRenderSelection (cyclomatic 21): NativeEditorRenderNormalization.normalizeRenderSelection has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c840aa676865298e7444ee71e1499953fb63dd523deaa64b81c4393aa2e8c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.onAtomLayout (cyclomatic 21): useViewerAtoms.useViewerAtoms.onAtomLayout has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 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":"src/useViewerAtoms.tsx"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ab75fc3cc4ebc8e7396b64be23e49067dc7cbf284ed71c92640569c23f28e6"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorCommands.useRichTextEditorCommands.runAtomAction (cyclomatic 21): useRichTextEditorCommands.useRichTextEditorCommands.runAtomAction has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4134ff49b775d1d4423513de1ab5ad75951bed48a5a19e8fd679df9b8d054fc"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateJsonScanner::scan_value (cyclomatic 20): CreateJsonScanner::scan_value 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a018c967de6d904312247a86be8fed94e0a6a96e16eaa9d87f4fbba7b50588d7"}},{"ruleId":"D1","level":"warning","message":{"text":"CachedRenderBlocks::transition_localized_textblock (cyclomatic 20): CachedRenderBlocks::transition_localized_textblock 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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a28dc4e72e2f1081ddde5a05ba6749a269b7e8167c00e91ae14ce2653e71b"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::current_storage_insertion (cyclomatic 20): MutationCompiler::current_storage_insertion 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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb774dd3dc58649e4876977dc4d63463c8163beb915f2e0f7569331cf7feedc"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalizedSplitCompiler::try_new (cyclomatic 20): LocalizedSplitCompiler::try_new has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/index/localized_split.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa78711404625530245dee2683e0e931066b38a8ba13d99d97db607c95c7530"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::clipboard::replacement (cyclomatic 20): editor_core::clipboard::replacement has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9f918d78f7c61291795e9e20d75744c41ce8886491669815f17b523c3713f7"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::ffi_v2::native_frame::build_native_frame (cyclomatic 20): editor_core::ffi_v2::native_frame::build_native_frame 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/editor-core/src/ffi_v2/native_frame.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a453feb0a31c44ffaa589388219cc743068a2aaac51ff13f6c93cb435a309fb"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::transform::apply::range::insert_nodes_in_children (cyclomatic 20): editor_core::transform::apply::range::insert_nodes_in_children 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b5fd74d2b60e29ec73f41d54cbb6390669e722704311ca6bce8eb146010121"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::transform::apply::validation::validate_opaque (cyclomatic 20): editor_core::transform::apply::validation::validate_opaque 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/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d618200a1923f4d45cd75c4dde3ac5dc820a7b38df3813da69b2e770b1bd2b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorInputConnection.commitCorrection (cyclomatic 20): EditorInputConnection.commitCorrection has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dac08182873f02dd35d57e87699f785528090602270dbbc00719347330de1d"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2AdapterMutationsKt.performMutation (cyclomatic 20): EditorV2AdapterMutationsKt.performMutation 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c309663d722bb6715afc140dec618b9b7ca641fce50fad6de6a312fe4f556875"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorClipboardPaste.semanticHTML (cyclomatic 20): EditorClipboardPaste.semanticHTML 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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e53e4bc346cabd46be2b3bbed5c7c71539f31ca5b2eecc8beb49541a00e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.insertText (cyclomatic 20): EditorTextView.insertText has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView.swift"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bcb85f224fb05690328ed59ecf16e26e6304f47f4a57563577cab126ad8542"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applyNativeTextReplacementIfPossible (cyclomatic 20): EditorTextView.applyNativeTextReplacementIfPossible has cyclomatic complexity 20 (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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"157da4caaed40866a83c2527b58d3d88a1100fc2fadb91448a8c6ec82735eb19"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.beginExternalTextComposition (cyclomatic 20): EditorTextView.beginExternalTextComposition has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BExternalComposition.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a897f32b52d4510b249c604a1cc4c34b61fe226e5bc8337276efb1bfd46735e1"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterResponse (cyclomatic 20): NativeCollaborationTransportRegistry.parseProtocolAdapterResponse 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":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3510c76b17c7edf416e037eb1d07b7f9f9d0fcceea4a435b0b0ca73b17eec7f0"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.settleTableSelectionAfterTextSync (cyclomatic 20): RichTextEditorView.settleTableSelectionAfterTextSync has cyclomatic complexity 20 (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":"ios/RichTextEditorView.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf67c49217069727654044e837f1766dd0061c2abaf294595148216450c0a21c"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.toggleTaskListMarker (cyclomatic 20): RichTextEditorView.toggleTaskListMarker 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":"ios/RichTextEditorView.swift"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f729b43296bde7b350b0106a10fef7eaa7eb9ec0ff5840a39a280764ed6f62ac"}},{"ruleId":"D1","level":"warning","message":{"text":"atoms.defineAtomNode (cyclomatic 20): atoms.defineAtomNode has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/atoms.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"136cb4b808adb70c36bf89b751314b2cf4be762737132e455c8ba2de2bcb1133"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCreateJson.appendV2JsonString (cyclomatic 20): NativeEditorCreateJson.appendV2JsonString has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb28198d0aa92f9369f9c6bdbdbdcde3fd57ee7ca542d70cbe83e2c1f6567ec"}},{"ruleId":"D1","level":"warning","message":{"text":"CollaborationRuntime::process_admitted_message (cyclomatic 19): CollaborationRuntime::process_admitted_message 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/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"845e9da269fb8b2e9ecefa58182533b3f528cc05fcafdb4914702a8eb192b40b"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateJsonScanner::scan_string (cyclomatic 19): CreateJsonScanner::scan_string 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7d6537c8036107c75935b789d98b79419f4b8520078c1f4ea76767d7c08e01"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::validate_constructibility (cyclomatic 19): Schema::validate_constructibility 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/editor-core/src/schema/construction.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb16d75fe0fbd997576186c99409b4fa17c718b22e199108271b2f9e5fb295d8"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::try_wrap_prepared_root_batch (cyclomatic 19): MutationCompiler::try_wrap_prepared_root_batch 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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc50346dbb8840e73f7faab664edad8f1a89e2c6c7fd4ddeb880ab4f5299f22"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::replace_structural_range (cyclomatic 19): MutationCompiler::replace_structural_range 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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9073be2e7858b98ec9627e43bad7f32646007e302bb87c7270f4b18c037fc3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::ffi_v2::render::serialize_render_element (cyclomatic 19): editor_core::ffi_v2::render::serialize_render_element 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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de266ee69942e27ea87caf4b49d142506a4c50b657e6ccc3381133f7fffec0b"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::html_out::serialize_nodes (cyclomatic 19): editor_core::serialize::html_out::serialize_nodes 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/editor-core/src/serialize/html_out.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a8e3081326507c43e9d059dc9e97812001974308551f913b7c303ed683f69"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::commands::text::semantic_transaction_impl (cyclomatic 19): editor_core::yrs_engine::commands::text::semantic_transaction_impl 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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeb1853a2334ea1dfc3acbef6d2c508378f0dd948df44a5da8f14437771dd3c"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent (cyclomatic 19): editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent 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/editor-core/src/yrs_engine/mutation/lowering/index/localized_locators.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"766fb3bc2b82553648cc0b10d4886c24e54acec05e4cc85352da10d53fd20e17"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextClipboardKt.handlePaste (cyclomatic 19): EditorEditTextClipboardKt.handlePaste 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d822e0123c4f5d7cd9defb83b8bad8a1ab04267886cac15bd5f6b66599ab1a"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.retainedBlockMetadata (cyclomatic 19): EditorEditTextRenderPatchKt.retainedBlockMetadata 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7024165f7b97f1edaa58af7cb7c6882707b8236d4135b2641a2279c99ad3f431"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextRenderingKt.applyRenderedSpannable (cyclomatic 19): EditorEditTextRenderingKt.applyRenderedSpannable 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3167dac313e365eff9e2f7e11bc6be57a68e7d4d2967bcfc5a60224ed3794b83"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextSurfaceInteraction.onTouchEvent (cyclomatic 19): EditorTextSurfaceInteraction.onTouchEvent 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec74cb0b42d2ab41de484a1c7eb1d701e8333ce3ac1bb09b391c13d5d891110c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorScrollView.onInterceptTouchEvent (cyclomatic 19): EditorScrollView.onInterceptTouchEvent 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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe595c2cfe44f3c330752911700b6044ecf7c2ca0144d8c404756833d03b113"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStyleSheet.applyText (cyclomatic 19): EditorStyleSheet.applyText 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b38fb1c2494f8c209a8a35de4dcfac7ed6bc4618b7422746715c16e89cbbac"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.commitNativeTextMutationIfPossible (cyclomatic 19): EditorTextView.commitNativeTextMutationIfPossible 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":"ios/EditorTextView\u002BNativeInputLifecycle.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb93187e666334c1614c5dab460eb81aa29ef7c79df5209ccf6ed322ede55502"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.shouldPreserveAcceptedAutocorrectSpace (cyclomatic 19): EditorTextView.shouldPreserveAcceptedAutocorrectSpace has cyclomatic complexity 19 (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":"ios/EditorTextView\u002BNativeMutation.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3fa625be6ce874de40a4c7ac0de7b5d85de31cc16e8cf7761e65282262b897"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.attributesForMarks (cyclomatic 19): RenderBridge.attributesForMarks 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":"ios/RenderBridge\u002BAtoms.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9717926a48d9818d7b51489c136b2dd3d3f2c2a0e6a9076ea9d52b741c14d963"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerTablePresentation.project (cyclomatic 19): ViewerTablePresentation.project has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (appendLayout::appendBlocks, appendLayout::appendInteraction, appendLayout::appendAccessibility). 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"18234b4c853b0547debe0d98b7c143daa8a02dc68af6e5a106f734cca7cbca6b"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerDocument.cellSupportsBackgroundPreparation (cyclomatic 19): ViewerDocument.cellSupportsBackgroundPreparation 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6349a588d13ea095cfcd09f249987a7b49452eb3967a7b1660e425993b1a4f68"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorAddons.swift.resolveMentionQueryState (cyclomatic 19): EditorAddons.swift.resolveMentionQueryState 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":"ios/EditorAddons.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d30fbef7a56a5eb1c5d11311b4441ba91c70a53673447301ec42a62c35fed0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorModule.swift.v2MutationResultDictionary (cyclomatic 19): NativeEditorModule.swift.v2MutationResultDictionary has cyclomatic complexity 19 (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":"ios/NativeEditorModule.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a56330bc6e7aa095c5e982f9c6789814aaf567721665b80dc8644723d7ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorStyleSheetNormalization.normalizeStyle (cyclomatic 19): EditorStyleSheetNormalization.normalizeStyle has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3485064ee8f669fb60360269c7113e06572b022820b50859abe44eb945982b"}},{"ruleId":"D1","level":"warning","message":{"text":"atoms.normalizedHtmlRules (cyclomatic 19): atoms.normalizedHtmlRules has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/atoms.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d850168f32f154ed12f16ce9f250f0db8fe38b04386e0c22c63b3af3e54df12"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaNormalization.normalizeNodeJSONProjection (cyclomatic 19): schemaNormalization.normalizeNodeJSONProjection 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":"src/schemaNormalization.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c5b1c718a686131345853d01fda7f4355a187c672f936cf89b4537b96b96e9"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCreateJson.chargeV2JsonStringBytes (cyclomatic 19): NativeEditorCreateJson.chargeV2JsonStringBytes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0c1ffbeaf1eca5bb975f4c59e77b8484f12d1fd123c8d3760b109ae89dc92"}},{"ruleId":"D1","level":"warning","message":{"text":"CachedRenderBlocks::transition (cyclomatic 18): CachedRenderBlocks::transition 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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618f00262c56caa153194acab3c5f81744f5952625608a0604de70ec6c2972c"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::normalize_existing_target_for_split (cyclomatic 18): MutationCompiler::normalize_existing_target_for_split 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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28fba2575ee00a918703a460ae488d640733c8b7febe4fa6faf12c27113aa30"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::command_planner::empty_blocks::empty_block_delete_action (cyclomatic 18): editor_core::command_planner::empty_blocks::empty_block_delete_action 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/editor-core/src/command_planner/empty_blocks.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"8534cd55bc03aac66f97528f49ac8730a5be181b3bc16e697ff26a7e04b7553f"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::command_planner::structure::diff::structural_diff_nodes (cyclomatic 18): editor_core::command_planner::structure::diff::structural_diff_nodes 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/editor-core/src/command_planner/structure/diff.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc8949b2838049affcd399172d8d04c8a12ca6b26059652e638238b60d3fc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::ffi_v2::editor::create_scanner::scan_initialization (cyclomatic 18): editor_core::ffi_v2::editor::create_scanner::scan_initialization 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4310f7a88fb5305f0a7d8795140233b5b4475ea97611bcbc5f91696bfffeda01"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::render::generate::walk_children (cyclomatic 18): editor_core::render::generate::walk_children 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/editor-core/src/render/generate.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94660c878012fbbf455a3ef9ae660bf5c98293301070e6bcd30fd13f32331a3"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::json_in::parse_node (cyclomatic 18): editor_core::serialize::json_in::parse_node 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/editor-core/src/serialize/json_in.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dd444769d68925be1731e547f64e86f01e6c96f814aa8446bc6eee11b6a826"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::resolve_insert_position_budgeted (cyclomatic 18): editor_core::yrs_engine::compiler::insert_position::resolve_insert_position_budgeted 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9aab53d052afb91e2f96fcb58841487a3b8d0e246a319f0ca17b3f85d885d47"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope (cyclomatic 18): editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope 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/editor-core/src/yrs_engine/mutation/plan/envelope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06809f129ab4c08f1f16b1f12ef20224721a68f7d92b00a1fb8ce08ae28eb445"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextDeletionKt.handleBackspaceImpl (cyclomatic 18): EditorEditTextDeletionKt.handleBackspaceImpl 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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"13beeaa285a3aeaa2931c9747af3848ba19f97dd437f9187be5c31162ffe76e2"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorInputSurroundingDeletionKt.performPlainSurroundingDelete (cyclomatic 18): EditorInputSurroundingDeletionKt.performPlainSurroundingDelete 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":"android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fa643d84a51df5c8bd1c5d82b9dbc374bacd9a704c50ffd5ee171d19e46258"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoViewUpdatesKt.applyEditorResetUpdateOutcome (cyclomatic 18): NativeEditorExpoViewUpdatesKt.applyEditorResetUpdateOutcome 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"57024cd01cbd07ed37228c9f1db3a760df40dcb5a9e5e2892292fca9d9ae8771"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.onDragTouch (cyclomatic 18): EditorTableSurface.onDragTouch 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a15a9a387a71bf40655435593256e8e0f4b30e221ddf2b1a2659160365f11e8"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseViewerManager.createViewInstance (cyclomatic 18): PreparedProseViewerManager.createViewInstance 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eb050631b03042e2423fd9448d63ea968cb244f330375c6e12ba54cc88aac0"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.trimmedAttributedPatch (cyclomatic 18): EditorTextView.trimmedAttributedPatch 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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"386fc5873f4d40c8fd6d925c87a30850ba3be3a07714ab5fefd289264bad2c97"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.isAtTableCellArrowBoundary (cyclomatic 18): EditorTextView.isAtTableCellArrowBoundary has cyclomatic complexity 18 (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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe82578ca4b0d23c39d02c044215c7bb24ae143bcd5b54ef2db854b94fb538f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applyTopLevelChildMetadataPatch (cyclomatic 18): EditorTextView.applyTopLevelChildMetadataPatch 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5674e154e41708c15fee01f70ffb7608ec08c6e24dcdebee9b216a0c313ec38"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.enqueue (cyclomatic 18): NativeCollaborationTransportRegistry.enqueue has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8180f02e8a1146824108a8d958417657f30ffbf1f5445fad69281c929e5fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoView.applyEditorUpdateOutcome (cyclomatic 18): NativeEditorExpoView.applyEditorUpdateOutcome 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":"ios/NativeEditorExpoView\u002BUpdates.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5a754f4fc2f3d26978e381e9ca34b8ed689bf45cd485fb8e7dfbeb9e29889e"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.collapseStyledSiblingMargins (cyclomatic 18): RenderBridge.collapseStyledSiblingMargins 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5567553804e97603f8b955f79ed152a034474c46c44eabccf9f67cc6987d8493"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.resolveTableCellDrop (cyclomatic 18): EditorTableSurface.resolveTableCellDrop 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":"ios/Tables/EditorTableSurface\u002BCellDragDrop.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c80650c2d9f17485bdfab72ac2f3ec24152800e1bd69f1f87027ba0962754fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerTableSurface.init (cyclomatic 18): ViewerTableSurface.init 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 cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0d19d0cb74d3c4915568711455662c41fe684e342e907efe5fba34151e4718"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.drawTableChromeBorders (cyclomatic 18): PreparedProseDrawingView.drawTableChromeBorders 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6384873c7e46e0562a9973a1f7080af7a4ede919fc750003a8dd8d0053f1f4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCollaborationTransport.serializeCollaborationProtocolAdapterResult (cyclomatic 18): NativeEditorCollaborationTransport.serializeCollaborationProtocolAdapterResult has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f185b5e853fd0819371083d8e4128cec5428e8db04ddfb5ae58800483adbc970"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorAddonNormalization.normalizeEditorAddons (cyclomatic 18): EditorAddonNormalization.normalizeEditorAddons has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorAddonNormalization.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1cdf333dcf7ee2214856d4041888f5ab313a7f5bc3c6caa7a2dd40ef84165a"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorCommands.useRichTextEditorCommands.updateAtomAttrs (cyclomatic 18): useRichTextEditorCommands.useRichTextEditorCommands.updateAtomAttrs has cyclomatic complexity 18 (threshold 15). Of this number, 17 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eb2ced4b9928e3b0a4bf1ee0314f0a8639fde27a45d8493ffd4569492c9931"}},{"ruleId":"D1","level":"warning","message":{"text":"useRichTextEditorMentions.useRichTextEditorMentions.insertMentionSuggestion (cyclomatic 18): useRichTextEditorMentions.useRichTextEditorMentions.insertMentionSuggestion has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7727e45fc87ad87b7ebe39ad55e8fd3e98536fd96a7f1e571b7853385eafec4b"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonValueMeter::admit_object (cyclomatic 17): JsonValueMeter::admit_object 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/editor-core/src/boundary.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d9d12ecbcf694e45854f8d5d5d1fd3dd39a431c2d32e32a8369a8622ec4e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"YrsHistory::availability_audit (cyclomatic 17): YrsHistory::availability_audit has cyclomatic complexity 17 (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/editor-core/src/yrs_engine/history/availability_audit.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e2b78ea3de4c7316cd6a045dfcc95510cfa71d07369b813c1618bc79a93050"}},{"ruleId":"D1","level":"warning","message":{"text":"YrsHistory::unmirrored_stack_metadata_bytes (cyclomatic 17): YrsHistory::unmirrored_stack_metadata_bytes 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/editor-core/src/yrs_engine/history/capture.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"307c07f0d17c529cf74df1d532e547377fa50825d45e2459ae97e3db5358b30f"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportTextCaptureWork::observe (cyclomatic 17): ImportTextCaptureWork::observe 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/editor-core/src/yrs_engine/mutation/lowering/import_lookup.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0d7cdecc68cc7771030c37b719080a6f3ba843f4ecba538f23430e828f706b"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::outdent_list_item (cyclomatic 17): MutationCompiler::outdent_list_item 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":"rust/editor-core/src/yrs_engine/mutation/lowering/list/indent.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c22aabdb23580e2f56f770e50a53f3c916330e3bd5428e713a942f6b0e53467"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::editor_state::structure::can_unwrap_list_item_local (cyclomatic 17): editor_core::editor_state::structure::can_unwrap_list_item_local 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/editor-core/src/editor_state/structure.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e28a7fefde62771a11890c8764e3728eb93823174844eec0e013f85b8df9d"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::tables::commands::paste::plan_matrix_paste (cyclomatic 17): editor_core::tables::commands::paste::plan_matrix_paste 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/editor-core/src/tables/commands/paste.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"190333b4313db5077ad3826365ba038c0dca244bb4feec5ebc9e0cbbaa755be4"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorCaretOverlayView.canDrawSeparately (cyclomatic 17): EditorCaretOverlayView.canDrawSeparately 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":"android/src/main/java/com/apollohg/editor/EditorCaretOverlayView.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca584b9376f3b9a461fa99e6c360a02c7d1798523abd249b3c502a496daa3de9"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.jsonValuesEqual (cyclomatic 17): EditorEditTextRenderPatchKt.jsonValuesEqual 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841a405ed4ca39655c872aff471c2c8eca8380e4d10a597fa5b069b8475763f"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderImageDecoder.decodeSvgLease (cyclomatic 17): RenderImageDecoder.decodeSvgLease 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d53dca3a30040494375956b81bb17c5b4988035fa57492ff2b2cf4febb08dc"}},{"ruleId":"D1","level":"warning","message":{"text":"TableGridLayout.relayoutCells (cyclomatic 17): TableGridLayout.relayoutCells 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":"android/src/main/java/com/apollohg/editor/tables/TableGridLayout.kt"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1ef4b3499d98adba6a4bc47b364257c01453f8dcb0e5f18429ba620a46ebda"}},{"ruleId":"D1","level":"warning","message":{"text":"FallbackSelectionGeometryKt.fallbackSelectionRectsForGeometry (cyclomatic 17): FallbackSelectionGeometryKt.fallbackSelectionRectsForGeometry 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":"android/src/main/java/com/apollohg/editor/viewer/FallbackSelectionGeometry.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba323c757c3ebb92a9bddfddfcad0c8a9d1380d0addb7d38320ceb911d1d9192"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutRegistry.measure (cyclomatic 17): PreparedProseLayoutRegistry.measure has cyclomatic complexity 17 (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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4af6bf55d310ac8005346b9c153fd60b868be6851336b985d1be118128c935"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteSelectionDecoration.from (cyclomatic 17): RemoteSelectionDecoration.from has cyclomatic complexity 17 (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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"07292d6a01e2f087766eb7ab99efcb0da1c829c53927bf10dc5b67493bea7bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.applyRenderPatchIfPossible (cyclomatic 17): EditorTextView.applyRenderPatchIfPossible has cyclomatic complexity 17 (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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae56d049d6214a54205efa21c5ee40bef2afdabc926095f34c0fa0549d682c5"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.currentLogicalScalarSelection (cyclomatic 17): EditorTextView.currentLogicalScalarSelection 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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14a74ddc2d0dfc6cd97927cd3307d239764f6b7a845585b400c4485fd5a201b"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransport.normalizeDirective (cyclomatic 17): NativeCollaborationTransport.normalizeDirective has cyclomatic complexity 17 (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":"ios/NativeCollaborationTransport\u002BValidation.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087f8a01f528cddce2a8eeded3ba949269c718891345eb56b374cf7bc6af5e9"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoView.setEditorId (cyclomatic 17): NativeEditorExpoView.setEditorId 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":"ios/NativeEditorExpoView\u002BBinding.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0ee12f24a91fc48e6a90dd14743fc232ba0bdf7f427991717f551db1bf2dbf"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeToolbarIcon.from (cyclomatic 17): NativeToolbarIcon.from 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":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d47f131c1859eeef6264581e72264399f4937ebbe0d28a8cb48f7c4e1c7f84"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.inputElements (cyclomatic 17): RenderBridge.inputElements has cyclomatic complexity 17 (threshold 15). Of this number, 16 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":"ios/RenderBridge.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"808e7ea19b9ba0f464cb165e80a377f21a4d17930bc431cc3eb0b299a9ada82a"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.closeStyledBlock (cyclomatic 17): RenderBridge.closeStyledBlock 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbe32fa3ee546a386715cdb1ccfffe97499a5929da0027de75d11db6cfa97f2"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderBridge.applyBlockStyle (cyclomatic 17): RenderBridge.applyBlockStyle 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":"ios/RenderBridge\u002BStyle.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9940f03c26957bfefe13c592d56c1d140bff4c897ca3d564167cff23e8331e"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeCellPreparation (cyclomatic 17): CoreTextProseLayoutEngine.makeCellPreparation 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f30f0a0d61d541cd966c6d5fd8db647875c481320fb1ea0358b47adb10c40e5"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutRegistry.preparedDocument (cyclomatic 17): PreparedProseLayoutRegistry.preparedDocument 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":"ios/Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd8e131336245d079a4844b45ef452d056cb27fdba9102d84e298b1c2b0929"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorCollaborationTransport.decodeNativeCollaborationProtocolBytes (cyclomatic 17): NativeEditorCollaborationTransport.decodeNativeCollaborationProtocolBytes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1339f47107d2aa14c4f3a2654cf737956cb7f541b4f2c91bebb61873aff707"}},{"ruleId":"D1","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.updateAttrs (cyclomatic 17): useViewerAtoms.useViewerAtoms.updateAttrs has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (execute, clean). 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: useViewerAtoms.useViewerAtoms.measure (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useViewerAtoms.tsx"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2bbe5da73597e586e0ab4accc0eb148cc62d69522d878786be03bb2a769a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"TableNormalization.normalizeNativeTableSelectionGeometry (cyclomatic 17): TableNormalization.normalizeNativeTableSelectionGeometry has cyclomatic complexity 17 (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":"src/TableNormalization.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"70db08270eae7708e201846a7b8744d53c8ce9f9b0d74d7a765ae01d265c865f"}},{"ruleId":"D1","level":"warning","message":{"text":"YjsCollaboration.peersToRemoteSelections (cyclomatic 17): YjsCollaboration.peersToRemoteSelections 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 one function literal inside it that branches (line 196). 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":"src/YjsCollaboration.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d48c28966aafe7ed699720a8c731d8228aa4a43ea4f46707a09ccf5afaf70"}},{"ruleId":"D1","level":"warning","message":{"text":"AttrSpec::validate_definition (cyclomatic 16): AttrSpec::validate_definition 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/editor-core/src/schema/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d2e7129bbebfb3b627392fb2bc373c4b2263c19cf1ce53cbad103fa68ac35"}},{"ruleId":"D1","level":"warning","message":{"text":"TableRenderContext::retain_cells (cyclomatic 16): TableRenderContext::retain_cells 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/editor-core/src/tables/render.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce84b9df2923cedad13ae5d03c9807d929eeb9ac0c6252c442657ba41e3a0b40"}},{"ruleId":"D1","level":"warning","message":{"text":"DerivedStateCache::after_document_change (cyclomatic 16): DerivedStateCache::after_document_change 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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"5114c26467bb69114542df6fa50f457adb518e7701c818b94fa343b076ada0a2"}},{"ruleId":"D1","level":"warning","message":{"text":"YrsDocumentEngine::prepare_remote_update_internal (cyclomatic 16): YrsDocumentEngine::prepare_remote_update_internal 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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d5371b8c9a10b6dcc58bd9e8ca70f2dff4d2d9011ed11bbeef968407c4243"}},{"ruleId":"D1","level":"warning","message":{"text":"YrsDocumentEngine::prepare_position_epoch_splice (cyclomatic 16): YrsDocumentEngine::prepare_position_epoch_splice 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/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48ab2750c79006811a72d6c8e28696eaba11905193ea804d4df0808bd9975f3"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::shift_child_actions_after_insert (cyclomatic 16): MutationCompiler::shift_child_actions_after_insert 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/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c936ba125f5d0c60feb4977d59db8d7eaf7519babc07b5514c769a083604a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"MutationCompiler::remove_prepared_children (cyclomatic 16): MutationCompiler::remove_prepared_children 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/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5e509675a7df7a2d98ecf465759f227582f08bb82fe73c4ba3a067157cd823"}},{"ruleId":"D1","level":"warning","message":{"text":"PreflightReader::read_content (cyclomatic 16): PreflightReader::read_content 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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18a060bcf45a650c8da6e0062fcdae51c4d3dddd7443682167e60f79926d43d"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::html_in::extract_node_attrs (cyclomatic 16): editor_core::serialize::html_in::extract_node_attrs 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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8958b125d3cd6775c22e37d88120df83e27684ca5ae4c371441440f70e58dc56"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::serialize::markdown_out::inline::wrap_mark (cyclomatic 16): editor_core::serialize::markdown_out::inline::wrap_mark 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/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"088b8e8b3f5016e641fefa7b08b4008d940ad198d9ee20daf62e59c5a0e42534"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::transform::apply::list_wrap::apply_wrap_in_list (cyclomatic 16): editor_core::transform::apply::list_wrap::apply_wrap_in_list 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/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e609e61ffebedbce2581e29ee421495b40e90c708723cecb27aa99f91cf964d"}},{"ruleId":"D1","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_match::match_xml_element_json (cyclomatic 16): editor_core::yrs_engine::codec::projection_match::match_xml_element_json 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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f176eb5236aec63fe6bfa5fa6b6a6f5aae2d80f15d61b9d3b39d67b0f04ba539"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextDeletionKt.handleDeleteImpl (cyclomatic 16): EditorEditTextDeletionKt.handleDeleteImpl 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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c0cd406505ef3d0e73869a5489f6b373cabf92abefd874e9cefc4a8f0d6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextExternalCompositionKt.finishExternalTextComposition (cyclomatic 16): EditorEditTextExternalCompositionKt.finishExternalTextComposition 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":"android/src/main/java/com/apollohg/editor/EditorEditTextExternalComposition.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"243df26593549c2c93d051f721d4bf518c6a8d9c5f1ea19f9aae94881ebd7059"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorEditTextSelectionKt.applySelectionFromJSON (cyclomatic 16): EditorEditTextSelectionKt.applySelectionFromJSON 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":"android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"567be28f8f33dbe3623a76d0dcfecb0fc7f55faf8350e0ff5c412210639fcffb"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2AdapterRenderingKt.adopt (cyclomatic 16): EditorV2AdapterRenderingKt.adopt 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ceeb89fb867a5606a1ef0489f647035dbbdb940fa8e0e6f05767ba7e96bd81"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterResponse (cyclomatic 16): NativeCollaborationTransportRegistry.parseProtocolAdapterResponse 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":"android/src/main/java/com/apollohg/editor/NativeCollaborationTransportRegistry.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f747c1b9241ef6525d8178aa1145f40667b9e6be7dd65ca0fa9e4f679cb61cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderImageDecoder.preflightDataUrl (cyclomatic 16): RenderImageDecoder.preflightDataUrl 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc7fd97809b02f1fdcc0d58c44fcbef69c2d5d13097bf27d665e06b612aaee4"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.reconcileActiveCell (cyclomatic 16): EditorTableSurface.reconcileActiveCell 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9145fcfd5c82f79c4ae24d6a26e32ee2a7d9f01e94b0cc902b53d158eabbba3"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.install (cyclomatic 16): PreparedProseDrawingView.install 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62addab8e402c556bad4ea8252ceec69b2a838d65c9baf877c006d4c4e126dc"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteSelectionOverlayView.refresh (cyclomatic 16): RemoteSelectionOverlayView.refresh 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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a282d00bdcc457b904ee63cc7057dcdadc33a63b038df5bdaeea109172b07341"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorLayoutManager.layoutManager (cyclomatic 16): EditorLayoutManager.layoutManager 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":"ios/EditorLayoutManager.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4997c4e6ca4054e4247528fda1a2cc22b5a2e9d969977bff34f926f0eecf00b0"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorClipboardPaste.command (cyclomatic 16): EditorClipboardPaste.command 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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b537ea51a4961bf9426746a0c264132df6ce0144a8c7eaa88b68069eea2b49f"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTextView.scheduleCodeHighlighting (cyclomatic 16): EditorTextView.scheduleCodeHighlighting 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":"ios/EditorCodeHighlighting.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fcdf5c1461f45530256a2e186c4a95a2e788db59b7de2ebedd22abe69f589c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTheme.init (cyclomatic 16): EditorTheme.init 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":"ios/EditorTheme.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8a7233ef78eeacc603a0eedb332c8885d90e1e31b65c552681540fc10886f7"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.parseTableAttributes (cyclomatic 16): EditorV2Adapter.parseTableAttributes 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a6ea4f2f9c3df852e23a110c81e1fddf3e7b6cd0b75fa0da7be2a71d408bc"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorV2Adapter.scalarSelection (cyclomatic 16): EditorV2Adapter.scalarSelection 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2223e74e0b30d8832bb51119ada794cf93ec81922c1b7ff64a065dd8f6610c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeCollaborationTransport.receiveNext (cyclomatic 16): NativeCollaborationTransport.receiveNext 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":"ios/NativeCollaborationTransport\u002BSocket.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfaf5722e0bf04053c03dc0c41ffb48a9a94caca630af08572bb160985416e9"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeEditorExpoView.insertMentionSuggestion (cyclomatic 16): NativeEditorExpoView.insertMentionSuggestion 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":"ios/NativeEditorExpoView\u002BMentionRetry.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d975ab33fc0f24e0a44ec823fde523625ce0efd38abf90c2bc49e8fb53dcfc9b"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockImageAttachment.attachmentBounds (cyclomatic 16): BlockImageAttachment.attachmentBounds 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":"ios/RenderBridge\u002BAttachments.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e4a7b94383d0d51d55151762c72cb8d4e9c7ffa4d653a001fd8d29cf140ae2"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.bindTableCell (cyclomatic 16): RichTextEditorView.bindTableCell 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":"ios/RichTextEditorView.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d743402f54dd4dfc4d00f890a712d7882007d76d5632e6188da21aa043b1c86a"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorView.surroundingProseScalar (cyclomatic 16): RichTextEditorView.surroundingProseScalar 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":"ios/RichTextEditorView.swift"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"246c7ddefcf62b5286d5caabf6e9080882f2ee5f91f52eb7abe596fbf2e1cba5"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableIndex.validate (cyclomatic 16): EditorTableIndex.validate 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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ea7a051bc05d9612aaa47dec39b9979b8b565932c3fd35b08fc0d57d16ad5a"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.remoteTextInput (cyclomatic 16): EditorTableSurface.remoteTextInput 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"034255996626de736cf11d0cb30a3ff0dae1450df164b44cd7f58961f7fac1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.cellEditMenuActions (cyclomatic 16): EditorTableSurface.cellEditMenuActions 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440153842b79e54fa57ed18367a9afa49da684e2f3cfb0c74120e16a3a422df"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorTableSurface.retargetHandleDrag (cyclomatic 16): EditorTableSurface.retargetHandleDrag 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7612d78bbd3f2658f9fa3717625d20663c6315bb4ffb40b15f5c9784e5c7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreTextProseLayoutEngine.strikeFragments (cyclomatic 16): CoreTextProseLayoutEngine.strikeFragments 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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d5ac97ba729455acb8232bf169832752b2198b5ad96fbb5d00d389b985d2b7"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.boundCellChrome (cyclomatic 16): PreparedProseDrawingView.boundCellChrome 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f60418dde5820870309254d97128819f163b689256c8c69463ec98f51a0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseDrawingView.drawForeground (cyclomatic 16): PreparedProseDrawingView.drawForeground 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2d90e2769063c27c9dc5201e7c8860c34f1f85b0c16b5ba746f5572fa2eecb"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutCache.acquireForFabricMount (cyclomatic 16): PreparedProseLayoutCache.acquireForFabricMount 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11e0d030b95ea4382407ac86cf8067cdc45c6fef3c49deb5a592d9bee8e513"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedProseLayoutCache.contribution (cyclomatic 16): PreparedProseLayoutCache.contribution 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7af693b78898f1a357a5cd464e2a15e5e6d442212e12814a4b102a9391418b0"}},{"ruleId":"D1","level":"warning","message":{"text":"attributeValidation.validateAttribute (cyclomatic 16): attributeValidation.validateAttribute 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":"src/attributeValidation.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e150b79736282e9375fd9cdd548b00b99b69ee5db578e14aa0e1f6f08ea687a3"}},{"ruleId":"D1","level":"warning","message":{"text":"schemaNormalization.isSafeHtmlAttr (cyclomatic 16): schemaNormalization.isSafeHtmlAttr has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item 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":"src/schemaNormalization.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"81380ba9ee9aed00357e02e4318e04137fb6a82a6eb58c93c291959ce7e6081a"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedExternalTextCompositionSession.commit (cyclomatic 16): ManagedExternalTextCompositionSession.commit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fb50b68b696770c92e21f3d53029fa00f52b700c7fe18e6b565a42890ba6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.children (cyclomatic 16): useViewerAtoms.useViewerAtoms.children 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. This is NOT this file\u0027s highest cyclomatic complexity: useViewerAtoms.useViewerAtoms.measure (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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useViewerAtoms.tsx"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c05461c97319cacd1eddf9a0282a2a10ab17365fdcd757d8ae6df18fbe697d"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeProseViewer.RichTextViewer (cyclomatic 16): NativeProseViewer.RichTextViewer has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 3 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":"src/NativeProseViewer.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de116f46b996d448491e6b9e3abd9444bfc744e005cc11209abcc552ffcb03"}},{"ruleId":"D1","level":"warning","message":{"text":"RichTextEditorSerialization.parseSelectionFromUpdate (cyclomatic 16): RichTextEditorSerialization.parseSelectionFromUpdate 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":"src/RichTextEditorSerialization.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ba9e3bd0d17abc01c95c22732450be7c8c5f144129b64591af4ee85d7cf1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridgeElementsKt.appendElements (cognitive 207): RenderBridgeElementsKt.appendElements has cognitive complexity 207 (threshold 15). Drivers by points: if/else 60 (182 pts), boolean chains 19, match/switch 2 (5 pts), loops 1 (nesting depth added 125). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"478c4c93e756bbc11e79c4bfce59795de19bf1e8aa60e1fadef6f38aa461b959"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.renderElements (cognitive 157): RenderBridge.renderElements has cognitive complexity 157 (threshold 15). Drivers by points: if/else 41 (117 pts), boolean chains 20, ternaries 4 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedf9d2c0c26e717b22bc394001c1abcb805b996794b2ca4710adb977b52a72d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makePreparation (cognitive 133): CoreTextProseLayoutEngine.makePreparation has cognitive complexity 133 (threshold 15). Drivers by points: if/else 28 (61 pts), ternaries 17 (44 pts), boolean chains 15, loops 5 (13 pts) (nesting depth added 68). Of this number, 124 points are the body\u0027s own statements and 9 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1866278ae1e4ab94c52e73480da6f348df53f758427662a5b88271975413bb77"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.prepareLayout (cognitive 128): StaticLayoutAndroidProseLayoutEngine.prepareLayout has cognitive complexity 128 (threshold 15). Drivers by points: if/else 77 (110 pts), boolean chains 16, loops 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"422a2e05558ca532f88184a9be83bd433cc62f569a4d762e21490238e8a28746"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.stage (cognitive 123): EditorTableIndex.stage has cognitive complexity 123 (threshold 15). Drivers by points: if/else 31 (76 pts), loops 19 (30 pts), boolean chains 13, ternaries 4 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"42abee123c207a9a6cea294d6da39e7f5ee88f3ae5354b910be1ed79e0992f63"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.prepareBlock (cognitive 121): CoreTextProseLayoutEngine.prepareBlock has cognitive complexity 121 (threshold 15). Drivers by points: if/else 34 (59 pts), ternaries 20 (35 pts), boolean chains 16, loops 4 (8 pts), match/switch 2 (3 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e629c1a8ab78fdc280c76051c6816afbe1e3e4d5bbc8a0f17744a3216334706"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::apply_compiled_transaction_with_history_and_context (cognitive 118): YrsDocumentEngine::apply_compiled_transaction_with_history_and_context has cognitive complexity 118 (threshold 15). Drivers by points: if/else 63 (91 pts), boolean chains 17, match/switch 8 (10 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6900cf18843328181ca59da1ec57485566a98d66044dd77a8f0638810d491cb"}},{"ruleId":"D2","level":"warning","message":{"text":"useEditorToolbarItems.useEditorToolbarItems (cognitive 109): useEditorToolbarItems.useEditorToolbarItems has cognitive complexity 109 (threshold 15). Drivers by points: ternaries 16 (59 pts), if/else 12 (23 pts), boolean chains 12, match/switch 6 (10 pts), loops 2 (5 pts) (nesting depth added 61). None of this is in the body itself: all 109 points belong to 6 function literals inside it that branch (lines 192, 352, 89, \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":"src/useEditorToolbarItems.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7027218d0eccdbf29a410ac2247f4eecf5eba943626172c668ef1e86774efc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::try_new_with_budget (cognitive 106): Schema::try_new_with_budget has cognitive complexity 106 (threshold 15). Drivers by points: if/else 38 (79 pts), loops 13 (19 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into 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/editor-core/src/schema/construction.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43590b24737630ad01546d16932da0d727145c40190651f198f109361edcec8"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl (cognitive 103): editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl has cognitive complexity 103 (threshold 15). Drivers by points: if/else 35 (94 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 61). 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/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911300f04581a5fc8989c8a118230f8dbff82787fc562904184335b76d43c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::apply_virtual_structural_splices (cognitive 90): MutationCompiler::apply_virtual_structural_splices has cognitive complexity 90 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 10 (24 pts), loops 10 (19 pts), boolean chains 3 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into 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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"848c051bad590a3e1c5384d8584f76a98117508be2ecacb9b604f835e7ee6f91"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocument.lowerElements (cognitive 84): ViewerDocument.lowerElements has cognitive complexity 84 (threshold 15). Drivers by points: if/else 20 (45 pts), ternaries 8 (22 pts), boolean chains 11, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 41). Of this number, 74 points are the body\u0027s own statements and 10 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caff73f45ee17fa870bc59ca54b3b9d677dc90ebe781174cce00917a3b5a406"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.moveFromActiveTableCell (cognitive 81): RichTextEditorView.moveFromActiveTableCell has cognitive complexity 81 (threshold 15). Drivers by points: boolean chains 48, if/else 13 (24 pts), match/switch 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 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":"ios/RichTextEditorView.swift"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a727c0bbf2f2cebcb94b456981b1b1142bc7a32a4be2d9cb9e14e6cd4cc8a2"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateJson.normalizeV2JsonValue (cognitive 80): NativeEditorCreateJson.normalizeV2JsonValue has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (70 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (nesting depth added 43). Of this number, 78 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd17af5a30e8e911b88dee8abb3f5b6c0abeabc0c57cc08aa9cfd7f26fd046e"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationCompiler::compile_structure (cognitive 78): OperationCompiler::compile_structure has cognitive complexity 78 (threshold 15). Drivers by points: if/else 34 (70 pts), boolean chains 7, 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/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e599d601ceaf0e9d585e549d518cdd88cfcb37a34c585b66b37dba7be9019"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applyUpdateJSON (cognitive 77): EditorTextView.applyUpdateJSON has cognitive complexity 77 (threshold 15). Drivers by points: if/else 42 (50 pts), boolean chains 25, ternaries 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf064710b3a8471b8ba9f313ee3089677acb2e6f8e65f19db5283f8c596190"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocument.validTables (cognitive 77): ViewerDocument.validTables has cognitive complexity 77 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 28, loops 8 (18 pts) (nesting depth added 28). Of this number, 66 points are the body\u0027s own statements and 11 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e9cceb839af9e5da92095313c05234f9840f629b64ece6a6acd331398c07d8"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorPresentation.useRichTextEditorPresentation (cognitive 76): useRichTextEditorPresentation.useRichTextEditorPresentation has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 24 (35 pts), boolean chains 20, if/else 15 (17 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 14). Of this number, 44 points are the body\u0027s own statements and 32 belong to 14 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":"src/useRichTextEditorPresentation.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e00dc9161233a555528e620ce01252232a66d13cea12d34fa09c03c903eb3c8"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::clipboard::normalize (cognitive 74): editor_core::serialize::html_in::clipboard::normalize has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (53 pts), loops 5 (10 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into 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/editor-core/src/serialize/html_in/clipboard.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97c419b9cf0c818c28827724cb10cc2115ceb8b477ba09d0a0db63e89e85bff"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl (cognitive 72): editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (51 pts), match/switch 3 (8 pts), loops 3 (7 pts), boolean chains 6 (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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b665271c3d10f5e71aa853d1387a120fc9fe93ffec34d4e1bef6fd6f37f275"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::reference_grid::compute_map (cognitive 69): editor_core::tables::reference_grid::compute_map has cognitive complexity 69 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 11 (26 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into 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/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed379b0f0737928876bce09eae765560b4f55305806885c964e9feb0c9f0e8f0"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaNormalization.normalizeSchemaDefinition (cognitive 67): schemaNormalization.normalizeSchemaDefinition has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 17 (34 pts), if/else 7 (16 pts), boolean chains 10, loops 4 (5 pts), match/switch 2 (nesting depth added 27). Of this number, 65 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":"src/schemaNormalization.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a956bd8e5a1b3111991cacc7b1af2bd89cd7b06f3bf34fba2cbfdc6d5044c7"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::semantic::compile_transaction_impl (cognitive 64): editor_core::yrs_engine::compiler::semantic::compile_transaction_impl has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36 (41 pts), boolean chains 13, match/switch 7 (9 pts), loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca20625638f5c80c9122803b386f15198c269179963cc2186edbdb1d9be59b"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::wrap_in_list (cognitive 62): MutationCompiler::wrap_in_list has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 6 (16 pts), loops 11 (13 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb092d8108052d870765af8f40fdc5fea2913d0ef957259103bcc328395ced2"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::range::text_targets::drive_lookup_materialization_collector (cognitive 60): editor_core::yrs_engine::mutation::lowering::range::text_targets::drive_lookup_materialization_collector has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7696a5547fc72ab8cda698449d7a92605af973ff1c7e0b19646302c7fb92de43"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::split_block (cognitive 58): MutationCompiler::split_block has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 4 (15 pts), match/switch 3 (4 pts), boolean chains 3 (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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"711b6c1d0a3243fa6c6ce7f5a5b210f7dec12821d59a4bb394a518ddc932b09b"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position (cognitive 58): editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (46 pts), loops 2 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 35). 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dcfc6ca10214dbab1ae5d644751f324de1a526f19e24255514d168d44c0649"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::alignment::targets_in (cognitive 57): editor_core::alignment::targets_in has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 3 (8 pts), boolean chains 7, loops 2 (4 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/editor-core/src/alignment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5572305c0c521d8f150c7d0f5eaa06cf1e43e36ef270d7a31729a62a7aad00ff"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageDecoder.isSelfContainedSvg (cognitive 57): RenderImageDecoder.isSelfContainedSvg has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (40 pts), boolean chains 10, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf089deca49091f7e49ae468d8e055bbaf0c935dce348acf184dfc4114d139c"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::range::insert_nodes_in_children (cognitive 56): editor_core::transform::apply::range::insert_nodes_in_children has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 7 (23 pts) (nesting depth added 35). 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab31b43f630be11e4856544327b360aab3607672a8af7d2143488b7bacae4649"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDefinition.defineSchema (cognitive 56): schemaDefinition.defineSchema has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 15 (26 pts), if/else 7 (18 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 27). Of this number, 49 points are the body\u0027s own statements and 7 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":"src/schemaDefinition.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1af60f71f88471d7c1e5fea1ab9eb35d2de80a02298adfedb287d3b4821d07"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRustCommandsKt.insertPlainTextRangeInRust (cognitive 55): EditorEditTextRustCommandsKt.insertPlainTextRangeInRust has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 6, error handling 1 (5 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fa9084b63d8e55dde49c131ee0a1776b2b4e42b5b71868e04d8a7933790c09"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.stage (cognitive 54): EditorTableIndex.stage has cognitive complexity 54 (threshold 15). Drivers by points: if/else 37 (45 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449c38443e35b3718eb15c9407062ea5b4f29a94a095f994987bf7f312d8eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"TableInteractionController.onTouch (cognitive 54): TableInteractionController.onTouch has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (51 pts), boolean chains 2, match/switch 1 (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":"android/src/main/java/com/apollohg/editor/tables/TableInteractionController.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66c876cc5379edb107d04496b78e63356cfea63495e7f543907288e4631b9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaResolution.resolveDocumentSchema (cognitive 54): schemaResolution.resolveDocumentSchema has cognitive complexity 54 (threshold 15). Drivers by points: if/else 24 (36 pts), loops 8 (10 pts), boolean chains 7, error handling 1 (nesting depth added 14). Of this number, 51 points are the body\u0027s own statements and 3 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":"src/schemaResolution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b08dd6f733b11d97254cb8ab30f9134bdb17358b3ffb5343aa2d32a9a547bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocumentKt.validViewerTables (cognitive 53): ViewerDocumentKt.validViewerTables has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 7 (13 pts), boolean chains 9 (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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b0a176cc90ffcadda8ad008dd92ab5de1b1b987f797ab68b14912c3aeacef7"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedTextLeafIndex::carry_after_textblock_edit (cognitive 52): LocalizedTextLeafIndex::carry_after_textblock_edit has cognitive complexity 52 (threshold 15). Drivers by points: if/else 26 (43 pts), loops 3 (7 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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead963486bd73920b20cdea2676f8a41b9dbb9a48aae6feac827ca5d095c26bf"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextSurfaceInteraction.performAccessibilityAction (cognitive 52): EditorTextSurfaceInteraction.performAccessibilityAction has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 1 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 26). 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"e589eaa53d61921ac705a1f38431771feda50451f2911f399cc3c1cc080a905e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applySelectionFromJSON (cognitive 52): EditorTextView.applySelectionFromJSON has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 5, match/switch 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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"16852385fb952af704972f6f67c706967b269c7d394c49d85f48a658fac9f1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDocumentConstruction.constructDefaultEmptyDocument (cognitive 52): schemaDocumentConstruction.constructDefaultEmptyDocument has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 8, loops 6 (8 pts), ternaries 1 (nesting depth added 13). Of this number, 25 points are the body\u0027s own statements and 27 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":"src/schemaDocumentConstruction.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ab6f5c67fe028e39393f8114ed050783c4021660addb307c61936b890e5586"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationCompiler::compile_text (cognitive 51): OperationCompiler::compile_text has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (45 pts), match/switch 2 (4 pts), boolean chains 2 (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/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c944aa5b78106f614eba0e02e198bda82b1d8713d96a91e7f478708c4cd999ed"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateJson.serializeV2CreateEnvelope (cognitive 51): NativeEditorCreateJson.serializeV2CreateEnvelope has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d499396cdca1e0605bdc0619b1904eac7f51cbc504f93a420dabb0f152ff6554"}},{"ruleId":"D2","level":"warning","message":{"text":"useNativeEditor.useNativeEditorDocument.refresh (cognitive 51): useNativeEditor.useNativeEditorDocument.refresh has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 10 (nesting depth added 21). Of this number, 50 points are the body\u0027s own statements and 1 belongs 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":"src/useNativeEditor.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a15947cc867a0cb079b052e084b15dfa97ad40deea5edb116c0fb69a5b9eba0"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_out::serialize_nodes (cognitive 50): editor_core::serialize::html_out::serialize_nodes has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 3 (7 pts), match/switch 1 (2 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/editor-core/src/serialize/html_out.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d89bf7a67d6cd62502344a4564fc5457b9d99f64c5572c5ecafe0a761c7b5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextSurfaceInteraction.onKeyDown (cognitive 50): EditorTextSurfaceInteraction.onKeyDown has cognitive complexity 50 (threshold 15). Drivers by points: if/else 28 (44 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daf729336443e7aa8f23ed1c32a0219fe9f22bb2d541eedb83fb4c53a7b6de0"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.moveFromActiveCellByArrow (cognitive 50): EditorTableSurface.moveFromActiveCellByArrow has cognitive complexity 50 (threshold 15). Drivers by points: if/else 29 (38 pts), boolean chains 12 (nesting depth added 9). 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79404eee9976849c65f175116c649bf6df9de922fbf3058a0cd28c6b19131f3"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorAccessoryToolbarView.apply (cognitive 50): EditorAccessoryToolbarView.apply has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 14 (16 pts), boolean chains 15, loops 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":"ios/NativeToolbar.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6603a771ce68fd7e99c16dbc5a0db70c8f97c33e47a6062cb4945ed9a022675d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeAttributedString (cognitive 50): CoreTextProseLayoutEngine.makeAttributedString has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 12, ternaries 3 (9 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 18). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b67c8e3c36c6a75869aed436ac68970ba6adf9939a2186ab3581d90cda0300"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::index::localized_format::localized_existing_textblock_targets (cognitive 49): editor_core::yrs_engine::mutation::lowering::index::localized_format::localized_existing_textblock_targets has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 13, loops 2, match/switch 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/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f76cefc768589a9724a9cd5ef6220820b8e34f862d8d404a852a6f86ec4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.attributes (cognitive 49): CoreTextProseLayoutEngine.attributes has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts), ternaries 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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfad5c9d0d2384754e36776b34593d155923b35d44e9281196e54e31c1bab83d"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::validate_constructibility (cognitive 48): Schema::validate_constructibility has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 6 (13 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eecfcc01b8d0a1824bc57797a2c33f2824fea7cadcf681664c275b4385d27ef"}},{"ruleId":"D2","level":"warning","message":{"text":"TableRenderContext::retain_cells (cognitive 48): TableRenderContext::retain_cells has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 7 (20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e5958f9931a9cef644806d37e2b7ced8554fb696584de47f605b4405d22db2"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationCompiler::compile_edit_structure (cognitive 48): OperationCompiler::compile_edit_structure has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (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/editor-core/src/yrs_engine/compiler/operations/batch.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba21f6a42c7e424923c86ea79ce3ffd34548aa36ed90f907caf5bce13a02e32"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationCompiler::compile_marks (cognitive 48): OperationCompiler::compile_marks has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 1 (3 pts), match/switch 1 (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/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e491712d02c42b9dd802ba5e51572377afe2558cf6d5e8c7295dc6f8888f948"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::unwrap_from_list (cognitive 48): MutationCompiler::unwrap_from_list has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (41 pts), loops 3 (4 pts), boolean chains 2, match/switch 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/editor-core/src/yrs_engine/mutation/lowering/list/unwrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d10def557a62dc20e4ee0cbfbcc7ed940e588f991d6ca845046e6962dc7031"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetKt.overlaidWith (cognitive 48): EditorStyleSheetKt.overlaidWith has cognitive complexity 48 (threshold 15). Drivers by points: if/else 46 (48 pts) (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":"android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"46134b905b9f14eefeda5855329bedf1cb37c92a3415f3be3f8266175f4e28b6"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeToolbarItem.parse (cognitive 48): NativeToolbarItem.parse has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 24, if/else 12 (23 pts), match/switch 1 (nesting depth added 11). 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":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea1087225d34300c93c358c10443935476673a3fb5b49ea2a504ab86949770b"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.updateTableLayers (cognitive 47): PreparedProseDrawingView.updateTableLayers has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 30, if/else 10 (13 pts), loops 3 (4 pts) (nesting depth added 4). 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8015ae6951c09b17354a2fd0c31ed5c6f1851a64b1ea2afd020e87efd9f5763"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.drawTableChromeBorders (cognitive 47): PreparedProseDrawingView.drawTableChromeBorders has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 6 (24 pts), if/else 4 (13 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fd9ef9e54ad41b8eb125f34b567021d1d01d03e8af883fa83d02811d8a694b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTransactionBridge::submit_native_intent (cognitive 46): NativeTransactionBridge::submit_native_intent has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 7 (16 pts), boolean chains 3 (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/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9554609b6e5f170344e10e0d0b88e978019ab80c80e72d2bcfccb43b5899dd98"}},{"ruleId":"D2","level":"warning","message":{"text":"OperationCompiler::compile (cognitive 46): OperationCompiler::compile has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 7, match/switch 3 (7 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/editor-core/src/yrs_engine/compiler/operations.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"232a9f4cd4e5340df2004ee23e59a9511a485dbe53b6c5e2161fc3311c4ccd0d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applyAttributedRender (cognitive 46): EditorTextView.applyAttributedRender has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 8, ternaries 1 (2 pts), match/switch 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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba9f4f0d18b5ec9cb94f60507f6760f006410b45eb81fc2412b8bd75bccff8f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.stepDragFrame (cognitive 46): EditorTableSurface.stepDragFrame has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 11, ternaries 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698382a27fc3beacdbe0538c1c5a537149cb2a38be9837bf2c13c00f2b086d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeBinding (cognitive 46): CoreTextProseLayoutEngine.makeBinding has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 10, loops 3 (5 pts) (nesting depth added 17). Of this number, 29 points are the body\u0027s own statements and 17 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4fdff7efa56a4e1fbbd946984c671cc80a5a6af01659bdf026d2a6afa9dc1c"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::boundary::write_json_frames (cognitive 45): editor_core::boundary::write_json_frames has cognitive complexity 45 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 5 (17 pts), match/switch 3 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fe8de66c42513998eb7dca64ae45485dd7d05b0111212aff4c1b42cf4d5939"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.deleteBackward (cognitive 45): EditorTextView.deleteBackward has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 6 (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":"ios/EditorTextView.swift"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e59415a9bd10cf03fb0b9c44a18b95f6d5b148b357ae117bb21e42d6960ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::delete_structural_range (cognitive 44): MutationCompiler::delete_structural_range has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 8 (12 pts), match/switch 5 (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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9975268e8a4fcfd17122a0965874cde9b6b275ffe48dd93cc9ccd540802faa87"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::rebuild_target_layout (cognitive 44): MutationCompiler::rebuild_target_layout has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 7 (9 pts), match/switch 6 (9 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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e482984759b02dd1b3d8c074221d70018881a63d9d16f02190c646d1fd1c0698"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.drawTableChromeBorders (cognitive 44): PreparedProseDrawingView.drawTableChromeBorders has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (6 pts), boolean chains 1 (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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ea37f651e30dd911e2565744557a7068a242d0373127391e8c8177585dd99"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::ffi_v2::native_frame::build_native_frame (cognitive 43): editor_core::ffi_v2::native_frame::build_native_frame has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 4 (11 pts), match/switch 1 (3 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/editor-core/src/ffi_v2/native_frame.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a4abb822339d67639fac8d088b5c7d5dfc58baa4ced2d00cc20e39d6ce718a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::format::plan (cognitive 43): editor_core::yrs_engine::commands::format::plan has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 1 (4 pts), match/switch 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/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"005a67a5d08f3fe73c8aeabd3438540f1d43bb3c4ceb5a8c82fb69d7958810f9"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.prepareBlock (cognitive 43): StaticLayoutAndroidProseLayoutEngine.prepareBlock has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 9, match/switch 1 (2 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e8beb4ec45eac8f136e4b8bb0d724529539005117e8b2a7bc7ea3856d206b2"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageLoadOwner.decodedDataURLByteCount (cognitive 43): RenderImageLoadOwner.decodedDataURLByteCount has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 13, ternaries 4 (5 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":"ios/SharedNativeImagePipeline.swift"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d05d862c4658868ae608bf6993cca58d36ce84cad42987176046075abbcfe06"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.hitResizeEdge (cognitive 43): PreparedProseDrawingView.hitResizeEdge has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 16, ternaries 2 (6 pts), loops 2 (3 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"0141fc45db99d49d45448adf6f61a262daed5934007f34b871b257ec6025aa16"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::json_in::parse_node (cognitive 42): editor_core::serialize::json_in::parse_node has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (12 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3ad622281090f08379edad0e581b845f25e16551e1f7ff7a5daa88bae10dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::clipboard::plan_at_selection (cognitive 42): editor_core::yrs_engine::commands::clipboard::plan_at_selection has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (33 pts), match/switch 2 (6 pts), boolean chains 2, 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":"rust/editor-core/src/yrs_engine/commands/clipboard.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"17895d3188bf9fa93c7625b1a1df7c7cf7726e703d4ac0a7c5c501ed41d42179"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::resolve_insert_position_budgeted (cognitive 42): editor_core::yrs_engine::compiler::insert_position::resolve_insert_position_budgeted has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (3 pts), boolean chains 2 (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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"133b91aa03e612690668ce9253303a2a0eb68d2245fd529915340b917088b4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextUpdatesKt.applyUpdateJSONImpl (cognitive 42): EditorEditTextUpdatesKt.applyUpdateJSONImpl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (31 pts), boolean chains 10, error handling 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":"android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cb4ecc40e58ea5b12f8b1429f855f6434a643011c1bdc0d16d1d1b79a949f3"}},{"ruleId":"D2","level":"warning","message":{"text":"TableGridLayout.relayout (cognitive 42): TableGridLayout.relayout has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 10, ternaries 3 (5 pts), loops 4 (nesting depth added 11). Of this number, 38 points are the body\u0027s own statements and 4 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":"ios/Tables/TableGridLayout.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d8e12af9c65fa2cc84090186ec2b97d985b736846ced65d345f6aba92ee627"}},{"ruleId":"D2","level":"warning","message":{"text":"useEditorToolbarPresentation.useEditorToolbarPresentation (cognitive 41): useEditorToolbarPresentation.useEditorToolbarPresentation has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 23 (29 pts), boolean chains 7, if/else 4 (5 pts) (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 21 belong to 7 function items 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":"src/useEditorToolbarPresentation.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5edd218d11af9db709353633ee42e776a0fd619ba0d0b234a55ea2bb138d6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.drawTableNodes (cognitive 40): PreparedProseDrawingView.drawTableNodes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 12, 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea00120cecf3d7106834bc4adc60609e0a101c00a5ebb4ca2a6d9a42254b6621"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.isValidMentionStyle (cognitive 40): EditorV2Adapter.isValidMentionStyle has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 4, loops 3, match/switch 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6665b6e89c4fb2a00bb75a5d90fcb3fac4b92afc517cfacdc3864e3c62134"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.isValidRenderElement (cognitive 40): EditorV2Adapter.isValidRenderElement has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 21, if/else 10 (18 pts), match/switch 1 (nesting depth added 8). 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"547b7f1199ce2801e310a9608a88206d4b1ed453aa9772a48079dac9079cee96"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.commitNativeTextMutation (cognitive 40): EditorV2Adapter.commitNativeTextMutation has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca717960893dbcb93199664d5c7056b717ada615b247ddd28155c2d9576ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutRegistry.measure (cognitive 40): PreparedProseLayoutRegistry.measure has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 7, error handling 5 (7 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseLayoutRegistry.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8501d1374ebcf9321bc3bf9e4e795ad6847169da24c62b034c54765bb9ae8bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.refreshRetainedPositionalMetadata (cognitive 39): EditorTextView.refreshRetainedPositionalMetadata has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 12, loops 3 (4 pts), ternaries 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f27e5ebbc060d19ee7870c0eccfff9874b533f58fd3b08abdacb37e604816"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::current_storage_insertion (cognitive 38): MutationCompiler::current_storage_insertion has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 5 (10 pts), loops 2 (4 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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"264de3bb3423a970380ab09bcfed7fd717c5500d62417b41a16ff9601a5db013"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent (cognitive 38): editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (5 pts), boolean chains 4 (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/editor-core/src/yrs_engine/mutation/lowering/index/localized_locators.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb013f8d85dafb4fd872f430e901ca7a88b46760c57263ecd8b6006926ef27b"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.listPlacement (cognitive 38): CoreTextProseLayoutEngine.listPlacement has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 14 (23 pts), if/else 8 (9 pts), boolean chains 3, loops 1 (2 pts), match/switch 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1208bc0da6587466f7de874e3979c0e5d7fbc5be70ec88d9ecd49fe1dcd4a439"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorResultNormalization.normalizeNativeEditorV2PeersValue (cognitive 38): NativeEditorResultNormalization.normalizeNativeEditorV2PeersValue has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 7, ternaries 3 (5 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea3f87be1c6bd613661c19cf885518e244eb56f2b33bce2c65e63e171d6527"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::extract_node_attrs (cognitive 37): editor_core::serialize::html_in::extract_node_attrs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 22). 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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65fe8619c75ffd9b32ff0c237ad06021c7a1fcce6b6bb631318650adf26e8df"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::reference_grid::reference_pass (cognitive 37): editor_core::tables::reference_grid::reference_pass has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"38524dbb0732253ec622c654aa72f39ff0e70d40e95a8d4f70c75ab5fe8e6a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridgeInlineAndAtomsKt.appendStyledText (cognitive 37): RenderBridgeInlineAndAtomsKt.appendStyledText has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 10, match/switch 3 (6 pts), loops 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":"android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e298663f707fc9a8521d99992dabfd610f8c888ce0210b2dc633937dc62fee11"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.refreshPresentation (cognitive 37): EditorTableSurface.refreshPresentation has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 9, match/switch 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e44b5af5d4fa72f930aad12e3683edaef97a04d62649510e498a8cfde6de8"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::shift_child_actions_after_insert (cognitive 36): MutationCompiler::shift_child_actions_after_insert has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3430eec2d99be77047c28f1be11b7047dcf5c48a1f881c07e8699f4f3f8df4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.textViewDidChangeSelection (cognitive 36): EditorTextView.textViewDidChangeSelection has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 16 (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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba444a1d40236fb966cdf4aaa4b4bfabedd00ad786af5f3b4e666576265dd34e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetNormalization.normalizeEditorTheme (cognitive 36): EditorStyleSheetNormalization.normalizeEditorTheme has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"da967c817b727edd057758339cdce57d48c8e6224b66336e24637e9381c5f776"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.moveFromActiveTableCell (cognitive 35): RichTextEditorView.moveFromActiveTableCell has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 27, if/else 7, ternaries 1. 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":"ios/RichTextEditorView.swift"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c7b88ea0335e2e5f702aea323509604bab78dc4c915ae94f26155e42c76075"}},{"ruleId":"D2","level":"warning","message":{"text":"contentExpression.minimalContentMatch (cognitive 35): contentExpression.minimalContentMatch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (14 pts), boolean chains 1, error handling 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":"src/contentExpression.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92c49e67303a8f45ff2d9e85e3ff271928c67a2be15ed2001fd9305745496b6"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::prepare_typed_result (cognitive 34): YrsDocumentEngine::prepare_typed_result has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/transaction_result.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"760c84d40c31427277f374a7205210f0be6d5f4b91278a3728203d4b6ebd564a"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::remove_prepared_children (cognitive 34): MutationCompiler::remove_prepared_children has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 6 (12 pts), match/switch 2 (4 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/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52b6a63796a03742fd0728c5050b33f2961d6e7691978c2c0b80c7825d99c39"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::range::insert_node_in_children (cognitive 34): editor_core::transform::apply::range::insert_node_in_children has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 1 (nesting depth added 19). 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a479e628623bc1125bd9c43e1568819d62dc54730f743beb4b4b6b7c94ebff6c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2AdapterMutationsKt.performNativeIntent (cognitive 34): EditorV2AdapterMutationsKt.performNativeIntent has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (5 pts), boolean chains 2, error handling 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af9f199b8a9efe1ebb71d44e5963b776426dcb31b91f90c37e31623449bd821"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewBindingKt.setEditorIdImpl (cognitive 34): NativeEditorExpoViewBindingKt.setEditorIdImpl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (28 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewBinding.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11e98fbf66f08c5eb5ca2a5f0a7b4c0bce4fef49962835281e809346034253e"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.inputElements (cognitive 34): RenderBridge.inputElements has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (8 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 21). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc88feff54efe2f3bd10e51c109a46d59781490516cbf82fd27c61fe7c0017"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerImagePipeline.updateVisibleRect (cognitive 34): ViewerImagePipeline.updateVisibleRect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 13, 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":"ios/Viewer/ViewerImagePipeline.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee07ef2bc8b626b74785948dfc469e4ea2f3d7c9a5658313a2d5323d04c843"}},{"ruleId":"D2","level":"warning","message":{"text":"useNativeEditor.useNativeEditorDocument (cognitive 34): useNativeEditor.useNativeEditorDocument has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 3, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 380). 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":"src/useNativeEditor.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cda2b2ce61bbc357dbbcb1e1fe9dce59ae686f32a2cae675b6ac719721129eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::from_json_with_limits (cognitive 33): Schema::from_json_with_limits has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/json.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b21a6280ddb2178de929c25354da2e99d2da2c2f55b8a8cf5873a98be95ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsHistory::unmirrored_stack_metadata_bytes (cognitive 33): YrsHistory::unmirrored_stack_metadata_bytes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (12 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/editor-core/src/yrs_engine/history/capture.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab982a26104b36d8c538233bdd7c81ade267608d7a3ecd826d5c00e4a29a3d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportTextCaptureWork::observe (cognitive 33): ImportTextCaptureWork::observe has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/import_lookup.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f59a80f785885107f852f9899875f3c182933461e783e0aaf68edd94c1cd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::paste::clip_matrix (cognitive 33): editor_core::tables::paste::clip_matrix has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (14 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/editor-core/src/tables/paste.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fe2bb7db34c4d229a12aab1afc8e2f969c2f17121002e3afd255071219d5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.adopt (cognitive 33): EditorV2Adapter.adopt has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 17, if/else 14 (15 pts), ternaries 1 (nesting depth added 1). 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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b9a12afae211e89eae5b200beaef8deea43184ef39b40ca0bd79eacc34d808"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.paragraphStyleForBlock (cognitive 33): RenderBridge.paragraphStyleForBlock has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 8 (9 pts), match/switch 2 (3 pts), loops 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":"ios/RenderBridge\u002BStyle.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"538885516678a3d9fc08246bc5a586b1d41d8994a965910b5635d47b8a2d1ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCollaborationTransport.normalizeNativeCollaborationTransportEvent (cognitive 33): NativeEditorCollaborationTransport.normalizeNativeCollaborationTransportEvent has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 7, 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eb2bc6004b7330caff431316f4ddbabf5e9417856c3c790137e8665d6ded54"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentRule::choose_matches (cognitive 32): ContentRule::choose_matches has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (11 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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a267554ee0f6ba1dc7d2b917552aa8fc119c8c371c196234903289e1418c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::incremental::generate_block_inner (cognitive 32): editor_core::render::incremental::generate_block_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 5 (11 pts), boolean chains 1, match/switch 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/editor-core/src/render/incremental.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa026a77ec59510ff7d5eac2797afd78dc9134ec945702f9912a9a882e5488"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::text::plan (cognitive 32): editor_core::yrs_engine::commands::text::plan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 3 (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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f99bf1472b73940952053d27b0b5b6e6e04d571effb85dd0527dd7ad0c2cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::range::text_targets::collect_text_targets_inner (cognitive 32): editor_core::yrs_engine::mutation::lowering::range::text_targets::collect_text_targets_inner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 2 (6 pts), match/switch 1 (2 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/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d177430799f4a9bf087a9dafd6e91d12617be785ef077762685dc564d3d2878e"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::position::doc_pos_to_sticky_index_in_sequence (cognitive 32): editor_core::yrs_engine::position::doc_pos_to_sticky_index_in_sequence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 1 (2 pts), boolean chains 1, 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/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"658eb46b5ee24aef9a256a2310cb89944e51113a4dac84812eb0ef4b2b8793b2"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableCellProjection.project (cognitive 32): EditorTableCellProjection.project has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d33627a2bb37761c1a8aa4f04256d40d7375bf16e1d931920a10f02d556217"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateConfig.buildV2CreateRequestUnchecked (cognitive 32): NativeEditorCreateConfig.buildV2CreateRequestUnchecked has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 2, loops 1 (2 pts), ternaries 2, 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f42a894b8ce659198112ac35b76087275af7169eac6823809b05c70549c001"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorState.useRichTextEditorState (cognitive 32): useRichTextEditorState.useRichTextEditorState has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 10, ternaries 2 (3 pts) (nesting depth added 2). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 224, 241, 271, \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":"src/useRichTextEditorState.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"514af5a281d93e672afca375e1de6aefa77b9527f2b328b18f765a68dae620a0"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateJsonScanner::scan_value (cognitive 31): CreateJsonScanner::scan_value has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 4 (11 pts), loops 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"111c9a7a4cbee415a19c622d56372c039edb26ff0bd835b6fe0b2ad8f7b9676d"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::ffi_v2::editor::create_scanner::scan_initialization (cognitive 31): editor_core::ffi_v2::editor::create_scanner::scan_initialization has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7accabcd81031564f4afae701d9c02d42980fe6880d7e91dfe7f9738d4e5dd88"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocumentKt.lowerElements (cognitive 31): ViewerDocumentKt.lowerElements has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 6, 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e985691329eb9530a89e92cf1b5da542f859ba270829460128498d8ad299d2"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.submitNativeIntentRecoveringStaleEpoch (cognitive 31): EditorV2Adapter.submitNativeIntentRecoveringStaleEpoch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 3 (8 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad06ecc8d24be54c4be00940ecbaa65a4c810fdf2d48f79e7769a100098dafb"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterConfig (cognitive 31): NativeCollaborationTransportRegistry.parseProtocolAdapterConfig has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 14, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8086995d7a5e466f5b83fd35638edf321a6c52d6807d9df874e7b07256dd6fb6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorCellSelection.resolve (cognitive 31): EditorCellSelection.resolve has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 3 (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":"ios/Tables/EditorCellSelection.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef87f9c40f6f7ef942d049e1a1be08aa1ad9b876b2c968335828f05feabc22f1"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.drawHierarchicalBackgrounds (cognitive 31): PreparedProseDrawingView.drawHierarchicalBackgrounds has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (8 pts), boolean chains 2, match/switch 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a424495383bf59586f03801b270b203cbf0f84ce04bee5ce1fd8d5c4dc3b61"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaResolution.admitSchemaCollections (cognitive 31): schemaResolution.admitSchemaCollections has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 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":"src/schemaResolution.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b22a325ffc8f95e5db255303c92712684ab218c204b55930f0696fb44083fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.retainedBlockMetadata (cognitive 30): EditorEditTextRenderPatchKt.retainedBlockMetadata has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde0dab1a03cc29d977d4ba10f06a6e7d649a75b601911881421ad9eebc2942e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextSurfaceInteraction.onTouchEvent (cognitive 30): EditorTextSurfaceInteraction.onTouchEvent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 5, 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"78edd5966b60abd55140af0e8e5538a27392014f085599ca9b52448b545d2a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutCache.value (cognitive 30): PreparedProseLayoutCache.value has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ecccfb257f1bc2ac30e43dddb865a08313e0fca7d3734948360fd78585c1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorAddonNormalization.normalizeEditorAddons (cognitive 30): EditorAddonNormalization.normalizeEditorAddons has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorAddonNormalization.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffc4fef1bab1302d0ce450de71dbb5a797c17607fb6b8e0898d4479cc2a1c87"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonValueMeter::admit_object (cognitive 29): JsonValueMeter::admit_object has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (5 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/editor-core/src/boundary.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec17ca1052907170ea4c24e3e21cf2ab1d8c3b076402266cf0d2fe5961796ce"}},{"ruleId":"D2","level":"warning","message":{"text":"AwarenessCodec::admit_update (cognitive 29): AwarenessCodec::admit_update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/awareness.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffade59bdb46ac480e099a72bcb1cd00a6bcb52c9ea7a5a8fd8e0f0d75a2789"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.renderBlockVisuallyEquals (cognitive 29): EditorEditTextRenderPatchKt.renderBlockVisuallyEquals has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 2 (3 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d3f5b1aba0f1bbd68eb1e7e3029901852818b597dc9e286626dbfcc0401c08"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.nativeTextMutationWithCurrentSelection (cognitive 29): EditorTextView.nativeTextMutationWithCurrentSelection has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 9, ternaries 5. 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":"ios/EditorTextView\u002BNativeMutation.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b8aa3f84116e0a34084f45c3d97a7ac26eb2e0a29fcdd801004d9ba94f11bf"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.selectionHandles (cognitive 29): PreparedProseDrawingView.selectionHandles has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, ternaries 12, if/else 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d57e2877448518e958bdae9e1454b00886350b105e05a0d01ca068f83bcb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.paint (cognitive 29): PreparedProseDrawingView.paint has cognitive complexity 29 (threshold 15). Drivers by points: loops 9 (12 pts), boolean chains 9, if/else 5 (7 pts), ternaries 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25abdc2211d4d14dabf54f0472b2fb1a9e979359dd42187ca1d1a412f50d5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetNormalization.normalizeStyle (cognitive 29): EditorStyleSheetNormalization.normalizeStyle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (8 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b77ef3e8c21b2e93ba153ba63df6cfb7e11d1cae1d9fe54cc5351f64aafd38"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::apply_empty_skip_transaction (cognitive 28): YrsDocumentEngine::apply_empty_skip_transaction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, match/switch 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/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"122836b39be9b39857cddb83496e5afc3be03bc871a70aff2f91541b9d23ebaf"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::markdown_out::inline::serialize (cognitive 28): editor_core::serialize::markdown_out::inline::serialize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (9 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/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ada9f5943eebfed64b2c3666b8b56b707808c3d6e06b26e016faa51b5f01a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::validation::validate_opaque (cognitive 28): editor_core::transform::apply::validation::validate_opaque has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8f3686af5233bf2fa60f594757a4c51a7bdea5db2771bf4d98832e4f08a03"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderingKt.applyRenderedSpannable (cognitive 28): EditorEditTextRenderingKt.applyRenderedSpannable has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 7 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb8aae4da08531f188110210580be1be32f78f4a0257755e63b60f4bfe71787"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerTableSurface.replacingCells (cognitive 28): ViewerTableSurface.replacingCells has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 10 (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":"android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa67677fa24492ac363b56de20da883475c862a70ec02df02ec19d6459b8e54"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorRenderNormalization.normalizeRenderSelection (cognitive 28): NativeEditorRenderNormalization.normalizeRenderSelection has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e12dc0e2268ef60aec84076566f0b7b529b82c71ad1122a504b225dfc7074c"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorUpdates.useRichTextEditorUpdates (cognitive 28): useRichTextEditorUpdates.useRichTextEditorUpdates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 10, error handling 2, ternaries 1 (nesting depth added 3). None of this is in the body itself: all 28 points belong to 5 function literals inside it that branch (lines 577, 509, 309, \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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6f37b9a3015555881edaf26f34a8489581b1622de16c6013baa77f4c8b0be9"}},{"ruleId":"D2","level":"warning","message":{"text":"CollaborationRuntime::process_admitted_message (cognitive 27): CollaborationRuntime::process_admitted_message has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (6 pts), loops 2, 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/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bfe10140674ca61605a970518286509e27dd45482d762e1bc6af581e6c668a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::boundary::admit_json_container_depth (cognitive 27): editor_core::boundary::admit_json_container_depth has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (4 pts), match/switch 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":"rust/editor-core/src/boundary.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"62192e24c1c7adadd758a6941c84df6ab46810116c849657dc5172a2087d22c7"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::normalize::outer_table_path (cognitive 27): editor_core::tables::normalize::outer_table_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 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/editor-core/src/tables/normalize.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd617e3cf6d997845eac587c5fb76cce9349ee566102156aaee4b2ddf3dfc00"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::reference_grid::materialize (cognitive 27): editor_core::tables::reference_grid::materialize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (8 pts), match/switch 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":"rust/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4a43b3209a9a1fb65830cb14b42bad3b2b92897ad772918bb6e1f7a9a08022"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::preflight::expected_preflight_work (cognitive 27): editor_core::yrs_engine::mutation::plan::preflight::expected_preflight_work has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f606a1777bb6ab32a0457db2bbf4d77814db079c6d3f7a91401bc1961c49223"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewToolbarKt.handleToolbarItemPress (cognitive 27): NativeEditorExpoViewToolbarKt.handleToolbarItemPress has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d30acb10311593280046136881cacdad15050dc25b44485d5b75c62c8485ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TableGridLayout.relayoutCells (cognitive 27): TableGridLayout.relayoutCells has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3, 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":"android/src/main/java/com/apollohg/editor/tables/TableGridLayout.kt"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50c52fe540bfe8c042e3eb8520ed03d411356112a065d4be1e59753f1b7a79e"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.bindCellShape (cognitive 27): StaticLayoutAndroidProseLayoutEngine.bindCellShape has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 5 (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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea4763e05331cbb8fd83714337e140352ddf00129ee70d4692bcc809101493a"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerImagePipeline.updateVisibleRect (cognitive 27): ViewerImagePipeline.updateVisibleRect has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 7 (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":"android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02928b824f3751c774a8c1b8bf1f862e055799924bc1dbabc92d37b8a55870a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorClipboardPaste.semanticHTML (cognitive 27): EditorClipboardPaste.semanticHTML has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (8 pts), boolean chains 7, 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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec955e1d391a41f574386df407814772beea59e0213f1cbb5e7b49884b42e41f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoView.setEditorId (cognitive 27): NativeEditorExpoView.setEditorId has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (25 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":"ios/NativeEditorExpoView\u002BBinding.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1fe1d0d4bac2d0d3e3cf0f084d099c30b9026009da30fff7f06fcc6262f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.collapseStyledSiblingMargins (cognitive 27): RenderBridge.collapseStyledSiblingMargins has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorStyleSheet.swift"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece6bdfd68b9a9e610f13f9380c6dbdd3dadd51321b2271eb8d774e08708ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageLoadOwner.startLocked (cognitive 27): RenderImageLoadOwner.startLocked has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/SharedNativeImagePipeline.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1417a1a4e616b3d9bb5394c455a50ab4d7ee0fcb771690ff96b5d7d4ed362cd"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.entry (cognitive 27): EditorTableIndex.entry has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (9 pts), loops 4 (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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ea47c272799dbd3fdde4939e0ac8ce89096a464e18e65ddc45505dfd061f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.prepareEntries (cognitive 27): EditorTableSurface.prepareEntries has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (13 pts) (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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3af15e19d6d4a3fe9c55e9d02fb000f6810e6a7b0d3b3c31d61b8232f52794"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerTableSurface.init (cognitive 27): ViewerTableSurface.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 7). Of this number, 26 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91119d6333bec8b988414ab3797a2328c8fdd4668767302d4f8907e989eb24"}},{"ruleId":"D2","level":"warning","message":{"text":"attributeValidation.validateAttributeSpec (cognitive 27): attributeValidation.validateAttributeSpec has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11, 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":"src/attributeValidation.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf07bc7b322da1a3f7c08083c540dfe4ffe16ea3d060c95384ba8d23246d2022"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchBuilder::into_edits (cognitive 26): BatchBuilder::into_edits has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (5 pts), match/switch 1 (3 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/editor-core/src/yrs_engine/commands/structural_batch.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f761074ee1b36a1decbda614997eef9fd9c532aaeefbd1e29160088b5e44a423"}},{"ruleId":"D2","level":"warning","message":{"text":"DerivedStateCache::after_document_change (cognitive 26): DerivedStateCache::after_document_change has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, match/switch 1 (2 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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b56457230b75e02b938524fa533f68c3c28670c44435c92cf4bd73058564f53"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::generate::walk_children (cognitive 26): editor_core::render::generate::walk_children has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (2 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/editor-core/src/render/generate.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b0e1079f1c65abd0b015cdef53f8181f05939919bf6d7395f2fd342c130a72"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::collect_inline_children (cognitive 26): editor_core::serialize::html_in::collect_inline_children has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_in.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"50df1e997a2375c0d147fe531ba95771aacc64b7822eb4e1b917cbabf464aaa1"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::list_wrap::apply_wrap_in_list (cognitive 26): editor_core::transform::apply::list_wrap::apply_wrap_in_list has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3, 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/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88ec33ec1d7ededca46b65b3bdb893bf7ec73f8d08f2c57d65e8365d2b925c3"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::text::insert_text_in_children (cognitive 26): editor_core::transform::apply::text::insert_text_in_children has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (25 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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"72233249a0e203a272fc9da0951da71f6b28c5a70fde78b253f3233d21df6086"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::text::semantic_transaction_impl (cognitive 26): editor_core::yrs_engine::commands::text::semantic_transaction_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 3 (6 pts), boolean chains 3 (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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"299d7dcc355cbab9ef56064e85d9082906e74da93678daab0eace47ccdf7b443"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditText.dispatchKeyEvent (cognitive 26): EditorEditText.dispatchKeyEvent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 10 (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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5279e76524539ab801b53cb638f19879e9ba219f1676a2595c04fdb73863b99"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.jsonValuesEqual (cognitive 26): EditorEditTextRenderPatchKt.jsonValuesEqual has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6eb3ef2c62b515d04a7dae091f548def97fe3f2e6031bb4bdbe74d98a38e82"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorInputConnection.commitCorrection (cognitive 26): EditorInputConnection.commitCorrection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 4 (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":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a491cd6f37ec98da8b1637787844cf81be889c48ebf8e86631d2ee733f27dca0"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.onTouchEvent (cognitive 26): PreparedProseDrawingView.onTouchEvent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, match/switch 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b01f00f91e1b834f995e9b4e97bb358aa06077c1f35d5598ef0e191a88d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.reusingStyledParagraphBox (cognitive 26): EditorTextView.reusingStyledParagraphBox has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 24, if/else 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"df86dbd9069deef9fa4478419d630eac6bd2392b978a8bb7730dcf680270135a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.performMutation (cognitive 26): EditorV2Adapter.performMutation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 pts), boolean chains 4, ternaries 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6835ff3c04257aa7c8c274cc204ae1f7975f1b30fdf3b9031381b64ea459c20"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransport.receiveNext (cognitive 26): NativeCollaborationTransport.receiveNext has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, 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":"ios/NativeCollaborationTransport\u002BSocket.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65cff7cdfff47b26ab0e4ecafb9968fcfd3a80de629e40902cdb92f2e5ec611"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableInputCoordinator.projection (cognitive 26): EditorTableInputCoordinator.projection has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (11 pts), loops 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":"ios/Tables/EditorTableInputCoordinator.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e5f1b931987a7ad681f18f8cc08ae907929b9f9e7f9cc6c17011e59b64ecfa"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorMentions.useRichTextEditorMentions.handleAddonEvent (cognitive 26): useRichTextEditorMentions.useRichTextEditorMentions.handleAddonEvent has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (7 pts), boolean chains 5, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f92ae22dd5c3fa34420978f2e648d649d32faab8a646bac6e845eb1873ba6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::release_prepared_storage_suffix (cognitive 25): MutationCompiler::release_prepared_storage_suffix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (11 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dc6306815c606dfbcf23e6280d557e6ad639a66869e5ac3fa0389f2ffe7023"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::ffi_v2::render::serialize_render_element (cognitive 25): editor_core::ffi_v2::render::serialize_render_element has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (24 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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01ce6351e737ec1e0178ab5be1be372525f1456d85acc829fcd104ead8a6a20"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::interchange::table_clipboard_fragment (cognitive 25): editor_core::tables::interchange::table_clipboard_fragment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (9 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/interchange.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"df274a55a8c811dacfaf78170a8e0777fece4295e5c61d46b73730c1374b7290"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::text::delete_in_children (cognitive 25): editor_core::transform::apply::text::delete_in_children has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4717aacb97ca7fe3f4dc43b266921b498d194e8d7aec7ad216450059606da397"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::derived_state::localized_index::collect_localized_text_leaves_streamed (cognitive 25): editor_core::yrs_engine::derived_state::localized_index::collect_localized_text_leaves_streamed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f55fa6ab4bf5eab2d85d17aade94bf9d1a4467d6a5c5d3c0e79027e70a083e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterResponse (cognitive 25): NativeCollaborationTransportRegistry.parseProtocolAdapterResponse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (4 pts), boolean chains 2, loops 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":"android/src/main/java/com/apollohg/editor/NativeCollaborationTransportRegistry.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ecc59242fa55ae15d5a0a9e1bc092dad26f17e40e3c79491330f2848760914"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.attributed (cognitive 25): StaticLayoutAndroidProseLayoutEngine.attributed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97b6a91e0d179ff2877d970156b23baf45e02e439833a441002173fe1544887"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocumentKt.parseTableAttributes (cognitive 25): ViewerDocumentKt.parseTableAttributes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 2, error handling 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33273993da20f1c0c5268651994abfc5c67975475093c5c42ef435774b36871"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheet.applyText (cognitive 25): EditorStyleSheet.applyText has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32f68dfe83313b67e248d2cdc906e95881cb1f177cb911f6bd0dcc891b2de8"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.toggleTaskListMarker (cognitive 25): RichTextEditorView.toggleTaskListMarker has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 11, 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":"ios/RichTextEditorView.swift"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0450c565833afc394e4703970026f8a14781271f982febaa55613daa284485d"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutRegistry.preparedDocument (cognitive 25): PreparedProseLayoutRegistry.preparedDocument has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, error handling 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":"ios/Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc9a81afb8a29733e36bbf1c8e8dfebd252332417d5b1de1cb6e3a84551017a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateJson.appendV2JsonString (cognitive 25): NativeEditorCreateJson.appendV2JsonString has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (4 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"274757e9268685ef501a05799a1f2516a37b38d1022902ecc3ddda4d656b6700"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalTextComposition.parseNativeCompositionResult (cognitive 25): ExternalTextComposition.parseNativeCompositionResult has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, ternaries 3 (6 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fe876ab69b230642c49dbbe2723a9e86d812bc517259956e8794969c72241b"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorCommands.useRichTextEditorCommands.runAtomAction (cognitive 25): useRichTextEditorCommands.useRichTextEditorCommands.runAtomAction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, ternaries 2 (3 pts), error handling 1 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 1 belongs 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5545d0e5a738d8a8224aece556c31fa85dbb0cbacd2c37671400f6f73b2051d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedRenderBlocks::transition_localized_textblock (cognitive 24): CachedRenderBlocks::transition_localized_textblock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 3 (4 pts), match/switch 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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fa30def2217479992d82b70cfd6d4911957a913badee2fa51ecfb0d3b70f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::prepare_position_epoch_splice (cognitive 24): YrsDocumentEngine::prepare_position_epoch_splice has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 2, 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/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c01bfd5c785e802b2d72185bf35b05528bffc19f925ef99322f2ef58712b593"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::text::plan_delete_scalar_range_impl (cognitive 24): editor_core::command_planner::text::plan_delete_scalar_range_impl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/text.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b68556769f8857b93519c10ef982d9aa44ec068cef26f544855d05b9f25277"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_write::append_xml_text_json (cognitive 24): editor_core::yrs_engine::codec::projection_write::append_xml_text_json has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_write.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0265da0364c6bc06129232a292d984672b746bd598cb70952060377e75b07"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorCaretOverlayView.canDrawSeparately (cognitive 24): EditorCaretOverlayView.canDrawSeparately has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6 (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":"android/src/main/java/com/apollohg/editor/EditorCaretOverlayView.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8131e3173c68987a4a75156caafd035fddb2fccc53259254f6700fb8613b7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextDecorationDrawing.draw (cognitive 24): EditorTextDecorationDrawing.draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (3 pts), boolean chains 1, match/switch 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":"android/src/main/java/com/apollohg/editor/EditorTextDecorationDrawing.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b878d9ecdff1c2a9359a162169c8554a2995f3987bf57c4750dd73207b967e69"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2AdapterMutationsKt.performMutation (cognitive 24): EditorV2AdapterMutationsKt.performMutation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6273e551bca3b5f6962bef801a8b0ca8dd599c04328c02655910a8fcd57287"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2AdapterRenderingKt.adopt (cognitive 24): EditorV2AdapterRenderingKt.adopt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 4 (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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58db11f3f6c5275382409af682c1717958009d1e05e2c4ea27c32ad8f3ed54d"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageDecoder.preflightDataUrl (cognitive 24): RenderImageDecoder.preflightDataUrl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, loops 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"221bf71ea70b09fc72f17bca552aafeec159a6bfa20fd476fb3619fadbd4f351"}},{"ruleId":"D2","level":"warning","message":{"text":"FallbackSelectionGeometryKt.fallbackSelectionRectsForGeometry (cognitive 24): FallbackSelectionGeometryKt.fallbackSelectionRectsForGeometry has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, loops 1 (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":"android/src/main/java/com/apollohg/editor/viewer/FallbackSelectionGeometry.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"901c6b4507dd903b42f4f537e33376302a97438dc8617c624325ad58f9619cc4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.trimmedAttributedPatch (cognitive 24): EditorTextView.trimmedAttributedPatch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 pts), boolean chains 5 (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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0b49f72132b5bbdeeeb3a6ee821b035587ff2eb5b179653ad0851771f63d61"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterResponse (cognitive 24): NativeCollaborationTransportRegistry.parseProtocolAdapterResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf69b937f505a060ac8d083da5644865a6d2d87e8fb248321183870084b9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.closeStyledBlock (cognitive 24): RenderBridge.closeStyledBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 2 (6 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorStyleSheet.swift"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"969773c711d8786cb4e8bc027aecad083e4d7cdfa3e55109dbd679055bdd5463"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.arrowDestination (cognitive 24): EditorTableSurface.arrowDestination has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (5 pts), ternaries 3 (4 pts), match/switch 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4cf36472d44cad1d4fb57ee2f9a2eec39066b80e3645a53ea402b09fe6f0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocument.cellSupportsBackgroundPreparation (cognitive 24): ViewerDocument.cellSupportsBackgroundPreparation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1784f3f90961a8a47edb40238942dc429863b13861316ab812da1df36660f06"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorEvents.useRichTextEditorEvents.handleAtomLayout (cognitive 24): useRichTextEditorEvents.useRichTextEditorEvents.handleAtomLayout has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 9 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":"src/useRichTextEditorEvents.tsx"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2209d84bc25e571459223577e5efe9614477926578e51882a1ca20898ef7c724"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::prepare_remote_update_internal (cognitive 23): YrsDocumentEngine::prepare_remote_update_internal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, match/switch 1 (2 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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f392d96faa0d54697e8577a91c371c3947c4d5fe4b73243fec024994704a8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::structure::diff::structural_diff_nodes (cognitive 23): editor_core::command_planner::structure::diff::structural_diff_nodes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/structure/diff.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e341581b5882c8c4a2edd8445c6aa743b4433eb75b8b2826a17f00987bcf68"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::text::plan_textblock_text_replacement (cognitive 23): editor_core::command_planner::text::plan_textblock_text_replacement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 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":"rust/editor-core/src/command_planner/text.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"746f551907c6d4079da07d9fce0914aad82be2a4af81e0c8023dc1f9c6b26620"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextClipboardKt.handlePaste (cognitive 23): EditorEditTextClipboardKt.handlePaste has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae99d5560c281462950f5828c13157b7ae38d69b43e06e4d1eb9f6c705abc42b"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseViewerManager.createViewInstance (cognitive 23): PreparedProseViewerManager.createViewInstance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6 (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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d250810af6d89fcff850fa2833c319e6d5851dc169199cf8b79ea9191b43c968"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.adoptExternalReset (cognitive 23): EditorV2Adapter.adoptExternalReset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, match/switch 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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a829106d76b32a8359318ca809c3a6832ded2154c31647ff8cb1d75fa7102c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.parseTableAttributes (cognitive 23): EditorV2Adapter.parseTableAttributes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9836949afb32a83ac159450914e919ecc262d7659126ff99c42c8bfdd3ae291"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.attributesForMarks (cognitive 23): RenderBridge.attributesForMarks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1, ternaries 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":"ios/RenderBridge\u002BAtoms.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c8fc2892f38557f3c6a6d34c1e120b44ae70bc256bb90df625b5a61007553b"}},{"ruleId":"D2","level":"warning","message":{"text":"atoms.normalizedHtmlRules (cognitive 23): atoms.normalizedHtmlRules has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4, boolean chains 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/atoms.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32fbe0001fc4eb9e6da530df926de04bca36e01ab09e8dbecdef09fe9c1d9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaDefinition.validateAttributeDOMRules (cognitive 23): schemaDefinition.validateAttributeDOMRules has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, ternaries 2 (3 pts) (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 7 belong to 4 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":"src/schemaDefinition.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6519c1d4c498aa293868ffd5e20d5b6d8febef369a0cef4431244d675fadb4"}},{"ruleId":"D2","level":"warning","message":{"text":"AtomHost.AtomHost (cognitive 23): AtomHost.AtomHost has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 6 (7 pts), boolean chains 6, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 126, 186, 196, \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":"src/AtomHost.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f6be85c48c3d9aa12aa7adb7c6ec6e23c8a4645dad1a8494be60bd24aa6941"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedRenderBlocks::transition (cognitive 22): CachedRenderBlocks::transition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 5, boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3a93b9c634e80a3aca66d02046c9be90406804edf4054718cf3f2449a02c26"}},{"ruleId":"D2","level":"warning","message":{"text":"AttrSpec::validate_definition (cognitive 22): AttrSpec::validate_definition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"741db2cab908f2497b28cd04fae829480772d42b304d0e7f4e85eadf4993aa1e"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::clipboard::replacement (cognitive 22): editor_core::clipboard::replacement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, loops 2 (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/editor-core/src/clipboard.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1f72c7036636054f0cadc64d983e8cfac90c1cf62941e175236f183ff155cb"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::editor_state::structure::can_unwrap_list_item_local (cognitive 22): editor_core::editor_state::structure::can_unwrap_list_item_local has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 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/editor-core/src/editor_state/structure.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae68086ecb83ab0a9830476df0172a9bdc76311ae645cec04704c21af18db2"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::markdown_out::block_kind (cognitive 22): editor_core::serialize::markdown_out::block_kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 3 (5 pts) (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/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb5f1673e23055859e079a54f69f92265407c26883b9f472084c5dec56fc60f"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::markdown_out::inline::wrap_mark (cognitive 22): editor_core::serialize::markdown_out::inline::wrap_mark has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, match/switch 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/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"347222f68c90cdfcd0a155ed7b8b6d70771814a097add008429b73f227a4e7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::paste::matrix_from_slice (cognitive 22): editor_core::tables::paste::matrix_from_slice has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/paste.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39b06ff1e4434f3f262f5a766c3eddfb47de6e692e355bba163594c0fa7e0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::block::apply_split_block (cognitive 22): editor_core::transform::apply::block::apply_split_block has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33ca09eff856ba845fd38b3dcdaab490a247773d8a445cc0879dba7f4a5197b"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::text::add_mark_in_children (cognitive 22): editor_core::transform::apply::text::add_mark_in_children has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 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. This shape REPEATS in the file: one other method here (editor_core::transform::apply::text::remove_mark_in_children) 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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6036d65ef08c93e992a78da91ffd90480bcab41e6724ae0e77c5b8a26bced8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::text::remove_mark_in_children (cognitive 22): editor_core::transform::apply::text::remove_mark_in_children has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 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. This shape REPEATS in the file: one other method here (editor_core::transform::apply::text::add_mark_in_children) 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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d6633af4af6c13657d7c5a4d77c4350d5472bcc980808554d237b9241a1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::clipboard::pasted_matrix (cognitive 22): editor_core::yrs_engine::commands::clipboard::pasted_matrix has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (5 pts), boolean chains 1, 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/editor-core/src/yrs_engine/commands/clipboard.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3afa622d94a65bdbeba79763945e96bc386da7dac67abe8aaec7415c19343f8"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextDeletionKt.handleBackspaceImpl (cognitive 22): EditorEditTextDeletionKt.handleBackspaceImpl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 3 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f63679538727d7690a4caf503efee77142f6504fe0e79be4ad776d544840c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorMentionStyleKt.mergedWith (cognitive 22): EditorMentionStyleKt.mergedWith has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"85955487830a575df48578dc36cb73000ba32a1bbc686e028bd560b31bf2a2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewUpdatesKt.applyEditorResetUpdateOutcome (cognitive 22): NativeEditorExpoViewUpdatesKt.applyEditorResetUpdateOutcome has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 3, error handling 1 (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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f18beb6e5d009495809584176c201d05ca81ec6871cb3922c5bd416cd7f388"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorScrollView.onInterceptTouchEvent (cognitive 22): EditorScrollView.onInterceptTouchEvent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8 (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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8092ee17a6b9e01cf05798b50a9afdfae70c27dd42957b1ac90e16c412a8279a"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainTableCellMeasurer.measure (cognitive 22): PlainTableCellMeasurer.measure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PlainTableCellMeasurement.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9597dfb637dca05173a7c5b55ec7ddb0b47240846b55aa29aac53b794b3b8914"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.install (cognitive 22): PreparedProseDrawingView.install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5 (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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3fd167864d8b503afa94b8307de4ecf651c62111a00443bf567f8b30012df3"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.insertText (cognitive 22): EditorTextView.insertText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 5 (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":"ios/EditorTextView.swift"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45395442e376507d5b4fbf00dfa90803e647339241d60018146b6f92932f910"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.beginExternalTextComposition (cognitive 22): EditorTextView.beginExternalTextComposition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, ternaries 3 (4 pts) (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":"ios/EditorTextView\u002BExternalComposition.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ba6d0a9b4821013efe1825eb348c41faceb867e08ede31650e151adf24be90"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.commitNativeTextMutationIfPossible (cognitive 22): EditorTextView.commitNativeTextMutationIfPossible has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4 (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":"ios/EditorTextView\u002BNativeInputLifecycle.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e145e21aeb382f4f074acb027a9aa9bc3fc0ae7ebe41630d8e1316d7dcda2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoView.applyEditorUpdateOutcome (cognitive 22): NativeEditorExpoView.applyEditorUpdateOutcome has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeEditorExpoView\u002BUpdates.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c337618405602b3bfc313b374813ddedb23047e953020b6c9f516aebc8e92c"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.strikeFragments (cognitive 22): CoreTextProseLayoutEngine.strikeFragments has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (11 pts), boolean chains 5, if/else 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa98f1c0980201b534c4919d1b85ad41dcd9e7c4b78d6ec5e353e5868600d3"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetNormalization.property (cognitive 22): EditorStyleSheetNormalization.property has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, ternaries 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec83da6f4be9d84686a02298b7bee8caeef30e3132852e1d4b3a97c7279d0324"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateJson.chargeV2JsonStringBytes (cognitive 22): NativeEditorCreateJson.chargeV2JsonStringBytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 1 (3 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cd250d72cc55a79b51237acbc17ecd4d26130e08bc4aa2a149d35f914f4bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::highlight (cognitive 21): Engine::highlight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 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":"packages/code-highlighting/rust/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ec55d3805ed6792f372e88e3545814896352f3d1b3d819054ef46d0330ec74"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsDocumentEngine::prepare_position_epoch_update (cognitive 21): YrsDocumentEngine::prepare_position_epoch_update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), match/switch 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/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f497a034df02c9eb4a32b1aa63f5fa37e54c8497e3b511e11945da001c0716b"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::try_wrap_prepared_root_batch (cognitive 21): MutationCompiler::try_wrap_prepared_root_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 5, boolean chains 1, 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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d320161b6ffcedf053b6c82da71abca31920bc0fb7d44b62d58c79a62baa64"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::empty_blocks::empty_block_delete_action (cognitive 21): editor_core::command_planner::empty_blocks::empty_block_delete_action has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 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/editor-core/src/command_planner/empty_blocks.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a5789da20c71a4ac38e54833f5523d2effc4746e3b728fc35767c9ee775a29"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::model::resolved_pos::resolve_in_node (cognitive 21): editor_core::model::resolved_pos::resolve_in_node has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 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/editor-core/src/model/resolved_pos.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1170741a7249b96474427489b093df3f9b3c1fc2b81cb00c7ff1a13509b75771"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::incremental::cache_helpers::changed_textblock_position (cognitive 21): editor_core::render::incremental::cache_helpers::changed_textblock_position has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 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/editor-core/src/render/incremental/cache_helpers.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e172ead65ac77694a0b63183aade00ad5f7e76b64662b7700f410be06e83d8"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::clipboard::write_open_tag (cognitive 21): editor_core::serialize::html_in::clipboard::write_open_tag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 3, loops 1 (2 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":"rust/editor-core/src/serialize/html_in/clipboard.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5ad4dcbd94abc647d0e96129496ad643444ef62c20bafd948284818a9587ee"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::canonicalize_yrs_document (cognitive 21): editor_core::transform::apply::canonicalize_yrs_document has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function items inside it that branch (is_canonical_node, canonicalize_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/editor-core/src/transform/apply.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2125e989ba1dcdaa6c5f565e60aab69c128abf7461839ab2a06b4647182d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_match::match_xml_element_json (cognitive 21): editor_core::yrs_engine::codec::projection_match::match_xml_element_json has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb08e6f5413331d3c00d77dae9c70627161bfd40e8404bb9e4ec1d386e514e28"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextDeletionKt.handleForwardDeleteImpl (cognitive 21): EditorEditTextDeletionKt.handleForwardDeleteImpl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a8209e841ab13de5b386a22fb6b9a57475d633fb7276b23a5a2b207789280b"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticLayoutAndroidProseLayoutEngine.markSpans (cognitive 21): StaticLayoutAndroidProseLayoutEngine.markSpans has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, match/switch 2 (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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd63f923437ea83f3cdbb83416b8b0cbbb69eb85ef0e39b16eb0a22a75768ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.hitResizeEdge (cognitive 21): PreparedProseDrawingView.hitResizeEdge has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 9. 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"589277f0cb7703275ffdba2c3d073cdb7cb673a8f6362330dc0b80e3a00cdd12"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.selectionHandles (cognitive 21): PreparedProseDrawingView.selectionHandles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1988445021c5d000a5bac37aec32dc983eca502ae58b2ed72ceee0b8006e7107"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteSelectionOverlayView.refresh (cognitive 21): RemoteSelectionOverlayView.refresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, 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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c96c7cfd3027b03f057069e1b8ac1c5b96ab378bd0b8f6f8f5f348a4104b918"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleBox.draw (cognitive 21): EditorStyleBox.draw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 4 (8 pts), boolean chains 3, 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5368fcb5c8772060c0677e09f9588139e2851f8e4230d9b73ba6f04122a1a5f0"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.applyBlockStyle (cognitive 21): RenderBridge.applyBlockStyle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge\u002BStyle.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4036e4a1a9720c0a442020b298198e36afe226808edfa5665dfa8709137c7c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCreateConfig.cloneAndFreezeDescriptorValue (cognitive 21): NativeEditorCreateConfig.cloneAndFreezeDescriptorValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"757eee56c42966b16642982e7f6cddad32ece56cadf84b19ae6623fcbe4d3205"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateJsonScanner::scan_string (cognitive 20): CreateJsonScanner::scan_string has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 2 (5 pts), if/else 2 (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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bd6813dd3f799f51ec0cca0f4259b8c914582e253e35c51f3b1cba9972c193"}},{"ruleId":"D2","level":"warning","message":{"text":"TableGeography::survey (cognitive 20): TableGeography::survey has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, 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/editor-core/src/tables/mutation_guard.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"602530d3861680c8b347efac676db773085762b0f22184435b27eb6c0c1e85f6"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::outdent_list_item (cognitive 20): MutationCompiler::outdent_list_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 2 (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/editor-core/src/yrs_engine/mutation/lowering/list/indent.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"556981fff5477471c157404d0a2183e6d91d2dbc4cfe16bef2e500ceb27a8b94"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::ffi_v2::editor::create_scanner::scan_create_root (cognitive 20): editor_core::ffi_v2::editor::create_scanner::scan_create_root has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), loops 1 (2 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55230708417609c429dbd3fa8376dd9cc70bdac87d52dbbe58745f287d8d2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_out::serialize_node_attrs (cognitive 20): editor_core::serialize::html_out::serialize_node_attrs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d60a003d9af28dfacd463723ffc23518a5d69a56aa7d1dc5d9bd77b76f6a71"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::mutation_guard::cell_region_pieces (cognitive 20): editor_core::tables::mutation_guard::cell_region_pieces has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, 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/editor-core/src/tables/mutation_guard.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"011217e9ded79176fd08f22debd964784a80dcb445a20ffc7055b273b38b0d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::block::split_children_at (cognitive 20): editor_core::transform::apply::block::split_children_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1, 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/editor-core/src/transform/apply/block.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa86d88054b5e2d1127483d5382083e2b6d13358cf4fdd03229993209df6a41"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::transform::apply::list_wrap::apply_unwrap_from_list (cognitive 20): editor_core::transform::apply::list_wrap::apply_unwrap_from_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 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/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f761bbd054d499ba0c99a2b293fdb59b2aea73cca981534574a0a4859b518de8"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_match::marks_match_json (cognitive 20): editor_core::yrs_engine::codec::projection_match::marks_match_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, 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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"b485540b158cf6cbe67da5c95a378bb8bee28d3e85bd4fbad0e7e8dfb3e34410"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::document_position_at_path_budgeted (cognitive 20): editor_core::yrs_engine::compiler::insert_position::document_position_at_path_budgeted has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c42110d3d91ac4d77e7fb0930af5d71da17a750d6aea672105ca47cdfa20f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope (cognitive 20): editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/envelope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3b403d0a36ff8acc40cbfd9c3f8e72b0234fd0cd542d8a9ef51487d68fd24c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.refreshRetainedBlockMetadata (cognitive 20): EditorEditTextRenderPatchKt.refreshRetainedBlockMetadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 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":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eb157de244f7e7e169ec59a64ab2535303e023928b88100a2dcb19e56b5e24"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextSelectionKt.applySelectionFromJSON (cognitive 20): EditorEditTextSelectionKt.applySelectionFromJSON has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 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":"android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bb6d86909c921819f71a448052d305bf4636ac4af2252c2a34b9a5a2c86ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorInputSurroundingDeletionKt.performPlainSurroundingDelete (cognitive 20): EditorInputSurroundingDeletionKt.performPlainSurroundingDelete has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 1 (2 pts) (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":"android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a186c86aa2c2a8bd44aa02986d09c82e47c1fb4db2f2ce8709c439a2a35c5793"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorKeyboardToolbarView.applyButtonLayout (cognitive 20): EditorKeyboardToolbarView.applyButtonLayout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fdbead8db13b9577e2faf9fa10d87d1d590a2971c699825714616d879399d3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorUpdateIfNeededImpl (cognitive 20): NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorUpdateIfNeededImpl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 2, match/switch 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6984a36881aebc6f0d07cbf4e1991b6fd07cf2199342894bfa5a91fc58b32c74"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeToolbarItem.parseItem (cognitive 20): NativeToolbarItem.parseItem has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (2 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":"android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3143f3b22cd2e4b56f2e9cce79ab084d0f39953c41c9abb6169a2243188dcb0"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageLoader.loadInternal (cognitive 20): RenderImageLoader.loadInternal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 1 (2 pts), boolean chains 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":"android/src/main/java/com/apollohg/editor/RenderImageLoader.kt"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac3bec8a8afe44232663e173a45bff00c4c494dfcbc21139a5959516cc5bdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.onDragTouch (cognitive 20): EditorTableSurface.onDragTouch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db4e9d5899c8118e179df4fa5cda66bbef325434fcc9d54028c542139fe41c1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.measuredAutoGrowHeight (cognitive 20): EditorTextView.measuredAutoGrowHeight has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 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":"ios/EditorTextView\u002BLayout.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"85df6a17fe70f9af837199ee17477203b0f62ce1745358b2bc5b20d4229a8ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applyTopLevelChildMetadataPatch (cognitive 20): EditorTextView.applyTopLevelChildMetadataPatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, loops 1 (2 pts) (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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62cb0f14d48b13f0d2d296011a0f35b85c27aa37c8a31474b684229541af0d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorAccessoryToolbarView.updateButtonAppearance (cognitive 20): EditorAccessoryToolbarView.updateButtonAppearance has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 8, boolean chains 2 (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":"ios/NativeToolbar\u002BButtonStyle.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cb773baa03f5dca572445fc3bf18ef45e48fd09d2c672bfa3c5ad8d92f9087"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.resolveTableCellDrop (cognitive 20): EditorTableSurface.resolveTableCellDrop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 2 (3 pts) (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":"ios/Tables/EditorTableSurface\u002BCellDragDrop.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc62b6087dd06c0fb6bd4c802cbf19fff5b832e3b8816990c03cf3a736a46004"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerTablePresentation.project::appendLayout::appendBlocks (cognitive 20): ViewerTablePresentation.project::appendLayout::appendBlocks has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (8 pts), boolean chains 2 (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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"279fec1a852d6b08a380d7e7f77735763b336913d4e2e4f483b86441cbd99519"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeCellPreparation (cognitive 20): CoreTextProseLayoutEngine.makeCellPreparation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"061e3f87faeccee42e5ceaac5524f70ae2439d445904afd63c10c4ba6424a6de"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.measurePlainCell (cognitive 20): CoreTextProseLayoutEngine.measurePlainCell has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 3, ternaries 1. 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0483093568a74653edd10cd48634e1a6cb2bafa71c0f4fa61a7d95e36b0aea3e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorAddons.swift.resolveMentionQueryState (cognitive 20): EditorAddons.swift.resolveMentionQueryState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorAddons.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f8ddcf6c853ff3fc5ea79e7f5f941d2383b587af4f5e79e798b6a9a2768409"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorModule.swift.v2MutationResultDictionary (cognitive 20): NativeEditorModule.swift.v2MutationResultDictionary has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, if/else 4 (6 pts) (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":"ios/NativeEditorModule.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1ca314c5ed8555e76954814e178c44303bdd13148ca2caa04ec3204a112f6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetNormalization.tableTheme (cognitive 20): EditorStyleSheetNormalization.tableTheme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (4 pts), loops 3, 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2510d80d044a24cae5b655b95748061e8612f0238c0bd1eb4b6346c5c5b86f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedExternalTextCompositionSession.commit (cognitive 20): ManagedExternalTextCompositionSession.commit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, error handling 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":"src/ExternalTextComposition.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afc20614c40024d2005141a7e818336d8f72411b8a853f5d7b14264abcfb02f"}},{"ruleId":"D2","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.onAtomLayout (cognitive 20): useViewerAtoms.useViewerAtoms.onAtomLayout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (4 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 5 belong to 2 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":"src/useViewerAtoms.tsx"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f333fc89448ce0d38060c60404cd03670af5c5a576dfdb4caa634831ef03ae"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionMap::doc_to_scalar (cognitive 19): PositionMap::doc_to_scalar has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 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/editor-core/src/position/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21db640a6c39adcf78097f9abfec1db96c00c3f083a10ae397bfb656a879085"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentRule::matches_with_states (cognitive 19): ContentRule::matches_with_states has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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. This shape REPEATS in the file: one other method here (ContentRule::states_after_with_states) 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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fc2c6debefedae1cd0598f31b9534379e83af0f861e0b151904ce38871fbda"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentRule::compact_insertion_symbols (cognitive 19): ContentRule::compact_insertion_symbols has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/content_rule.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e2b3bda41552a3a1968a9186831028128a981ac1d376b647e9cc563c17393f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentRule::states_after_with_states (cognitive 19): ContentRule::states_after_with_states has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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. This shape REPEATS in the file: one other method here (ContentRule::matches_with_states) 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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4ba506db3e2a1b4ecad78342186a6cb7d2996a49620da75c817ec5c0631528"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockBranchIndex::build (cognitive 19): BlockBranchIndex::build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 4 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/editor-core/src/yrs_engine/block_branch_index.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2e9a9117a542676759fb995edc31d769231f8f4782cd5ad81de345839541f5"}},{"ruleId":"D2","level":"warning","message":{"text":"CanonicalSpliceCache::prepare (cognitive 19): CanonicalSpliceCache::prepare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 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/editor-core/src/yrs_engine/canonical/splice_cache.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"903502b42825bc43bceb5266e272566f25a092fc553a647b5b0ef007a8183d54"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::format::textblock_text_ranges (cognitive 19): editor_core::command_planner::format::textblock_text_ranges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/format.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f7f401cba6301019a5891923f1691c9c8dbc4f8319cd6870724f93439c72b7"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::position::scalar_to_doc_intra_block_metered (cognitive 19): editor_core::position::scalar_to_doc_intra_block_metered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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/editor-core/src/position/mod.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"541695097e076e5938bb6dfd4cfaca18af3548d1d9eb273ed69af57727b13b50"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_out::serialize_html_rules_node_open (cognitive 19): editor_core::serialize::html_out::serialize_html_rules_node_open has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2, 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/editor-core/src/serialize/html_out.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4698d4abd7caaadb8c4653a61f5e95986db2b15f802a0fe0f09fcbce96cb7107"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::json_in::lift_paragraph_images (cognitive 19): editor_core::serialize::json_in::lift_paragraph_images has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a06900061c61f42ea35c1a9a451071ced0c39f940f3eb1ac3ee94c7727f120"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::admission::validate_table_shapes (cognitive 19): editor_core::tables::admission::validate_table_shapes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/admission.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"27231eb1608c8ec86309938db0ef483a73043611b6c5728f86edf9422377270f"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::commands::tables::plan (cognitive 19): editor_core::yrs_engine::commands::tables::plan has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 12 (16 pts), if/else 2 (3 pts) (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/editor-core/src/yrs_engine/commands/tables.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"125d35a59fe0b795aefabdb31f4d5d5c8aaa31dafc2f55034557c53c47883813"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::block::join::merge_same_index_insertions (cognitive 19): editor_core::yrs_engine::mutation::lowering::block::join::merge_same_index_insertions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 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/editor-core/src/yrs_engine/mutation/lowering/block/join.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5138705d55ea1ee39e6707e5d4a567f2dcb5415c98d3f730da681a204ebbe9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::lowering::prepared::prepared_structural_insertion (cognitive 19): editor_core::yrs_engine::mutation::lowering::prepared::prepared_structural_insertion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/prepared.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db946a280fc9ca562ff3984dc18652310b21c8498e23a9e076b93201e1fd60"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::position::sticky_index_to_doc_pos_in_node (cognitive 19): editor_core::yrs_engine::position::sticky_index_to_doc_pos_in_node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 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/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"92373e70545af59bbacba39754b20bf1d8600c076a570d72fb308a3778d28114"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.node (cognitive 19): Cursor.node has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/CanonicalPlainJson.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fbca9ce8e5daee731f8f832780d1e85ef0bdc0a8e511789cf389a39e13ab09"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextHardwareInputKt.handlePrintableHardwareKeyEventImpl (cognitive 19): EditorEditTextHardwareInputKt.handlePrintableHardwareKeyEventImpl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, match/switch 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":"android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"79db93c760beef5d4d96de3d65c5f4f32701b30f16de3d9e323046e4b185b303"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.containingTable (cognitive 19): EditorTableIndex.containingTable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd30ea0dabc8e7e551e621e473c3ba371a2b067021bc347eed9cdf97831da34"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorLayoutManager.layoutManager (cognitive 19): EditorLayoutManager.layoutManager has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (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":"ios/EditorLayoutManager.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"632a575c282e2592f7a6720633c671acd6b4623995c5972a8fb47cd8e1c511e5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applyNativeTextReplacementIfPossible (cognitive 19): EditorTextView.applyNativeTextReplacementIfPossible has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, if/else 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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec516ffa302229e886bd81d2d1c2382c01bdfc9d4728063c8898de068c15960f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.isAtTableCellArrowBoundary (cognitive 19): EditorTextView.isAtTableCellArrowBoundary has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (6 pts), ternaries 1 (2 pts) (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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4da386ef31db15a279dd1d2936b1cccc8042a3756c738c5c59bf9941725ac43"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTheme.init (cognitive 19): EditorTheme.init has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 1 (2 pts), ternaries 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTheme.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33194fe2aa58f0800033988091cc006bee61d4b7d1c9a3e44ca86e1b68bab1a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeToolbarIcon.from (cognitive 19): NativeToolbarIcon.from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"924b37c520566e0fc927ed96c5fa37360edba61c2ce6abec2a7d07485abee7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.settleTableSelectionAfterTextSync (cognitive 19): RichTextEditorView.settleTableSelectionAfterTextSync has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 16, if/else 3. 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":"ios/RichTextEditorView.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c4818bbda8709d59bb75a334c256939c643878036a3a88de4afc6e0c34f21"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.validate (cognitive 19): EditorTableIndex.validate has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 3). 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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70167a6c67bf3ddd78d959b2df8826ebe5a8a5511e92d229144de4288f1f3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.makeListMarker (cognitive 19): CoreTextProseLayoutEngine.makeListMarker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (6 pts), boolean chains 5 (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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fc3012701133b358638304b54341899902920b0449b3fd139e48859cf43bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorStyleSheetNormalization.orderedMarker (cognitive 19): EditorStyleSheetNormalization.orderedMarker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"55429d3c12bc91468f98d3ae3fa2dc16621146902fc130f2940c6db23341ce31"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorMentionThemeValidation.validEditorMentionTheme (cognitive 19): EditorMentionThemeValidation.validEditorMentionTheme has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"217f9a2ec65dee1d9572fb4ed976b264961f740fd6153b0545f62bdb00126f05"}},{"ruleId":"D2","level":"warning","message":{"text":"atoms.defineAtomNode (cognitive 19): atoms.defineAtomNode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 3, loops 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":"src/atoms.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8186852904eb7e2463b02d0891c9f492a9e30238c6a5a792090676874bb8b401"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorUpdates.useRichTextEditorUpdates.applyParsedUpdateState (cognitive 19): useRichTextEditorUpdates.useRichTextEditorUpdates.applyParsedUpdateState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a20a433c6a329861152372181acc8e8db2cf47c983d06fd1db96708e9d1bff"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorCommands.useRichTextEditorCommands.updateAtomAttrs (cognitive 19): useRichTextEditorCommands.useRichTextEditorCommands.updateAtomAttrs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 1 belongs 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9ea85e50313770df1f99cfd78f027ebd9851e242b4c559e9a6380447f1664"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateJsonScanner::scan_number (cognitive 18): CreateJsonScanner::scan_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), match/switch 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"389befbb936e2aa69e3394cb30b63cc76217753434dc62128daa8974e46901db"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionNormalizer::write (cognitive 18): ProjectionNormalizer::write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, 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/editor-core/src/yrs_engine/canonical/projection_hash.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff657312e4ebf2e800fe8134176b1ceba827e2327be8f83dc9fcb0904550b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::replace_structural_range (cognitive 18): MutationCompiler::replace_structural_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3, boolean chains 1, loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"44694937d88e405619de1d2cc5b654133c374b2dbc3d762607c1b0c7676c9f18"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedSplitCompiler::try_new (cognitive 18): LocalizedSplitCompiler::try_new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, match/switch 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/editor-core/src/yrs_engine/mutation/lowering/index/localized_split.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77665695e53bab01ea50c58f072744ab9179637a20c26a0c1b4c30b6c46b039"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::collect_list_items (cognitive 18): editor_core::serialize::html_in::collect_list_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (17 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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb80b2c20f1b59bdfe12d1df6cd51c6869de38338be18990223e0c30f9e02b41"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::commands::resize::same_column_sources (cognitive 18): editor_core::tables::commands::resize::same_column_sources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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/editor-core/src/tables/commands/resize.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7db45fe8575e23dedec402fe23c9502b834433e58aee1fdc7756c7a823dbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::interchange::first_editable_position_in (cognitive 18): editor_core::tables::interchange::first_editable_position_in 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/editor-core/src/tables/interchange.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5869b7013b688980f31394d45b25acf69932225c330d7d3c5201acff4bbaa0c"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::paste::matrix_from_rows (cognitive 18): editor_core::tables::paste::matrix_from_rows has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (8 pts) (nesting depth added 8). 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/editor-core/src/tables/paste.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bede47598ec3c40ff299b4b4445a2968d2647a2031f6d17e3f5b06a7025a9edc"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextRenderPatchKt.firstCharacterOffsetForTopLevelChildIndex (cognitive 18): EditorEditTextRenderPatchKt.firstCharacterOffsetForTopLevelChildIndex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextRenderPatch.kt"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c251bbe55d5df7ccf19e641841b62786c79c81002cfd7d5cf198eb52837ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.adoptExternalReset (cognitive 18): EditorV2Adapter.adoptExternalReset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (4 pts), match/switch 2, 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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ae2278d45ef1131fa0280e617ec7f136935f8cdf81d5745beddb4914142e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransportRegistry.parseProtocolAdapterConfig (cognitive 18): NativeCollaborationTransportRegistry.parseProtocolAdapterConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (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":"android/src/main/java/com/apollohg/editor/NativeCollaborationTransportRegistry.kt"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d7f06e2516f96d458563f489e9ec5db04af85292f0babc84255ed9165cff53"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorResetUpdateIfNeededImpl (cognitive 18): NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorResetUpdateIfNeededImpl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f9be654359f52e826e4a2f0dd2fa0fc41d490a7179eb10f31b8a9a9390305"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorExpoViewUpdatesKt.applyEditorUpdateOutcome (cognitive 18): NativeEditorExpoViewUpdatesKt.applyEditorUpdateOutcome has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, error handling 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc06a5c77eeeae377a83cfe3bc1fbb9f0f7171e5ae6e91ad66da269301fe0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutRegistry.measure (cognitive 18): PreparedProseLayoutRegistry.measure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 6, error handling 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae706a34a5600b359f4a88334034e4f7da7a8445415f6a3a8e3101dbdf9b1cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocumentKt.cellSupportsBackgroundPreparation (cognitive 18): ViewerDocumentKt.cellSupportsBackgroundPreparation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a90ee8a586a03b9aa4a7df779d1779b378351e7f53c296865b1b460a5214fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocumentKt.cellSemanticSourceIndex (cognitive 18): ViewerDocumentKt.cellSemanticSourceIndex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8f47e98813e535a7103b0b74829a97760e0b2aac4bce29b2a0b206d80492d1"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.setMarkedText (cognitive 18): EditorTextView.setMarkedText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"ios/EditorTextView.swift"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdc7106d02e06384211700828e6c02f3e2ee74c906650afe8771823484f8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.scheduleCodeHighlighting (cognitive 18): EditorTextView.scheduleCodeHighlighting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, loops 1 (3 pts), error handling 2, match/switch 1 (2 pts) (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":"ios/EditorCodeHighlighting.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39d69c9e0002815648dccfca72ab719e33253a43beb8632fa30d5a7480dff34"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.shouldPreserveAcceptedAutocorrectSpace (cognitive 18): EditorTextView.shouldPreserveAcceptedAutocorrectSpace has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 16, if/else 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":"ios/EditorTextView\u002BNativeMutation.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"275179869db1da4353009c259af3ab5bd9f5b52b5b9c1f6cbd5ca00e65d2408b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.currentLogicalScalarSelection (cognitive 18): EditorTextView.currentLogicalScalarSelection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eaf748e48a633d1ea0e2ef76a2ebaa98d7c5877e13a3753b2df262a0e8bab5"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCollaborationTransport.normalizeDirective (cognitive 18): NativeCollaborationTransport.normalizeDirective has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (5 pts), match/switch 1 (nesting depth added 2). 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":"ios/NativeCollaborationTransport\u002BValidation.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdc100e62ceb8cd171178be92cb50fdda11959ba55deb31863b217f677fd317"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableIndex.containingTable (cognitive 18): EditorTableIndex.containingTable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 3, 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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa8eab34d86d662d868b8084c729380c72576da77de1299e89dcc11bfac227"}},{"ruleId":"D2","level":"warning","message":{"text":"attributeValidation.validateAttribute (cognitive 18): attributeValidation.validateAttribute has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (6 pts), if/else 3 (nesting depth added 3). 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":"src/attributeValidation.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a13d65b472a6cc2574fa6f531168b37e27ea267ef427ceef9147df822be0f57"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaNormalization.normalizeNodeHtmlRules (cognitive 18): schemaNormalization.normalizeNodeHtmlRules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function items 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":"src/schemaNormalization.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45fb785ebb06aece4296667789a0fe73e34aa1a6fa689a7e6925447d06c555d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorCollaborationTransport.decodeNativeCollaborationProtocolBytes (cognitive 18): NativeEditorCollaborationTransport.decodeNativeCollaborationProtocolBytes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42fb10225dab024e45599bc50cbf348b27b13679643f70665e1b27a2e69c9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorRenderNormalization.validLeafRenderElement (cognitive 18): NativeEditorRenderNormalization.validLeafRenderElement has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 16, if/else 1, match/switch 1. 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":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"270dca5f885ab9058a945f48d55d8863273cf29110a361804572ec4d310dc6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"useViewerAtoms.parsePositions.positions (cognitive 18): useViewerAtoms.parsePositions.positions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, ternaries 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useViewerAtoms.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a518bf7bee40da056435aa96bd7cd7122097c16b26570af79daf66bfd603b"}},{"ruleId":"D2","level":"warning","message":{"text":"Blocks::shift (cognitive 17): Blocks::shift has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (5 pts), boolean chains 3, match/switch 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/editor-core/src/position/storage.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d354971482ce75d9b08244c63ac4fd31a918d889542dea72b494352fa3bab0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportLookupMaterializationCollector::end_container (cognitive 17): ImportLookupMaterializationCollector::end_container has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (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/editor-core/src/yrs_engine/mutation/lowering/import_lookup.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb81e6f7a39131309019574f1e0cc69334e6932a45070d14d33bfd58c4fd8e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsMutationPlan::deleted_base_branch_roots (cognitive 17): YrsMutationPlan::deleted_base_branch_roots has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/model.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cce2ed35c249a4630d57808fbc8107efb5982a3f1f307762853a4941738dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::empty_blocks::clear_selected_block_content (cognitive 17): editor_core::command_planner::empty_blocks::clear_selected_block_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), boolean chains 2 (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/editor-core/src/command_planner/empty_blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5c31add06d1a5c787022604e499fdda70c996221d41152ff5b6c8dc87ead32"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::command_planner::structure::diff::structural_diff_range (cognitive 17): editor_core::command_planner::structure::diff::structural_diff_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/structure/diff.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a5851a98ce34afbd193d10580fa6e91f0d9aff2d7538cf8c52bd2498001578"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::incremental::safe_contiguous_render_blocks_patch (cognitive 17): editor_core::render::incremental::safe_contiguous_render_blocks_patch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 3 (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/editor-core/src/render/incremental.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd1c9b135e47843d246e51529f29cbeb0b44f63441e67b25382b12a38f801ff"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::markdown_out::to_markdown (cognitive 17): editor_core::serialize::markdown_out::to_markdown has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (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/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ac3846a41d3e4f7967547af1eb14fccfc4ffa2bda7a34d686b0f9c8926cb02"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_match::match_xml_text_json (cognitive 17): editor_core::yrs_engine::codec::projection_match::match_xml_text_json has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dac69c3b20bb3a185094be65c5ad32658966dbb287c67ccea813a084e5b0ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::insert_position::normalize_current_insert_node_position (cognitive 17): editor_core::yrs_engine::compiler::insert_position::normalize_current_insert_node_position has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), boolean chains 2, 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc4aadb233e735227f43358b75f8131122a3ea3a6537285013da4ae7749629"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::position::sequence_branch_index_to_doc_pos (cognitive 17): editor_core::yrs_engine::position::sequence_branch_index_to_doc_pos has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 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/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e40395021f4b36507128864807e01f1b55547b1274d2596cad0152b81ff281"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorDocumentLayout.getSelectionPath (cognitive 17): EditorDocumentLayout.getSelectionPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"666785fa56537e57a0477492430324b206a042c99ea881209ec0f54a0092ff1d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextDeletionKt.handleDeleteImpl (cognitive 17): EditorEditTextDeletionKt.handleDeleteImpl 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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de4ef0451e0e12194353f9bc57de826af9970d1aaab21c39fdad853a5cee3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextUpdatesKt.rootTableRenderForUpdate (cognitive 17): EditorEditTextUpdatesKt.rootTableRenderForUpdate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd33b36fa879ed658a1b3d82bf42fe98e0babf8d16f9cd12352a9a50d83da6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorInputCursorGeometryKt.buildSurfaceCursorAnchorInfo (cognitive 17): EditorInputCursorGeometryKt.buildSurfaceCursorAnchorInfo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (5 pts), boolean chains 3 (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":"android/src/main/java/com/apollohg/editor/EditorInputCursorGeometry.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2c9945d21c9a99e38b5219d27c73c14f433aeb67dd2c65d517b4080dc252c8"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorKeyboardToolbarView.updateButtonAppearance (cognitive 17): EditorKeyboardToolbarView.updateButtonAppearance has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, match/switch 2 (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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8521017b46e36684c8399b98a6a5d7ff9b84c1b0055606745a7737f06d93c46a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2RenderValidationKt.validRenderElement (cognitive 17): EditorV2RenderValidationKt.validRenderElement has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 1, 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":"android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca721a1ec3e8d0618b959db0e1d2b2752a82b96439216d72acdab56de874516e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.activateCell (cognitive 17): EditorTableSurface.activateCell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"90595c369d326a975b97f7d9ebbefd82bc5292f6a7d5b570b0551ccc5ab75d67"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerTableSurface.measuringViewport (cognitive 17): ViewerTableSurface.measuringViewport has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 4 (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":"android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aab9b1e7c5ec7d7bff5ea0e195fca74ce708682d430cab24a20e60940fcb76b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorClipboardPaste.command (cognitive 17): EditorClipboardPaste.command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff61b672475b00090df6f8880d7a52f42c406d6741eb54c046def0273d9dcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTextView.applyRenderPatchIfPossible (cognitive 17): EditorTextView.applyRenderPatchIfPossible has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e9dbc0773eedc03a1c9b3d82853282b5c76d28b58cfe63b3e84d76f019fec6"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2Adapter.scalarSelection (cognitive 17): EditorV2Adapter.scalarSelection has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). 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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d502cb8b8352736c55e176b2d83ab512417ac64cbe8fb8c2cf505ac90fab9a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.nestedTableHeights (cognitive 17): EditorTableSurface.nestedTableHeights has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 3, 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"503d4576a2bff50a324fbcd689fe7462b9707f9d10a4ed1195cdfcd7507ebc84"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.tablePreparationPlan (cognitive 17): CoreTextProseLayoutEngine.tablePreparationPlan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e5125b026dfdbe2c8486357f1ca7e540686199cd7a9d1a216b0a03cd02562a"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseDrawingView.drawForeground (cognitive 17): PreparedProseDrawingView.drawForeground has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"9205df7deced673fd2014240b25f26a0d956a2373860087baa8a0f6446213f52"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutCache.acquireForFabricMount (cognitive 17): PreparedProseLayoutCache.acquireForFabricMount has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 2 (3 pts) (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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"809a49f4c5da5206dbf42b96865d955e9c7e551e7413c7dfe36075c543da815e"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerDocument.cellDocument (cognitive 17): ViewerDocument.cellDocument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764b9b4329b7a15bffc7db46c1cf5a00ab341c0fe28cb4fa6444bda1600df50"}},{"ruleId":"D2","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.children (cognitive 17): useViewerAtoms.useViewerAtoms.children has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useViewerAtoms.tsx"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0b1a696a6a948bd36aa73b99613faeb0ffc24f0445b1d48121ef599c025e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"useRichTextEditorMentions.useRichTextEditorMentions.insertMentionSuggestion (cognitive 17): useRichTextEditorMentions.useRichTextEditorMentions.insertMentionSuggestion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, error handling 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"36690ccd626a0b1cbebd91baf3ea723e49d2e3d7ae0123e7a5d6997925e53f51"}},{"ruleId":"D2","level":"warning","message":{"text":"PositionMap::scalar_to_doc_metered (cognitive 16): PositionMap::scalar_to_doc_metered has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, 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/editor-core/src/position/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b32025dc66fe78bf332c8075c04e8e9bd721e34235cef17f6e54961a5073ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TableRenderContext::intern_attributes (cognitive 16): TableRenderContext::intern_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"86eee226ffa70b79b1d87a0ec3c79b8a6a32b6dfb7843f2fa92ed28acd620c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedTextLeafIndex::splice_root_window (cognitive 16): LocalizedTextLeafIndex::splice_root_window has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb762883717baf0384327f4ba7f5568cc6eb09a80348b96f14a072091a02a50"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedTextLeafIndex::carry_after_textblock_marks (cognitive 16): LocalizedTextLeafIndex::carry_after_textblock_marks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e742172800925e7bafd10b8ead3a5c694cb362ea6cd0264f135f5b4af44fda30"}},{"ruleId":"D2","level":"warning","message":{"text":"YrsHistory::availability_audit (cognitive 16): YrsHistory::availability_audit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 5, boolean chains 2, match/switch 1 (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/editor-core/src/yrs_engine/history/availability_audit.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e0d9bf34c7caffe06ff45cb5c625681c6b24c66e6fe008559885946cb61e94"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::update_node_attrs (cognitive 16): MutationCompiler::update_node_attrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (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/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7606fbca50661c8d18ee3e630a782fca47f8301363ef01e96240c2d29baa1b"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::insert_structural_node (cognitive 16): MutationCompiler::insert_structural_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/node.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0c12391e9bc42bf26a99f711e42b1321474c61ebb901a761f628a7093b35f7"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::register_inserted_structural_children (cognitive 16): MutationCompiler::register_inserted_structural_children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, 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/editor-core/src/yrs_engine/mutation/lowering/node.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a697c8b92b3b350d6e1289bd545446d159a959fa6ad4e7c60ebc27fd03234e6"}},{"ruleId":"D2","level":"warning","message":{"text":"MutationCompiler::delete (cognitive 16): MutationCompiler::delete has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d072087f66ab6b515758b7094fe10b5765bd9f1a0cbaf98f841434af7878e69"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonPreflight::read_number (cognitive 16): JsonPreflight::read_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c864801c3282624a91367bfa67a437862e293b9a37190ffa8b06e7ecf2ffc770"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::incremental::cache_helpers::render_localized_table_block (cognitive 16): editor_core::render::incremental::cache_helpers::render_localized_table_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental/cache_helpers.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8247e9b2288037280e9540a70f50110f3b6baa4f68b40d8f35040199a086e0"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::render::incremental::cache_helpers::classify_cached_transition (cognitive 16): editor_core::render::incremental::cache_helpers::classify_cached_transition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 3 (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/editor-core/src/render/incremental/cache_helpers.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"430f2832e35ac5c7e809285639628ad4521d14b479cf8d6420c30ea91fcd0b63"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::element_marks (cognitive 16): editor_core::serialize::html_in::element_marks has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts) (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":"rust/editor-core/src/serialize/html_in.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d73d0d421e62a539953a3482d3617c8813862b6ed3b9536960646b87ca2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_in::process_element (cognitive 16): editor_core::serialize::html_in::process_element has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c586348863b20263e98afb089552692e6fcf82a153d37063ddb0549fc1ba7fd"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::serialize::html_out::serialize_opaque_node (cognitive 16): editor_core::serialize::html_out::serialize_opaque_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaacff10c0dc955f8b32b4c61abdd93455ee04b0f1d88eb5bd1029c56ccc789a"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::commands::merge::plan_split_cell (cognitive 16): editor_core::tables::commands::merge::plan_split_cell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/commands/merge.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f4fa95a395361f24eafcaaac0c7cca1c363cb78ae81837309be9b09cabbc3"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::commands::paste::plan_matrix_paste (cognitive 16): editor_core::tables::commands::paste::plan_matrix_paste has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 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/editor-core/src/tables/commands/paste.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6735c5af452b1b5bee1f9a9fd46d841b86335f46535c0ef4b3b2d0414475f538"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::tables::render::all_elements (cognitive 16): editor_core::tables::render::all_elements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae9c21a690e8d21d6965ff4ad7a8409a714609896eb29100b5dbd6dc120351"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::codec::projection_write::xml_element_to_json (cognitive 16): editor_core::yrs_engine::codec::projection_write::xml_element_to_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_write.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a214b6c0bbbf6a09d8b067723b2e27cbd0d78ec5b5e4c2982106f266b7ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope (cognitive 16): editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), if/else 3 (5 pts), 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/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"032bc20dc5a06647054a1e992f3806b318d979f5b93fda591574f7810b373bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::compiler::selection::selection_plan (cognitive 16): editor_core::yrs_engine::compiler::selection::selection_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (7 pts), boolean chains 2 (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/editor-core/src/yrs_engine/compiler/selection.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6451e67941c905c041e0278fcee959f64e3b25034d2a9b0c59620bff06c3bde9"}},{"ruleId":"D2","level":"warning","message":{"text":"editor_core::yrs_engine::mutation::plan::preflight::signatures::expected_path_matches (cognitive 16): editor_core::yrs_engine::mutation::plan::preflight::signatures::expected_path_matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 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/editor-core/src/yrs_engine/mutation/plan/preflight/signatures.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d44b7a542435151f3397a110280002b266592e0116b5c08d4880cf7253571f"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidCollaborationTransport.driveOutboundIfPossible (cognitive 16): AndroidCollaborationTransport.driveOutboundIfPossible has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 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":"android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca86b61f8a492931fef524a5f2e727dadae9ce3e165e71c30ad1a5c53be0356"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorBlockSpacingKt.resolvedBlockSpacing (cognitive 16): EditorBlockSpacingKt.resolvedBlockSpacing has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (6 pts), boolean chains 5, if/else 2 (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":"android/src/main/java/com/apollohg/editor/EditorBlockSpacing.kt"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdbf815cbe1a258b6ebf8b338c09805ecd5f07aac5a46f23c63010271ddbb4c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorBoxDrawing.draw (cognitive 16): EditorBoxDrawing.draw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, loops 1 (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":"android/src/main/java/com/apollohg/editor/EditorBoxDrawing.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4d094a568dfb2f2ae40391435090d0ec3450419e78b686d49e25315c5d4875"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextClipboardKt.handleCut (cognitive 16): EditorEditTextClipboardKt.handleCut has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab0f391fdc63d0aa52c4ab92244e6472d70e2a452ef6e9d8bac7fc67fac11e0"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextCorrectionKt.handleCompositionCommitImpl (cognitive 16): EditorEditTextCorrectionKt.handleCompositionCommitImpl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextCorrection.kt"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32352570b4400dd88e8977c9eabac19869739fe8d811afc2e363990ad12323a"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextExternalCompositionKt.finishExternalTextComposition (cognitive 16): EditorEditTextExternalCompositionKt.finishExternalTextComposition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 1, match/switch 1 (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":"android/src/main/java/com/apollohg/editor/EditorEditTextExternalComposition.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d1eab391f197728c8d9db71b2d6808ab5c6cb772a46d05ca83ee8cd56e6a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextHardwareInputKt.handleCompositionKeyEventImpl (cognitive 16): EditorEditTextHardwareInputKt.handleCompositionKeyEventImpl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 pts) (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":"android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0ad7429da88b413ee9400fc35b4e90bed70ed41bfbbfa25c571f9cc45dfe4d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextHardwareInputKt.handleHardwareKeyEventImpl (cognitive 16): EditorEditTextHardwareInputKt.handleHardwareKeyEventImpl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"268072ac573621dd33081de9ad041c1b25a72ed83879305bd8fd271030b6a2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorEditTextImagesKt.handleImageTap (cognitive 16): EditorEditTextImagesKt.handleImageTap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a555ea7f156898268d5778881703dcd0d27cac9cd8f03bfa1647b4e165d376d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorInputConnection.commitTextToEditor (cognitive 16): EditorInputConnection.commitTextToEditor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72177c8b83309b9099cc613a270ae0b14f27f3063d668f46b7f9deb99c9554c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2AdapterSelectionKt.ensureSelection (cognitive 16): EditorV2AdapterSelectionKt.ensureSelection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterSelection.kt"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1c1af9a8d070cc12854e962d05e4e9c91ad987b3c351fe8ff83d584aef4943"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorV2AdapterSelectionKt.publishAwarenessSelection (cognitive 16): EditorV2AdapterSelectionKt.publishAwarenessSelection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 pts), boolean chains 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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterSelection.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9aa9221b6a7247fd47076b1c1d4edfb3f5944299f0613632cdceb4115370be"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorModuleKt.destroyEditorV2FromModule (cognitive 16): NativeEditorModuleKt.destroyEditorV2FromModule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, 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":"android/src/main/java/com/apollohg/editor/NativeEditorModule.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7e71262ed54109dc7b8bee959fe5eb4bc15f1c8b28b9ce2d22541a3d918bf"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorModuleKt.mutationResult (cognitive 16): NativeEditorModuleKt.mutationResult has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"android/src/main/java/com/apollohg/editor/NativeEditorModule.kt"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acef7f4f3f2876c6d5be85d503746a4917726ec10059b26d42331f729d2a853"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderImageDecoder.decodeSvgLease (cognitive 16): RenderImageDecoder.decodeSvgLease has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, error handling 4, boolean chains 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5033943b463bec9cdd6d1ac496750626cc064bd8995c93327925ab7e1cc501"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.renderedAtomHeightPx (cognitive 16): RichTextEditorView.renderedAtomHeightPx has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), loops 1 (nesting depth added 3). 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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7643e0aece0304e9cc3a7c74f8aaff8a4401d35e0d106476dee057262c38e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorTableSurface.reconcileActiveCell (cognitive 16): EditorTableSurface.reconcileActiveCell has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2644149641ab67e0532e5b00b96fc9afb8cdb616ad5c21ac943a0af408f3427"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteSelectionDecoration.from (cognitive 16): RemoteSelectionDecoration.from has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. 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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"800570dc7a6cb820b4468fb7905746b656b0ec4c9a35658c62e170c4e719cfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockImageAttachment.attachmentBounds (cognitive 16): BlockImageAttachment.attachmentBounds has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 2 (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":"ios/RenderBridge\u002BAttachments.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"45514e4cf442378073229c5fc6bdfcd3db0e57db8e5dc79410e05a624efbb2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderBridge.renderBlocks (cognitive 16): RenderBridge.renderBlocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, loops 2 (3 pts) (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":"ios/RenderBridge.swift"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e1f1b3c126694fd84a04cfa7d84e6e4b9927ab4deb6f996fb98c48052fb1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RichTextEditorView.surroundingProseScalar (cognitive 16): RichTextEditorView.surroundingProseScalar has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4, ternaries 3 (4 pts), loops 1 (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":"ios/RichTextEditorView.swift"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824acbc9929c11ced9ae6136d4fe6f22665028c2903d218fa7824bd866ec11a"}},{"ruleId":"D2","level":"warning","message":{"text":"TableGridLayout.columnGeometry (cognitive 16): TableGridLayout.columnGeometry has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), loops 2 (3 pts), ternaries 1 (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":"ios/Tables/TableGridLayout.swift"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e86a0b0da7614168098f54a53c17a4c4ea8ffde5e660ccafbad19c99eca3a"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreTextProseLayoutEngine.semanticBindings (cognitive 16): CoreTextProseLayoutEngine.semanticBindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe18ba5c55e009a1bf377e0b9daa8cfa9a4bb6db15337801153b8eae63a8050"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedProseLayoutCache.contribution (cognitive 16): PreparedProseLayoutCache.contribution has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b39fae24992314f0bb698eeec328ce8a88585e6ca5f18ecf5b8369f5a9be570"}},{"ruleId":"D2","level":"warning","message":{"text":"UIView.editorVisibleRectInWindow (cognitive 16): UIView.editorVisibleRectInWindow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), loops 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"269b896f9a3b96ed3727c9d0565b4e0dcc456c80500f68c8ec02acc336ff02e7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeEditorModule.swift.destroyEditorV2FromModule (cognitive 16): NativeEditorModule.swift.destroyEditorV2FromModule has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, 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":"ios/NativeEditorModule.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda292a3f3ffcf5e2802b18479274967a257a5bfd288821a893eae35659a2e18"}},{"ruleId":"D2","level":"warning","message":{"text":"schemaNormalization.normalizeNodeJSONProjection (cognitive 16): schemaNormalization.normalizeNodeJSONProjection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 1, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaNormalization.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"efda1a57933dc3ba2e133814ab88128f2068ef8caababd5a04aaa9265d873f79"}},{"ruleId":"D2","level":"warning","message":{"text":"useEditorToolbarInteractions.useEditorToolbarInteractions (cognitive 16): useEditorToolbarInteractions.useEditorToolbarInteractions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 7 function literals inside it that branch (lines 230, 205, 255, \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":"src/useEditorToolbarInteractions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908d707db350f2eef44eea8d96ce25d5a224bbcc7f61d946c670e37151ec8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedExternalTextCompositionSession.cancelWithCause (cognitive 16): ManagedExternalTextCompositionSession.cancelWithCause has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, error handling 1, 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":"src/ExternalTextComposition.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f345858699a9e410d74ae4d955f14066ae165707628879aac25f7fea0c1a5597"}},{"ruleId":"D2","level":"warning","message":{"text":"useViewerAtoms.useViewerAtoms.updateAttrs (cognitive 16): useViewerAtoms.useViewerAtoms.updateAttrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 3 (4 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function items inside it that branch (execute, clean). 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":"src/useViewerAtoms.tsx"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76af8f39d9046bfaccad77d805034146ff00d849da5ec3d2ce914c0d336eeca"}},{"ruleId":"D2","level":"warning","message":{"text":"useFocusPreservingFrames.useFocusPreservingFrames.refresh (cognitive 16): useFocusPreservingFrames.useFocusPreservingFrames.refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 125, 136, 104). 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":"src/useFocusPreservingFrames.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b88e147fbb4aa2d99002cf70e08e2e262b107aa73116cd4483563b1270f26f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorTextView: TooManyMethods \u2014 346 methods, declared across 20 files: ios/EditorTextView\u002BSelection.swift (39), ios/EditorTextView\u002BKeyboardInput.swift (33), ios/EditorTextView\u002BImages.swift (28), ios/EditorTextView.swift (28), \u002B16 more file(s). The bar is 30 methods; this is 316 over it, 11.53\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":"ios/EditorTextView.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7029c2c8e795bfdf2344ecc480b08d1edf60429f942bfcaeef4d6f76e32f9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.apply_compiled_transaction_with_history_and_context: MethodTooLong \u2014 apply_compiled_transaction_with_history_and_context runs 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) in one body. The bar is 100 significant lines; this is 835 over it, 9.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/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4b93dc4b3dcd15b50632274c2cc3051573cfb38726029a92499397999b679e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticLayoutAndroidProseLayoutEngine.prepareLayout: MethodTooLong \u2014 prepareLayout runs 724 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 624 over it, 7.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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f6c7f1a64a53a9d26497a1982a35d0fefa4976e60b8116008f1e89d053ebc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationCompiler.compile_structure: MethodTooLong \u2014 compile_structure runs 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 469 over it, 5.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/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e4aa78d682200c22e7848988020164c133dc76aae039368ba01b716d537213"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorV2Adapter: TooManyMethods \u2014 165 methods, declared across 8 files: ios/EditorV2Adapter\u002BSelection.swift (29), ios/EditorV2Adapter\u002BRenderState.swift (26), ios/EditorV2Adapter\u002BCommands.swift (24), ios/EditorV2Adapter\u002BEnvelope.swift (23), \u002B4 more file(s). The bar is 30 methods; this is 135 over it, 5.50\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":"ios/EditorV2Adapter.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"882c87e243094215c5b693c4e25802cd9c7d97335a60febc9879ebf9814ff276"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticLayoutAndroidProseLayoutEngine: ClassTooLong \u2014 2175 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 1775 over it, 5.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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8974e93d15dd3ad5de30cd48ecafab90db2905b46447e40a4c32c7a8032528"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderBridgeElementsKt.appendElements: MethodTooLong \u2014 appendElements runs 542 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 442 over it, 5.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":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8810edd6761000f9b6534a255a5cbdf5cf959018982cf17392797e1ba6bbdd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: YrsDocumentEngine: TooManyMethods \u2014 152 methods, declared across 15 files: yrs_engine/engine.rs (57), engine/undo_redo.rs (18), engine/imports.rs (16), engine/commands.rs (14), \u002B11 more file(s). The bar is 30 methods; this is 122 over it, 5.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/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4617a9e565296e6e49e209cb84066bc41bf8552e81fbc9068fe77d52fa0996bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTableSurface: ClassTooLong \u2014 2021 significant lines (blank, comment-only and punctuation-only lines excluded), 103 methods. The bar is 400 significant lines; this is 1621 over it, 5.05\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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6f689f0d249d7cdc0d88acb186e8e805092a7514f3d3d3ba0771832b9509c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeEditorExpoView: TooManyMethods \u2014 149 methods, declared across 11 files: ios/NativeEditorExpoView\u002BProperties.swift (27), ios/NativeEditorExpoView\u002BFocus.swift (18), ios/NativeEditorExpoView\u002BAccessoryRetry.swift (17), ios/NativeEditorExpoView\u002BUpdates.swift (15), \u002B7 more file(s). The bar is 30 methods; this is 119 over it, 4.97\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":"ios/NativeEditorExpoView.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddad0a12f5df3efa42d20927256fe5168cd0737825fd3984b10e15419180cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/AndroidProseLayoutEngine.kt: FileTooLong \u2014 2393 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: StaticLayoutAndroidProseLayoutEngine (277-3041). The bar is 500 significant lines; this is 1893 over it, 4.79\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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5038825534babf6b20547b7057aab241642734e5802de20c3cbe8316b42dc562"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::semantic::compile_transaction_impl: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::semantic::compile_transaction_impl runs 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) in one body. The bar is 100 significant lines; this is 377 over it, 4.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/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"831b7a661e20d869d2c931b13cb4f97a43e03308868683cdb4ebb13cd3a3af25"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorEditText: TooManyMethods \u2014 141 methods. The bar is 30 methods; this is 111 over it, 4.70\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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2277a689c27c43d03a4d5e71fcdc32d498b4007f07befb9d446ede1956a8f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/EditorTableSurface.kt: FileTooLong \u2014 2158 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: EditorTableSurface (156-2728). The bar is 500 significant lines; this is 1658 over it, 4.32\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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24f520ca338555d2f549e6cdf39e65fa89bde83300d6dec4f0f5233b6a8c93e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRichTextEditorCommands.useRichTextEditorCommands: FunctionTooLong \u2014 useRichTextEditorCommands runs 431 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 331 over it, 4.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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a451ac4f8d553188aa65d6c540b81d8c47098ced5b082c3533e26378eda0cc3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.split_block: MethodTooLong \u2014 split_block 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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7a2d7b96c9920b1e90e04581ed5517f4f5aae7ad19912b182ff68d55734ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRichTextEditorUpdates.useRichTextEditorUpdates: FunctionTooLong \u2014 useRichTextEditorUpdates runs 429 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 329 over it, 4.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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7311658fc401d1e217fff3173a8b09350f70642f54452dfcedebc7782736db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeEditorExpoView: TooManyMethods \u2014 122 methods. The bar is 30 methods; this is 92 over it, 4.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1811227b93d203d85f354229fed3ff51d484af62a3371939e3d7fb21f945d921"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.unwrap_from_list: MethodTooLong \u2014 unwrap_from_list runs 393 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 293 over it, 3.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/list/unwrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f9dc9a459fca6af42183ac544f4cda0085770d4192740902824f4de3ae45cf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreparedProseDrawingView: ClassTooLong \u2014 1560 significant lines (blank, comment-only and punctuation-only lines excluded), 107 methods. The bar is 400 significant lines; this is 1160 over it, 3.90\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18ac3ff0272f9cc19680e5d65ae1c51f11727c07ade6454640d35a65b46965"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl runs 390 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 290 over it, 3.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/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f5e06eb60681623530d7dfb1880fdbd3a7de05470c9e4f8fcd488cea1f3baf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useNativeEditor.useNativeEditorDocument: FunctionTooLong \u2014 useNativeEditorDocument runs 387 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/useNativeEditor.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"639674740e68943a185b17181a1dd4601c62557f5d1d525b9ed0befe814676c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorTableSurface: TooManyMethods \u2014 113 methods, declared across 2 files: Tables/EditorTableSurface.swift (105), Tables/EditorTableSurface\u002BCellDragDrop.swift (8). The bar is 30 methods; this is 83 over it, 3.77\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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae0b736dd418cc35dc38d1100712d57974840f154b14cf5dd8713d4e754110e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.prepare_remote_update_internal: MethodTooLong \u2014 prepare_remote_update_internal 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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d3b200b3247465909110df8fe1a26ac4ada1cb8c71511e299ec76b608792a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useEditorToolbarPresentation.useEditorToolbarPresentation: FunctionTooLong \u2014 useEditorToolbarPresentation runs 364 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 264 over it, 3.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":"src/useEditorToolbarPresentation.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf3e91d5d471a1a5d652f514a54b99c45da4061989eff55337731c33c713c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreTextProseLayoutEngine.prepareBlock: MethodTooLong \u2014 prepareBlock runs 361 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 261 over it, 3.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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8643f136fc13ceb225cd20f51bd4c5fe93f44c152c92159842695428656e0b08"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreparedProseDrawingView: ClassTooLong \u2014 1433 significant lines (blank, comment-only and punctuation-only lines excluded), 101 methods. The bar is 400 significant lines; this is 1033 over it, 3.58\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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d70f03b60145ebaa3ba72a44c2220816e651a06f5760acf5aed344bcfc30494"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseDrawingView: TooManyMethods \u2014 107 methods. The bar is 30 methods; this is 77 over it, 3.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c71fb673e0579248a1b5cea4b9c8283b922b3a3622226553ebd78bd8f73423"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoreTextProseLayoutEngine: ClassTooLong \u2014 1420 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 1020 over it, 3.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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386faa4f68ed58e88cd407fda36ad0160fd1e7518e6c6a84228d8e06bdc8a3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticLayoutAndroidProseLayoutEngine.prepareBlock: MethodTooLong \u2014 prepareBlock runs 355 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 255 over it, 3.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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"523058289cca29f297beb352ec1643d83a3163cc23f2c67e6d0067c7f1cca7ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useViewerAtoms.useViewerAtoms: FunctionTooLong \u2014 useViewerAtoms runs 355 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 255 over it, 3.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":"src/useViewerAtoms.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc16793c88daaf2d3030beea3f954aac07641386ccb3024e40d71b3cce7bcc1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTableSurface: ClassTooLong \u2014 1408 significant lines (blank, comment-only and punctuation-only lines excluded), 113 methods. The bar is 400 significant lines; this is 1008 over it, 3.52\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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083721de3b02feca4a0d3ec7f2e6f9beedae16719ec46c03da37452766e00c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreTextProseLayoutEngine.makePreparation: MethodTooLong \u2014 makePreparation runs 349 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 249 over it, 3.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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afe9217a5c8f147527792144d08c94cc85e51392efe705fda5915c6b79955c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRichTextEditorEvents.useRichTextEditorEvents: FunctionTooLong \u2014 useRichTextEditorEvents runs 349 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 249 over it, 3.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":"src/useRichTextEditorEvents.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c543bdb2a53b9e6efc24640c5178c31086f7de6d31fcfaf635e16fe6d31193"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useEditorToolbarItems.useEditorToolbarItems: FunctionTooLong \u2014 useEditorToolbarItems runs 345 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/useEditorToolbarItems.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b66dab3d4af90d78f06ded4d2d2ca1da505ed734ed5faae869f3f7bdf1394c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorTableSurface: TooManyMethods \u2014 103 methods. The bar is 30 methods; this is 73 over it, 3.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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"373b54fe681300b798fa8582ee9eb374764f173b21007615bad2fe28d67aa027"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderBridge.renderElements: MethodTooLong \u2014 renderElements runs 339 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 239 over it, 3.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":"ios/RenderBridge.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee69078767a8fdf9c60f74a87150ba1e362878d8d03311864907a574a813c3fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseDrawingView: TooManyMethods \u2014 101 methods, declared across 2 files: Viewer/PreparedProseDrawingView.swift (98), ios/EditorCodeHighlighting.swift (3). The bar is 30 methods; this is 71 over it, 3.37\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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d02be7ea3bd6576bbfcfcaca25b3ff88fbc2769b7c1a1e7cf5cab03a08387"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.outdent_list_item: MethodTooLong \u2014 outdent_list_item runs 334 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 234 over it, 3.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/editor-core/src/yrs_engine/mutation/lowering/list/indent.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bb60ec3663ce4b7d774deed1f19143ae906e5b77873466c4d06cba92487066"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.wrap_in_list: MethodTooLong \u2014 wrap_in_list runs 334 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 234 over it, 3.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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad950976a0ae59d88cbfa28e3115e3fe84054eef1fbd6b57a9bd43e2d500fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRichTextEditorMentions.useRichTextEditorMentions: FunctionTooLong \u2014 useRichTextEditorMentions runs 331 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 231 over it, 3.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":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c25de9b04e45ca43eed8c7dd5996f1e8244c1a308c1ca4e1c23d16ba3daae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/PreparedProseDrawingView.kt: FileTooLong \u2014 1652 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PreparedProseDrawingView (77-2114). The bar is 500 significant lines; this is 1152 over it, 3.30\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544757b7ccb464570107abfd1af24e31be047ebb4b5de09f20be5b16306b00a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationCompiler.compile_marks: MethodTooLong \u2014 compile_marks runs 325 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 225 over it, 3.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/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff24967a47fb0214eba772a031887edb580a6beae30701b201b33861d9b3905"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::plan::preflight::preflight_mutation_plan_impl runs 321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 221 over it, 3.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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66dcaec6b9884cf8c8602c27322f945626a383ae3aa3d2ae3638fbb6f3107e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tables/EditorTableSurface.swift: FileTooLong \u2014 1546 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: EditorTableSurface (79-1858). The bar is 500 significant lines; this is 1046 over it, 3.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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af7b52cee05acf9586262afd8296cffe527aa5e531143decc90116a4ee74aea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::schema::presets::build_schema_parts: FunctionTooLong \u2014 editor_core::schema::presets::build_schema_parts runs 307 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 207 over it, 3.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/editor-core/src/schema/presets.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d53cd046b412e791ba028c56fd2c717c5070d2959744f2904ba98f1f7611a31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RichTextEditorView: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RichTextEditorView.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e749af5515c0fcf4b37590e9c0c30f253cdb7247cdd3be52cf5feedd2c961106"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Viewer/PreparedProseDrawingView.swift: FileTooLong \u2014 1525 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PreparedProseDrawingView (80-1931). The bar is 500 significant lines; this is 1025 over it, 3.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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2d8a6afcc9ccf2d6f5b519b5c4c60b02019006ed6aaffcab60e5a187ccb4e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schema.try_new_with_budget: MethodTooLong \u2014 try_new_with_budget runs 300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 200 over it, 3.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/editor-core/src/schema/construction.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebe20c847aa65cca9bb020a5d6e223488a93a7ad729fd344c5f98999a434066"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RichTextEditorView: ClassTooLong \u2014 1185 significant lines (blank, comment-only and punctuation-only lines excluded), 92 methods. The bar is 400 significant lines; this is 785 over it, 2.96\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":"ios/RichTextEditorView.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aa335b097762e3fe3f92664a3115cd5e8167c94b5cc04c91ee60a5b5ce35b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationCompiler.compile_text: MethodTooLong \u2014 compile_text runs 292 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 192 over it, 2.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/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e997e1d5952f689252acd8385a7c8af5425c0781717146b7c04757904ced576a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Viewer/CoreTextProseLayoutEngine.swift: FileTooLong \u2014 1424 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: CoreTextProseLayoutEngine (9-1709). The bar is 500 significant lines; this is 924 over it, 2.85\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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c3bfbd51e97a09e6166fa313c7d6b34da9fcf49896b12c99dc7f6ad5592db3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.indent_list_item: MethodTooLong \u2014 indent_list_item runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.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/editor-core/src/yrs_engine/mutation/lowering/list/indent.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f1c63d749d96a5ec364814cdd362010dca6dd8db020de53eab3a80fc0995af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTextView.applyUpdateJSON: MethodTooLong \u2014 applyUpdateJSON runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b089607d9973b63a89d3a9326b9fe05e5a057b75e7782bb8048cc64a391820"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorV2Adapter: TooManyMethods \u2014 83 methods. The bar is 30 methods; this is 53 over it, 2.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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"96db919ecee1537e2652bf74a3d93390010eacc74c1fc0093e0b701e7b4676ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useEditorToolbarInteractions.useEditorToolbarInteractions: FunctionTooLong \u2014 useEditorToolbarInteractions runs 266 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 166 over it, 2.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":"src/useEditorToolbarInteractions.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d13fe76c446116b3b965bb38f2bdfdf9c6193441ae50153f1a98473150afcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.apply_empty_skip_transaction: MethodTooLong \u2014 apply_empty_skip_transaction runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.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/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb644fda437a8a2cdb74146a1279885d7f3f7325f7e30ebbd9b676fc76e2c979"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationCompiler.compile_edit_structure: MethodTooLong \u2014 compile_edit_structure runs 262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 162 over it, 2.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/editor-core/src/yrs_engine/compiler/operations/batch.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0198786ea7fa38147df0a49100da85c59bba0356f045ef8125f2fc73e47208bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RichTextEditorView: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cb1ba67fe760e5f671c39cc7b36c64426665b30fe96f2f92db2dff25ab1b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/ViewerTableSurface.kt: FileTooLong \u2014 1271 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 771 over it, 2.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":"android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a519bfa997bf68685f5c8482ad14177ae2c81094640057796329c7f7e7b6a888"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeEditorModule.definition: MethodTooLong \u2014 definition runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/NativeEditorModule.swift"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f280d14176bd215ce1c35fe4a73ce37551c397d7add79aa3cfeb3e099d13293a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/RichTextEditorView.swift: FileTooLong \u2014 1248 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: RichTextEditorView (96-1664). The bar is 500 significant lines; this is 748 over it, 2.50\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":"ios/RichTextEditorView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9954b54fba237469d64b7e359ac96fc685bffce7090974bd77d18504df97cd44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.insert_structural_node: MethodTooLong \u2014 insert_structural_node 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/editor-core/src/yrs_engine/mutation/lowering/node.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a85d394f13d5be6405e4947abfb60cdfd370307bd0a6b00b8c287930697b39"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RichTextEditorView: ClassTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. The bar is 400 significant lines; this is 549 over it, 2.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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee0a6b5eee668d910495c359737a5538f6c2fe6219ff5eabe3a1c544b424693"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.rebuild_target_layout: MethodTooLong \u2014 rebuild_target_layout runs 237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 137 over it, 2.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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb95253821909f156d239e2e7201a6f8c2b5770f998f97542261f9354513e884"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::text::plan: FunctionTooLong \u2014 editor_core::yrs_engine::commands::text::plan 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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"300784d28fdb005bce4bba20228d0dfbdf7c05d11fcce4c788d2ed4dd1e581f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.delete_structural_range: MethodTooLong \u2014 delete_structural_range runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc2dfab78da8d266977308ea9ee7cd7065f238a18df6ff16ad9794357cb857"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::render::incremental::generate_block_inner: FunctionTooLong \u2014 editor_core::render::incremental::generate_block_inner 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/editor-core/src/render/incremental.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9e5df141e5857520d8d1c59efc05562fc34ecb5f055bef6457670d94f42d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperationCompiler.compile: MethodTooLong \u2014 compile 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/editor-core/src/yrs_engine/compiler/operations.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d3e4debd7abf669ee938e68aa75b9a39d8f2a101100de1052f3f9852a6b244"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tables/ViewerTableSurface.swift: FileTooLong \u2014 1056 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 556 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"710439cb7c7902894d6ba0bff75d546e94f3f5f49b1c2850c22f125b25a1cc76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTableSurface.refreshPresentation: MethodTooLong \u2014 refreshPresentation runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75f3deb9f134aa021dd4cc790ca0172ae856475cd8d951514840ebe93a1b4b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.replace_structural_range: MethodTooLong \u2014 replace_structural_range 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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"de30aeb9bc7597ce0b61cd4a039e8b1611d36df323e65bc1d263f6045e0f25ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorTextSurface: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 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":"android/src/main/java/com/apollohg/editor/EditorTextSurface.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"279ad12efe4095d74c513770cbbb545ae993d4f3a84d6d4f3e2200b1e6f56c74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: YrsHistory: TooManyMethods \u2014 62 methods, declared across 5 files: history/replay.rs (29), history/capture.rs (15), history/recording.rs (12), history/deletion_filter.rs (5), \u002B1 more file(s). The bar is 30 methods; this is 32 over it, 2.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/editor-core/src/yrs_engine/history.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bd69564726020ae7928d6c95f768cf7160923bdb44a961a5e2938869165d40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.derive_history_candidate_state: MethodTooLong \u2014 derive_history_candidate_state 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/editor-core/src/yrs_engine/engine/undo_redo.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d628cc53aeac8b796ceca36daa5d818558eef82fd610fc3c93912695855ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseLayoutRegistry: TooManyMethods \u2014 61 methods, declared across 4 files: Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift (22), Viewer/PreparedProseLayoutRegistry\u002BFabric.swift (21), Viewer/PreparedProseLayoutRegistry\u002BFabricOwnership.swift (10), Viewer/PreparedProseLayoutRegistry.swift (8). The bar is 30 methods; this is 31 over it, 2.03\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":"ios/Viewer/PreparedProseLayoutRegistry.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"30834418721123a95c32c9331ed3da6e4abcd7654d361ca104e4a6a01052d2ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DerivedStateCache.after_document_change: MethodTooLong \u2014 after_document_change 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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"21871503fc24752a828abb8b7711564eba19161e3c46521d1a081a30b5dfca16"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MutationCompiler: TooManyMethods \u2014 60 methods, declared across 12 files: index/construction.rs (21), lowering/range.rs (8), lowering/text.rs (7), index/structural_delete.rs (6), \u002B8 more file(s). The bar is 30 methods; this is 30 over it, 2.00\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/editor-core/src/yrs_engine/mutation/lowering/model.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a643cfe955986c82915cbb674181517377df7c79bb8ae41a508eff38fe510a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/text.rs: FileTooLong \u2014 996 significant 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 496 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":"rust/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab81209c6e0d2c53f452a41449473f29255160314a36772303362882fa91c6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreparedProseViewerManager: ClassTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 391 over it, 1.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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7be8c904c98a86fe0843543e1621b8b3e236cf41870bd0557827596717191bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::text::semantic_transaction_impl: FunctionTooLong \u2014 editor_core::yrs_engine::commands::text::semantic_transaction_impl 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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebc3ee75fa5bfcb3d586046250e6530513d8c906c5f38e356ff5396540a3458"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorLayoutManager: ClassTooLong \u2014 787 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 387 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":"ios/EditorLayoutManager.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a9fc6eb03351fd65211d3947dafaa245be4d87d5bd5c1c24e76bef9a4d97f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/RichTextEditorView.kt: FileTooLong \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: RichTextEditorView (34-1334). The bar is 500 significant lines; this is 477 over it, 1.95\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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c777d0ee9fbf1c994e9a51372651ae59cc18b9d026ff67a2deca9312df99a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/commit.rs: FileTooLong \u2014 977 significant 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 96% of them inside a single declaration: YrsDocumentEngine (66-1299). The bar is 500 significant lines; this is 477 over it, 1.95\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/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6332db58fd48200fac4f1ba49308551f905cc903339cc68078d72c74ce7eab97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.prepare_typed_result: MethodTooLong \u2014 prepare_typed_result 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/editor-core/src/yrs_engine/engine/transaction_result.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff21de7e8ead13f39113474c3bd0380e3c521af51e618b0ba2aab323dd98844"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derived_state/localized_index.rs: FileTooLong \u2014 953 significant 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: LocalizedTextLeafIndex (3 blocks, 124-970). The bar is 500 significant lines; this is 453 over it, 1.91\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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8db317a674c91e205a1223da2d7445f6cdca44ae311cf39f3a547a8d932c852"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewerDocumentKt.lowerElements: MethodTooLong \u2014 lowerElements runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"929000fb6b122ac8319fff3335d6e672fb555236dfc789fba72129f7979ebcfa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorV2Adapter: ClassTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 400 significant lines; this is 357 over it, 1.89\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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"50056ac23a2a7a0f866717a32d36990ce4f7888d06a26763fe056d6886cb2c48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTableIndex.stage: MethodTooLong \u2014 stage runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"294c589bd184e7a5cd01d05483e1da015dd13dc1f26b88a01222f42c68ed6d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schema.from_json_with_limits: MethodTooLong \u2014 from_json_with_limits 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/editor-core/src/schema/json.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5440b6c3a30707e86cac99baa88a65ccec38d00ebc4a02500c6d36167ed6c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DerivedStateCache.initialize_with_local_state: MethodTooLong \u2014 initialize_with_local_state 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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf58640e78aae8365467eba11eba23ae9c7c8f09892dec82edc6d4082bdd1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticLayoutAndroidProseLayoutEngine.bindCellShape: MethodTooLong \u2014 bindCellShape runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4eb991f821d2132d9ffe3667ca25cf6a8c94da849d0927e52c24d813af5ec2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorAccessoryToolbarView: TooManyMethods \u2014 56 methods, declared across 5 files: ios/NativeToolbar\u002BDiagnostics.swift (17), ios/NativeToolbar.swift (17), ios/NativeToolbar\u002BButtonStyle.swift (11), ios/NativeToolbar\u002BButtons.swift (10), \u002B1 more file(s). The bar is 30 methods; this is 26 over it, 1.87\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":"ios/NativeToolbar.swift"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"26974fc3090a5b8e519d5a1e7d88ceb76b3f90796260c2ea90c3641d0637bc34"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorSession: TooManyMethods \u2014 56 methods, declared across 3 files: session/collaboration.rs (32), session/native.rs (13), session/content.rs (11). The bar is 30 methods; this is 26 over it, 1.87\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/editor-core/src/session.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac752da4c68bc80145b054b7d6b3c9c0c2cee6852a2d36ab6c88fa55d55b7259"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.try_wrap_prepared_root_batch: MethodTooLong \u2014 try_wrap_prepared_root_batch 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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4e9ccaaf21a11368f5ab11087347f0be3bf6828d1258fd267081875fcc66e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorEditText: ClassTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded), 141 methods. The bar is 400 significant lines; this is 342 over it, 1.86\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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c32c6085862535cac2a87b5499c2c1797f594225ca1367d4591a958f9ebd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/position.rs: FileTooLong \u2014 923 significant 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 423 over it, 1.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/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd68b87ceeedaac5b526f56e6ead81b459bacefef02cc1756506474ae2306d8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTextView: ClassTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded), 346 methods. The bar is 400 significant lines; this is 336 over it, 1.84\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":"ios/EditorTextView.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0ecd58324e0948a8edfdf02a994d24601300b20cf273f422094faa1030b279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::input_limits::admit_transaction_envelope 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/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"145698cb669a304474eaac94988004b56f2bb82603f201954dee3ec89d1b61d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lowering/text.rs: FileTooLong \u2014 917 significant 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: MutationCompiler (1-929). The bar is 500 significant lines; this is 417 over it, 1.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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e31c1bba1a210cc1e504d4dc6174118e3afb412f6c82227e5078879f12a73a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalizedTextLeafIndex.carry_after_textblock_edit: MethodTooLong \u2014 carry_after_textblock_edit runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"64747538cf1e9dff30f9514a9d9d9395d27ff999cbc2c4c43a138c2a93466e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: serialize/html_in.rs: FileTooLong \u2014 911 significant 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 41 free functions. The bar is 500 significant lines; this is 411 over it, 1.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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbabbbac4dd06ca73623bea871e2d8355a8e7eea58a0d38ecf6f21aea26d62a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.update_node_attrs: MethodTooLong \u2014 update_node_attrs 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/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4b84cc6e7b2b2b2aabae2f1f8d3f981e15175ea72638001cb59367d7a8f131"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorKeyboardToolbarView: ClassTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 327 over it, 1.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6abe0cfd0fff9beaa0f667706db5eacbd57a4c9ed90618dbb897474bb2b7ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command_planner/text.rs: FileTooLong \u2014 899 significant 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 399 over it, 1.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/editor-core/src/command_planner/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dad6336558c0411b221dd04cb2d9c717e8177681000b3a20c6b205153681c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DerivedStateCache: ClassTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 3 blocks, lines 113-1015. The bar is 400 significant lines; this is 312 over it, 1.78\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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae60af469bcd37d75b61909d1659a6606fd0ac3bd2ada45d6db6b92100d6916"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.apply_virtual_structural_splices: MethodTooLong \u2014 apply_virtual_structural_splices 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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fab93b64c7bd58ce0cb44aef2aa308697c204d76f65208018201eb93a747b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/PreparedProseViewerManager.kt: FileTooLong \u2014 885 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: PreparedProseViewerManager (50-1141). The bar is 500 significant lines; this is 385 over it, 1.77\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10369d38c8d8c0a402163d9a12877436befb73116ecb098a05f84cfe79d9a028"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeTransactionBridge.submit_native_intent: MethodTooLong \u2014 submit_native_intent 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/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d44047f72e490332961291a10420eac8c3dbd84cbea72ec14bf7e3312688c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/lookup_seed.rs: FileTooLong \u2014 861 significant 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 96% of them inside a single declaration: MutationLookupSeed (1-1079). The bar is 500 significant lines; this is 361 over it, 1.72\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/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88353714fa4a30cc9dca70c1299c1d48983d25759a2535e55cac2546a48163"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/engine.rs: FileTooLong \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). The bar is 500 significant lines; this is 354 over it, 1.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/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a7ebf6028f03a6f14be87074d3212b11f1ab4d4ab2adf69f0da2321c26b8f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewerDocument.lowerElements: MethodTooLong \u2014 lowerElements runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3893e8de772f0303fc2f576e43c40fc0af5ea316a6f40add8b407e707db40c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table_interop.rs: FileTooLong \u2014 836 significant 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 63% of them inside a single declaration: RustPeer (2 blocks, 284-1020). The bar is 500 significant lines; this is 336 over it, 1.67\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/editor-core/src/table_interop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b3612633f8d1a0576b530a97dab512a0b621588ad326fcb1084afbe5a0392"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CachedRenderBlocks.transition_localized_textblock: MethodTooLong \u2014 transition_localized_textblock 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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2de21e83a1eb55828332be39ab727d9ba1fd0808c4caff96191ba64264893"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProseViewerView: TooManyMethods \u2014 50 methods. The bar is 30 methods; 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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c43f6d14c7d6e1352bf3d41ee5f4e3bfa4b7fe4e084f5d8c54c55edf50ea53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.insert: MethodTooLong \u2014 insert 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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae62478474807bd4eb24603ca557212f434cff9c66734cf55190ebf548e5694"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/content_rule.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547bb8afe2b566a2e1a42662ebf0b19495f0c2f0094d03566ba942147aa16e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RenderBridge: TooManyMethods \u2014 49 methods, declared across 5 files: ios/RenderBridge\u002BStyle.swift (18), ios/RenderBridge\u002BBlockBoundaries.swift (17), ios/RenderBridge\u002BAtoms.swift (6), ios/RenderBridge.swift (6), \u002B1 more file(s). The bar is 30 methods; this is 19 over it, 1.63\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":"ios/RenderBridge.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"567c66e2bfc3cd9bff65076691cc710dcae0e2c49036cefc3b8a2df4da8969cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::render::generate::walk_children: FunctionTooLong \u2014 editor_core::render::generate::walk_children 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/editor-core/src/render/generate.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"858549628106c21258f4625ecb702d93140282cb13f3262aaf433835f990a695"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalizedTextLeafIndex: ClassTooLong \u2014 643 significant 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, 3 blocks, lines 124-970. The bar is 400 significant lines; this is 243 over it, 1.61\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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3990263e2a2384474e3a5f658223ee482fce6dc9c680450580066578606e982f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTextSurface: ClassTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 400 significant lines; this is 241 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorTextSurface.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4682d082da663ec4e1ef543effa9d67c919d6827f0b62870f4853447e1c51d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RenderImageLoader: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RenderImageLoader.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"248a0951951f1289d67474643254cf8e673689e89c34a1dfecbfe3833a4aef51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/derived_state.rs: FileTooLong \u2014 799 significant 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: DerivedStateCache (3 blocks, 113-1015). The bar is 500 significant lines; this is 299 over it, 1.60\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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3472a68f00e75ff76bffc92a7a73369bd5f6f69d32866c0b8191618c9cb91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorLayoutManager.swift: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: EditorLayoutManager (7-1045). The bar is 500 significant lines; this is 289 over it, 1.58\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":"ios/EditorLayoutManager.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37f9820d69c6bd4da01aa64febe4669917d324b10cfb6913676da46415a5fc8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProseViewerView: ClassTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 230 over it, 1.58\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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a48e1859870d341f03cb481a09fa684efeb104d05dffb3f634ef1d5518ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AndroidCollaborationTransport: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"249da3163a47cbc7c6ec402b41d0fbd8caf35f48ab3244d6e42fbfdd456556eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeEditorExpoView: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded), 122 methods. The bar is 400 significant lines; this is 225 over it, 1.56\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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"366723bfeb1c69f1c8b729ecade71b8b04f18d2bc5018f34a71d5f32d6bfbf6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeToolbarItem.parse: MethodTooLong \u2014 parse runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b23ced7dab0a7522538e52ceb1ebafd953d5ac59e3462d44501ad22dc69e69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorEditText.kt: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: EditorEditText (29-1180). The bar is 500 significant lines; this is 263 over it, 1.53\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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7babb6976f50062307622adfb26d5b3877ea4272a0a9a6bd16667718bd738bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorV2Adapter.kt: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: EditorV2Adapter (10-1093). The bar is 500 significant lines; this is 263 over it, 1.53\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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c8e3be205f61f7d2f0bed9cf69fcc081386a877c5aab4f33dce479640f7562"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewerTableSurface: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 206 over it, 1.52\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":"android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62e429123e8eb5f40fa5225a42706fe6d920a5900d7ecaffa8a89ad2363c9b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.finish_split_with_created_right: MethodTooLong \u2014 finish_split_with_created_right 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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"674ad00932b00444f225a06324e58025727825ddfb68cad590da9a7c9da1ba47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorKeyboardToolbarView.kt: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: EditorKeyboardToolbarView (29-997). The bar is 500 significant lines; this is 253 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aa65ebe4607794ea77b253dac869caf11696722e794c7e2b50ba4da62a30bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.commit_candidate: MethodTooLong \u2014 commit_candidate 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/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e197167e90047e5b7475cc09187d5a78f9dc3dde4d3e07ec1164261bbf7492bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::plan::preflight::expected_preflight_work: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::plan::preflight::expected_preflight_work 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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80f18b7b08a82e717398bd14a30ff0f9eb1ae2c8f2aca667f78e9c31961b7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/position_epoch.rs: FileTooLong \u2014 745 significant 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 245 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/editor-core/src/position_epoch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce57cc2e0e929c465e6891227a12c6561b6f3a7f13571070afc3065cf9c04f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::clipboard::plan_at_selection: FunctionTooLong \u2014 editor_core::yrs_engine::commands::clipboard::plan_at_selection 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/editor-core/src/yrs_engine/commands/clipboard.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1d0f4053e243d37b9ea6cd88f7b786f1e2cf5120840c58135d445f591cc33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: block/split.rs: FileTooLong \u2014 741 significant 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 100% of them inside a single declaration: MutationCompiler (3-868). The bar is 500 significant lines; this is 241 over it, 1.48\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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"933dd816b51060bde83c2e66c874d86653c8137ce2d0994a76ad51b65bcc9404"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorTextView.swift: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: EditorTextView (15-1114). The bar is 500 significant lines; this is 238 over it, 1.48\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":"ios/EditorTextView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e433153e5904521bacdde75dc9a08fb9a3c2e44cef81f4fc4a2f935f1e9dd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/construction.rs: FileTooLong \u2014 734 significant 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 234 over it, 1.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/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6fd0f96772a246e41cd78ad35b55b1833058ec9b013869849230762860eead"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorInputConnection: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"28505de5712303600297d2c8caf310f33713bcdfc5501db76c85fae464d6ee5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorKeyboardToolbarView: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2057e7eb928f5723d7794dad84cff6fae2ba97ba18ac277b3e1c28e9e62ca9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTextView.applyRenderPatchIfPossible: MethodTooLong \u2014 applyRenderPatchIfPossible 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64abd51030097815b45d4ea3e52bd3f328603caf159852fb77bd0572e90d2a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreTextProseLayoutEngine.makeBinding: MethodTooLong \u2014 makeBinding 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db294fcdca31ad2367d83f40c4bee94824e5aea98ef01faf3ad1ae1c3b0f9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/editor_state.rs: FileTooLong \u2014 727 significant 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 227 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/editor_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef03075790705c412537d660564bebaff491e241325bb1a937208608eb66e355"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTextView.applyAttributedRender: MethodTooLong \u2014 applyAttributedRender runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0847398e26d9967eda61f77d53deaec52093e17891e20854205dea96e5166d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/PreparedProseLayoutRegistry.kt: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: compiledByteBudget (28-992). The bar is 500 significant lines; this is 222 over it, 1.44\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b955474590f996b1fea23b5630d893dbc46cc78a2c04b66e1a75c176de05d855"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/ViewerDocument.kt: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"899d89a7836d285df09eb4846207b5ecae6a313ef6a2ec22f0d328e5121c06be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalizedTextLeafIndex.splice_root_window: MethodTooLong \u2014 splice_root_window runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd42ad7e90d5e8756b5f6eed8f55a91a65b6b8bcacdd384ecb0c478794da290"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/ProseViewerView.kt: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: ProseViewerView (114-998). The bar is 500 significant lines; this is 212 over it, 1.42\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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb396526f1976da34aabb15526dad31afbbfd6208e2314e0b69e22ccda73182"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::serialize::html_in::clipboard::normalize: FunctionTooLong \u2014 editor_core::serialize::html_in::clipboard::normalize 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/editor-core/src/serialize/html_in/clipboard.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca7d3935bbfed19624eb33b1d184f3c924f4607f09b307266a89f394b291e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/render.rs: FileTooLong \u2014 706 significant 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 206 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/editor-core/src/tables/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1eab17ce525afe08504f27e576034279a107f0ee2c32aded9edb798bdf39d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticLayoutAndroidProseLayoutEngine.attributed: MethodTooLong \u2014 attributed runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2319f90a54c126146cf11d899693d76b5a5128f699f516b6efe1e92c2319f232"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::command_planner::text::plan_delete_scalar_range_impl: FunctionTooLong \u2014 editor_core::command_planner::text::plan_delete_scalar_range_impl 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/editor-core/src/command_planner/text.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"593a456fd0fbb73147046f4381eb260144f3b5267adc11c56827383367720095"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/tables.rs: FileTooLong \u2014 701 significant 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 201 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":"rust/editor-core/src/yrs_engine/commands/tables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"750c3bfcb5b57ccb1ec430d6d6a5f750b5bdaef1a1c0af1495ea0a0bd998413f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorDocumentLayout: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4e804195dc09fc97e8a7118efb66c2d8dd673ef8e7628b324753cf070ff90a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseInstrumentation: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseInstrumentation.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90fdae92cf72263258afc1217ac054bee471aa60f6e240b71d1e04794722804"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderBridgeInlineAndAtomsKt.appendVoidBlock: MethodTooLong \u2014 appendVoidBlock runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e87f6653fc2835f8eee0333832acd1366c6b1ae0350a56c587a80f14b46fca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::ffi_v2::native_frame::build_native_frame: FunctionTooLong \u2014 editor_core::ffi_v2::native_frame::build_native_frame 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/editor-core/src/ffi_v2/native_frame.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c294fad9e101e7f0c6097cc82ecdfb9c78bfab764e11e2fe0d13311101f0fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.compile_typed_transaction_with_read_view: MethodTooLong \u2014 compile_typed_transaction_with_read_view 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/editor-core/src/yrs_engine/engine/compilation.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"81360b7b9123eda0b045e8acb9f1f489e145899ce1ac5e55eb2116bcb4971550"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::selection::selection_plan: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::selection::selection_plan 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/editor-core/src/yrs_engine/compiler/selection.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6814ab2f7c538fb5605547c704cd765b23bf061488bdfceea59218bbd685132"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/commands.rs: FileTooLong \u2014 692 significant 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 192 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c3df48116a817076dbcc990a3b5b980b789f7fe855376c2574f791a9653f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: incremental/cache.rs: FileTooLong \u2014 690 significant 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 100% of them inside a single declaration: CachedRenderBlocks (1-879). The bar is 500 significant lines; this is 190 over it, 1.38\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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31155c2d8d1e80517837609809d4b65e721efd6bbe1776beb8d56640d8222c42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Companion.parseItem: MethodTooLong \u2014 parseItem runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4126a7386b76e7cfcb93cb47e2aff9b1c005a215dd3123942e2478f4d5c436"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedProseLayoutRegistry.measure: MethodTooLong \u2014 measure runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseLayoutRegistry.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c4b53f75bd3d128aa6142053c3e060176bea4b87bff14fa11379f095bc9528"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derived_state/history_snapshot.rs: FileTooLong \u2014 688 significant 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 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/history_snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93128ea6d61fe8dc367a18b11678c76f7ded8052e618e08bd23ae71d37616d59"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreparedProseLayoutCache: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5ed9332ad833f1bd18c7b301574ae58ef5d63f9e8f267c04764bc88b04d36a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::transform::apply::range::apply_cross_parent_delete: FunctionTooLong \u2014 editor_core::transform::apply::range::apply_cross_parent_delete 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd140fcdc70ed56d8f7ab3b82d01900e292f8e3ad296342ff23d72ff3ce1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::format::plan: FunctionTooLong \u2014 editor_core::yrs_engine::commands::format::plan 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/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c704231ceec3c812d6235c426411fa0ff3eb4d049a307408472116d242f7ebfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorTextSurface.kt: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: EditorTextSurface (46-878). The bar is 500 significant lines; this is 184 over it, 1.37\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":"android/src/main/java/com/apollohg/editor/EditorTextSurface.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7558c73e440f8b283ead61f36ec38d428ead3e9dabf9ba7b31b377ceff7616ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseViewerManager: 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"90897678c47e7d755892527c77f2c0ed1aa613d369bd1e7815263488104a5b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DerivedStateCache: TooManyMethods \u2014 41 methods, declared across 7 files: yrs_engine/derived_state.rs (12), derived_state/localized_insert.rs (9), derived_state/active_state.rs (7), derived_state/history_snapshot.rs (6), \u002B3 more file(s). The bar is 30 methods; this is 11 over it, 1.37\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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f156f1ffa58fc9e2dad0b5294d82e540747a97a9bd564eae0fbbdbe705e182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Viewer/ViewerDocument.swift: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: ViewerDocument (320-866). 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ba0ff604c52acde24bdd498be404585ab57a761eed629eaccf0e75031f9c97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.prepare_command_history_admission: MethodTooLong \u2014 prepare_command_history_admission 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/editor-core/src/yrs_engine/engine/commands.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e00878938bc0b881fea2f66f67fa1643545d8d46d4dbabf767ba57b0f83af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.insert_tracked_replacement: MethodTooLong \u2014 insert_tracked_replacement 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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be66067486012a3e47c8737f0c8dd9f064d16e8f16f9aeea406719370bfd957"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::plan::estimate::estimate_update_v1_growth: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::plan::estimate::estimate_update_v1_growth 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/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4baead4cdaa3a40d59e30e7f2c0a1ead7d4e956a03561016b8116f7c48244"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTextSurfaceInteraction: ClassTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 140 over it, 1.35\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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"053d8de38bff8e4eb0ee6bf209664ce7679370a6f9ac869b9f357afbef30634a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTableIndex.stage: MethodTooLong \u2014 stage runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f21189c7e19c68c9668ce25be17034567a774976b314dd4f9d561e21a4352a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::ffi_v2::render::serialize_render_element: FunctionTooLong \u2014 editor_core::ffi_v2::render::serialize_render_element 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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ce7010d30178822a41724bf6dc3cdcf2ea1c06e9438426073becbabce1dcea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/remote.rs: FileTooLong \u2014 673 significant 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 81% of them inside a single declaration: YrsDocumentEngine (89-796). The bar is 500 significant lines; this is 173 over it, 1.35\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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fda4923f9b965f4aa740b049f118d1a091ed733dabd53f2aeabe8270d496a97"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useRichTextEditorPresentation: ClassTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 138 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorPresentation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f016056c9324710315e53cfe921e522dca51b574d772d35f875628e1953909"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.insert_cross_parent_replacement: MethodTooLong \u2014 insert_cross_parent_replacement 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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f60640b97039a7e20704d848b49b0726cc72c66052bbfd0cb6bb0a82f4697f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UniffiEditorV2Backend: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. Most of these members implement editor.EditorV2Backend (35 of 40 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc9124ecd210e1ee795029bfdefdc18e7eea9686ab8494af6f7352ba876ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/admission.rs: FileTooLong \u2014 665 significant 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 72% of them inside a single declaration: PreparedSemanticAdmission (2 blocks, 58-901). The bar is 500 significant lines; this is 165 over it, 1.33\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/editor-core/src/yrs_engine/compiler/admission.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf6c67146a1e70fce460ee75ddd87d3a06d4ffb4fff2836ae6b7123867bc970"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command_planner/structure.rs: FileTooLong \u2014 662 significant 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 162 over it, 1.32\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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0690fc7d4554a3add40a4a2fc70a23731ddd5369df6aebcb5c8d35ff86dac406"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AndroidCollaborationTransport: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 129 over it, 1.32\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":"android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"de011e301f8fe3fafdb6ea80916c4626ee83e6368791f965dbedc3e258682586"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/undo_redo.rs: FileTooLong \u2014 661 significant 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: YrsDocumentEngine (75-831). The bar is 500 significant lines; this is 161 over it, 1.32\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/editor-core/src/yrs_engine/engine/undo_redo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7248495b69d4258c1ff416d0ca0df2494eb2e2729952e29b3121f6526d52cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationCompiler.normalize_existing_target_for_split: MethodTooLong \u2014 normalize_existing_target_for_split 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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6352e3c543affb1f70553470183b9ffd2e97d5343afd80481d2476fcf017d37f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/RenderImageLoader.kt: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\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":"android/src/main/java/com/apollohg/editor/RenderImageLoader.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b568247cccf3cecb229279967b9f75f9ea3635854ff6b64e57b45c2f4c7cbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/structural_delete.rs: FileTooLong \u2014 656 significant 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 100% of them inside a single declaration: MutationCompiler (1-770). The bar is 500 significant lines; this is 156 over it, 1.31\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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ba143792afed48c6af3dc9238a0670f72df99ebb5520a60ee345436d7d6c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTextView.applySelectionFromJSON: MethodTooLong \u2014 applySelectionFromJSON runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa0a51340082ea1f7083b96185b52f8ad2446230e4a9a32fa78a1d99845c57"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RustPeer: ClassTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 284-1020. The bar is 400 significant lines; this is 123 over it, 1.31\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/editor-core/src/table_interop.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaf4f6b63b7dc1122c64d4d75056911affeab0fd93d8cf080bc697d6c791559"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseLayoutRegistry: 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6aef72486055ffc173287f302bc997b9c041df962073197544e56e1e9c9110"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorLayoutManager: 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":"ios/EditorLayoutManager.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"23858107f284d538d352ed478d197a4ec792667898b6fe0adf9cb6f680d81d93"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseLayoutCache: 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518f235b2ba86992b7d499270cc817e16339e292903d09b05cec65582efaebe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorAccessoryToolbarView.setupView: MethodTooLong \u2014 setupView runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/NativeToolbar.swift"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490f3116f85aa6f1378a84ac6d8eb277d1e8a9a3a87976bb51341825e81b549"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::tables::render::generate_table: FunctionTooLong \u2014 editor_core::tables::render::generate_table 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/editor-core/src/tables/render.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed69fa37a042e386842d9f26839e22a950496a41b029c85171de18bbca97efd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useEditorToolbarState.useEditorToolbarState: FunctionTooLong \u2014 useEditorToolbarState runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/useEditorToolbarState.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c30cc74241dcf5ae8fba6c384c04e1d2713f0b0dce4be6f6e519dc7cec393b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RenderBridge: ClassTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 114 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":"ios/RenderBridge.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d012b8e2a980dd80708210841fff517afa911ede564d46a96d15830e4e31c8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/NativeEditorExpoView.kt: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NativeEditorExpoView (25-899). The bar is 500 significant lines; this is 141 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cecc5cfea3805cca7bf96ca9f577f48e380551693bc73067cb867d2956ff396"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plan/preflight.rs: FileTooLong \u2014 639 significant 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 139 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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06a2354635cc49455eb1a5838e48040a0d0903daffcbe0289507e1ff9537c96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorInputConnection.kt: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af2a42408d713a0bcbe661f98fdc53bf2f1be052b690f98c5b76cb09d94c680"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NativeProseViewer.RichTextViewer: FunctionTooLong \u2014 RichTextViewer runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/NativeProseViewer.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"575d5e568518c97e0407cd2ac82583bfdcd6de12dad3277a004a57d02373a39a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/commands.rs: FileTooLong \u2014 634 significant 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: YrsDocumentEngine (20-774). The bar is 500 significant lines; this is 134 over it, 1.27\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/editor-core/src/yrs_engine/engine/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90c07cea3c6df3e0c717abe32cf7da96e2b556d5ec05c9d4ba3cad4bc52387"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewerTablePresentation.project: MethodTooLong \u2014 project runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e50aff4996e40d1e159c3ba7e39fcb07117d3fa4eeac221bf475e1992394fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::transform::apply::validation::validate_opaque: FunctionTooLong \u2014 editor_core::transform::apply::validation::validate_opaque 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/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d335447d20cd5d752fb73bd99545ac65c3db5736d2432d729fdfbdc905dc24b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffi_v2/render.rs: FileTooLong \u2014 626 significant 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 126 over it, 1.25\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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a339204ae1124019b8bf25801e1407bd48e8ddbb2acc1e537bd84ce47380815"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreTextProseLayoutEngine.makeAttributedString: MethodTooLong \u2014 makeAttributedString runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd431239f6d61149be813834747834fbe2adae92da9a9659e026383f6efc0f2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/AndroidCollaborationTransport.kt: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: AndroidCollaborationTransport (130-860). The bar is 500 significant lines; this is 124 over it, 1.25\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":"android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da882526fb15de133da4437ebe42672db107637d0574996cc40bac1b3a5011e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CachedRenderBlocks.transition: MethodTooLong \u2014 transition 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/editor-core/src/render/incremental/cache.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"39159932819de02b068202c95fb6805ef3d57be707e64e8cae438f6457a69148"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::transform::apply::list_wrap::apply_unwrap_from_list: FunctionTooLong \u2014 editor_core::transform::apply::list_wrap::apply_unwrap_from_list 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/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a162142e6f1122e429c1db2d10249f7fc22e4345eb002b34cbe8742ec4fd50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::lowering::range::structural_parent_target: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::lowering::range::structural_parent_target 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/editor-core/src/yrs_engine/mutation/lowering/range.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb834dd89c53a8790ba1f32e55cbea1e98847db7dbdf82ffd076bb767238032"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: list/indent.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: MutationCompiler (1-709). The bar is 500 significant lines; this is 119 over it, 1.24\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/editor-core/src/yrs_engine/mutation/lowering/list/indent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0608659cc267eea971ae1b08b70390997240711c9c7e04837f7782e092d3f5c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: editor_core::ffi_v2::editor: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; 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/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f790a8becfdd5e1bb3927a057fbbc4804def35b8a91edb0ea07ce1bf30c5dcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorTextView\u002BRendering.swift: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac828333fb3a11444a0b4e513bedb7791b0b6ffc10ab980175c3fbafc9345cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schemaResolution.resolveDocumentSchema: FunctionTooLong \u2014 resolveDocumentSchema runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/schemaResolution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1562e2365780f6f836818ad4e1ad44bb79c2668eca7bcb10137491f7d4e3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/NativeEditorModule.swift: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 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":"ios/NativeEditorModule.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e8dfca45ccf21d6f19b61840b988135018418086b6ceb00f052816cc129ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lowering/node.rs: FileTooLong \u2014 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), about 67% of them inside a single declaration: MutationCompiler (1-481). The bar is 500 significant lines; this is 111 over it, 1.22\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/editor-core/src/yrs_engine/mutation/lowering/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a472b31a8e7c8a0cb16f2e730abda37df6e3a644cc95a8ad8259448a5d71f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::serialize::json_in::parse_node: FunctionTooLong \u2014 editor_core::serialize::json_in::parse_node 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/editor-core/src/serialize/json_in.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"497049dd048f78dc916720e9de017dc8199782c8e78f8b77f514d177132553c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustPeer.command: MethodTooLong \u2014 command 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/editor-core/src/table_interop.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c55d9d6164c2f8d352f8563eed5006ec5f348eae3d2d011b44d50944a3be249"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::tables::reference_grid::reference_pass: FunctionTooLong \u2014 editor_core::tables::reference_grid::reference_pass 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/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0180508d7fb0fa8c0c24db1774f90f987d2e4a54b52dde40152a02b880a38ad8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsHistory.availability_audit: MethodTooLong \u2014 availability_audit 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/editor-core/src/yrs_engine/history/availability_audit.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"be80fa49f1324ca309cd4409ea414ec2bb082e6e2b914763c9383c2cdb73cca1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::insert_position::resolve_insert_node_position 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4e48fb17fd0cab2e60cc9e79ae1a067c64466adc204d4c51908c1c64d7d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.prepare_deferred_command_history_admission: MethodTooLong \u2014 prepare_deferred_command_history_admission 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/editor-core/src/yrs_engine/engine/commands.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c59371555528dfe5ed06667d3e425630482add177f818ccd950024f6cbc5639"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorAccessoryToolbarView: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods. The bar is 400 significant lines; this is 80 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":"ios/NativeToolbar.swift"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3df8762c5e98504bfb181736843727b5759af40bff121e355e87adac3a725b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Schema: TooManyMethods \u2014 36 methods, declared across 3 files: schema/queries.rs (30), schema/construction.rs (4), schema/json.rs (2). The bar is 30 methods; this is 6 over it, 1.20\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/editor-core/src/schema/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2f794ae30f3e2fcd72227c97427ad3f50b671c876e86364f7de40282c72928"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::lowering::index::localized_locators::localized_root_structural_parent 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/editor-core/src/yrs_engine/mutation/lowering/index/localized_locators.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f640b54166009221a4792a7bd37dafd3f92902f929b41e1894b65b95afb9e1a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/compile.rs: FileTooLong \u2014 597 significant 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 97 over it, 1.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/editor-core/src/viewer/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21073b9d122e09d8b1a7d73c7840cabea9c2f631c729122eb742c48387bb3f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PreparedSemanticAdmission: 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), 18 methods, 2 blocks, lines 58-901. 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/editor-core/src/yrs_engine/compiler/admission.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c998f3eaec305e2fcb8dc7f93592f601a58030247654cbe296acaa6a5d5d1953"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorTableIndex: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 76 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":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd794a3d1133d36edb68202add0f10a35d940f6ba4d4f2c7ac348120d2962fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Companion.resolve: MethodTooLong \u2014 resolve runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseTheme.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a867b2bbff0d4c57570cd56309bd13b29ff0d411d04c013a4c37d1dc0f20565c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NativeEditorCreateConfig.buildV2CreateRequestUnchecked: FunctionTooLong \u2014 buildV2CreateRequestUnchecked runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c193bf3bb416fae06fef31753c1c4b3877a9d114721734f35e500ed4c9f78fb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_transaction_bridge.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.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/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55043c9338a4b0357c61ef1f7d6634a2a9364c931c65eacf64ad56ce2284c5d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operations/structure.rs: FileTooLong \u2014 591 significant 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 97% of them inside a single declaration: OperationCompiler (26-668). The bar is 500 significant lines; this is 91 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/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"280dad4598a0351d3f1a1eb32d9af5aada4118fe242de4f857520b1e4e58ea20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::tables::plan: FunctionTooLong \u2014 editor_core::yrs_engine::commands::tables::plan 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/editor-core/src/yrs_engine/commands/tables.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2014cb210469f121db8d3a49953c87d93b680d291a0153cdbe868d5eac3deb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::plan::envelope::crdt_envelope 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/editor-core/src/yrs_engine/mutation/plan/envelope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81c6a0754b95ab2db3edd018475361a59d3c13d2950395042f37b2886338c9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/useRichTextEditorPresentation.tsx: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: useRichTextEditorPresentation (50-786). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorPresentation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca991bc631fb257ef4ec6ef7bd796492cce20814bd64c98d4dd84a7f2a06819b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::mutation::lowering::node::materialize_text: FunctionTooLong \u2014 editor_core::yrs_engine::mutation::lowering::node::materialize_text 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/editor-core/src/yrs_engine/mutation/lowering/node.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf0b17cd5fa595a7daf8352b64cc1ff8fa3f38fdd1246944fafe63aee7c4516"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/RenderImageDecoder.kt: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 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":"android/src/main/java/com/apollohg/editor/RenderImageDecoder.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f923af44755d0d4af00e4db5d0f5da471e46d87220e11e01bd6afb3304174fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/RenderBridge.swift: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: RenderBridge (156-841). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d517a96401d5b8d91c12b8985ece69f6324c88274e1fd5156eeb8e594f06a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorTextView\u002BSelection.swift: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1630f9330652d0f724caf740ac0ead745779ffc9a031b03baaa3c02045689a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorDocumentLayout.kt: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0636663a831dbb1fe904f7a5ce78aa07b16cd59f4b982efeaad8be1289e3150f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorTextView\u002BKeyboardInput.swift: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527a56f1e72df758ef0fe16a71a6ce17bbff5e9127505a1f54ad01689754a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RichTextEditorView.moveFromActiveTableCell: MethodTooLong \u2014 moveFromActiveTableCell 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":"ios/RichTextEditorView.swift"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8ebe87ed9a787b0568152cbaefc899ff5c6d9cd0ba8309b470a12acaf4661d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedProseDrawingView.updateTableLayers: MethodTooLong \u2014 updateTableLayers 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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4063fe6c1b25a6cbb5df9f11501aac51d94ed106455344d22d124a28acad5185"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AtomHost.AtomHost: FunctionTooLong \u2014 AtomHost 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":"src/AtomHost.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ca903c52f86a9c9ae10814f18d872905334a9dd33bc011f43260d9fa5394b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/PreparedProseInstrumentation.kt: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseInstrumentation.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8b7311ea981f89797e4dc1ad5f0fb33007c27de8b996962f77e6ba7a4e22b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: apply/validation.rs: FileTooLong \u2014 570 significant 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 70 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"355e47eff9ed64bc72d77f894d82c94e854761b6de3ae5ab11270d6808e0283d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorInputSurroundingDeletionKt.performPlainSurroundingDelete: MethodTooLong \u2014 performPlainSurroundingDelete runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2120089178e2c4694b06ab25851f1c3fe3f8f82e40036ae957edc6c15e5c06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StaticLayoutAndroidProseLayoutEngine.markSpans: MethodTooLong \u2014 markSpans runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"046cd39a198eb555bac90309efbdab68af31fb25c2d1ab193033a7449ef0745d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::commands::structure::plan: FunctionTooLong \u2014 editor_core::yrs_engine::commands::structure::plan 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/editor-core/src/yrs_engine/commands/structure.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf4299418f64e4d56ea03268807e182182162c50b8f41821b06b82999fd8e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/EditorTextSurfaceInteraction.kt: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: EditorTextSurfaceInteraction (30-751). The bar is 500 significant lines; this is 66 over it, 1.13\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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a51f4002f04914bc1990baf5761941330c8abafca3fcb061698cbae395121e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewerTableSurface.init: MethodTooLong \u2014 init runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b610ddaff7291006bac3d95d0ee58841b7ca1da396ba81959491eae7b256c61d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedProseTheme.resolve: MethodTooLong \u2014 resolve runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Viewer/CoreTextProseLayoutEngine\u002BModels.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"351006b5c55027b9ecda5ef100ba0969904258240b3f105a448c420cbf2dfadd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schemaDocumentConstruction.constructDefaultEmptyDocument: FunctionTooLong \u2014 constructDefaultEmptyDocument runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/schemaDocumentConstruction.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a50c78636a4bfdd1e09a210b534609a3702ed41ae48bf1c074ea7f156ce30b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/TableAccessibility.kt: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 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":"android/src/main/java/com/apollohg/editor/tables/TableAccessibility.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e79aa75a51ef12a06b3f0907c23f70477e6f67713752063b7d1349c3c796d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collaboration_runtime/outbox.rs: FileTooLong \u2014 561 significant 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: CollaborationOutbox (2 blocks, 231-855). The bar is 500 significant lines; this is 61 over it, 1.12\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/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8572ef0ba6538306c176a7f65a381f1c5f27ada2a9e6726dbd06bc6974bd9db7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derived_state/candidate_evidence.rs: FileTooLong \u2014 561 significant 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 61 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":"rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a05f6225216e3273f26f125d38195890476b51427754e25e3da632593a886d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedProseDrawingView.drawTableNodes: MethodTooLong \u2014 drawTableNodes runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4c7bad869d5a7375b42df638081115ac03d848532dd5e764f2239dbc7512a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::clipboard::replacement: FunctionTooLong \u2014 editor_core::clipboard::replacement 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/editor-core/src/clipboard.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"09480ac36691017d8980a3d52a2a8391abcd22712a9a7de38201fb2fb60395d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CollaborationRuntime.process_admitted_message: MethodTooLong \u2014 process_admitted_message 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/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0106ef2f522c8ad18dce92dfe92641aa540d74eafd632ecc24e166501c77074f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.apply_prepared_command_transaction: MethodTooLong \u2014 apply_prepared_command_transaction 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/editor-core/src/yrs_engine/engine/transactions.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccaf53a7418f7e5d35aa4642946bce285b8ce208042cf04fe4b19915e378f2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorInteractionOverlays.swift: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2722c2df9dcbb8a3f7ce062a5807b55c68d433357dae8181b0347ec2f56ec3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::editor_state::command_applicability_with_known_node_count_impl: FunctionTooLong \u2014 editor_core::editor_state::command_applicability_with_known_node_count_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/editor-core/src/editor_state.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d8adc0db216cdc4ac83291f69c65ff86cd202a967790ca834fed723bfa4fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: YjsCollaboration.useYjsCollaboration: FunctionTooLong \u2014 useYjsCollaboration 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":"src/YjsCollaboration.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a68522a443972785b27e9c07bdced6ff3edcae8c94bba8a3cd7de4b95d22c5e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewerDocument: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 43 over it, 1.11\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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2c3b69da1a8f1935c48f729abb1f0b26b1424961944ad316d998e7fc8ba315"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collaboration_runtime/protocol.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e22958375a7582eb862a93eb8c1b1cbc6c7e57c16fdc6b2e5c86a277ab1d4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: apply/range.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ab6ce5d5ec3efa74b0aa596f1b895c6e9554753cf6d14496fa777e657a111b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeCollaborationTransport: TooManyMethods \u2014 33 methods, declared across 3 files: ios/NativeCollaborationTransport.swift (15), ios/NativeCollaborationTransport\u002BSocket.swift (12), ios/NativeCollaborationTransport\u002BValidation.swift (6). The bar is 30 methods; this is 3 over it, 1.10\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":"ios/NativeCollaborationTransport.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"437307e16d9a94ffde1b8810f9d741841229fa53c2a264eee41def750d7158f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Viewer/PreparedProseLayoutCache.swift: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: PreparedProseLayoutCache (6-814). 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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9fdeb72e3c9f0723350b1c47367b0214b767c9efe8fe65dbe49d62cc170e57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collaboration_runtime/awareness.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). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/awareness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d710501d1e12c0402380dbe5c93a570aef7bded5ebe2614f4e19afd69eced"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorBoxDrawing.draw: MethodTooLong \u2014 draw runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/EditorBoxDrawing.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f748b3c104142b910d05bda123b6e5eddee9b3f4c9ae3ac983de54030a7c2931"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::ffi_v2::editor::initialization::build_config: FunctionTooLong \u2014 editor_core::ffi_v2::editor::initialization::build_config 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/editor-core/src/ffi_v2/editor/initialization.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41af227a8f3d33ee66e4f3c3bd4a6415b217c303552d02171d7788e1ec374ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/RenderBridgeElements.kt: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d02f4925cc8ce6b8b9144272809fbdf9154855bc73f1df8c78946362f377dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/canonical.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f515790bd42b61e3a2e2da85e36ef8f3f3bf064cb994349e7d7396988c4f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewerTableSurface: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 36 over it, 1.09\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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a81c16727ad30328ccb8708fba64cdcecb8be43db634a0e8f697a93aa6cb647"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorTableSurface.prepareEntries: MethodTooLong \u2014 prepareEntries runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"86239b6ddbe671dc3a6360968f35d975cd6d3cf76d0188e3c6d8a6568f868357"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DerivedStateCache.textblock_edit_target: MethodTooLong \u2014 textblock_edit_target 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/editor-core/src/yrs_engine/derived_state/localized_insert.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f646120550b1e7f5fb5803fea27530bbcfd844796d2c5e99c9eccb0bdd46e4c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YrsDocumentEngine.compile_finalized_prepared_typed_transaction_with_read_view: MethodTooLong \u2014 compile_finalized_prepared_typed_transaction_with_read_view 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/editor-core/src/yrs_engine/engine/compilation.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a393cf55f8c1917121eedaa47c26a0228447466879364da730f2dc25aead19e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/yrs_compilation.rs: FileTooLong \u2014 541 significant 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 41 over it, 1.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/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be397178af47321a1cd1840e817b1234d124063d98a344dee931fdda48a7be47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derived_state/localized_insert.rs: FileTooLong \u2014 540 significant 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: DerivedStateCache (40-664). The bar is 500 significant lines; this is 40 over it, 1.08\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/editor-core/src/yrs_engine/derived_state/localized_insert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3425af6e325e714d12dcfe8f7a331c9ffe9c93b45e94a4e50f4ba6c0c4d3de7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorAccessoryToolbarView.apply: MethodTooLong \u2014 apply runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/NativeToolbar.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a6cbfb1d07e0efaf2e114bf409cf06c5359cfa4f55cc617d4b08acf3f7a5cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreTextProseLayoutEngine.makeCellPreparation: MethodTooLong \u2014 makeCellPreparation runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7b57630b629e451ed2e633fc1ae4b03ed9654a0edd0a78a46d68b325e411ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorTextView\u002BRenderPatch.swift: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 39 over it, 1.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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f302cd0a837bb42959f7448cd085674f9a1224b4ebce787d80d5ac37d5ed1d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useRichTextEditorCommands: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 31 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b03d2728ef95d8236fa62f283e156bc9496c1981290953d9da4949b1ba8c85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useRichTextEditorUpdates: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b50aebe41d5f59129b76ccc879aca1b5a1df808a9fa519a33e96d7312c4e15b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CollaborationOutbox: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 231-855. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a799c2cf80ed5121cfdd2845bae1ede22331414e86e71d3c281a57d73bc42e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Tables/TableAccessibility.swift: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.07\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":"ios/Tables/TableAccessibility.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483abecd2ca9f56f100e97204447112d929c413e0c6a790d79866eb3e6e1d5ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/transaction_result.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 69% of them inside a single declaration: YrsDocumentEngine (2 blocks, 23-685). 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/editor-core/src/yrs_engine/engine/transaction_result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3993e6e3c410259c75fb24ccbce1df04b06ee84b8ec5e810e34102c02b9a37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DerivedStateCache.restore_history_document_snapshot: MethodTooLong \u2014 restore_history_document_snapshot 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/editor-core/src/yrs_engine/derived_state/history_snapshot.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"3280f9303f0a21c8a2f6491665e3e18eb8b73a5ff0a6d5a02f65d6b68cb80ff2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ExternalTextComposition.ts: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2237f13ba3c26e5f9ab12c4c9afffe51c4fa348a572f4a184c196ff29a8029d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContentRule: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 122-732. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/content_rule.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"447a34f562172bf1f357c129e66e6e7260e2b340fdc3a27160aaaeb4f312131c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/imports.rs: FileTooLong \u2014 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), about 69% of them inside a single declaration: YrsDocumentEngine (138-607). The bar is 500 significant lines; this is 32 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/editor-core/src/yrs_engine/engine/imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aafbbdcdfbd04ba3475a68a846fdad2993fbbcfd429bedc0688bb52fc17820a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::yrs_engine::compiler::preview::try_localized_semantic_compilation: FunctionTooLong \u2014 editor_core::yrs_engine::compiler::preview::try_localized_semantic_compilation 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/editor-core/src/yrs_engine/compiler/preview.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefbdfd56786c9a68566d554c39c7c99761006fd1dec08f63ca20a6bfbbb7bca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MutationLookupSeed.with_root_window_replaced: MethodTooLong \u2014 with_root_window_replaced 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/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"23995b2aff4d31960a6a2d027629d33fd13bfe54181f1b44328e9ff11509af28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/insert_position.rs: FileTooLong \u2014 525 significant 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 25 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/editor-core/src/yrs_engine/compiler/insert_position.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1f0096874d371ceab6fe308a7461621dae9302bdbae402434dc2d31fe6bc84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CanonicalSpliceCache.prepare: MethodTooLong \u2014 prepare 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/editor-core/src/yrs_engine/canonical/splice_cache.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfeade9137a126d49ebcc781d0c2a1d7d5e8d2cdb2e68608b3dcc2dc59548f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derived_state/validation.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), about 62% of them inside a single declaration: DocumentValidationCertificate (3 blocks, 255-762). The bar is 500 significant lines; this is 24 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":"rust/editor-core/src/yrs_engine/derived_state/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb387ba1608559bf048461952a978b2e21f29f04021a69a746ae0c55ca4f1fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/NativeEditorModule.kt: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 23 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":"android/src/main/java/com/apollohg/editor/NativeEditorModule.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71beb688a58310974e28a8da9fe433fce9073e50f05fe6aa3895e04b2316833e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: list/wrap.rs: FileTooLong \u2014 523 significant 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 100% of them inside a single declaration: MutationCompiler (1-619). The bar is 500 significant lines; this is 23 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":"rust/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cccfb565e5bd228c8f81e9a564f6814682c516e67419a28dd113b592d67d1b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/update_preflight.rs: FileTooLong \u2014 523 significant 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 23 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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0186e34fabcc6f8c2912862946e26743007fe5da3884dd5cd8590516a2ad5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ios/EditorStyleSheet.swift: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 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":"ios/EditorStyleSheet.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3af29241d27d8b31cc64de43b3e3b293d1e71957d5ec3859eb9de26deab085"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DerivedStateCache.table_command_availability: MethodTooLong \u2014 table_command_availability 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/editor-core/src/yrs_engine/derived_state/table_availability.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a433bde91cef5e6c8de2693b52237eb32dec4062fe8ab1535d56c4e57b1b29e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: schemaNormalization.normalizeSchemaDefinition: FunctionTooLong \u2014 normalizeSchemaDefinition runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaNormalization.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2562e408a70a60dafa1689a40cc5bdbe169773190c19e4d640361ddd6d764f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: yrs_engine/operation.rs: FileTooLong \u2014 519 significant 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 19 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/editor-core/src/yrs_engine/operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c98cfa1c68e14e320dbb7ee8918c137b581492b3427482ccd364d50a7317a9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreparedProseLayoutCache: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutCache.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc87151774215c1ccf4fda85263375677f68824f94c57217c5e3d380207d815c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeEditorDocumentBridge: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorDocumentBridge.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e663418e11e9476c605dd345fc33a0766215800b5e08f18466b2502553cd813"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/input_limits.rs: FileTooLong \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). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b294074f8bb6cab10390fb1dd04ffc3d1cf946157f90fce91f97ee77c2775470"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderBridgeInlineAndAtomsKt.appendOpaqueInlineAtom: MethodTooLong \u2014 appendOpaqueInlineAtom runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"61012d0318238ea8be20f358718d3554d4d457012e9e2801e645ed9cd340a024"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lowering/range.rs: FileTooLong \u2014 513 significant 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 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":"rust/editor-core/src/yrs_engine/mutation/lowering/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cbe4000830864c07e2830cb5d89b0c7740dee99154690e265b1197ed8d2a47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/EditorTableIndex.kt: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: EditorTableIndex (44-680). The bar is 500 significant lines; this is 11 over it, 1.02\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":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40185cb1c065ce8d10437ebed7ebcb5031dcc12dcfbac5d0233fdd00f0807ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/useRichTextEditorState.tsx: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 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":"src/useRichTextEditorState.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75179c6d3b62c3d328249ef472582a98c26158587149832d8bf38c45c334aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codec/projection_match.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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"136c7c578456eec0f478b75233b3e11c22af0d5bd4e281c32a986773b9854612"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedProseLayoutRegistry.measure: MethodTooLong \u2014 measure runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf9d0fdec4086f41323b30c8c9cd6d79f87cdea651d5c85dc3a9a8c1042a887"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/boundary.rs: FileTooLong \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). The bar is 500 significant lines; this is 9 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/editor-core/src/boundary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57ddf7e3663c5caea39523ccfbb2306acbd7a83f70ea09c6fff15f2978a2cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderImageLoader.loadInternal: MethodTooLong \u2014 loadInternal runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/RenderImageLoader.kt"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bf523be90e34b65dd02741e84c7f2e39007253d46b2f234352b3c2e59ebf32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableInteractionController.onTouch: MethodTooLong \u2014 onTouch runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/src/main/java/com/apollohg/editor/tables/TableInteractionController.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"228b9e073afb5b31bb6c80943da32f63a64555fd14781842fe513d585a03b4b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: editor_core::tables::reference_grid::compute_map: FunctionTooLong \u2014 editor_core::tables::reference_grid::compute_map 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/editor-core/src/tables/reference_grid.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23c97e5d99f177686dfc7612b8abaa15263b344ace0320bd4951514fa599302"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/compilation.rs: FileTooLong \u2014 504 significant 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 81% of them inside a single declaration: YrsDocumentEngine (96-646). The bar is 500 significant lines; this is 4 over it, 1.01\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/editor-core/src/yrs_engine/engine/compilation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05508d9dea7d4499ec75cdd45502498fb8545b81efeb409ec8c11a22fbac2cb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiler/semantic.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 1 over it, 1.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/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e0c7268a94ca0c8dba18dcc9e5dd2b754a4e35b81506ee9c902b8a086cb64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (134 shared lines): rust/editor-core/src/render/generate.rs:59-247 | rust/editor-core/src/render/incremental.rs:638-886 \u2014 These two members are variants of one another: 134 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/editor-core/src/render/generate.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ad6e4888a7523312061e5ce49d16331c3fa6a5ac5569337de47045d8d145d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): rust/editor-core/src/command_planner.rs:231-241 | rust/editor-core/src/transform/apply.rs:115-196 | rust/editor-core/src/transform/apply/text.rs:265-322 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:261-271 \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/editor-core/src/command_planner.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c7425f988f4c134516d3ea36449af9895334aee54301a5fdabb73eba1de95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): rust/editor-core/src/transform/apply/text.rs:265-322 | rust/editor-core/src/transform/apply/text.rs:362-410 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac4b2912bd5f81fa73704579aae186d35f45943a3341d30b97b6df160e3704e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 69\u002B corresponding lines): rust/editor-core/src/transform/apply/range.rs:8-83 | rust/editor-core/src/transform/apply/range.rs:165-251 | rust/editor-core/src/transform/apply/text.rs:52-120 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 69 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7e6c4159074254cabb657f568df33913309a2287c23908b81eb4ece48d740a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust/editor-core/src/yrs_engine/codec.rs:569-619 | rust/editor-core/src/yrs_engine/codec/projection_match.rs:212-248 \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/editor-core/src/yrs_engine/codec.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b1fd486798f481c2749716edb53f0a6326e39378a0538abb6d58b766971a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): rust/editor-core/src/command_planner/format.rs:111-184 | rust/editor-core/src/command_planner/format.rs:192-250 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/format.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a2857f208c566ec2e4c302e242415c0d0306e77bdd501842e43af51d72ef2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt:136-197 | android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt:199-284 \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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8236d233c332b030e30ac98db65d6ab7cb1ed8be62c7c6696c6a93e17b1282d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): ios/EditorStyleSheet.swift:625-649 | ios/Viewer/PreparedProseDrawingView.swift:943-967 \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":"ios/EditorStyleSheet.swift"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad481cd4ad46541fe634ba055f2ed72bbdd0e79fc354b4bd26cc8030d7038311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:302-349 | rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:363-395 \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/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b5913a77c82dab998c8864935ec74d7d02056ddccb02121cfa81063c5b5279"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): rust/editor-core/src/yrs_engine/engine/transaction_result.rs:32-87 | rust/editor-core/src/yrs_engine/engine/undo_redo.rs:490-553 \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/editor-core/src/yrs_engine/engine/transaction_result.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec8d26fb5375ce6cb875bfc86658e48d6dd54aa8e3d32d9c08c3a523babc5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): rust/editor-core/src/transform/apply/range.rs:669-707 | rust/editor-core/src/transform/apply/range.rs:712-750 \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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c2df8195bc004cb1403a7bdf13a57b5e982a72a6ba6db7f16924c8701dfc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): rust/editor-core/src/tables/commands/paste.rs:285-319 | rust/editor-core/src/tables/commands/paste.rs:326-357 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/commands/paste.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cad1e6139d439c3f237bf5e84f5550e8a30e0c04502c77822d0b9e6c4e0a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust/editor-core/src/tables/admission.rs:184-222 | rust/editor-core/src/tables/normalize.rs:140-167 \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/editor-core/src/tables/admission.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea04bd77de9da9f52efa5e0b50481b02d5e9f911894c233f01e89b3d28e5fd8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): ios/EditorV2Adapter\u002BSelection.swift:289-345 | ios/EditorV2Adapter\u002BSelection.swift:391-429 \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":"ios/EditorV2Adapter\u002BSelection.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d25615becfb7aca06738b956e975f00cd495264e4555a107f899e2197e33526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): ios/EditorLayoutManager.swift:991-1012 | ios/Viewer/PreparedProseDrawingView.swift:1913-1930 \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":"ios/EditorLayoutManager.swift"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"609dc0b5fd806ba0da65e3485e79968850e3d328f80037fe2271a35a0b0436f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): rust/editor-core/src/tables/selection.rs:234-266 | rust/editor-core/src/tables/selection.rs:272-305 \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/editor-core/src/tables/selection.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d0053380cacb95e94f6a9acff1ae65cec28580157373775a0d3738332ccf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): rust/editor-core/src/yrs_engine/codec/projection_match.rs:457-490 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:25-59 \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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f65bc87abd498e00ef67f2c6c029f8c09de9f5799082387ec09070d0438857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): ios/EditorTextView\u002BMarkedText.swift:136-169 | ios/EditorTextView\u002BMarkedText.swift:171-204 \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":"ios/EditorTextView\u002BMarkedText.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121ebb1f07859b496ab55ef913c08c48e99d22149d4bee8e8ee95ad29511440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:387-426 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:433-474 \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":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34daaaa52d5df21af2b68d7928cee820452dd6b6e8f9e3dc8b9c511178814aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:547-579 | android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:581-609 \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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"4800e889076fc91cc1639cecf430386c6fdb899eb96825c62cfe11fcde6d4c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:56-87 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:92-123 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83da0a36d7751a6fd8d1763794f66f76e440029dd582dbe7ab3d624b5a812d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): rust/editor-core/src/transform/apply/text.rs:127-162 | rust/editor-core/src/transform/apply/text.rs:230-256 | rust/editor-core/src/transform/apply/text.rs:329-354 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e800e013e37bb0f2161c4744df133378d12ae8a951b81e40a221db8bc5baf911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt:684-701 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt:709-728 \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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafb13c3ba86998b4df7c8b70390277a07f13eb8abf009819a3ee6753aaea491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust/editor-core/src/ffi_v2/collaboration.rs:272-301 | rust/editor-core/src/table_interop.rs:877-903 \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/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f8c1d6c78ef26febc4e948f0facb1908f4646831939235c67043b855d7c3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt:256-277 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:733-751 \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":"android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b342e7a07eab554e482ecb1eff7eeb1f5d813c42d1e22d91b1b47142770a922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): ios/EditorV2Adapter\u002BTextCommands.swift:384-405 | ios/EditorV2Adapter\u002BTextCommands.swift:407-433 \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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e6b46458ee8dd6995a92216abb1810c5a08cbe420a2456bd4c5006301f02de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): rust/editor-core/src/schema/content_rule.rs:330-353 | rust/editor-core/src/schema/content_rule.rs:678-701 \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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2912e11d83a7711b98cd0eeaf4430b326ebfddf8f62e6be796339e2204a90ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust/editor-core/src/serialize/html_in.rs:936-964 | rust/editor-core/src/serialize/html_in.rs:970-990 \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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"b458b5be264e9c67e6419b93b8ca43abf5e7dd805bc00422d31c32df7a6cdd99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ios/EditorV2Adapter\u002BTextCommands.swift:107-125 | ios/EditorV2Adapter\u002BTextCommands.swift:127-153 \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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"051819138b61d782c52694a705f75c61f5e6e51d99aa886dd25a25d17e57f59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/editor-core/src/tables/commands.rs:416-431 | rust/editor-core/src/tables/commands.rs:472-489 \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/editor-core/src/tables/commands.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92acb5b6f4385113cda98f3112d1ba0dd59435fe2569e23f53832cbeac6fd5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:763-788 | android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:791-816 \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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34cf14cd4d7ff8eb16280fdf56569416865f8f59225d83bb40e459c4991cce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:36-59 | android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:61-81 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc43c80a37e65d1e2ebcb3f841f48edb6adc73f7b1b5abc7b53360f5f50a7d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt:548-576 | android/src/main/java/com/apollohg/editor/RichTextEditorView.kt:1170-1197 \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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d590bfa21fcb626b845fd15b8c8cc135d514ebf91e34837f39bb9a8b2919c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): android/src/main/java/com/apollohg/editor/RenderedTextFragments.kt:75-88 | android/src/main/java/com/apollohg/editor/RenderedTextFragments.kt:96-109 \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":"android/src/main/java/com/apollohg/editor/RenderedTextFragments.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1644d9dc65cef31c4ac80ddf95e6fd7fd575da87862e151002af5a5dd90e580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust/editor-core/src/yrs_engine/canonical.rs:549-565 | rust/editor-core/src/yrs_engine/canonical.rs:746-767 \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/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f994b6769a8afeab9e077e3c7a0ea3fc8e7b362ac9b4561a7b2fa037e42b343f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:181-199 | rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:201-215 \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/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"689132fe5d8dc885a393b6b2508b4453ac5d4780bc911b9ef7767b7787d3f804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:617-634 | android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:636-663 \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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae2584a6d2acc7f9f80d6ecd4db7805e11fb085469d9592a0423d3566c40509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/editor-core/src/yrs_engine/update_preflight.rs:45-63 | rust/editor-core/src/yrs_engine/update_preflight.rs:212-230 \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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e1be25e52206588a1d1b27f5dde8042b4b2c4c462c11eee9a352511522a1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): ios/EditorV2Adapter\u002BTextCommands.swift:262-279 | ios/EditorV2Adapter\u002BTextCommands.swift:281-299 | ios/EditorV2Adapter\u002BTextCommands.swift:301-317 \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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc34bfc5cbc75c809f2b50517c929c311c645d4feca1cabe56cd5726c57cf3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): rust/editor-core/src/collaboration_runtime/outbox.rs:433-459 | rust/editor-core/src/collaboration_runtime/outbox.rs:470-496 \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/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e7121398eac6413c749c20b47d0cf008e6799833ad09493d19f48df2b25d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): ios/NativeEditorExpoView\u002BAccessoryRetry.swift:54-73 | ios/NativeEditorExpoView\u002BAccessoryRetry.swift:75-95 \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":"ios/NativeEditorExpoView\u002BAccessoryRetry.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c7bfa7ff4f1b5a178c48e453e8d6743ca3e55a7d6451eec19b8473cee813ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ios/EditorV2Adapter\u002BTextCommands.swift:155-184 | ios/EditorV2Adapter\u002BTextCommands.swift:186-206 \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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e0987c57a569a87d5b76cf4d8d2a0571aca0159a36fef5a49765193c3fb805"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust/editor-core/src/editor_state/structure.rs:116-139 | rust/editor-core/src/editor_state/structure.rs:145-165 \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/editor-core/src/editor_state/structure.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e824802a9144041d2838c2db9b3e8d584890b4feabb6990f4228773a40366c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/editor-core/src/schema/content_rule.rs:498-513 | rust/editor-core/src/schema/content_rule.rs:570-585 \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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb6fd1b81a7cff2b881febed47a385048ffbf78fd6faed3a5a17cfa6abec9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): ios/EditorV2Adapter\u002BRenderState.swift:452-469 | ios/EditorV2Adapter\u002BSelection.swift:514-529 | ios/EditorV2Adapter\u002BSelection.swift:533-548 \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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f1519d4470e4642d545eeabe7e107d8c67590eafdec2d723950568e33f5ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): ios/Tables/TableCellPositionMap.swift:24-39 | ios/Tables/TableCellPositionMap.swift:41-58 \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":"ios/Tables/TableCellPositionMap.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f156f3aa188e03122bff653d79f7a9614dc55266b673adce5e7e3fe8591e33b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 19\u002B corresponding lines): rust/editor-core/src/ffi_v2/collaboration.rs:75-93 | rust/editor-core/src/ffi_v2/collaboration.rs:101-120 | rust/editor-core/src/ffi_v2/collaboration.rs:132-156 | rust/editor-core/src/ffi_v2/collaboration.rs:190-208 | rust/editor-core/src/ffi_v2/collaboration.rs:215-233 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea04a9ebc820fe862cbd5fc437c0f2abf31a20147b9785e56d2b3493b1b1ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/yrs_engine/codec.rs:491-504 | rust/editor-core/src/yrs_engine/codec/mutation.rs:412-430 \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/editor-core/src/yrs_engine/codec.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"003fa566cfcaa2e3dcc312f6690dd5147e1cc9bbd18ba6306ddcc85cd90d56df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): rust/editor-core/src/command_planner/structure.rs:86-102 | rust/editor-core/src/editor_state.rs:583-597 | rust/editor-core/src/editor_state/selection.rs:293-311 | rust/editor-core/src/editor_state/selection.rs:370-386 \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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcce394ec847abb06213980c59a25d6a3df74929e8f53502de229abe83928313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): ios/NativeEditorExpoView\u002BMentionRetry.swift:119-140 | ios/NativeEditorExpoView\u002BProperties.swift:119-142 \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":"ios/NativeEditorExpoView\u002BMentionRetry.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5af84bb8615171fd629b3671ffe96ded9b5c6d2ea1983e1b35a27036b9d620b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt:377-389 | android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt:391-406 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/tables/EditorTableIndex.kt"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c432a150c826d57b3c63f21d96be5246038428ba7def71e33287a76e2ae51d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ios/Tables/EditorTableIndex.swift:395-401 | ios/Tables/EditorTableIndex.swift:403-410 \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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"745e5b04d4ab2080b0619e03acc62c8fea2c202a98588cc9b02f6905b7592bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ios/EditorTheme.swift:180-191 | ios/EditorTheme.swift:215-230 \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":"ios/EditorTheme.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa10fd3e0eeeb4f73a9da85c76d684e6f2a21e39a0dd164063ee6c8b65fc238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/editor-core/src/command_planner/structure.rs:472-486 | rust/editor-core/src/command_planner/structure.rs:488-507 \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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"496b6efabd53d70f08d8846b6be2f45380c56b6f0ccea7d93dc954e748219790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/tables/render/content_key.rs:61-69 | rust/editor-core/src/tables/render/row_key.rs:30-38 \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/editor-core/src/tables/render/content_key.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd65cbb8a84e9d8d7dde64b3d06d1ca29cbc91dd528f0a1fbf031636e405e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ios/Viewer/PreparedProseLayoutCache.swift:486-492 | ios/Viewer/PreparedProseLayoutCache.swift:619-625 \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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3091d7d9c7762415dcbab88704ee5325827892a34f3b0e3f516fbd9c532541d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/editor-core/src/command_planner/structure.rs:628-638 | rust/editor-core/src/editor_state/structure.rs:80-92 \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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bd6bc7ebd20739b7701cc19d05de5fa9409154160f5dc960c1f976b0b3ba38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/editor-core/src/session/errors.rs:125-136 | rust/editor-core/src/session/errors.rs:151-163 \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/editor-core/src/session/errors.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc4efc20c69221c5aebfc308e504c8180c9e7f75eaf1af926411d48d851faba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ios/EditorTheme.swift:34-42 | ios/EditorTheme.swift:151-159 \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":"ios/EditorTheme.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9797e3357a75aab5a719005f0b3de927600e964f2731803f8e7be371ebf2e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ios/EditorTextView\u002BCaret.swift:108-122 | ios/EditorTextView\u002BCaret.swift:124-142 \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":"ios/EditorTextView\u002BCaret.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583efa8aeb856082341154a44fa4151a9b44621513a9fd85899c57cd4723c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ios/EditorTextView\u002BKeyboardInput.swift:586-600 | ios/EditorTextView\u002BKeyboardInput.swift:602-613 \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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b31a06075c41b1353efc1d3c60ea35b26853a5e3073cc5f188dc7c1eab668d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:25-37 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:48-61 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fda3c8b07ee1dad3204a1da8f261eb54f43d9f4bf693c8e5393014faff0075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ios/EditorTextView\u002BKeyboardInput.swift:305-313 | ios/EditorTextView\u002BKeyboardInput.swift:315-322 \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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9900a19284b58953919b3916bf09c3acd5f7acede0029b4b6e3cb2f3305d8e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): ios/Viewer/PreparedProseLayoutCache.swift:601-608 | ios/Viewer/PreparedProseLayoutCache.swift:610-617 \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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f4b1dcb87790d4a8b65254dff510d110efc9405ea2b60e09bd8fcea5fce63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/editor-core/src/yrs_engine/update_preflight.rs:351-369 | rust/editor-core/src/yrs_engine/update_preflight.rs:658-676 \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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fba35a48294fb458907e27551fc1b7b7a78c7c891e08c1d96004b4c7b495b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt:203-216 | android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt:219-239 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"138210e688c1eef20a3ff4023804a224650bf70e6ecebddaa8be7cba82b2c4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt:826-844 | android/src/main/java/com/apollohg/editor/MentionSuggestionChipView.kt:211-228 \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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6b41a6f571d30b3fbf45e97959632c92b99cf1b413e367c098027baca2792c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): ios/NativeCollaborationTransportRegistry.swift:295-308 | ios/NativeCollaborationTransportRegistry.swift:310-327 \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":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f967530d229426d7a0062cdc515fca3b3f777ce2fe6dce00fdc12787775285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust/editor-core/src/command_planner.rs:322-337 | rust/editor-core/src/editor_state.rs:769-781 \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/editor-core/src/command_planner.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af4f76f18421b65605c9f12989a40668360bf6284e29f1c14d246b5decfa3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/editor-core/src/yrs_engine/engine/remote.rs:883-897 | rust/editor-core/src/yrs_engine/engine/undo_redo.rs:836-855 \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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"310b30e426685d79a1481b9a7e013ad86df87da7f1e61d6af0773c2776a3c75c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): ios/NativeEditorModule.swift:8-20 | ios/NativeEditorModule.swift:242-254 | ios/NativeEditorModule.swift:259-270 \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":"ios/NativeEditorModule.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80318177acfc108ed33eb0cb448a9881202b52b3d37eb3165a5f9af2cc6dc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust/editor-core/src/command_planner/format.rs:310-324 | rust/editor-core/src/command_planner/format.rs:330-344 \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/editor-core/src/command_planner/format.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3e5f2ab0b06e3dbc021eea20a6631516f4998528f00411760c0d5e574388ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt:257-270 | android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt:275-289 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"45544dd936278dc937f1153f921e2913250a81557a42857e4456d0883e77a48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): rust/editor-core/src/yrs_engine/derived_state/history_snapshot.rs:729-746 | rust/editor-core/src/yrs_engine/engine/history_state.rs:265-282 | rust/editor-core/src/yrs_engine/engine/remote.rs:818-837 | rust/editor-core/src/yrs_engine/engine/remote.rs:839-858 \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/editor-core/src/yrs_engine/derived_state/history_snapshot.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2271a4e368d4a1a8f07d46c880040770d83dd7cbf5c3cdd571060380ccf14b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/editor-core/src/yrs_engine/update_preflight.rs:252-270 | rust/editor-core/src/yrs_engine/update_preflight.rs:678-696 \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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"218cd6b8c708a47053937e2caee6c2521f8cebd9e55a934bddd10b5b0ba5a8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android/src/main/java/com/apollohg/editor/EditorTheme.kt:227-238 | android/src/main/java/com/apollohg/editor/EditorTheme.kt:270-284 \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":"android/src/main/java/com/apollohg/editor/EditorTheme.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9facdb198ea3493c395c1ac631242e25245a7f77f6ecf6ff1496fc885b21bff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ios/EditorTextView\u002BAttributedPatch.swift:110-124 | ios/EditorTextView\u002BAttributedPatch.swift:142-162 \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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dcfe428a6fbad451cdc4c2aa942f5678619959fbb7838d42d7e8d42623c375"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust/editor-core/src/transform/apply/range.rs:518-528 | rust/editor-core/src/transform/apply/range.rs:530-540 \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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e21c4837612c2b72ad212afad879bca352bf7a684fe0d3e395b467dad9246fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt:330-346 | android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt:348-364 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9ddb72a25b2fee1a7964539873ea4510cea6d39d7e70cb2ad05aef4b971da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ios/EditorV2Adapter\u002BCommands.swift:195-205 | ios/EditorV2Adapter\u002BCommands.swift:227-235 \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":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54655f1b7edc2d14a2acfd9d186b18cc3b6c3470ed110203e4a49606a28fbb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): ios/Tables/EditorTableSurface.swift:1138-1153 | ios/Tables/EditorTableSurface.swift:1155-1170 | ios/Tables/EditorTableSurface.swift:1221-1237 \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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0464011988712fe5320fca80cfc5b9207eb84ec1297f14d16ab85edf005bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/editor-core/src/ffi_v2/render.rs:246-253 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:666-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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2fcee77d98a48a3dafe07085732a9746072a97945573bd664c26aa78f76bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/command_planner/backspace.rs:352-365 | rust/editor-core/src/editor_state.rs:987-1001 \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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd9b850e750c73abb24e3457326dddbfd5cf5a0f43e425e86b4a80df6ebbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust/editor-core/src/render/incremental/cache_helpers.rs:513-527 | rust/editor-core/src/yrs_engine/commands/clipboard.rs:77-88 | rust/editor-core/src/yrs_engine/engine/imports.rs:117-136 \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/editor-core/src/render/incremental/cache_helpers.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a514bbce862c26daea3dfca434a3f00f8cafdbf952b00049b59cc42b2617c52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android/src/main/java/com/apollohg/editor/EditorTheme.kt:213-224 | android/src/main/java/com/apollohg/editor/EditorTheme.kt:253-267 \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":"android/src/main/java/com/apollohg/editor/EditorTheme.kt"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1022143f477cd906e999ea14dda88c45c592736cf31d9855bd0bca8d87569f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): ios/EditorCodeHighlighting.swift:8-12 | ios/EditorInteractionOverlays.swift:7-15 \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":"ios/EditorCodeHighlighting.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6038d9a2f1da3e411da1e8284770a77ac8136de5cb74d67d47d386481bfc2dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt:313-325 | android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt:95-105 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"736003c4e494f060711ab34b1c77cdbf686410e896b383d5e4bbbee2e03f44b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): android/src/main/java/com/apollohg/editor/NativeEditorModule.kt:289-298 | android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt:222-229 \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":"android/src/main/java/com/apollohg/editor/NativeEditorModule.kt"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b64dad082ee6ccb7ba77c1839b93580d50f3d8dd25d1f5ac2814b11a7dc329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ios/ProseViewerView.swift:422-436 | ios/ProseViewerView.swift:442-456 \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":"ios/ProseViewerView.swift"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89db3efad3b2ddd2b6d7b45d804a8de42ff2f64fc172d120f0320de9492d14a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): ios/Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift:6-23 | ios/Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift:58-74 \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":"ios/Viewer/PreparedProseLayoutRegistry\u002BArtifacts.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e61a0bc48c5d886cf8c4f8d9a320b156050e313ae04793c0a26f8175b90c1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust/editor-core/src/collaboration_runtime/outbox.rs:340-353 | rust/editor-core/src/collaboration_runtime/outbox.rs:360-373 | rust/editor-core/src/collaboration_runtime/outbox.rs:382-399 \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/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2280f30f03999ad7880fb802955c6ca49c63350402dae2d68a5bd3c7f7773a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/editor-core/src/yrs_engine/history/deletion_filter.rs:103-114 | rust/editor-core/src/yrs_engine/history/deletion_filter.rs:116-127 \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/editor-core/src/yrs_engine/history/deletion_filter.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbf58107b380d3e98931391902b717bda0ef19a91c5d38a9cbc448a3f732037"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust/editor-core/src/yrs_engine/mutation/plan/model.rs:806-819 | rust/editor-core/src/yrs_engine/mutation/plan/model.rs:821-834 | rust/editor-core/src/yrs_engine/mutation/plan/model.rs:836-863 \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/editor-core/src/yrs_engine/mutation/plan/model.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ad2f579903feb9755a03a49fb828e8997fb49db5f645d4e1d2ac8576646d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): ios/EditorV2Adapter\u002BRenderState.swift:441-450 | ios/EditorV2Adapter\u002BRenderState.swift:503-512 \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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"983d6f9b81b41eaff6be6671ab6871c818b164fe64341ccf66877134cb68b73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ios/Viewer/PreparedProseDrawingView.swift:443-449 | ios/Viewer/PreparedProseDrawingView.swift:451-456 \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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5d2b34600011d26ca6ce6579a20fa17a7ed07e3ff28a0fd43da01f7cb84a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust/editor-core/src/ffi_v2/render.rs:561-569 | rust/editor-core/src/ffi_v2/render.rs:572-582 | rust/editor-core/src/ffi_v2/render.rs:585-592 \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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d54066f9bb6e53ada15f6852be62bf10f0d49cf586344187d06f01407987de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): ios/EditorTextView\u002BCommands.swift:136-142 | ios/EditorTextView\u002BCommands.swift:144-155 | ios/EditorTextView\u002BCommands.swift:218-225 \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":"ios/EditorTextView\u002BCommands.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e0ff884292d1061a22f8a8f5daf3363c1146f39b95877bc63f88e3e128a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust/editor-core/src/transform/apply/validation.rs:59-65 | rust/editor-core/src/transform/apply/validation.rs:72-78 \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/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb870884482efd4abfc7326ddb6ac0dd1ff2cd51a4adf12f453012caec45e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/editor-core/src/boundary/limits.rs:94-140 | rust/editor-core/src/yrs_engine/editing_limits.rs:91-102 \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/editor-core/src/boundary/limits.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d18949d2756f36784c0e5214564a8c22d9fa608b09a87b48a666ec6cfda812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): ios/EditorTextView\u002BAttributedPatch.swift:94-108 | ios/EditorTextView\u002BAttributedPatch.swift:126-140 | ios/EditorTextView\u002BAttributedPatch.swift:164-184 | ios/EditorTextView\u002BAttributedPatch.swift:186-206 \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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a7d1d9ee309efb7bfc1e200237b5b140cc2eeca191e3282b4b8ce77650e1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): ios/SharedNativeImagePipeline.swift:166-178 | ios/SharedNativeImagePipeline.swift:180-192 | ios/Viewer/ViewerImagePipeline.swift:324-332 \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":"ios/SharedNativeImagePipeline.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d320bb646b62341043cf31495b3d74c4cf5b29a25422d3be5e39338af3b8b994"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/editor-core/src/table_interop.rs:939-948 | rust/editor-core/src/table_interop.rs:953-963 \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/editor-core/src/table_interop.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6be6bca1e24ed176e9e96af7c7b48d056011ee41dda6e0d78184cd9a21c33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:847-867 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2006-2017 \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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"709b74fd960f97b6de5ff26fbf6ecf24ba80f3cf049d9f4b961db50a48f7e3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:905-916 | android/src/main/java/com/apollohg/editor/tables/TableAccessibility.kt:518-529 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2048-2059 \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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f69d59b840c3c84cd8f03f3c7f68dc21cc76ec197457e2afc1b51949a62f5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ios/Tables/EditorTableIndex.swift:385-388 | ios/Tables/EditorTableIndex.swift:390-393 \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":"ios/Tables/EditorTableIndex.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"96880f66f4004ba8130b487ba8f3571d085ec92e7313031c5b5667f420362d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:16-23 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:39-46 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:63-71 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:73-80 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:82-89 | android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt:91-98 \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":"android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"516c27bdad4389d429d443625e8df4ff74c8b04f0e8621f1159142b8a14603bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:960-971 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2090-2101 \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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c11f4c0c9a4b95200dc97743583a3180db50f3d4ed199c1e9555d00ada105fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): ios/EditorV2Adapter\u002BRegistry.swift:42-55 | ios/EditorV2Adapter\u002BRegistry.swift:57-70 | ios/EditorV2Adapter\u002BRegistry.swift:72-85 | ios/EditorV2Adapter\u002BRegistry.swift:87-100 | ios/EditorV2Adapter\u002BRegistry.swift:102-119 \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":"ios/EditorV2Adapter\u002BRegistry.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf54762a2cc9bfc1618a02f7723e09147d665318c8e4586d52e0ee81805e2c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ios/Viewer/PreparedProseLayoutRegistry\u002BFabricOwnership.swift:108-124 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabricOwnership.swift:126-140 \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":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabricOwnership.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7008c4f03910b9923d95e2a5a162c0c54fd24c6edcef384191a7cb3ab5e90d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:1095-1104 | rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:1106-1118 \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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f774985590cbcd08c7b58a37456bdb900b3a3da187c70014c4a65c3f97494"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/yrs_engine/engine/imports.rs:233-246 | rust/editor-core/src/yrs_engine/engine/imports.rs:253-267 \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/editor-core/src/yrs_engine/engine/imports.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba93d2e4bb09cd05ebf753bd7216340cc129fb454b23d004a0e07bc55434f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt:73-81 | android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt:205-216 \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":"android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bddae2883742943450157d259c9b8543be38470dc15c163fa31d64484e674d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ios/RichTextEditorView.swift:1344-1350 | ios/RichTextEditorView.swift:1355-1361 \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":"ios/RichTextEditorView.swift"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed86415c8efbab1b2869c2b3ecd7e5376df2855e2b6a8098eda6eef1e29b99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): ios/NativeCollaborationSocket.swift:78-86 | ios/NativeCollaborationSocket.swift:88-96 \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":"ios/NativeCollaborationSocket.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f144f31edd95cea88754a9135d27a5497817656cf899e2ad4e162ed311b78a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/yrs_engine/engine/candidate.rs:448-461 | rust/editor-core/src/yrs_engine/update_preflight.rs:329-349 \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/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a1b2a44c382b935c17166c10047ce0397d2a469c90da9e0006b652a469c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt:168-176 | android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt:178-187 | android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt:189-197 \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":"android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81ed8e84c4048c9ea502521fc8ebe20e7c34d879faf177c5f9bdd7b985f8910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt:224-232 | android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt:243-253 \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":"android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9754d3fb1bb2f648a0bc63f64121fbb04875fadc6f80546de1c2f18f89b5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): ios/EditorV2Adapter\u002BCommands.swift:4-14 | ios/EditorV2Adapter\u002BRenderState.swift:480-491 \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":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"006f01aa0c395349f686b34f98158786873bb9ef2c0093582c38d420e3af9937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 5\u002B corresponding lines): ios/EditorV2Adapter\u002BCommands.swift:40-44 | ios/EditorV2Adapter\u002BCommands.swift:62-66 | ios/EditorV2Adapter\u002BCommands.swift:68-72 | ios/EditorV2Adapter\u002BCommands.swift:86-94 | ios/EditorV2Adapter\u002BCommands.swift:96-104 | ios/EditorV2Adapter\u002BTextCommands.swift:354-362 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521011ba7502d72960effc7b89315d336ae37802d2314ab4ab4a1138e5d8c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): android/src/main/java/com/apollohg/editor/EditorInputConnection.kt:277-283 | android/src/main/java/com/apollohg/editor/EditorInputConnection.kt:285-296 \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":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9231d0c8a07ca0b20acf228bbc6fef5c038ebc3208fcc204b24933cc03c8733"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt:584-597 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt:602-616 \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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0821e3112fe9fbd6803bb173174334a10573c5402f4311e239811075c31933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:503-517 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:519-534 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:536-554 \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":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3a6796ef48f83419763f82dea4fa6b9f6a6f6bcc669f3c2893abc6e2e879b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/serialize/html_out.rs:387-400 | rust/editor-core/src/viewer/compile.rs:342-356 \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/editor-core/src/serialize/html_out.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a0f142299fc0aa74d2593c5290e7a4a3b75d6a3a0655c5ffa54bf5bee8842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:623-630 | rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:632-642 \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/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1847cc6fa852a2712e3c193773abfa2e3eb44b0f932fb92f22875b4a881fb586"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): android/src/main/java/com/apollohg/editor/viewer/ViewerFontEnvironment.kt:50-59 | android/src/main/java/com/apollohg/editor/viewer/ViewerFontEnvironment.kt:62-71 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/ViewerFontEnvironment.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d016537ebd09ec2bd14c6192a8f8c4bf04dc7e67d9fac706282a10247fffef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 5\u002B corresponding lines): ios/EditorV2Shadow.swift:128-132 | ios/EditorV2Shadow.swift:203-207 | ios/EditorV2Shadow.swift:253-257 | ios/EditorV2Shadow.swift:259-263 | ios/EditorV2Shadow.swift:265-269 | ios/EditorV2Shadow.swift:283-287 | ios/EditorV2Shadow.swift:289-294 | ios/EditorV2Shadow.swift:314-318 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Shadow.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ca04690fa3a05389902240f0f8e6e7728fc952c79f05453127d382704940c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/ffi_v2/editor.rs:181-189 | rust/editor-core/src/native_transaction_bridge.rs:724-735 \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/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a976d2dcf7ec79015d0ab270e72cfaa487485fa6be5ffb8d74fc729a0cb8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ios/EditorTextView\u002BCommands.swift:187-197 | ios/EditorTextView\u002BKeyboardInput.swift:748-754 \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":"ios/EditorTextView\u002BCommands.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0343d2357f9c43fa5919247126f0a6afb411e5f4ac0115e9aee4544e8330117c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): ios/Viewer/ViewerImagePipeline.swift:239-245 | ios/Viewer/ViewerImagePipeline.swift:259-266 \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":"ios/Viewer/ViewerImagePipeline.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db7d33da552c5ecde23ef964e4cf81c0c8a12e02b853cba938ef426c5c442c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): ios/EditorV2Adapter.swift:210-218 | ios/NativeCollaborationTransport\u002BValidation.swift:67-75 | ios/NativeCollaborationTransportRegistry.swift:485-493 | ios/NativeEditorModule.swift:148-157 \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":"ios/EditorV2Adapter.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"314579c73370e77dca8966c30eb42b6189c2c49bcf17ec63aa5536d1e3cbce26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust/optimize-kotlin-bindings.py:34-40 | rust/optimize-swift-bindings.py:41-45 \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/optimize-kotlin-bindings.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db0b9d0217502c9f90c41e913818cad771b64a636027736df2a5937d4b08463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:883-892 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2030-2037 \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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e1796b395dacbd24eb52750e478b8caea9d181ab473814db2a00c9d0e98fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): rust/editor-core/src/ffi_v2/native_frame_mapping.rs:123-135 | rust/editor-core/src/position/storage.rs:179-191 | rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:436-447 \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/editor-core/src/ffi_v2/native_frame_mapping.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d87ec8378d6f920d4ef04706caacf06170321967598213e21b5fca34865238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): ios/NativeCollaborationTransport\u002BValidation.swift:77-88 | ios/NativeCollaborationTransportRegistry.swift:509-520 \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":"ios/NativeCollaborationTransport\u002BValidation.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d855f01f4bd7bb2206471c0dc36c2592429dca45b9bc99aeb1ab8c0200399b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): ios/NativeEditorExpoView\u002BEvents.swift:17-22 | ios/Tables/EditorTableSurface.swift:1406-1411 \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":"ios/NativeEditorExpoView\u002BEvents.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f10d9e9140207a0c1a50c18c99c16468a71329ce459f71ff4e3f1a1fc88a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/src/main/java/com/apollohg/editor/IntArrayPartition.kt:6-14 | android/src/main/java/com/apollohg/editor/tables/ViewerTableSurface.kt:1029-1037 \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":"android/src/main/java/com/apollohg/editor/IntArrayPartition.kt"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae86d7d4cb0e4c84949a7a4b5a026be9ae5141ce4191d7168948e41fab45b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/editor-core/src/ffi_v2/types.rs:95-106 | rust/editor-core/src/session/errors.rs:71-82 \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/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774be49c40208f41bd1732a5213bc7de888dbd3a80becd6f4f88f7e14610d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/yrs_engine/compiler/input_limits.rs:222-230 | rust/editor-core/src/yrs_engine/compiler/insert_position.rs:463-471 \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/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6e24ce7dc830a5d3d71b4e893ee2c50977ce4bfe025a066676522dda27c824"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ios/Tables/ViewerTableSurface.swift:928-931 | ios/Viewer/PreparedProseDrawingView.swift:61-64 \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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc1f143f799ca9908ae2103c42230fc2b35da58c92579840a10f90fd3d327d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/ffi_v2/snapshot.rs:45-54 | rust/editor-core/src/test_support/ffi_v2_test/session_fixtures.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/editor-core/src/ffi_v2/snapshot.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a478999c4fa7154fd28518820e48bb055cef090d7dcf53ef209df12ce2659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:515-525 | android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt:183-190 \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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"27178616c71bd5fb465b3eb3c0eb0e967f73b8f2e6cf01d8a296a02c3283a20c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): ios/Tables/EditorTableSurface.swift:21-23 | ios/Tables/TableInteractionController.swift:332-334 \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":"ios/Tables/EditorTableSurface.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dea8db93d2eab41ca103d03d6d8a5e9aae846d0d965ca49f78d5ec3f74ec7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:920-926 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2061-2067 \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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81198c8f0de96dde6c9d72c4e1f598f36ca77ab76e70115f8513eecdcd4c033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/ffi_v2/collaboration.rs:20-28 | rust/editor-core/src/ffi_v2/native_frame.rs:420-428 \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/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef77126d1730f61899ae2b0a6bce2d7163374d1663bce68ac1fe0ce68de8ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/yrs_engine/engine/imports.rs:615-623 | rust/editor-core/src/yrs_engine/error.rs:54-62 \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/editor-core/src/yrs_engine/engine/imports.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f9fdbdf7325065bd629b05285fb1795629e27dda065969ee10f678ce73f9b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): ios/NativeCodeHighlighting.swift:60-62 | ios/NativeEditorModule.swift:940-942 \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":"ios/NativeCodeHighlighting.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"226078ec455126eaf097eac5d43730eb155f064c850d5faed1c731200c9409e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ios/ProseViewerView.swift:300-303 | ios/Tables/EditorTableSurface.swift:1699-1702 \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":"ios/ProseViewerView.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65fb789e544cce2a2bb25685947db3c597494e8d17b1a0c58da79fed58ff0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift:5-8 | ios/Viewer/PreparedProseLayout.swift:438-441 \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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2631d227994b703cbf4f66cc691955ef9d762ae3dfef05c88a8bd5501b97a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): android/src/main/java/com/apollohg/editor/EditorTheme.kt:659-662 | android/src/main/java/com/apollohg/editor/NativeToolbarIcons.kt:217-220 \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":"android/src/main/java/com/apollohg/editor/EditorTheme.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f041d995c205bf5f4b31e03bb8d42a7ce87b7ec176a0b981354ea536766aa69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/editor-core/src/yrs_engine/derived_state/history_snapshot.rs:218-234 | rust/editor-core/src/yrs_engine/engine_tests/candidate_publication.rs:126-141 \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/editor-core/src/yrs_engine/derived_state/history_snapshot.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"421eac35d815e42c8f99236697da104b8c5879a6b1a2e2254fd0c271335ffafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): rust/editor-core/src/tables/interchange.rs:136-144 | rust/editor-core/src/yrs_engine/commands/tables.rs:358-369 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/interchange.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d2bb05461d5d7bba948508823e5dad841b096c0b5f637c92a0bae561e0bb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust/editor-core/src/ffi_v2/editor/create_scanner.rs:70-75 | rust/editor-core/src/yrs_engine/update_preflight.rs:698-702 \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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6b368cefd7381acb910ea0bc3aa47167c6b024bd886dd03563321e4892ccf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 2): rust/editor-core/src/transform/apply/text.rs:266-300 | rust/editor-core/src/transform/apply/text.rs:363-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/text.rs:266\u0060 it does not close everything it opens, so those exact 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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2268810517be12b10fc2c89190f608bc20e05dc045ebe862431ca502adc9dee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust/editor-core/src/render/generate.rs:140-161 | rust/editor-core/src/render/incremental.rs:752-773 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:140\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/editor-core/src/render/generate.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"420af54e027f38a98e859f727a4ed4aacd11e15a226fe89974225237736a8634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs:481-502 | rust/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs:518-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs:481\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/range/text_targets.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc3f174e5374afe298b817035726ef9deb1fa2fc09d4156aa103236890dc226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs:90-111 | rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs:119-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/editor-core/src/yrs_engine/mutation/plan/preflight.rs:90\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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1bcfdd4b217b408b031c38c36f060be03056b872b387c97b24cb1023c6528c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): rust/editor-core/src/render/generate.rs:63-83 | rust/editor-core/src/render/incremental.rs:656-674 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/generate.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1291303478d31babfb380787302213df381ea29c760bdfe659b8403e900a4c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust/editor-core/src/render/generate.rs:224-244 | rust/editor-core/src/render/incremental.rs:864-884 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:224\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/generate.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd30fc9d31f09cd3c2d66b44114db2912ba2dd0396859f4e4ff0a00f9595d3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine/transaction_result.rs:46-66 | rust/editor-core/src/yrs_engine/engine/undo_redo.rs:505-525 \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/editor-core/src/yrs_engine/engine/transaction_result.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/transaction_result.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"888783eddd6e684e0bc275ee5c355cf72d90fc6c8e05bd06c17943b696ea1b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): rust/editor-core/src/editor_state/structure.rs:120-139 | rust/editor-core/src/editor_state/structure.rs:147-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/editor_state/structure.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/editor_state/structure.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d370e5f0464bd978beafb3b398fcc9decef83f8a5d53e95f9f003c3debc870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec/projection_match.rs:630-649 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:174-193 \u2014 before extracting anything, compare \u0060rust/editor-core/src/yrs_engine/codec/projection_match.rs\u0060 and \u0060rust/editor-core/src/yrs_engine/codec/projection_write.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 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/editor-core/src/yrs_engine/codec/projection_match.rs:630\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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee21e1b36bc733da981e74f9ae58c9e915f323e35ca9b1ef60d9e725e1d879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs:471-490 | rust/editor-core/src/yrs_engine/mutation/plan/preflight.rs:511-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/editor-core/src/yrs_engine/mutation/plan/preflight.rs:471\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/editor-core/src/yrs_engine/mutation/plan/preflight.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd87d61f54ae28e6841f0d3f810d37b96eecd3335f7480681dc0baf15bdf88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/command_planner/backspace.rs:522-540 | rust/editor-core/src/command_planner/empty_blocks.rs:252-270 \u2014 before extracting anything, compare \u0060rust/editor-core/src/command_planner/backspace.rs\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs\u0060 as WHOLE FILES: this scan already matched 5 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/editor-core/src/command_planner/backspace.rs:522\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab400343410a8df82bac76ab97ed1c43de141e7904212a18fe27a048bcaafd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/render/generate.rs:164-182 | rust/editor-core/src/render/incremental.rs:789-807 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:164\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/editor-core/src/render/generate.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bc7665934c297e42a75ec1e1110321ecf0871331e821e4fcdc899e9cee886a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/render/incremental.rs:736-754 | rust/editor-core/src/render/incremental.rs:811-829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/render/incremental.rs:736\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce5849ba440d8252fc02b130c2da8965402e817cd02ed1650faa37fe8cebf0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/yrs_engine/commands/text.rs:475-493 | rust/editor-core/src/yrs_engine/commands/text.rs:704-722 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a700a9ab13ec9dd4797308b499c990327c8c3ae5bbaea6c96c093adbef165ae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/yrs_engine/compiler/yrs_compilation.rs:530-548 | rust/editor-core/src/yrs_engine/compiler/yrs_compilation.rs:680-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1577794d1de3949b6887e955ab89f4afceec61a05e8b4d9fed66e928ff38954f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/selection.rs:219-237 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:398-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/derived_state/selection.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/selection.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93a84628e9088b2ed8d78e0a58f6f38fc426f8af4eefa432ddd07ca0b3de87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): rust/editor-core/src/yrs_engine/commands/format.rs:211-228 | rust/editor-core/src/yrs_engine/commands/format.rs:240-256 | rust/editor-core/src/yrs_engine/commands/format.rs:268-284 \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/editor-core/src/yrs_engine/commands/format.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f50695583efa87581fa095adf45a2079d8713786585eeeb630ab45152619995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust/editor-core/src/render/generate.rs:121-138 | rust/editor-core/src/render/incremental.rs:720-737 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/generate.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe5c0b18b3451aec0779329046323b1033f911390e6bcfa6236bda9ba23d388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): rust/editor-core/src/render/generate.rs:189-206 | rust/editor-core/src/render/incremental.rs:827-844 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:189\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/editor-core/src/render/generate.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9c59d253f40b73e0f0cedd3ff58a27abb702706035f52d53ce245e327f2864"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust/editor-core/src/yrs_engine/compiler/preview.rs:431-447 | rust/editor-core/src/yrs_engine/compiler/preview.rs:513-529 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/compiler/preview.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8691f09a1879d98b79bd718c4a9d42454cd27de985802212a6e2682ed44146b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/range.rs:214-236 | rust/editor-core/src/yrs_engine/mutation/plan/preflight/signatures.rs:130-152 \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/editor-core/src/yrs_engine/mutation/lowering/range.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e23e3001ee6c9ad69ce1e716d597d2148fb848b3d83b7c48b3855be72ef680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): rust/editor-core/src/command_planner/backspace.rs:483-496 | rust/editor-core/src/command_planner/empty_blocks.rs:225-240 \u2014 before extracting anything, compare \u0060rust/editor-core/src/command_planner/backspace.rs\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs\u0060 as WHOLE FILES: this scan already matched 5 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/editor-core/src/command_planner/backspace.rs:483\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust/editor-core/src/command_planner/empty_blocks.rs:241\u0060 calls \u0060try_from\u0060, \u0060get\u0060, \u0060ok\u0060 and \u0060rust/editor-core/src/command_planner/backspace.rs:497\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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"767621ed0eae4556c0209705e059c7016d89586e0c83a656ef06d468a98ed5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/editor-core/src/schema/content_rule.rs:332-347 | rust/editor-core/src/schema/content_rule.rs:680-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/editor-core/src/schema/content_rule.rs:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/content_rule.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6dc26ace8d0670d9333d9a9833608c72a573ffca9922367518482f686136f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/editor-core/src/transform/apply/text.rs:231-246 | rust/editor-core/src/transform/apply/text.rs:330-345 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4583935c573a0112944f500ad99cf2e581f5ff9222120ec4cae730fa674d498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:126-141 | rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:142-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2451ff36f3459e45b11f7d19b7157e421bcfc78e3df989e500f1f5e87bd67d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:287-302 | rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:401-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f96a456a00fc020b86cad5bb7e9c8498ede50a6a02b2694dcd6bb2a7b545f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): rust/editor-core/src/ffi_v2/render.rs:720-734 | rust/editor-core/src/ffi_v2/render.rs:745-759 | rust/editor-core/src/ffi_v2/render.rs:776-790 | rust/editor-core/src/ffi_v2/render.rs:816-830 \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/editor-core/src/ffi_v2/render.rs:720\u0060 it begins part-way through the construct above it, so those exact 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/editor-core/src/ffi_v2/render.rs:760\u0060 calls \u0060Some\u0060, \u0060atom_id\u0060, \u0060String\u0060 and \u0060rust/editor-core/src/ffi_v2/render.rs:735\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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b068909d62970fa953ddd8fe786440a011282277af5ed113dd87f0fbb72f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/editor-core/src/clipboard.rs:233-247 | rust/editor-core/src/clipboard.rs:286-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e889864890fe29e2c24ae3bbf8914d725f72cc1efa843b4f9d45c616fbb1cc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:176-190 | rust/editor-core/src/transform/apply/text.rs:59-73 \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/editor-core/src/transform/apply/range.rs:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f85930931ec2fed9ba7817f3e3ae6b881470b700a5ca13dea1a117d8e7654d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:237-251 | rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:365-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62c6115a923d1c755070976aae7e493cc54c78cedb97079d10f57a9eefa8bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): rust/editor-core/src/yrs_engine/position.rs:345-359 | rust/editor-core/src/yrs_engine/position.rs:374-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/editor-core/src/yrs_engine/position.rs:345\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/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cc8f34c924b9ace78c3567a41e5c100aeaf3995095c67dbfba20f993baf8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust/editor-core/src/command_planner/format.rs:90-103 | rust/editor-core/src/command_planner/format.rs:171-184 | rust/editor-core/src/command_planner/format.rs:237-250 \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/editor-core/src/command_planner/format.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/editor-core/src/command_planner/format.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eee0446c2dbadfae7e32fae526dddf3ddd994410a5ac549fffe327cd663e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust/editor-core/src/command_planner/backspace.rs:188-199 | rust/editor-core/src/command_planner/backspace.rs:285-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/backspace.rs:188\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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"166fad3db351d7569e6b16a8f45ff552259fba06be763576068d0a45a0934c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/ffi_v2/editor/create_scanner.rs:189-202 | rust/editor-core/src/ffi_v2/editor/create_scanner.rs:229-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/editor-core/src/ffi_v2/editor/create_scanner.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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe29a75e5de954f944d56a03cf76c8ce3954d927fc0382881c0f0ddfa1079a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/schema/content_rule.rs:500-513 | rust/editor-core/src/schema/content_rule.rs:572-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/schema/content_rule.rs:500\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/editor-core/src/schema/content_rule.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c69f6b6d8290a904838ec6f0cc21cf244af2bdf031757a91a105bb3b0dfdb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/transform/apply/list_indent.rs:222-235 | rust/editor-core/src/transform/apply/list_wrap.rs:161-174 \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/editor-core/src/transform/apply/list_indent.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b382fc93f55fda679a9bfffd888198bf5c1f9c0fd3e98794f16bba0ed94d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:32-45 | rust/editor-core/src/transform/apply/range.rs:195-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/range.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. 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c515c92be2371133196ac19d466e881e1e50fa2eff4dbd1aac7f1ce0cffc784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/transform/apply/text.rs:309-322 | rust/editor-core/src/transform/apply/text.rs:397-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/text.rs:309\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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e34f41d7988c260762eeb69dccc8abdb21f436c5d9b4ff9b70556271bad97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec/projection_match.rs:542-555 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:77-90 \u2014 before extracting anything, compare \u0060rust/editor-core/src/yrs_engine/codec/projection_match.rs\u0060 and \u0060rust/editor-core/src/yrs_engine/codec/projection_write.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 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/editor-core/src/yrs_engine/codec/projection_match.rs:542\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b563111de6c2235f1a650c4456fb8f7fa96b1973df0e9d661488ca6464f05dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/yrs_engine/commands/format.rs:129-142 | rust/editor-core/src/yrs_engine/commands/format.rs:186-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/commands/format.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"75650a558c9524bc16eaee7e9dbee3ce30d766554d58da383730329d5a5f9c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:655-668 | rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:887-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. 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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e325e494c16aefb5f5bb551d9e4c9dfcf3c0918621b52ae92478b3504fdf2975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:787-799 | rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:830-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:787\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bcc9f86822322299393e966c725874521017073db8603081015df2b47a0e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): rust/editor-core/src/yrs_engine/update_preflight.rs:356-369 | rust/editor-core/src/yrs_engine/update_preflight.rs:663-676 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/update_preflight.rs:356\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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b095000f41f67613ac4ebe5ffad2be1a20b4bc4ccb613f93e06946c7f9957"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust/editor-core/src/command_planner/backspace.rs:338-350 | rust/editor-core/src/command_planner/text.rs:750-762 | rust/editor-core/src/editor_state/selection.rs:389-401 \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. 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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8cd2cada7a9f312c580399bab8181249c87fb3d0622039ab9cf4f7dbd2a60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust/editor-core/src/yrs_engine/compiler/operations/batch.rs:342-354 | rust/editor-core/src/yrs_engine/compiler/operations/batch.rs:406-418 | rust/editor-core/src/yrs_engine/compiler/operations/batch.rs:479-491 \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/editor-core/src/yrs_engine/compiler/operations/batch.rs:342\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/editor-core/src/yrs_engine/compiler/operations/batch.rs:478\u0060 calls \u0060clone\u0060 and \u0060rust/editor-core/src/yrs_engine/compiler/operations/batch.rs:405\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/editor-core/src/yrs_engine/compiler/operations/batch.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"db63cdc5f8defe30ef6df9e9c11c1127588be293ca848e4dc52ee06b6cd9d9d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): rust/editor-core/src/command_planner/empty_blocks.rs:113-123 | rust/editor-core/src/command_planner/empty_blocks.rs:180-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/empty_blocks.rs:113\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. 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/editor-core/src/command_planner/empty_blocks.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"81afe500024f7b0b1fef4459c1195ad0d655bb533a421a6c5b7c54a2abfea01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/command_planner/format.rs:312-324 | rust/editor-core/src/command_planner/format.rs:332-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/format.rs:312\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/editor-core/src/command_planner/format.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9061c8643ed36a87ef60ad1932c4c48bcbb9ff0bcbd24cae949942974e3bc0be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/render/incremental/cache_helpers.rs:46-58 | rust/editor-core/src/render/incremental/cache_helpers.rs:97-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental/cache_helpers.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e47df1b80e66aa5e4e7a4e810dcc2978a09c2e0c75dd54909029004101f5684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/session/config.rs:102-114 | rust/editor-core/src/session/config.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. 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/editor-core/src/session/config.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c487d11fe2d989c7566866804ea053da43136d07843d11b4fc7a658e03c27dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:18-30 | rust/editor-core/src/transform/apply/range.rs:179-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/editor-core/src/transform/apply/range.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c934ead25393418bff0633a21df8e5f20a888c660fb70e63a2ed156d98305e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:701-713 | rust/editor-core/src/yrs_engine/mutation/lowering/text.rs:743-755 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e40cdfb76ef3f4254d975a0eefeda8501e94860b434e6ceb012a6fbbb32db3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): rust/editor-core/src/render/generate.rs:144-155 | rust/editor-core/src/render/generate.rs:176-187 | rust/editor-core/src/render/incremental.rs:756-767 | rust/editor-core/src/render/incremental.rs:801-812 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9459098018c8adef4bc105c64ff7244a2b5abd7621120154a1edb48566f83cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): rust/editor-core/src/command_planner/backspace.rs:451-461 | rust/editor-core/src/command_planner/backspace.rs:524-534 | rust/editor-core/src/command_planner/empty_blocks.rs:252-263 \u2014 before extracting anything, compare \u0060rust/editor-core/src/command_planner/backspace.rs\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs\u0060 as WHOLE FILES: this scan already matched 5 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/editor-core/src/command_planner/backspace.rs:451\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afeeceb9a40b5552c7510bcdd85be17a7e86c9dd2ccc2a7dc1b316f9d558950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/editor-core/src/ffi_v2/collaboration.rs:286-297 | rust/editor-core/src/table_interop.rs:889-900 \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/editor-core/src/ffi_v2/collaboration.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61d5b8c324fae13d8a541f86877bb0f176f3863e45e9e1ebe159d722e416f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): rust/editor-core/src/transform/apply/block.rs:8-34 | rust/editor-core/src/transform/apply/text.rs:8-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2087fe919c13380d6fd93cc32f920bd114e4e8450991cb017ae8606a9550d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine/remote.rs:308-319 | rust/editor-core/src/yrs_engine/engine/undo_redo.rs:690-700 \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/editor-core/src/yrs_engine/engine/remote.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. 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/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ad0d29a549ddeb0a93c26845915ab730d51e9aa6d1afd0826bfce879bd3026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:49-60 | rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:106-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"716270fdb825519e83f9f7dc907140992abc8ccc86bb49dbb849fe9e8c416fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:71-82 | rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:88-99 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4880d7b8e0b41fba9127df067a0cff0dd5a87451b14aa488b39386bb6271b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): rust/editor-core/src/command_planner/backspace.rs:12-22 | rust/editor-core/src/command_planner/backspace.rs:41-51 | rust/editor-core/src/command_planner/backspace.rs:376-386 \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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7961723040189b2586b55d274046df30ec72f4595f393105318745ea6031e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/editor-core/src/command_planner.rs:349-360 | rust/editor-core/src/command_planner.rs:468-479 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/command_planner.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a5beb92bbab3b1830b0c4802be33f8f07a38e357d9cbec14639d338e433324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/table_interop.rs:545-555 | rust/editor-core/src/table_interop.rs:595-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/table_interop.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a657fd6133542a7a927ca68bae94283b830c32fb8afe42b1760656e1e543f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/tables/admission.rs:190-202 | rust/editor-core/src/tables/normalize.rs:145-157 \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/editor-core/src/tables/admission.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/editor-core/src/tables/admission.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dfd3eb2d83dc7c97beeff5776659d408944fd87fd7afea620e35ef46c5eacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec/projection_match.rs:569-579 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:97-107 \u2014 before extracting anything, compare \u0060rust/editor-core/src/yrs_engine/codec/projection_match.rs\u0060 and \u0060rust/editor-core/src/yrs_engine/codec/projection_write.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"893007c687a0dc1fdd9600aa6edf5531dd2ca8e79ed93638e2dc69848436c075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:45-54 | rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:75-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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"622a342382a908f4699aeff0504960e8b7616489b09fb126da045e830d6ee258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:406-416 | rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:484-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs:406\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"119aa85d162ed559913ca87650291399aad86823cf60176e41b70ea43a8d5739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/yrs_engine/update_preflight.rs:488-498 | rust/editor-core/src/yrs_engine/update_preflight.rs:516-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/update_preflight.rs:488\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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"83db7eaa0b379a7c2f43de037e61156ace3f6e80cc4afdc1cd5cabc6c4006800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): rust/editor-core/src/serialize/json_in.rs:623-632 | rust/editor-core/src/serialize/json_out.rs:29-38 | rust/editor-core/src/transform/apply.rs:158-167 \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/editor-core/src/serialize/json_in.rs:623\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c580f3683da11ce575e6aba3d6b88d8c98e50434b1c997238d439eae869b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/command_planner.rs:232-241 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:262-271 \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/editor-core/src/command_planner.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4957352f094e71f324b7843ca773ee87aae1be88b2fe24a3ebb29d3d122bb41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/command_planner.rs:366-375 | rust/editor-core/src/command_planner.rs:496-505 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/command_planner.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"617fa3d5ed32c123534ffc9a961870b95a2dca738c3c8fcbfeb766e7bd1cdfb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/command_planner/structure.rs:473-482 | rust/editor-core/src/command_planner/structure.rs:489-498 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"03442722c8de09caba933ff12682ae76595172458d5224b45d66e3889cb3904e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/ffi_v2/collaboration.rs:191-200 | rust/editor-core/src/ffi_v2/collaboration.rs:216-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/ffi_v2/collaboration.rs:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ba15a7a2c608c7da28d0c7d811d9c44ca5e46aa7b9511d6c6531c8bb0dec5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/render/generate.rs:209-218 | rust/editor-core/src/render/incremental.rs:852-861 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:209\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/editor-core/src/render/generate.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"322364f9e62d2a5b79eca45587a3d880afaffdcaaa0e70301e00543d1da5b45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/serialize/html_in.rs:1301-1310 | rust/editor-core/src/serialize/html_out.rs:557-566 \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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd29e1a8b4550336ac1382ba9d78aa432bd7218e156b6abe2a46fc09a64c7c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec.rs:147-156 | rust/editor-core/src/yrs_engine/codec/mutation.rs:136-145 \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/editor-core/src/yrs_engine/codec.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac368a4d20e87e3d325b53def0e0a3482b658d1bfee71a80046846352632cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/compiler/positions.rs:112-123 | rust/editor-core/src/yrs_engine/compiler/positions.rs:193-202 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/compiler/positions.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e5f75154256cf4b7853ea6200bc30aea01709f7ede6763aa8e45e1c781a166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/history_snapshot.rs:551-560 | rust/editor-core/src/yrs_engine/derived_state/history_snapshot.rs:751-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. 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/editor-core/src/yrs_engine/derived_state/history_snapshot.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0b247dea686f77cc41f3ac4614be3a2718a69d8a16dfd85a9ff1d0a64249cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/localized_index.rs:948-957 | rust/editor-core/src/yrs_engine/derived_state/localized_index.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/editor-core/src/yrs_engine/derived_state/localized_index.rs:948\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/editor-core/src/yrs_engine/derived_state/localized_index.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d03e174797ac7fe7c9a4c59697d54dbbb124e88a2164e952a5defd96e23a0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs:140-149 | rust/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs:369-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs:140\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/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddecd7238912f452e709986688fade5aa6473e23d96bcafe611e4cc6ee0d4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:471-480 | rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:495-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs:471\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85859e4835a9dd6f3b292e730e7366601df596faf34c4b336da80de5e29e776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/editor-core/src/command_planner/backspace.rs:19-27 | rust/editor-core/src/command_planner/backspace.rs:383-391 | rust/editor-core/src/command_planner/backspace.rs:476-484 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32df1102ad4438780d014bc5f8c69b63563f8cb56f5151ee8650434d69fcad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/editor-core/src/tables/admission.rs:193-201 | rust/editor-core/src/tables/mutation_guard.rs:271-279 | rust/editor-core/src/tables/normalize.rs:148-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/tables/admission.rs:193\u0060 it does not close everything it opens, so those exact 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/editor-core/src/tables/admission.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"681b7172edea998a7d179f03549d6d1a6071893e56b6ffca154cb6be9b6a3034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:11-19 | rust/editor-core/src/yrs_engine/mutation/lowering/block/join.rs:9-17 | rust/editor-core/src/yrs_engine/mutation/lowering/node.rs:15-23 \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/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90bcb8d714428621d98967f15543cbe2583e65d8b4021ac220fe0296cbbb00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/command_planner/structure.rs:141-149 | rust/editor-core/src/editor_state/selection.rs:272-280 \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/editor-core/src/command_planner/structure.rs:141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/structure.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c8755771d12ede540411fdf3b735332ba70f4f5a396bbdc542333637cc7261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/ffi_v2/collaboration.rs:77-85 | rust/editor-core/src/ffi_v2/collaboration.rs:103-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/editor-core/src/ffi_v2/collaboration.rs:77\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/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6b96f905e6c560b5bf8ffdd15aa3c1ea7345e4af71612a9294963cda6b30be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/ffi_v2/editor.rs:497-505 | rust/editor-core/src/ffi_v2/editor.rs:531-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/ffi_v2/editor.rs:497\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/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f345d7de3730f32c81193f892f0ccc03e40dc45d2609f1484afc3dbbb78ac565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/serialize/html_in.rs:571-579 | rust/editor-core/src/serialize/html_in.rs:1089-1097 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/serialize/html_in.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_in.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f85cb8c767c82c3468b6486bca363d49cce2ce5e7750ccfc37f9bc0b86db200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/transform/apply.rs:139-147 | rust/editor-core/src/transform/apply/validation.rs:295-303 \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/editor-core/src/transform/apply.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f292675374958b35d71f74045160698546f9a6743257a9888658f28bb45218a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/transform/apply/list_wrap.rs:233-241 | rust/editor-core/src/transform/apply/list_wrap.rs:243-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18170212a03d5ecb6dd07116641560471f902cbb85bba97d163b7e9de42f31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine/candidate.rs:281-289 | rust/editor-core/src/yrs_engine/engine/snapshots.rs:132-140 \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/editor-core/src/yrs_engine/engine/candidate.rs:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b299267fa48a5c3cff50521487a1f5409f7ab841fce8bd4fd04695fb0d5b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine/candidate.rs:298-306 | rust/editor-core/src/yrs_engine/engine/snapshots.rs:149-157 \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/editor-core/src/yrs_engine/engine/candidate.rs:298\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/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4904f128a3bbb3bfd018caa477a421b06ca08047261d57ec2255b76f60bf8d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine/candidate.rs:348-356 | rust/editor-core/src/yrs_engine/engine/candidate.rs:433-441 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"918e556255386ecbbaadf25cbbafa8b3381fc7a7623ded668ddf93753cfee34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:245-253 | rust/editor-core/src/yrs_engine/mutation/lowering/attrs.rs:264-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. 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/editor-core/src/yrs_engine/mutation/lowering/attrs.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe4cb8487637e2755e796a0230aaa5a059bfddc239556a376f26eb6b1d8fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs:906-914 | rust/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs:916-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/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs:906\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/index/construction.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab385c55208fb891e47bccc8b7c32382c4ed6700aa7fbd321595a9a3b7570cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/model.rs:335-343 | rust/editor-core/src/yrs_engine/mutation/plan/model.rs:354-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/editor-core/src/yrs_engine/mutation/plan/model.rs:335\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/editor-core/src/yrs_engine/mutation/plan/model.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0020547b7d11e84be69a66fd3bc4e7b75f482fef8f790b34025686945d5375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): rust/editor-core/src/ffi_v2/collaboration.rs:76-83 | rust/editor-core/src/ffi_v2/collaboration.rs:102-109 | rust/editor-core/src/ffi_v2/collaboration.rs:133-140 \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/editor-core/src/ffi_v2/collaboration.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c0ba3baf5822e81def5503d4ad6760c5cf63ac0f38018219499c8f0bc60386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): rust/editor-core/src/transform/apply/list_wrap.rs:234-240 | rust/editor-core/src/transform/apply/list_wrap.rs:244-250 | rust/editor-core/src/transform/apply/list_wrap.rs:258-265 \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/editor-core/src/transform/apply/list_wrap.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd1310043223b9adf3e4565b478d532a3d1830e802c12f0ae2159c5bfd32bb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/editor-core/src/command_planner/format.rs:136-144 | rust/editor-core/src/command_planner/format.rs:210-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/format.rs:136\u0060 it begins part-way through the construct above it, so those exact 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/editor-core/src/command_planner/format.rs:145\u0060 calls \u0060push\u0060, \u0060clone\u0060, \u0060canonical_marks\u0060 and \u0060rust/editor-core/src/command_planner/format.rs:218\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/editor-core/src/command_planner/format.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f176765ab98669b2afef5ded2c987b309472960e7047908d5e8617e33664b4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust/editor-core/src/command_planner/structure.rs:87-94 | rust/editor-core/src/command_planner/structure.rs:110-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/structure.rs:87\u0060 it does not close everything it opens, so those exact 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/editor-core/src/command_planner/structure.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d29fe50fe3612906f25b912ecb3a01afbec933115b550a1f7c010a7f1cc60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/session/errors.rs:126-136 | rust/editor-core/src/session/errors.rs:153-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/session/errors.rs:153\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 \u0060error\u0060 to \u0060YrsEngineError\u0060 in one and \u0060BoundaryError\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/editor-core/src/session/errors.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fffd707144b73e3a9200f95145a82c3ddaced8d290152e7a5565b5117f56f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust/editor-core/src/yrs_engine/commands/structural_batch.rs:243-249 | rust/editor-core/src/yrs_engine/commands/structural_batch.rs:376-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/commands/structural_batch.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/commands/structural_batch.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaaebabfa728185ddbacb7199a10e301e8086bc72d35a0926d84fb79ce45dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/range.rs:531-537 | rust/editor-core/src/yrs_engine/mutation/plan/preflight/signatures.rs:186-193 \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/editor-core/src/yrs_engine/mutation/lowering/range.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fcb7804ee02f848a2a07ddc95a4ca2364103224ae85477f522cb88dd048cee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): rust/editor-core/src/command_planner/backspace.rs:19-25 | rust/editor-core/src/command_planner/backspace.rs:383-389 | rust/editor-core/src/command_planner/backspace.rs:476-482 | rust/editor-core/src/command_planner/empty_blocks.rs:478-484 \u2014 before extracting anything, compare \u0060rust/editor-core/src/command_planner/backspace.rs\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs\u0060 as WHOLE FILES: this scan already matched 5 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/editor-core/src/command_planner/backspace.rs:19\u0060 it does not close everything it opens, so those exact 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/editor-core/src/command_planner/backspace.rs:474\u0060 calls \u0060node_by_html_tag\u0060, \u0060as_str\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs:476\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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"942eea9cca670557cf7e81c3b0b77f01a769ab6ac58dc991e49d553f2c60cb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): rust/editor-core/src/command_planner/backspace.rs:130-136 | rust/editor-core/src/command_planner/backspace.rs:188-194 | rust/editor-core/src/command_planner/backspace.rs:285-291 \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/editor-core/src/command_planner/backspace.rs:130\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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"330fc694118923613f26799ca8ada6806f83a97bfa2376847c6f449fbfd5f3da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust/editor-core/src/boundary.rs:594-601 | rust/editor-core/src/serialize/json_out.rs:246-253 \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/editor-core/src/boundary.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c086598429c3810567fec962d098c7f911b8cee5bdb56b80b096ab27d0bd09ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/command_planner/text.rs:771-777 | rust/editor-core/src/command_planner/text.rs:1034-1040 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/command_planner/text.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b90b9a26e0bd4b0e1261ea004635d2dbe139fc2587f2e407c8f026e6fb7f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/editor_state.rs:584-590 | rust/editor-core/src/editor_state/selection.rs:371-377 \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/editor-core/src/editor_state.rs:584\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/editor_state.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1978bd220a5ac85cbdfb9f301be2d23e5747d8ebea0592c7a145bb6d085a7255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:736-742 | rust/editor-core/src/transform/apply/range.rs:761-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/range.rs:736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcab523a2f7c59b31408858a8610018f51f7e51d181b25c5af657d7bf51050e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/transform/apply/text.rs:249-256 | rust/editor-core/src/transform/apply/text.rs:348-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/text.rs:249\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/editor-core/src/transform/apply/text.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba250bb2270baca14e82915019c424c2f5a69aea0082369b974bdaff3632d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): rust/editor-core/src/command_planner/backspace.rs:18-23 | rust/editor-core/src/command_planner/backspace.rs:47-52 | rust/editor-core/src/command_planner/backspace.rs:382-387 | rust/editor-core/src/command_planner/backspace.rs:475-480 | rust/editor-core/src/command_planner/empty_blocks.rs:477-482 \u2014 before extracting anything, compare \u0060rust/editor-core/src/command_planner/backspace.rs\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs\u0060 as WHOLE FILES: this scan already matched 5 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/editor-core/src/command_planner/backspace.rs:474\u0060 calls \u0060node_by_html_tag\u0060, \u0060as_str\u0060 and \u0060rust/editor-core/src/command_planner/empty_blocks.rs:476\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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4609224f55067971c2fc49beff0e233dfff59859cf301f47d43f22cec18feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 4): rust/editor-core/src/command_planner.rs:234-238 | rust/editor-core/src/transform/apply.rs:117-122 | rust/editor-core/src/transform/apply/text.rs:303-307 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:264-268 \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. 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/editor-core/src/command_planner.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f94ed8a30ddb0d78bce0aba7de1af51beeaa49ba2f57de849ef6c67d02c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): rust/editor-core/src/tables/admission.rs:192-197 | rust/editor-core/src/tables/mutation_guard.rs:185-190 | rust/editor-core/src/tables/normalize.rs:147-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/tables/admission.rs:192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/admission.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"013166fc269a3247219ca24a6beebd904dd2598e340a76a9fa4f251e94e8aaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/command_planner/text.rs:127-132 | rust/editor-core/src/command_planner/text.rs:511-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/command_planner/text.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner/text.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73c6d94b80ae8703c9b2021a3179d2c2fa92aeabbb51856b01a4553eeab690f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/command_planner/text.rs:713-718 | rust/editor-core/src/editor_state/structure.rs:55-60 \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/editor-core/src/command_planner/text.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe09d2034c41c830ed49ba897da067ce3e1e4aadd21785e609862c60e9fe232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/viewer/compile.rs:507-512 | rust/editor-core/src/viewer/compile.rs:527-532 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/viewer/compile.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed0d866ac830293d2ee40f27dc6091afd98c78a9646af69d80e9b10edcd5f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec/projection_match.rs:619-624 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:166-171 \u2014 before extracting anything, compare \u0060rust/editor-core/src/yrs_engine/codec/projection_match.rs\u0060 and \u0060rust/editor-core/src/yrs_engine/codec/projection_write.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 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/editor-core/src/yrs_engine/codec/projection_match.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1abcce7c51e428c92683c2c9219592f59fa949e07b4d4d8b656e74c7b896c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust/editor-core/src/render/generate.rs:196-200 | rust/editor-core/src/render/incremental.rs:834-838 | rust/editor-core/src/render/incremental.rs:861-865 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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/editor-core/src/render/generate.rs:196\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/editor-core/src/render/generate.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6f6a914a9eec5591641c37cbc06222610d12bfb710bb2ba47b2b69dfaaaa3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): rust/editor-core/src/transform/apply/text.rs:134-138 | rust/editor-core/src/transform/apply/text.rs:232-236 | rust/editor-core/src/transform/apply/text.rs:331-335 \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/editor-core/src/transform/apply/text.rs:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e824c8102715659835fae0a53c0440036315426432bac376b1123535f12f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/editor-core/src/boundary.rs:583-587 | rust/editor-core/src/serialize/json_out.rs:206-210 \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/editor-core/src/boundary.rs:583\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa1b4f72776c9acf347c2cfde2a13baac4e8e927dbed9461695c0c4199bcb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/collaboration_runtime/awareness.rs:282-287 | rust/editor-core/src/session.rs:191-196 \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/editor-core/src/collaboration_runtime/awareness.rs:282\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/editor-core/src/collaboration_runtime/awareness.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2117f227193be0b647b1b0caad719e30e84739ed31db2e292f2b77a2334cd484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/ffi_v2/render.rs:247-253 | rust/editor-core/src/yrs_engine/derived_state/selection.rs:667-673 \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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9768384da35fce57ac7a6a798cfdfcc3280e5a13df8c1e535c63178ae55177e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:313-321 | rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:371-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:310\u0060 calls \u0060matches_exact_source_document\u0060, \u0060schema_fingerprint\u0060, \u0060schema_context\u0060 and \u0060rust/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs:370\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/editor-core/src/yrs_engine/derived_state/candidate_evidence.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa43668471f0e621f878a58f0156195fab0ef52ab141bac5a7928afeeb979c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): rust/editor-core/src/tables/commands/columns.rs:83-117 | rust/editor-core/src/tables/commands/rows.rs:100-134 \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/editor-core/src/tables/commands/columns.rs:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/commands/columns.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"385d640f8f0eab821ac6b161c6c116eb91671172e9d027025f3ebaf7c51858f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/boundary/limits.rs:175-183 | rust/editor-core/src/yrs_engine/error.rs:29-37 \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/editor-core/src/boundary/limits.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5546307b4d1dd1e00f33786da45def469f23f7518de910e02bf85d38887917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/render/generate.rs:18-26 | rust/editor-core/src/render/incremental.rs:305-313 \u2014 before extracting anything, compare \u0060rust/editor-core/src/render/generate.rs\u0060 and \u0060rust/editor-core/src/render/incremental.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 155 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 \u0060node\u0060 to \u0060\u0026Node\u0060 in one and \u0060\u0026crate::model::Node\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/editor-core/src/render/generate.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"502d1c24917e6a95551a399a2e4cedad093ecc6774e53740594ab72cab927e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/tables/commands/columns.rs:11-20 | rust/editor-core/src/tables/commands/rows.rs:12-21 \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/editor-core/src/tables/commands/columns.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5627a0e3f6e65fdc96ffa920894a72fb6e9dd30d249684a72e4b096a7df3a234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/yrs_engine/codec/projection_match.rs:441-447 | rust/editor-core/src/yrs_engine/codec/projection_write.rs:9-15 \u2014 before extracting anything, compare \u0060rust/editor-core/src/yrs_engine/codec/projection_match.rs\u0060 and \u0060rust/editor-core/src/yrs_engine/codec/projection_write.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 58 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/editor-core/src/yrs_engine/codec/projection_match.rs:441\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd22f4940bff5fa0015faa5a9d17e910340f3871b8bb7d077abb38fccd32dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust/editor-core/src/ffi_v2/render.rs:723-736 | rust/editor-core/src/ffi_v2/render.rs:792-805 | rust/editor-core/src/ffi_v2/render.rs:819-832 \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/editor-core/src/ffi_v2/render.rs:723\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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d12b7f93ef9a0650be9056eaaeb2f48cafcdad93d32675481272254912c93dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/yrs_engine/update_preflight.rs:162-174 | rust/editor-core/src/yrs_engine/update_preflight.rs:456-468 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/yrs_engine/update_preflight.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e3845913dd3f851db804a2db80da50362f915927b4bcbf6fb996d28dc94958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/table_interop.rs:1055-1065 | rust/editor-core/src/table_interop.rs:1091-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. 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/editor-core/src/table_interop.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08829b9dd8cb8e7c531a3039a6ca576e9e37c889c5c0f93aada89e0a0765f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/transform/apply/list_indent.rs:242-252 | rust/editor-core/src/transform/apply/list_wrap.rs:189-199 \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/editor-core/src/transform/apply/list_indent.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. 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/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f646d5e0cb562d6888b61d4c2cc7fce1507546cd1488916bda7d2f11c24aedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:670-678 | rust/editor-core/src/transform/apply/range.rs:713-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/transform/apply/range.rs:670\u0060 it does not close everything it opens, so those exact 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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f1ef669c608c6132394d73431850b3d38d4a1adfc1d0c69592d3dba431c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/plan/model.rs:810-819 | rust/editor-core/src/yrs_engine/mutation/plan/model.rs:825-834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/plan/model.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/editor-core/src/yrs_engine/mutation/plan/model.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4fce78e13998d22ba19a6ed1c0ac953c69fa517660bc6c1edd90e62281750a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation/lowering/range.rs:476-484 | rust/editor-core/src/yrs_engine/mutation/lowering/range.rs:501-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation/lowering/range.rs:476\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/editor-core/src/yrs_engine/mutation/lowering/range.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e886f43d09aea19012c6841f48fa1ed0141323ae57faf0d50fe98d54f64c596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/ffi_v2/editor/create_scanner.rs:377-383 | rust/editor-core/src/ffi_v2/editor/create_scanner.rs:426-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/ffi_v2/editor/create_scanner.rs:377\u0060 it does not close everything it opens, so those exact 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/editor-core/src/ffi_v2/editor/create_scanner.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ae003880da7332d174dc3c7e0f55daf80a9371e0daf04cfe896a33ed18803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/transform/apply/range.rs:290-295 | rust/editor-core/src/transform/apply/range.rs:324-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/editor-core/src/transform/apply/range.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adbb903ad9f906bf26751e5867cae702781b84b4b79e4e529dabe2fffa9e08d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201354 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt:19-72 | android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt:392-437 \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 \u0060android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt:19\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e150383f41d67eb3e26a397b9f62653248d11884274a3c5b80591a5609d0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt:1297-1319 | android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt:1644-1664 \u2014 both copies are in the same file, so extract the block 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaeac03c0b516b991b53317f7022d57c6bafc3b37e7e14144dc0abab5d577c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorTextDecorationDrawing.kt:41-56 | android/src/main/java/com/apollohg/editor/EditorTextDecorationDrawing.kt:111-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorTextDecorationDrawing.kt:41\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":"android/src/main/java/com/apollohg/editor/EditorTextDecorationDrawing.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b8605d7ef3e070f780e07cadfc8060db1ea3cbf1c7f458a9a96f554e3583a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt:110-129 | android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt:203-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt:130\u0060 calls \u0060effectiveTextStyle\u0060 and \u0060android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt:223\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":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8cff77df11a566c3e534a8535047999cb760b897c67f1a43ab1f68798c579a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:767-782 | android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:795-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"81842bfcfcf30f6b7e70b298c687060dc4375a2db2646e16be07a7f66e84a94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt:829-842 | android/src/main/java/com/apollohg/editor/RemoteSelectionOverlayView.kt:107-121 \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 \u0060android/src/main/java/com/apollohg/editor/RemoteSelectionOverlayView.kt:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f70c3f26f92c57c1ce6f9c9c9acc7517c13ebd27b0ff19533b8bf438564f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt:1139-1151 | android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt:1210-1223 \u2014 both copies are in the same file, so extract the block 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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ca8ba80edc529c99a00f93e2d3aa845dffe7985586852ec455466d8c2c6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt:581-593 | android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt:604-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt:604\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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4e11cb20d165e832c2e2f9593532fe7df1bf292cd6abe001732969774ed2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:622-629 | android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:643-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt:622\u0060 it begins part-way through the construct above it, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"05854a6071c12baefcd6538c9fa15cc8a0591b0dbdf144dd74e73176314059aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorEditTextDeferredUpdates.kt:176-184 | android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt:277-285 \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 \u0060android/src/main/java/com/apollohg/editor/EditorEditTextDeferredUpdates.kt:176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextDeferredUpdates.kt"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b515593904efe545586926d338674df649703f1067ee6ed8afa24fe1e7a43b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:568-576 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:754-762 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:774-782 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d329b156882d228a30ca1eebf2324be6e102cc58a73dbb5dc10b1192136ddae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:38-44 | android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:134-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:38\u0060 it does not close everything it opens, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1611bbf47e9a004b62cbc52ba7735324341a9d654aa42055868f845086943ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt:11-18 | android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt:356-363 \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":"android/src/main/java/com/apollohg/editor/EditorMentionStyle.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"249234acf9e6a49820396ee2729920f38b8a3dc207da4d33d33a8f3c2cbeaca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:906-913 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2049-2056 \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 \u0060android/src/main/java/com/apollohg/editor/ProseViewerView.kt:906\u0060 it does not close everything it opens, so those exact 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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1502ecd9e7b27a396ca465ed31f2da8483d5bbe68f3e8009cba9d06632a385b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:37-43 | android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:62-68 | android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:133-139 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt:37\u0060 it does not close everything it opens, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorEditTextAnnotations.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2be52a8c87624ca5f18cec8f340ca7dcbda7f32cd951de61b3517259cde567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt:89-95 | android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt:149-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt:89\u0060 it does not close everything it opens, so those exact 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, \u0060android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt:88\u0060 calls \u0060canDispatchTableCellMutation\u0060 and \u0060android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt:148\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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c013ee8414d3824f232906dfee85cc84343a29e7298176bb5744a8a0f1873732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt:110-116 | android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt:143-149 \u2014 both copies are in the same file, so extract the block 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":"android/src/main/java/com/apollohg/editor/EditorInputCoordinates.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"293bf37ed4bdffe3d9c27bb9b65c67ff0dc5ba40e3872bbd220c97ec304aebb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorTheme.kt:595-600 | android/src/main/java/com/apollohg/editor/EditorTheme.kt:606-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorTheme.kt:595\u0060 it begins part-way through the construct above it, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorTheme.kt"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1c7720c81767601130312c792313c7a9cb4d512e20d29dee4d5a3f5299827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt:188-192 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:1812-1816 \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 \u0060android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt:188\u0060 it begins part-way through the construct above it, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c2aff09c7a8a848c1236dc457641a5861ccb7b6a38dbdc8f648b8eaac67db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:871-881 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2021-2028 \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 \u0060android/src/main/java/com/apollohg/editor/ProseViewerView.kt:871\u0060 it begins part-way through the construct above it, so those exact 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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"de90451066b330e109adb6a48f6241f476e0fb0135d3cc62687aec4c92c4c77e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android/src/main/java/com/apollohg/editor/ProseViewerView.kt:949-957 | android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt:2078-2086 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433d264a39073d10903b10f972410e5c6c961feb312ccd8f99891b13f9bf5a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorInputConnection.kt:524-539 | android/src/main/java/com/apollohg/editor/EditorInputConnection.kt:561-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/EditorInputConnection.kt:524\u0060 it does not close everything it opens, so those exact 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":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6ea5ca4ef6f8f423ed9db7170fea6fdeca4e7f2cb675dcb55e2ac3a77ad62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt:165-169 | android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt:230-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt:165\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf83cf6d289d4134f9d1ec397356abbaa0531fb0ea6aaa5726893815db961138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/src/main/java/com/apollohg/editor/EditorTheme.kt:231-235 | android/src/main/java/com/apollohg/editor/EditorTheme.kt:275-279 \u2014 both copies are in the same file, so extract the block 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":"android/src/main/java/com/apollohg/editor/EditorTheme.kt"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dfc28a45897213b334de46267636701549dba1f076fe77ebd45b2da837b41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt:223-227 | android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt:237-241 \u2014 both copies are in the same file, so extract the block 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":"android/src/main/java/com/apollohg/editor/UniffiEditorV2Backend.kt"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2163b43cf105c2192b2a543db9c397446929ea12c07f712eb2b589eb1d73794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:58-85 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:94-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:58\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":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02da5e0636fbdffb9a0224c7bb810402b35d1f7c77a9dad7fb7e114513c5e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): ios/Tables/TableSurfaceSource.swift:29-52 | ios/Tables/TableSurfaceSource.swift:54-77 \u2014 both copies are in the same file, so extract the block 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":"ios/Tables/TableSurfaceSource.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e8b56e420c38ff1ec8cb4139489b7dd5b78b8130a4db7f48e60b04cfa0824e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): ios/EditorTextView\u002BRenderPatch.swift:601-622 | ios/EditorTextView\u002BRenderPatch.swift:624-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorTextView\u002BRenderPatch.swift: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. 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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c45b33effe0390b19593bf6d2afcf05b66a715fba0d7d6722db10185114b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): ios/RenderBridge.swift:399-417 | ios/RenderBridge.swift:490-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 \u0060ios/RenderBridge.swift:399\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e12646811f333939f9295564b44a5fe79160211d29c3d6d4ee4958ad5823fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): ios/EditorInteractionOverlays.swift:85-122 | ios/EditorTheme.swift:579-616 \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 \u0060ios/EditorInteractionOverlays.swift:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ef8203d6905e9bf86ca28c0ef1187ba9074ec51edcc2dbf8eb402dae14ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): ios/EditorLayoutManager.swift:153-168 | ios/EditorLayoutManager.swift:231-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorLayoutManager.swift: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. 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":"ios/EditorLayoutManager.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1cc1556da677fbbd47d511a21f2bde8e90451b51dbd7bf1f83e08806fb7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:11-25 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:131-145 | ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift:190-204 \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":"ios/Viewer/PreparedProseLayoutRegistry\u002BFabric.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7361ad4c78ba187f9bf7dba14d496e1278817ad60cb637e79d55c30a5326522d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): ios/EditorV2Adapter\u002BMutation.swift:289-304 | ios/EditorV2Adapter\u002BMutation.swift:412-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BMutation.swift:289\u0060 it begins part-way through the construct above it, so those exact 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd96a1c0131db9b5c6856647ad331746e0ce45e43cb258a55825b00db27b376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): ios/EditorV2Adapter\u002BTextCommands.swift:111-120 | ios/EditorV2Adapter\u002BTextCommands.swift:133-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BTextCommands.swift:111\u0060 it does not close everything it opens, so those exact 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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8adaa7ad71b9cdb859da5017d32b81ad2f5383a7a83303935d1c3615c6138ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): ios/Tables/ViewerTableSurface.swift:305-318 | ios/Tables/ViewerTableSurface.swift:348-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 \u0060ios/Tables/ViewerTableSurface.swift:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2655a6d955c98c682bcab466e811764807c174ee035983b874544131f04cfffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): ios/RenderBridge.swift:383-394 | ios/RenderBridge.swift:407-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/RenderBridge.swift:407\u0060 it begins part-way through the construct above it, so those exact 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, \u0060ios/RenderBridge.swift:382\u0060 calls \u0060NSAttributedString\u0060 and \u0060ios/RenderBridge.swift:407\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":"ios/RenderBridge.swift"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5986123fb6df84d863ff48ac81a2ec29353ad84949231f1ff25b71b45e938581"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ios/EditorV2Adapter\u002BSelection.swift:518-529 | ios/EditorV2Adapter\u002BSelection.swift:537-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BSelection.swift:518\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BSelection.swift"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0567afa991ba77d6e5c021eb737e59a679dac1bd2d6f269145c248dc24a0c3f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ios/NativeCollaborationTransportRegistry.swift:496-507 | ios/NativeEditorModule.swift:28-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. 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":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d75a8a45678fae72bb2057d48218edad126e0792e0186b043618e41c9bf758c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ios/EditorLayoutManager.swift:626-635 | ios/EditorLayoutManager.swift:812-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorLayoutManager.swift:626\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":"ios/EditorLayoutManager.swift"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619e096ac99fbd38c88aee691251a0f9f2254a46e67196666951cd1e0a50dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): ios/EditorV2Adapter\u002BCommands.swift:208-216 | ios/EditorV2Adapter\u002BCommands.swift:240-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BCommands.swift:208\u0060 it does not close everything it opens, so those exact 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. 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":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7075e73a411c4c3aedb7cd8469ae7cc2d2dc8ea00d6445d7fcf19e70de94f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ios/EditorV2Adapter\u002BTextCommands.swift:282-292 | ios/EditorV2Adapter\u002BTextCommands.swift:302-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BTextCommands.swift:282\u0060 it does not close everything it opens, so those exact 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea580dafaa3da385c5794477827903d88a201bb1ad4d08a4a1938a3b6755248b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): ios/EditorV2Adapter\u002BCommands.swift:208-215 | ios/EditorV2Adapter\u002BCommands.swift:240-247 | ios/EditorV2Adapter\u002BTextCommands.swift:385-392 | ios/EditorV2Adapter\u002BTextCommands.swift:408-415 \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. 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6f428e04bfbb255087d6bc44596e3156c349151461008373f6479c1a878624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ios/EditorTextView\u002BImages.swift:164-172 | ios/EditorTextView\u002BImages.swift:192-199 \u2014 both copies are in the same file, so extract the block 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, \u0060ios/EditorTextView\u002BImages.swift:161\u0060 calls \u0060attributes\u0060, \u0060guard\u0060 and \u0060ios/EditorTextView\u002BImages.swift:191\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":"ios/EditorTextView\u002BImages.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a759af2ed3f7c8d6e9ae4232fe7b0fe3f54baaa1d99df7a8dfa5100ac3c12671"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ios/EditorTextView\u002BSelection.swift:626-633 | ios/EditorTextView\u002BSelection.swift:635-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorTextView\u002BSelection.swift:626\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"c404051dc21495f69b77b380816256e79987ac2fb7406169c12cbd57d0fc4f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): ios/EditorV2Adapter\u002BTextCommands.swift:344-352 | ios/EditorV2Adapter\u002BTextCommands.swift:423-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BTextCommands.swift:344\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"652dac3c2e9bd9a87aaf3f93b9cb4f5181a80e669dc98834fc2f81edb6fc7f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): ios/Viewer/ViewerDocument.swift:477-482 | ios/Viewer/ViewerDocument.swift:570-577 \u2014 both copies are in the same file, so extract the block 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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a14d2df46e02479b85595dc9915ee9d26e3e83800ce58231eebf975be5e529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ios/EditorLayoutManager.swift:155-161 | ios/EditorLayoutManager.swift:233-239 | ios/EditorLayoutManager.swift:487-493 \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 \u0060ios/EditorLayoutManager.swift:155\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":"ios/EditorLayoutManager.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a54482aba9b06c88145c7a2ec001cce6e2d3da99254d6750cc7752b3e4a8ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): ios/EditorV2Adapter\u002BRenderState.swift:457-463 | ios/EditorV2Adapter\u002BSelection.swift:518-524 | ios/EditorV2Adapter\u002BSelection.swift:537-543 \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 \u0060ios/EditorV2Adapter\u002BRenderState.swift:457\u0060 it begins part-way through the construct above it, so those exact 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 after the matched lines, \u0060ios/EditorV2Adapter\u002BRenderState.swift:464\u0060 calls \u0060emit\u0060, \u0060contractError\u0060 and \u0060ios/EditorV2Adapter\u002BSelection.swift:525\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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c97fadaf3ba4ebf503e605cd67e724253ed3265711c8c5a3320e975405c3f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ios/EditorV2Adapter\u002BCommands.swift:198-205 | ios/EditorV2Adapter\u002BCommands.swift:216-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 \u0060ios/EditorV2Adapter\u002BCommands.swift:198\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter\u002BCommands.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec2799b6d0bb9ce15e3bdaa9abd48d11d6986a1d83f0bee0a5b34c3b1e7ea5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/EditorV2Adapter\u002BMutation.swift:172-178 | ios/EditorV2Adapter\u002BMutation.swift:433-439 \u2014 both copies are in the same file, so extract the block 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d06cfeb852446110ef8a56b7f9f46f4b5bf41b8368c254f59a2fae7aae06d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/EditorV2Adapter\u002BMutation.swift:428-434 | ios/EditorV2Adapter\u002BRenderState.swift:269-275 \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 \u0060ios/EditorV2Adapter\u002BMutation.swift:428\u0060 it does not close everything it opens, so those exact 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3f00bd2bb6772af61873ee0289e3e3ede324368dc0cee295af4d6d1c909472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): ios/EditorV2Adapter\u002BMutation.swift:429-434 | ios/EditorV2Adapter\u002BRenderState.swift:249-254 | ios/EditorV2Adapter\u002BRenderState.swift:270-275 \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 \u0060ios/EditorV2Adapter\u002BMutation.swift:429\u0060 it begins part-way through the construct above it, so those exact 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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"897813845aa3156ff97c428b19a89587e6dc665f7b9db3dd121a817cf0cff44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/EditorLayoutManager.swift:1006-1012 | ios/Viewer/PreparedProseDrawingView.swift:1924-1930 \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 \u0060ios/EditorLayoutManager.swift:1006\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":"ios/EditorLayoutManager.swift"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff96fa0c4cfbc20841435f8079d11071a180b63d49e776a0fbbbad10de615f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): ios/EditorV2Adapter\u002BRenderState.swift:249-253 | ios/EditorV2Adapter\u002BRenderState.swift:457-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorV2Adapter\u002BRenderState.swift:249\u0060 it begins part-way through the construct above it, so those exact 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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f9293bb3e4afd935f4b3e300b47a760b27643109e496378d026b8e6eb8dfbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/Tables/ViewerTableSurface.swift:376-382 | ios/Tables/ViewerTableSurface.swift:503-509 \u2014 both copies are in the same file, so extract the block 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":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4315cb7ba9c448e9dafefa9d54d5ae390f724376a3bb2a37da69e3cded94edbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ios/Tables/ViewerTableSurface.swift:1235-1240 | ios/Tables/ViewerTableSurface.swift:1287-1292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/Tables/ViewerTableSurface.swift:1235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Tables/ViewerTableSurface.swift"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfb674c835715c7425f217e4aa20eb1d3db8d9b8b8a99e7ab25b3ee173f5a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ios/EditorLayoutManager.swift:997-1003 | ios/Viewer/PreparedProseDrawingView.swift:1917-1921 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorLayoutManager.swift"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e893e03b99265018a20308a1e474327da5ba5414f3f9a29722a74b2d729b21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ios/EditorTheme.swift:34-39 | ios/EditorTheme.swift:151-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorTheme.swift:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorTheme.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c656ddf7a2779d3c1b7303031adda6c4010e6057a0e8b886295ad4bf0f48120d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ios/RenderBridge\u002BAtoms.swift:105-110 | ios/RenderBridge\u002BAtoms.swift:224-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/RenderBridge\u002BAtoms.swift:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/RenderBridge\u002BAtoms.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c5b3a92e870a7322b6eec7e1a9b71c59f10e100a74d4f4d5ca8333864b1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/EditorTextView\u002BDragDrop.swift:119-125 | ios/EditorTextView\u002BDragDrop.swift:146-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/EditorTextView\u002BDragDrop.swift: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":"ios/EditorTextView\u002BDragDrop.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ac65b457440370a680480e5a1af0826aa4abda956ed2e3bcf8af31e2e09aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ios/EditorTheme.swift:196-200 | ios/EditorTheme.swift:235-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060ios/EditorTheme.swift:240\u0060 calls \u0060color\u0060 and \u0060ios/EditorTheme.swift:201\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":"ios/EditorTheme.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27a4ee890c9be06aa5fc968dcf272cfcce9a7cdb01247e32fe1ed2e797b3d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ios/Viewer/ViewerDocument.swift:494-500 | ios/Viewer/ViewerDocument.swift:590-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060ios/Viewer/ViewerDocument.swift:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8f7ac4657f3a48e9b2965888340c0a8a3652e19b25c0a7f255ef45db90b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:68-86 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/paste_root_window.rs:57-79 \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/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd5171133b9b283556d415a39dc0ea6b844f1f00e6609539657c6305cb4ccc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust/editor-core/src/test_support/serialize_test/schema_projection.rs:127-147 | rust/editor-core/src/yrs_engine/mutation_tests/list_structure/unwrap_multiple.rs:818-831 \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/editor-core/src/test_support/serialize_test/schema_projection.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"51110c53c88b344f6c235061cd42ae7bc51747b432a219f122a891e8d56d526d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/candidate_cache/root_replacement.rs:6-24 | rust/editor-core/src/yrs_engine/engine_tests/history_and_commit/snapshot_charges.rs:6-26 \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/editor-core/src/yrs_engine/engine_tests/candidate_cache/root_replacement.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a9afbcf1b1cc9bd4f21e1a6af68c8d297e9a7087a65cfb178bc4387a93f0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust/editor-core/src/test_support/native_intent_test/command_availability.rs:64-79 | rust/editor-core/src/test_support/native_intent_test/command_planning.rs:20-35 \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/editor-core/src/test_support/native_intent_test/command_availability.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f576229a034d76729f4411084ee81e6c479fc8fccb7cab9d441cfc8086cf5f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): rust/editor-core/src/yrs_engine/mutation_tests/block_structure/boundary_splits.rs:15-42 | rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs:61-86 | rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs:284-310 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation_tests/block_structure/boundary_splits.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b3c88fa880c732f8756e784996c5865208f581df50293d5a768050906f5b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:387-404 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:547-565 \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/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a31cf395f3f2ab70cc4b9053982f27779fa3b61a68d397c4bd3f9ea060f211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/boundary_typing.rs:11-45 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:5-51 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/paste_root_window.rs:17-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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/editor-core/src/yrs_engine/engine_tests/prepared_commands/boundary_typing.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"155355059f7e8548f1f62a7b66aff159cf78a7136307243f07e60f7bfbc62cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/history_and_commit/history_depth.rs:321-343 | rust/editor-core/src/yrs_engine/engine_tests/localized_split.rs:299-318 \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/editor-core/src/yrs_engine/engine_tests/history_and_commit/history_depth.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5343eeceacfc93b1192e103c05820b2f223ec2c14ccc7cea586226901034d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): rust/editor-core/src/test_support/large_table_fixture.rs:154-180 | rust/editor-core/src/yrs_engine/engine_tests/structural_representation.rs:63-84 \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/editor-core/src/test_support/large_table_fixture.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aea9a7b46383309aaf9fb77c574ec3d075ccc1c5d6d4225c54b3969ed6afeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): rust/editor-core/src/test_support/ffi_v2_test/session_fixtures.rs:42-60 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:370-385 | rust/editor-core/src/yrs_engine/mutation_tests/direct_operations.rs:4-19 \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/editor-core/src/test_support/ffi_v2_test/session_fixtures.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5a4940dc3a39d9994e2822f3ca9c53220eab868bb437ec137437dde0d16d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust/editor-core/fuzz/fuzz_targets/position_map.rs:148-159 | rust/editor-core/fuzz/fuzz_targets/position_map.rs:170-181 \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/editor-core/fuzz/fuzz_targets/position_map.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bd94c13131e1e13563c3e878aaa0a9f5fd90c0dfe632eca375df65031f2876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): rust/editor-core/src/test_support/yrs_engine_remote_update_test/staging.rs:11-25 | rust/editor-core/src/test_support/yrs_engine_remote_update_test/tables.rs:356-370 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:567-583 \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/editor-core/src/test_support/yrs_engine_remote_update_test/staging.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8952e146b45633fecd3a2fcb6e1d59c78acf075069d6d0379945af8b260d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/history_and_commit/canonical_cache.rs:44-61 | rust/editor-core/src/yrs_engine/engine_tests/localized_split.rs:57-78 \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/editor-core/src/yrs_engine/engine_tests/history_and_commit/canonical_cache.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d83a2804aaf1ddd18c2051bf5e2d7512f746d7797e7386f9cc7c30d509fa88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/format_commands.rs:663-672 | rust/editor-core/src/yrs_engine/mutation_tests/list_structure/unwrap_multiple.rs:833-844 \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/editor-core/src/yrs_engine/engine_tests/prepared_commands/format_commands.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70bfbb18fafbbff07ebe5edfd8fb6bc7e8106c35bb515674caaf566df7a184b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/editor-core/src/yrs_engine/engine_tests/localized_split.rs:25-32 | rust/editor-core/src/yrs_engine/engine_tests/localized_split.rs:285-292 \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/editor-core/src/yrs_engine/engine_tests/localized_split.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da2ea2151cd3c458bd19fc4414532be639ac5f7f57bbd1fc45612c9307b8ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust/editor-core/src/yrs_engine/codec_tests/json_matching.rs:23-30 | rust/editor-core/src/yrs_engine/codec_tests/roundtrip_limits.rs:1-8 \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/editor-core/src/yrs_engine/codec_tests/json_matching.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7439837d0cb2795fd6cc79256cdc4f0cf29983437051992bcb06634a9f62d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust/editor-core/src/test_support/serialize_test/json_roundtrip.rs:196-200 | rust/editor-core/src/test_support/serialize_test/schema_projection.rs:669-673 \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/editor-core/src/test_support/serialize_test/json_roundtrip.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cabb57bc16afe90497ff4a622671090eab31a5a83ea0a19acb375870defeb62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs:268-284 | rust/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs:366-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/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs:268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4721f35579a269b6083409672e7a9106b1278525aaf9e62ee454d44c45474083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs:62-78 | rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs:285-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation_tests/preflight_and_properties/deletion_bounds.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"28538517605eae10bda2198f6052c3a3d4ef140b8fc8f53db88ab65eb0a27591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): rust/editor-core/src/yrs_engine/mutation_tests/block_structure/boundary_splits.rs:17-30 | rust/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs:268-281 | rust/editor-core/src/yrs_engine/mutation_tests/direct_operations/attributes.rs:366-379 \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/editor-core/src/yrs_engine/mutation_tests/block_structure/boundary_splits.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation_tests/block_structure/boundary_splits.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56d7cc3f1bf9fdc09f5afdfc9c1a2ccce8c28240be4709430fe55174287827f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/scenarios.rs:62-74 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:28-40 \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/editor-core/src/test_support/yrs_engine_transaction_property_test/scenarios.rs:62\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/editor-core/src/test_support/yrs_engine_transaction_property_test/scenarios.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff757edec31514bd2eb4f76fae06d4160d926d97a303ece49d1109fd729b78a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:385-396 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/paste_root_window.rs:186-197 \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/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.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/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace22283b8b3ef86c862e95aa46004a6ec951671d0663ed387c10292c8514d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:371-381 | rust/editor-core/src/yrs_engine/mutation_tests/direct_operations.rs:5-15 \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/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5cd7f8d27e3cf984f2594958cc94ae9a5510c6f4818ba5f3e4288cd607352b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:388-397 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:548-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs:388\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/test_support/yrs_engine_transaction_property_test/oracle_properties.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c2291db31c36a235c14f32f360b831673c102c2d42cf3701641c72e2a7d8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:374-382 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/paste_root_window.rs:176-184 \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/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:374\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2033a401f2c98435e1b601d226a2405d0bd92454e9ec76035ccdf33bb2b0d6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:269-274 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:366-371 \u2014 both copies are in the same file, so extract the block 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/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:372\u0060 calls \u0060validate\u0060, \u0060default\u0060, \u0060unwrap\u0060 and \u0060rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:275\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/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2bb0340656a6f9aab6d9d405066a4ab4aafb25bd799b4f658d23558d5fcc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:129-133 | rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:285-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/test_support/yrs_engine_transaction_property_test/stateful_traces.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f87e7526fc7616f427ea21bcf3313151d0fbaebb87059a1de010217932fdaf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust/editor-core/src/test_support/serialize_test/json_roundtrip.rs:172-178 | rust/editor-core/src/test_support/serialize_test/schema_projection.rs:742-748 \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/editor-core/src/test_support/serialize_test/json_roundtrip.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8590ef9f244cdd052b1f2d10eb3777d0b89e698944039ab5dc45c957886effb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust/editor-core/src/test_support/native_intent_test/command_availability.rs:69-79 | rust/editor-core/src/test_support/native_intent_test/command_planning.rs:25-35 \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/editor-core/src/test_support/native_intent_test/command_availability.rs:69\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/test_support/native_intent_test/command_availability.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efed09093cc8aa3b281bd75a73192885e2fe4df0d3b94174362407408889e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust/editor-core/src/test_support/collaboration_awareness_test/cursor_projection.rs:6-11 | rust/editor-core/src/test_support/ffi_v2_test/session_fixtures.rs:124-129 \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/editor-core/src/test_support/collaboration_awareness_test/cursor_projection.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae75263b2bb867f7d7f3f4280f5769bc8d3cf4f78f9a2c0c21e52c7dd038f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine_tests/history_and_commit/snapshot_charges.rs:9-13 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:379-383 \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/editor-core/src/yrs_engine/engine_tests/history_and_commit/snapshot_charges.rs:9\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine_tests/history_and_commit/snapshot_charges.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"679979c4681b46dedcc4142fefd3ebb26c668b8aacdfdb7ac235839427620ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:7-11 | rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/paste_root_window.rs:19-23 \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/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine_tests/prepared_commands/localized_marks.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"44334e3bda5f80532127809b5277408d2bef20a0274aaa8510366cd5947fbb47"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ItemPtr (LCOM4 5): ItemPtr\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/vendor/yrs/src/block.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60e120acd84ef876ebef0a62c8d3d829dc0e24980a57effa5bd152d1ad3f903"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CheckedWork (LCOM4 4): CheckedWork\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/editor-core/src/yrs_engine/editing_limits.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0560b379c4af6b381aeb1fb176b2f39d48869c1f5335c2e8b2d9219d6d8ca95"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Branch (LCOM4 4): Branch\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/vendor/yrs/src/branch.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"757bafbb7d34384c81515a9caa9bbcd40c145b6cfa24f2e01c4e37050d1d044a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IdMapInner (LCOM4 4): IdMapInner\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/vendor/yrs/src/ids.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a85a6d861fdf6a2223b20973ad3ceaf0ab97dd9d6408b748c5d5a40be4088"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: TBL-21-P independently declared ${name} semantics: 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3546b08c0e8356d60eb044200e32ab0f878bfaf2edf01ec1d1a909020814fc1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: TBL-21-P permits empty display-only gap grouping and declared defaults: 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfe085b095fd96bb5d714a4c5920524532efb1c52d4c137a9c8762ebf9aa6c3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: TBL-21-P compares independently represented meaningful synthetic semantics: 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c3884a0d60427d5022bee399073944461a59e84257c4577ba0143a81bb81a9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: TBL-21-P retains opaque plain data and rich content, merging only equivalent text runs: 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeeadb67161b5d130037f4cc298159a903fcdf6601e27cfea8f3b2f0cdbef55"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: TBL-21-P an unspecified display gap width inherits its resolved column: 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"265931174cd97295ebf4aa0cb558c427a4d0fdd521b82d50e263800710696ea4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: remote lifetime permits fresh authored redo identities with the declared effect: 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":"scripts/table-interop/cases/supplementary-continuity.test.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa068ec52d36c480ea96b6b5c3deec6ba8feb367fb8fa0d32bcee76302b340"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: remote lifetime accepts declared cell defaults across peer observations: 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":"scripts/table-interop/cases/supplementary-continuity.test.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ecdd06b6d7fca0954fa242b4f8cad7511f0e1df7f88d002e69256911a7a9c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: coalesces pending provisional values and commits the final value: This test sets up 4 test doubles (for example \u0060jest\n        .fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/ExternalTextComposition.test.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"099bc7a028e383075cf37a682c9a420b65ffe5247f80dbc45fe13352ebdb64a8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: routes native link, mention, and error events through public callbacks: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/NativeProseViewer.test.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee836163cfadc7710615a4ef32de54175c3baefbbb42e50dd18d1cd71f72dc3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: forwards native selection changes with the engine selection and fires focus/blur edges: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 7 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/NativeRichTextEditor.native-commits.test.tsx"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b40940a47c280bcbae92176ed41334c98fe03df509890d7f56736d4ea68e19"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: forgets the emitted active state when the view rebinds to another document: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/NativeRichTextEditor.native-events.test.tsx"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313e7a5d4d9793b1e2966c1d583a22563f2e9ea3d551c3b9ce54810f3f19cac"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: never creates or changes an engine selection: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/TableSelectionGeometry.test.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f312b7722a3c46f21efbb3ba3e70dff4affb3db646260400793613f6fab661f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: exports subscribed content once per document revision and skips unchanged renders: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 11 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/__tests__/useNativeEditor.test.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd66687c70406c32120d56577f884b3634671a56f108ff5a9013e47a7d12a4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/RenderBridge.swift: ios/RenderBridge.swift changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in RenderBridge.renderElements at line 260. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/RenderBridge.swift\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":"ios/RenderBridge.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bee7804c56e2654ad9f78db71d13bafba9e666321c5a46efec58f311e38496"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/CoreTextProseLayoutEngine.swift: ios/Viewer/CoreTextProseLayoutEngine.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in CoreTextProseLayoutEngine.prepareBlock at line 1238. 7 of those changes were fix/bug commits, and the other 11 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/CoreTextProseLayoutEngine.swift\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":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2c364f83fe1be61ec73db3f96b591418f09822e15634167316cccf40ce329c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt: android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in StaticLayoutAndroidProseLayoutEngine.prepareLayout at line 499. 4 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt\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":"android/src/main/java/com/apollohg/editor/viewer/AndroidProseLayoutEngine.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cddbcbc6b554b909c063c591d4977dcec174632bc7bdb0bb7b7f65ae5c5287"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt: android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in RenderBridgeElementsKt.appendElements at line 10. 5 of those changes were fix/bug commits, and the other 7 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt\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":"android/src/main/java/com/apollohg/editor/RenderBridgeElements.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ca0c75c8b703d51cd803d3c91df4dbaae8a1d5138569c4f146a80f9ca704ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditText.kt: android/src/main/java/com/apollohg/editor/EditorEditText.kt changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EditorEditText.dispatchKeyEvent at line 419. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditText.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d737c62c1933430b541a534283da5791d519371ba238a1dc0da042f556a81cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorPresentation.tsx: src/useRichTextEditorPresentation.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in useRichTextEditorPresentation.useRichTextEditorPresentation at line 50. 3 of those changes were fix/bug commits, and the other 5 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorPresentation.tsx\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/useRichTextEditorPresentation.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc35f7be65b5428547909c210f5b6e9f01c4ab892221286edfb0b623c242eaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/ViewerDocument.swift: ios/Viewer/ViewerDocument.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in ViewerDocument.lowerElements at line 435. 3 of those changes were fix/bug commits, and the other 7 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/ViewerDocument.swift\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":"ios/Viewer/ViewerDocument.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49b9efc2702a3b203269ddeea668caf392777b5d230e52a83a841e4fbfc5950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BRendering.swift: ios/EditorTextView\u002BRendering.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in EditorTextView.applyUpdateJSON at line 331. 2 of those changes were fix/bug commits, and the other 6 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BRendering.swift\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":"ios/EditorTextView\u002BRendering.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"78293c256acd9c26ea3745ec30cca6108a61a166ea6259609b96c47ac45dc0da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/RichTextEditorView.kt: android/src/main/java/com/apollohg/editor/RichTextEditorView.kt changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EditorScrollView.onInterceptTouchEvent at line 87. 16 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/RichTextEditorView.kt\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":"android/src/main/java/com/apollohg/editor/RichTextEditorView.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"428b0957fc360b31b0e47e3d89706454925a023e67acf40e6e368679a13a6a01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useNativeEditor.ts: src/useNativeEditor.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in useNativeEditor.useNativeEditorDocument.refresh at line 217. 4 of those changes were fix/bug commits, and the other 6 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useNativeEditor.ts\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/useNativeEditor.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"72359c94e560f174eda61e384a509bf1a2030c9651425db83df6e40d0ca516ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorState.tsx: src/useRichTextEditorState.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in useRichTextEditorState.useRichTextEditorState at line 43. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorState.tsx\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/useRichTextEditorState.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ca892f331f0a30fa69326ca44d3937ae48c7cb1e84c6ea3659e053e86a74d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt: android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in PreparedProseDrawingView.drawTableNodes at line 1137. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6458ef05bdeab327b6774864a9c631525f74ccd1f7452ee37db5e6941f5b467c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeToolbar.swift: ios/NativeToolbar.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in EditorAccessoryToolbarView.apply at line 195. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeToolbar.swift\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":"ios/NativeToolbar.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc356c6743bda0c416257810d5b6415404daf603bcd3783eacb3e46df22cf34c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView.swift: ios/EditorTextView.swift changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in EditorTextView.deleteBackward at line 733. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView.swift\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":"ios/EditorTextView.swift"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af1facb50d453ebfbaab93b118003e49c54903576a30f627ad8f1ce2523f87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/PreparedProseDrawingView.swift: ios/Viewer/PreparedProseDrawingView.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PreparedProseDrawingView.paint at line 1341. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/PreparedProseDrawingView.swift\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":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d3cf71522206ee5a8b43ff3ea20f32225d87f4fcad4413cf048a64176b45ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/native_transaction_bridge.rs: rust/editor-core/src/native_transaction_bridge.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NativeTransactionBridge::submit_native_intent at line 83. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/native_transaction_bridge.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/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dd6c2ac31c77a855b9cfe768648f1c124d9e51fdd3ccc085d4f745625af5ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt: android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in RenderBridgeInlineAndAtomsKt.appendStyledText at line 34. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt\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":"android/src/main/java/com/apollohg/editor/RenderBridgeInlineAndAtoms.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a30730dd9697b160362bec3d995efcaac7b1a2feb1c77a7ba66b79d1433f44a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/command_planner/text.rs: rust/editor-core/src/command_planner/text.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in editor_core::command_planner::text::plan_delete_scalar_range_impl at line 842. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/command_planner/text.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/editor-core/src/command_planner/text.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b2e5a2bd4b1b4005587742acfebd53c646a98160237b88be9b38e6987b807"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift: ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in CoreTextProseLayoutEngine.attributes at line 209. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift\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":"ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4c50dccf077e27e620f35cce0f5a8f3cdbf01b07deda1f516d6ca752655ffb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorInputConnection.kt: android/src/main/java/com/apollohg/editor/EditorInputConnection.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EditorInputConnection.commitCorrection at line 315. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorInputConnection.kt\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":"android/src/main/java/com/apollohg/editor/EditorInputConnection.kt"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3960e8ae04285a777c27eed937bc5007a6610153e6d08d8883300b83dad110da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/engine/commit.rs: rust/editor-core/src/yrs_engine/engine/commit.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in YrsDocumentEngine::apply_compiled_transaction_with_history_and_context 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/engine/commit.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/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"377560ee4428192d40b5a13ac9bf28ac169569b3b36ba8e9ced87a1ddcf5d981"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/NativeEditorRenderNormalization.ts: src/NativeEditorRenderNormalization.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NativeEditorRenderNormalization.validLeafRenderElement at line 59. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/NativeEditorRenderNormalization.ts\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/NativeEditorRenderNormalization.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff011820cd8074045b9e30f4650e12897b1d4592a4c87f813bb6517b2ddb816b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useEditorToolbarItems.tsx: src/useEditorToolbarItems.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in useEditorToolbarItems.useEditorToolbarItems at line 12. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useEditorToolbarItems.tsx\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/useEditorToolbarItems.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a5de9f2f5165dbc485435f36120e3d422a2c913661307452af6da5762429cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt: android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ViewerDocumentKt.lowerElements at line 392. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt\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":"android/src/main/java/com/apollohg/editor/viewer/ViewerDocument.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a66b315212b696ba95317d02d27fc9fd962e20c823fa00866b8120f90433d05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/render/incremental.rs: rust/editor-core/src/render/incremental.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in editor_core::render::incremental::generate_block_inner at line 628. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/render/incremental.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/editor-core/src/render/incremental.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"58583de4527e8222c8e17a7d1be34424c5303c5dbe38951814a5c812cdf96c50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeToolbar\u002BModels.swift: ios/NativeToolbar\u002BModels.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in NativeToolbarItem.parse at line 348. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeToolbar\u002BModels.swift\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":"ios/NativeToolbar\u002BModels.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2b3c4c8e5a969c3f0d000874e4a83fa5cf71c32fac43e1409b25c686d7a148"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorV2Adapter\u002BRenderValidation.swift: ios/EditorV2Adapter\u002BRenderValidation.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in EditorV2Adapter.isValidRenderElement at line 187. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorV2Adapter\u002BRenderValidation.swift\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":"ios/EditorV2Adapter\u002BRenderValidation.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d33c2e447ed075018270d028ab6843d798c36dc421e4ccaf6e70c1a149af0bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/schemaNormalization.ts: src/schemaNormalization.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in schemaNormalization.normalizeSchemaDefinition at line 352. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/schemaNormalization.ts\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/schemaNormalization.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dea3013b52e7169fae1fa59f441a6fe74bde90d07833f2041815edfd0bed2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/commands/text.rs: rust/editor-core/src/yrs_engine/commands/text.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in editor_core::yrs_engine::commands::text::plan at line 987. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/commands/text.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/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d34adcdd0abe182c949f9b52234bd0dfa519ac0e6debc37929ff6ac0fb74df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorLayoutManager.swift: ios/EditorLayoutManager.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorLayoutManager.layoutManager at line 72. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorLayoutManager.swift\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":"ios/EditorLayoutManager.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1789a8008ffd66f204d766ca9e3188ef21178b5e37f7517a43ba50e813716231"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/PreparedProseLayoutRegistry.swift: ios/Viewer/PreparedProseLayoutRegistry.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in PreparedProseLayoutRegistry.measure 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/PreparedProseLayoutRegistry.swift\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":"ios/Viewer/PreparedProseLayoutRegistry.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcab8941e29acc7be8c4db827421debf9d902b4b81cf552f59269bdb11a7fac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BSelection.swift: ios/EditorTextView\u002BSelection.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in EditorTextView.textViewDidChangeSelection at line 184. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BSelection.swift\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":"ios/EditorTextView\u002BSelection.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae924e4515bdeac8d572c9ce7afb85394ff4b671dd74a85d17b5d271aff1ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt: android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PreparedProseViewerManager.createViewInstance at line 63. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc4dba92b919adc662da47814f8998ec4a348d88e32afd21d97b5294f7534fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorStyleSheet.swift: ios/EditorStyleSheet.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RenderBridge.collapseStyledSiblingMargins 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorStyleSheet.swift\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":"ios/EditorStyleSheet.swift"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a99099cfed6032edf0feb79b9c4afc0aaf1501e6f75242458080b5eb826a9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/serialize/html_in.rs: rust/editor-core/src/serialize/html_in.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in editor_core::serialize::html_in::extract_node_attrs at line 358. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/serialize/html_in.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/editor-core/src/serialize/html_in.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b232fd66ae18d0befc828ecc6c458d32020fecd51ced462ff1e6fa2dac9a42c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt: android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in EditorTextSurfaceInteraction.performAccessibilityAction at line 610. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt\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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c1dd551d22ec79736ee487fe8925bcf6e5f44021455ce52aa10c24b72b9ffd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt: android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EditorStyleSheetKt.overlaidWith at line 352. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt\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":"android/src/main/java/com/apollohg/editor/EditorStyleSheet.kt"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"461cf74bcfbd4afdd403ec47a7fa0a9888d2c50f36616e6ad689152bdcf59e5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTheme.swift: ios/EditorTheme.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorTheme.init at line 452. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTheme.swift\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":"ios/EditorTheme.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ea960aad9d3a274ab1199f0c42067e8aa21680bd520aa84170995695522a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorEvents.tsx: src/useRichTextEditorEvents.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in useRichTextEditorEvents.useRichTextEditorEvents.handleAtomLayout at line 386. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorEvents.tsx\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/useRichTextEditorEvents.tsx"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24553ece4981c99c26e2ffb50c23c08aaafa82f4a43230db39a818e86220263"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in NativeEditorExpoViewToolbarKt.handleToolbarItemPress at line 210. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt\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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewToolbar.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"542c832d084ddb2b8ba75967f8d9bcf16d06e25a9d414a78c733bb57d47fe7c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/ffi_v2/render.rs: rust/editor-core/src/ffi_v2/render.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in editor_core::ffi_v2::render::serialize_render_element at line 691. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/ffi_v2/render.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/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cca799d79f7a2dc3a655068ace5797ec05368ae662e413a2200a8965992935c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/serialize/html_in/clipboard.rs: rust/editor-core/src/serialize/html_in/clipboard.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in editor_core::serialize::html_in::clipboard::normalize at line 67. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/serialize/html_in/clipboard.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/editor-core/src/serialize/html_in/clipboard.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2c369b4f0186047a40484c7793353a337d791da7cfe5f6b0c2d81d7b22c6c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useEditorToolbarPresentation.tsx: src/useEditorToolbarPresentation.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in useEditorToolbarPresentation.useEditorToolbarPresentation at line 20. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useEditorToolbarPresentation.tsx\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/useEditorToolbarPresentation.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2d383958c1c654ba0cb14e6ac3e8849a6e5cb3a78ccdecc7e0630b2b8b46ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/schemaDefinition.ts: src/schemaDefinition.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in schemaDefinition.defineSchema at line 343. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/schemaDefinition.ts\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/schemaDefinition.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e3d34fd8c44d1aaf8d4b2b71d20b0e979a7b2bf350a150c5abc5b85a471535"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/schema/mod.rs: rust/editor-core/src/schema/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AttrSpec::validate_definition 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/schema/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c11c36afdc58452f9c1ef164607c4be94f8d201977b26a0f759cab35f43a077"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt: android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EditorKeyboardToolbarView.buttonState at line 733. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt\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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"396ee129e814a4f9873166247bb096e93e7cbc7854e6f4d55c98f657be562065"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/RenderBridge\u002BStyle.swift: ios/RenderBridge\u002BStyle.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RenderBridge.paragraphStyleForBlock at line 22. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/RenderBridge\u002BStyle.swift\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":"ios/RenderBridge\u002BStyle.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7f4d271404b7d00924660e6bb4642f54aa65658d616e59c3eefd5e1bb5efc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorCommands.tsx: src/useRichTextEditorCommands.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in useRichTextEditorCommands.useRichTextEditorCommands.runAtomAction at line 176. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorCommands.tsx\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/useRichTextEditorCommands.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a575d6c125b6197eab43e69bac850eb63e5a113f0957ec9a4c259715bc36a2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeToolbar\u002BButtonStyle.swift: ios/NativeToolbar\u002BButtonStyle.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EditorAccessoryToolbarView.buttonState at line 4. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeToolbar\u002BButtonStyle.swift\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":"ios/NativeToolbar\u002BButtonStyle.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a11429a6321fa4890c2f04521b94881288a98b2e85ed2774ae01f3860b80252"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/operations/structure.rs: rust/editor-core/src/yrs_engine/compiler/operations/structure.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in OperationCompiler::compile_structure 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/operations/structure.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/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d828ef8cfbaeabaa06e5e93b3692516354ce165ea01b250d98110a6a1d4f4bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/semantic.rs: rust/editor-core/src/yrs_engine/compiler/semantic.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in editor_core::yrs_engine::compiler::semantic::compile_transaction_impl at line 32. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/semantic.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/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"365f730220e2696efc50c92d79865c9c8676f1ef55c71e10d882b642566eb91a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/schemaResolution.ts: src/schemaResolution.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in schemaResolution.resolveDocumentSchema at line 127. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/schemaResolution.ts\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/schemaResolution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c057435ebc988fe924e2d2d6421acd5cdd2105b251b2685fdc7055fb6b22e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt: android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EditorEditTextRustCommandsKt.insertPlainTextRangeInRust 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ccc0396d23d99f550a320610ca3dd6a4db4ada2123452f20e2a3099e88f03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt: android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in EditorV2RenderValidationKt.validRenderElement 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt\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":"android/src/main/java/com/apollohg/editor/EditorV2RenderValidation.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77e2493a077371b4c8feebe4897dcbeb055ab30006e432420ec6b06dfca806d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/serialize/html_out.rs: rust/editor-core/src/serialize/html_out.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in editor_core::serialize::html_out::serialize_nodes at line 61. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/serialize/html_out.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/editor-core/src/serialize/html_out.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"813417d23d329234742cc42974c3f916a671d3f5cafaa7f2d9515b19155d9f31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt: android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in EditorEditTextUpdatesKt.applyUpdateJSONImpl at line 76. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextUpdates.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aacb9e74a3234b4d5b16ced47e4b2ed6d1636a286925e0b2a2d11068dda8a3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/NativeProseViewer.tsx: src/NativeProseViewer.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NativeProseViewer.RichTextViewer at line 191. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/NativeProseViewer.tsx\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/NativeProseViewer.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"403589f56b9640c4f5bf090235f5fe102367a9ec5480e3b2b7abcbbe97052ce4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/serialize/json_in.rs: rust/editor-core/src/serialize/json_in.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in editor_core::serialize::json_in::parse_node at line 147. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/serialize/json_in.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/editor-core/src/serialize/json_in.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"820a33cae6c94e315db51187a37be5a32ec5b9cf194fa7ca3d32de559f9a1218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/NativeEditorResultNormalization.ts: src/NativeEditorResultNormalization.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in NativeEditorResultNormalization.normalizeNativeEditorV2PeersValue at line 487. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/NativeEditorResultNormalization.ts\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/NativeEditorResultNormalization.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb039dfdc5d0f3eaf54a10e6ece90545eb730300dbfcafc37667c7e9b5b427cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/atoms.ts: src/atoms.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in atoms.defineAtomNode at line 260. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/atoms.ts\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/atoms.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521bdf5987c84023d9099afa178a4c13f74e4d2774f84243bfc132ede39fee2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/schema/construction.rs: rust/editor-core/src/schema/construction.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Schema::try_new_with_budget at line 14. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/schema/construction.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/editor-core/src/schema/construction.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead7da121b60f2458abfecbf9cef756843ff22426923037b025501069a5015c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorUpdates.tsx: src/useRichTextEditorUpdates.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in useRichTextEditorUpdates.useRichTextEditorUpdates at line 25. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorUpdates.tsx\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/useRichTextEditorUpdates.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfeb7128c56c3c97f5578337c635a8b0902fd6a5d60c5dacccb1dac65b642e87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useViewerAtoms.tsx: src/useViewerAtoms.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in useViewerAtoms.parsePositions.positions at line 95. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useViewerAtoms.tsx\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/useViewerAtoms.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb30b1424409f6c6ff90de0aae20b09801ae74ab077f9db5446b02025b042d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/NativeEditorCreateConfig.ts: src/NativeEditorCreateConfig.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in NativeEditorCreateConfig.buildV2CreateRequestUnchecked at line 137. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/NativeEditorCreateConfig.ts\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/NativeEditorCreateConfig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa048d0fac9a448753b75451ab1a06cba82d60e091d62ffbac136cbc09b0d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/render/generate.rs: rust/editor-core/src/render/generate.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in editor_core::render::generate::walk_children 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/render/generate.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/editor-core/src/render/generate.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65610f9876cbc960113732bf9f148e5e6d8a29b10a95ff9d2d53000e4a9835e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt: android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ViewerImagePipeline.updateVisibleRect 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt\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":"android/src/main/java/com/apollohg/editor/viewer/ViewerImagePipeline.kt"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd974878e495bb1ffbf8e4ff494b35ab5935fd6d7f105f8f464f7f868dfe714c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorInteractionOverlays.swift: ios/EditorInteractionOverlays.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RemoteSelectionDecoration.from 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorInteractionOverlays.swift\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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e7be67fa2eb253cb6077edbdb65f0121812047e2bf78054a3b427a9e20a995"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt: android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PreparedProseLayoutRegistry.measure at line 162. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt\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":"android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7002a61fa68a55bafb2cb9530afa37bf991a1fd543b8769b6ca4166221cb885"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/YjsCollaboration.ts: src/YjsCollaboration.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in YjsCollaboration.peersToRemoteSelections 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/YjsCollaboration.ts\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/YjsCollaboration.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa7c03221ec9767d1129ce7d1454d5c35d690491329c4d549b8a13c95043ebf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt: android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorEditTextSelectionKt.applySelectionFromJSON 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c773ecff80a32fd3d7c01815f9a88f910df55aeea60ac6eb1df39dc940b0d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/RichTextEditorSerialization.tsx: src/RichTextEditorSerialization.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RichTextEditorSerialization.parseSelectionFromUpdate 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/RichTextEditorSerialization.tsx\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/RichTextEditorSerialization.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5fb43f301ba0001c6eef369bf3e7bc64b6215d84f45b36f8d03be5d6c705c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/RenderBridge\u002BAttachments.swift: ios/RenderBridge\u002BAttachments.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BlockImageAttachment.attachmentBounds 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/RenderBridge\u002BAttachments.swift\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":"ios/RenderBridge\u002BAttachments.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"95734fc0f98ffb59b5a4436058ca42bd7e19d4859c840026069d4f1823fafecd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/derived_state.rs: rust/editor-core/src/yrs_engine/derived_state.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DerivedStateCache::after_document_change at line 762. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/derived_state.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/editor-core/src/yrs_engine/derived_state.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"43135aa255145d8043379e9045644360b5399b0a4735bf0b15194ebd8efe9738"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/EditorStyleSheetNormalization.ts: src/EditorStyleSheetNormalization.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EditorStyleSheetNormalization.normalizeEditorTheme at line 372. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/EditorStyleSheetNormalization.ts\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/EditorStyleSheetNormalization.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b620ee0df95131af856fd846bacaa7f95bda8d502185d4b3b3151b45fa640abd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/RenderBridge\u002BAtoms.swift: ios/RenderBridge\u002BAtoms.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in RenderBridge.attributesForMarks at line 16. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/RenderBridge\u002BAtoms.swift\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":"ios/RenderBridge\u002BAtoms.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c713a192225cb20c6df0c5ccfce234e27ce98fdc9c9487f86c40d61fdaa8ba70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorV2Adapter\u002BRenderState.swift: ios/EditorV2Adapter\u002BRenderState.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in EditorV2Adapter.adopt at line 69. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorV2Adapter\u002BRenderState.swift\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":"ios/EditorV2Adapter\u002BRenderState.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0f3fad6835ce7fd0c343fafb94cdfb668e706f74d954cc3bc5f5db781b6803"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/PreparedProseLayoutCache.swift: ios/Viewer/PreparedProseLayoutCache.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PreparedProseLayoutCache.value at line 92. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/PreparedProseLayoutCache.swift\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":"ios/Viewer/PreparedProseLayoutCache.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"776237218f9a625838e03694f923026a3bffc1e3f76bb9600e38bf67c88526d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeCollaborationTransportRegistry.swift: ios/NativeCollaborationTransportRegistry.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NativeCollaborationTransportRegistry.enqueue at line 192. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeCollaborationTransportRegistry.swift\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":"ios/NativeCollaborationTransportRegistry.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c0d20ccf0da259fdf065793f37b556591e439f9d130b1ff17fb5e6d7231247"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/engine/selection_commit.rs: rust/editor-core/src/yrs_engine/engine/selection_commit.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in YrsDocumentEngine::apply_empty_skip_transaction 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/engine/selection_commit.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/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003befad5d0da6d5fc00401aa0a1d21089c9c4d1ca73e2f1b951e50dfaf2793"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeEditorExpoView\u002BToolbar.swift: ios/NativeEditorExpoView\u002BToolbar.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NativeEditorExpoView.handleToolbarItemPress at line 51. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeEditorExpoView\u002BToolbar.swift\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":"ios/NativeEditorExpoView\u002BToolbar.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"935cdbd0ac7da07213b4c1e06e8152309ca56b2347010a0e70b8af36df856e63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorV2Adapter\u002BMutation.swift: ios/EditorV2Adapter\u002BMutation.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in EditorV2Adapter.submitNativeIntentRecoveringStaleEpoch at line 106. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorV2Adapter\u002BMutation.swift\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":"ios/EditorV2Adapter\u002BMutation.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94c74c8dac61d3c65659f18cf35a7de6ff66fb358c7f2af52667aaf7a4c7b08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/yrs_compilation.rs: rust/editor-core/src/yrs_engine/compiler/yrs_compilation.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in editor_core::yrs_engine::compiler::yrs_compilation::compile_transaction_with_yrs_impl at line 221. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/yrs_compilation.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/editor-core/src/yrs_engine/compiler/yrs_compilation.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f6f7fcc47cae29bde6ca74c062c5c6bb158f0118ca072af50720317cf78487"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs: rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in MutationCompiler::apply_virtual_structural_splices at line 2. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/list/layout.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/editor-core/src/yrs_engine/mutation/lowering/list/layout.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3c619c65ca03b14efe7e4a2dbc5d083461d5497cc825793fdc502f3207aec3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs: rust/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in MutationCompiler::wrap_in_list at line 3. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/list/wrap.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/editor-core/src/yrs_engine/mutation/lowering/list/wrap.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"520055bc711dbe99ba34c3b4ef1296f2be4e74916d73970f4276839ca4546d54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.rs: rust/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in editor_core::yrs_engine::mutation::lowering::index::localized_format::localized_existing_textblock_targets at line 320. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.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/editor-core/src/yrs_engine/mutation/lowering/index/localized_format.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a765e93030f0d788dcdde8cb0fdf240fa7197bf84a886dd5b7d6a6e66bd02e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt: android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EditorEditTextRenderingKt.applyRenderedSpannable at line 47. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextRendering.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ea0937e53ec3f4ee53012d1c431588fbc9f1091de4a021cc863f85a1379b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BNativeInputLifecycle.swift: ios/EditorTextView\u002BNativeInputLifecycle.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EditorTextView.commitNativeTextMutationIfPossible at line 291. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BNativeInputLifecycle.swift\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":"ios/EditorTextView\u002BNativeInputLifecycle.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"1920669b43951edf9c5acbcb0f221feba52ceede2a1f616ef76061691fa54447"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt: android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EditorEditTextClipboardKt.handlePaste at line 179. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d895652762d5225110425114702db0d972c0967b5312d015649374d0bd555"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Viewer/ViewerImagePipeline.swift: ios/Viewer/ViewerImagePipeline.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ViewerImagePipeline.updateVisibleRect at line 426. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/Viewer/ViewerImagePipeline.swift\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":"ios/Viewer/ViewerImagePipeline.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"476cee78f6fbd57db21813e614f8472bf90a449cf8fa8fee31b4475e4eb9ec0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/commands/format.rs: rust/editor-core/src/yrs_engine/commands/format.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in editor_core::yrs_engine::commands::format::plan at line 110. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/commands/format.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/editor-core/src/yrs_engine/commands/format.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8816d3f89326b6b0eb81dbfdb3ac787cfae04ea6ccd274ee55156af7bbb52312"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NativeEditorExpoViewUpdatesKt.applyEditorResetUpdateOutcome at line 16. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt\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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewUpdates.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e1af7f15b7c6e659d4f7e6815a8d76342f62345f0ef49ee5a86b96988ae792"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BRenderPatch.swift: ios/EditorTextView\u002BRenderPatch.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EditorTextView.applyTopLevelChildMetadataPatch at line 379. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BRenderPatch.swift\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":"ios/EditorTextView\u002BRenderPatch.swift"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd598260543737f93b265afec811ff8e799cb4ba907f72e0132114a6c7f68f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeEditorExpoView\u002BUpdates.swift: ios/NativeEditorExpoView\u002BUpdates.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NativeEditorExpoView.applyEditorUpdateOutcome at line 151. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeEditorExpoView\u002BUpdates.swift\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":"ios/NativeEditorExpoView\u002BUpdates.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd198158a30fd1f8311ea7b2d7d997ab1e0904b962475e2bdd629867f42caea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/useRichTextEditorMentions.tsx: src/useRichTextEditorMentions.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useRichTextEditorMentions.useRichTextEditorMentions.insertMentionSuggestion at line 140. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/useRichTextEditorMentions.tsx\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/useRichTextEditorMentions.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05ae3e2ec0a2447f0fd4889459d9894824746b125e99a144d098cf7074e5b7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/AtomHost.tsx: src/AtomHost.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AtomHost.AtomHost at line 75. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/AtomHost.tsx\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/AtomHost.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d954be3547312bb6022ee0e225f9fa9da9f7be223056632e18a8b6d5c4e95e22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/schema/json.rs: rust/editor-core/src/schema/json.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Schema::from_json_with_limits at line 17. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/schema/json.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/editor-core/src/schema/json.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"572a289d903cf296090b3bcd645a6077444fbc1bfdea4bf8f39e0b75f10e2267"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt: android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in EditorV2AdapterMutationsKt.performNativeIntent at line 57. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt\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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterMutations.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"39741766caec16000caec472745fe5c187c8bdaeaa2cfb8d1e40857594edd3ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorV2Adapter\u002BTextCommands.swift: ios/EditorV2Adapter\u002BTextCommands.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in EditorV2Adapter.commitNativeTextMutation at line 4. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorV2Adapter\u002BTextCommands.swift\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":"ios/EditorV2Adapter\u002BTextCommands.swift"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7db2a923bc3e641adbbc69719590760214ca93509fe6141622481af72454d72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt: android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NativeEditorExpoViewPendingUpdatesKt.applyPendingEditorUpdateIfNeededImpl at line 199. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt\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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewPendingUpdates.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f898f6b6207ad9eeaba2c1b88ce67e6d1d979e3163c69cb1a9cb0748de5a965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt: android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NativeToolbarItem.parseItem at line 127. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt\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":"android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2741a1b4d81327126845bc45ac83c9bc53542c1391a0cc44655eeb4248c52f72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/selection.rs: rust/editor-core/src/yrs_engine/compiler/selection.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in editor_core::yrs_engine::compiler::selection::selection_plan at line 224. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/selection.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/editor-core/src/yrs_engine/compiler/selection.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd82417fb94366d2d21ccfd631c3aa980c37341f8ff749b4316def83e2c38f60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/operations.rs: rust/editor-core/src/yrs_engine/compiler/operations.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in OperationCompiler::compile at line 71. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/operations.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/editor-core/src/yrs_engine/compiler/operations.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb6ef4ec8bb0821d840c66726df4ff0726437e13f682064f19f2cbfbe95ea82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/clipboard.rs: rust/editor-core/src/clipboard.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in editor_core::clipboard::replacement at line 379. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/clipboard.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/editor-core/src/clipboard.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae95571e0f53526e8e08656193976ff48c91ecee7c8ebbaa7a478d83a151a1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/block/split.rs: rust/editor-core/src/yrs_engine/mutation/lowering/block/split.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MutationCompiler::split_block 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/block/split.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/editor-core/src/yrs_engine/mutation/lowering/block/split.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f772afc5265529fa3ee50eb0f4ff1ff392451e371537f054e871d5544367a48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/operations/marks.rs: rust/editor-core/src/yrs_engine/compiler/operations/marks.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in OperationCompiler::compile_marks at line 20. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/operations/marks.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/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0a3e17d1538098d00fab350357fd5d5af0022c733a2eadb4cdcf48d76bfc90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/text.rs: rust/editor-core/src/yrs_engine/mutation/lowering/text.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MutationCompiler::replace_structural_range at line 677. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/text.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/editor-core/src/yrs_engine/mutation/lowering/text.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085657fe82a9e901d29bb9ae426fa9ab27769f7b0fa2b9c3ebdbb974aef62e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/attributeValidation.ts: src/attributeValidation.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in attributeValidation.validateAttributeSpec 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- src/attributeValidation.ts\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/attributeValidation.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"565fc82315b4db553521ef5a09c7dc339468a92ac4ee83b4e20fc77b1de47d2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/compiler/operations/text.rs: rust/editor-core/src/yrs_engine/compiler/operations/text.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OperationCompiler::compile_text at line 21. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/compiler/operations/text.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/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31fc4843b2a42920b6985ff05c81e25105a297d5ead1de60ce991bcd9f310ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs: rust/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in MutationCompiler::delete_structural_range at line 2. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.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/editor-core/src/yrs_engine/mutation/lowering/index/structural_delete.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a1c5739cd7373c6b2ad115b3812dcccf8610bbea549fa2a09a342fc726e5bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt: android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in EditorTableCellProjection.project at line 29. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt\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":"android/src/main/java/com/apollohg/editor/tables/EditorTableCellProjection.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"88912a1375f6c6f37643353bee61ad4bfbe95acb658adb3c85d479820dd2b870"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust/editor-core/src/yrs_engine/commands/clipboard.rs: rust/editor-core/src/yrs_engine/commands/clipboard.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in editor_core::yrs_engine::commands::clipboard::plan_at_selection at line 264. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/yrs_engine/commands/clipboard.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/editor-core/src/yrs_engine/commands/clipboard.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fbf216084425a6242ddceb678767ec74ba9a37eb9e1731b8005cc123d25144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/NativeEditorExpoView\u002BBinding.swift: ios/NativeEditorExpoView\u002BBinding.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NativeEditorExpoView.setEditorId at line 34. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/NativeEditorExpoView\u002BBinding.swift\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":"ios/NativeEditorExpoView\u002BBinding.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e5fa45821e0cdce962075f451b1a3c99f3fe290d8eadc1054d3fd9dd579610"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt: android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorV2AdapterRenderingKt.adopt at line 67. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt\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":"android/src/main/java/com/apollohg/editor/EditorV2AdapterRendering.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b14ffc7215eef4c4a3249d50d340fe86d2e9cf0cab390c8a27fc855b5d7e26a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BKeyboardInput.swift: ios/EditorTextView\u002BKeyboardInput.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorClipboardPaste.command at line 137. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BKeyboardInput.swift\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":"ios/EditorTextView\u002BKeyboardInput.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fef1c5442684d969915c4df824448850724161795e254d97bc4e6da18403e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt: android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EditorInputSurroundingDeletionKt.performPlainSurroundingDelete 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt\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":"android/src/main/java/com/apollohg/editor/EditorInputSurroundingDeletion.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c857c15ce8e0d899708fe33cab6ff7bdc5a1c9b406234cdcde38c023241f6a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorTextView\u002BAttributedPatch.swift: ios/EditorTextView\u002BAttributedPatch.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EditorTextView.trimmedAttributedPatch at line 238. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BAttributedPatch.swift\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":"ios/EditorTextView\u002BAttributedPatch.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fab039fd2a5d13cf6b64eb055141c92b5553e325ef320510cb9e9821a2a738b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt: android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EditorEditTextDeletionKt.handleBackspaceImpl at line 85. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt\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":"android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d657a38588bbbceceb3c6ea84ba427c2d821fcaa0bc58319974ad0937ef53f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/EditorCodeHighlighting.swift: ios/EditorCodeHighlighting.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EditorTextView.scheduleCodeHighlighting at line 140. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorCodeHighlighting.swift\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":"ios/EditorCodeHighlighting.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d24193c4f65f5ba6833f9c84122e5bc6e009a0aacea7c98339ca562b0ad6fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt: android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt changed 27 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is NativeEditorExpoView.onEditorUpdate at line 631), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(clipboard): complete rich copy and paste with configurable modes\u201D; \u201Cfix(editor): make resets authoritative over pending native input\u201D; \u201Cfix(android): stretch custom atoms with editor content\u201D; \u201Cfix(atoms): harden editing and render synchronization\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt\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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoView.kt"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f777927b90cd56b65d3339b651e3bbdae0ab3461337e4d9c01e48f0838c6fca3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/RenderBridge.kt: android/src/main/java/com/apollohg/editor/RenderBridge.kt changed 21 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is RenderBridge.buildSpannableFromBlocks at line 123), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(android): render collaboration cursors inside table cells\u201D; \u201Cfix(atoms): align component mounting and update behavior\u201D; \u201Cfix(native): stabilize caret and image interactions\u201D; \u201Cfix(atoms): preserve spacing and caret behavior\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/RenderBridge.kt\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":"android/src/main/java/com/apollohg/editor/RenderBridge.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f6da838283a562ef5537510c6f6b6f45fdfeed3276ef9cc4d4ea43d6405f81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt: android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is EditorV2Adapter.adoptExternalReset at line 344), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(lists): convert list types and align iOS bullets\u201D; \u201Cfix(clipboard): complete rich copy and paste with configurable modes\u201D; \u201Cfix(android): correct editor input and gesture regressions\u201D; \u201Cfix(editor): make resets authoritative over pending native input\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt\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":"android/src/main/java/com/apollohg/editor/EditorV2Adapter.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c15b49c9d3ffeac814b2a0a6a38445b770fee063d8ed2d80db072e50bc99f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/editor-core/src/command_planner.rs: rust/editor-core/src/command_planner.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is SemanticOperation::as_step at line 130), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(atoms): preserve spacing and caret behavior\u201D; \u201Cfix(atoms): harden editing and render synchronization\u201D; \u201Cfix(editor): support terminal atom editing and drag moves\u201D; \u201Cfix(atoms): stabilize Android layout and deletion\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/command_planner.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/editor-core/src/command_planner.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0957566dc6cecea967fa71d65ddf971ac9760fc12b5fac5c3978e83289b8c89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ios/EditorV2Shadow.swift: ios/EditorV2Shadow.swift changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is EditorV2Shadow.currentScalarSelection at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tables): preserve task checkbox interaction and layout\u201D; \u201Cfix(lists): convert list types and align iOS bullets\u201D; \u201Cfix(clipboard): complete rich copy and paste with configurable modes\u201D; \u201Cfix(ios): preserve image scrolling and node selection\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorV2Shadow.swift\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":"ios/EditorV2Shadow.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2e7ad4a16a6ad893190d264e27f1c72c26ed8a872cd76008f82c594f9fabfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt: android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is EditorDocumentLayout.getSelectionPath at line 595), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ci): repair benchmark contracts and Android validation\u201D; \u201Cfix(android): match native caret and selection handle behavior\u201D; \u201Cfix(editor): correct mobile caret, list editing, and task checkboxes\u201D; \u201Cfix(layout): collapse sibling margins and trim quote spacing\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt\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":"android/src/main/java/com/apollohg/editor/EditorDocumentLayout.kt"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26ae90529eda529d675c786e3268a1261e8a896e26af5657cf4c067746a0337"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ios/EditorTextView\u002BImages.swift: ios/EditorTextView\u002BImages.swift changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is EditorTextView.selectedImageSelectionState at line 260), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tables): preserve task checkbox interaction and layout\u201D; \u201Cfix(editor): reflow content during image resizing\u201D; \u201Cfix(ios): stabilize caret, checkbox, and keyboard interactions\u201D; \u201Cfix(ios): preserve image scrolling and node selection\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- ios/EditorTextView\u002BImages.swift\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":"ios/EditorTextView\u002BImages.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7909fdf5b46d10e482386ceddd45af4813cedb8fd05217a763c8d3ab1af6dd75"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/editor-core/src/command_planner/backspace.rs: rust/editor-core/src/command_planner/backspace.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is editor_core::command_planner::backspace::lift_trailing_empty_list_block at line 367), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(editor): continue backspacing paragraphs after lists\u201D; \u201Cfix(editor): unwrap list items after nested lists on backspace\u201D; \u201Cfix(editor): correct mobile caret, list editing, and task checkboxes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/command_planner/backspace.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/editor-core/src/command_planner/backspace.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62115e7d4deef33f4d6fcae083d5e8d0f5cb87e8e37f15f72413f1b4399ea25"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt: android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ImageResizeOverlayView.resizedRect at line 293), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(editor): reflow content during image resizing\u201D; \u201Cfix(native): stabilize caret and image interactions\u201D; \u201Cfix(android): stabilize caret and resize geometry\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt\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":"android/src/main/java/com/apollohg/editor/ImageResizeOverlayView.kt"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c7c8fca9ab42357ead5c5f3732e869a9e6d8bab8bd6475ccb1931a877a53fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/SharedNativeImagePipeline.kt: android/src/main/java/com/apollohg/editor/SharedNativeImagePipeline.kt changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ImageLoadingPolicy.fromJson at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(images): support native SVG rendering and imported image content\u201D; \u201Cfix(android): constrain approximate image decodes\u201D; \u201Cfix(android): bound decoded image ownership\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/SharedNativeImagePipeline.kt\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":"android/src/main/java/com/apollohg/editor/SharedNativeImagePipeline.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b743d98ce82f2c11a8472d63d7389ce444ccbcfbc533aef58043dcccadbb38b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt: android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is AndroidCollaborationTransport.driveOutboundIfPossible at line 500), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(android): finalize collaboration protocol boundaries\u201D; \u201Cfix(android): preserve collaboration across host lifecycle\u201D; \u201Cfix(android): close the collaboration socket with a going-away handshake\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt\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":"android/src/main/java/com/apollohg/editor/AndroidCollaborationTransport.kt"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d711119120e92282960224777a13cdc0e24b31f36c996991794c31ff1db5f67"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust/editor-core/src/test_support/yrs_engine_typing_regression_test/structural_typing.rs: rust/editor-core/src/test_support/yrs_engine_typing_regression_test/structural_typing.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is editor_core::test_support::yrs_engine_typing_regression_test::structural_typing::apply_bullet_list at line 1), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(editor): continue backspacing paragraphs after lists\u201D; \u201Cfix(editor): unwrap list items after nested lists on backspace\u201D; \u201Cfix(editor): correct mobile caret, list editing, and task checkboxes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 11:43:05 \u002B11:00\u0027 --until=\u00272026-11-01 11:43:05 \u002B11:00\u0027 --full-history --no-merges -- rust/editor-core/src/test_support/yrs_engine_typing_regression_test/structural_typing.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/editor-core/src/test_support/yrs_engine_typing_regression_test/structural_typing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a2af2389f9afa9a468d97c3b4ef281f67629ada78891e07e73721626ade7fa"}},{"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/editor-core/Cargo.toml\u0060 makes this repository a deployable product (line 42)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/Cargo.toml"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a792b12d67e1514c3e24ae0e4b01071dae88581e86b57e7b711c46dc63c358"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060rust/editor-core\u0060 (183804 LoC, 391 module-visible types across 71 directories) overshoots its size bounds. 3 of 7 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 1.4/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa2f3d92da36d361836d3a40d11b8615e61fef83c3bbded8f4c79f275f8b055"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (65990 LoC, 1338 module-visible types across 23 directories) overshoots its size bounds. 3 of 7 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 1.4/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d5244dbb9040f0ef9a41721fc246c38399605a5b233c47266a2093207fec1"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060android\u0060 (54527 LoC, 845 module-visible types across 5 directories) overshoots its size bounds. 3 of 7 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 1.4/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/build.gradle"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e8fb04f56ccee43719bf997e8dd37e440efe82c6427a2fc5e34c819d86bde5"}},{"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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"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":"de24fb5b2f9808dee7349e0f8b4bf4e8fc0b77a05b8578184e5f23b813b48863"},"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":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"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":"4ffcc1b724469248fcd864b1901b4fb0cedf5b911fb5d6075b57cf61232c29e8"},"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":"8c072cdfa4919a186094e4c61b35105c5d11db195171982dbe24ea845c729dc4"},"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":"6bc3b539f953f180f304780b633bbb65e6d2911ce57503f2f0e4a05dfd504060"},"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":"04cc6ef8b2713c5ae671a21c5adfc62ed3d32eec231bd27236ea49e066082d50"},"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":"c6fd0a81fb540f1df6e35e2920bc4e553d418bb32dc0b65b54f04b330d56cc8d"},"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":"9cf3fa0564336673aa64ac709fbf96b5687fd19178dae7e3bb67e37e5ec7645e"},"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":"53041d0452eb7a0f6d7363cca46cccfc47fe77904a465fee573e39f7c59d9395"},"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":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"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":"28fb95c74cf7e51a3f6e58d6d5d9aaba698bdc10ef21fbd45c72dc90736c26c6"},"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":"56d9371fb2efaf7518ba7ca36b309fcf19a4dd77b8fedb20a641b6ff91c06d3c"},"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":"baa151beff35ac46ee2536907cc918a207da07c42b004fec4c9aab8d58a6df6d"},"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":"989769c4edd7bfee3893414c1aa2ffcfb9f43e2bad5109a15100a33eda530c04"},"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":"5788d20ce12ca132fcc1598a32d6fb8d11208c5d6822cc24369684af7ef56595"},"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":"447668b7fcf03d704b8571741044da65bab0660f9836cac3718569a1697863da"},"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":"6e8a627e7020ac8119c8ec6c60ce9a9f6a161d947c9dd66552a2bad9e055ffb9"},"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":"a5ff6c36cc77c52281fa395ac6b9e1e18754b22fb93caffb8d30a7715d1e22e8"},"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":"8848ecb9b4899118cc8b8341841112d876be29e865cc3e14990aec7e928c6bbf"},"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":"77e2e71a4329e551cbe8be7023c7191820e375353d80fbebb52a3572f6943665"},"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":"1f15a7668953be1267a0466e5f75ea18ae87454d4723060bc975b20394f05eb2"},"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":"a1564299cd78d38ef9a18e75a02e72f87591f6d2601b53bbdfcbdec379e0f56a"},"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":"f57d1d312afdbea5e586f5c4277469ac5784f32d5ade2a108c78d246b6a0be52"},"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":"1375048b9ca8ef192c23faf83af425d2e99a11eb2f6e7951f3d837d8c63c990e"},"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":"3ee1818d8255f485c4fe9f8eec7ec14865c030222317516add1ea3f2587ac448"},"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":"417c80d37e40c8c101c97e32ba9af1a95439f85918a11b7f2f630d08f638a53d"},"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":"9e072dc6d84ffad87656d34a2365a3ed6335eb1709aad4abe6ae27fbd5f57ba7"},"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":"3ff86e3843a47784b8357011e8e9386681e1e9bd2ce4cdb20c35698435836091"},"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":"ef0f73559f0bf802baa495ada3d949df21e2d98cd76bb6297f8f8984c65c2c33"},"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":"60eb9a2698e9fcbd2b2db2554941f136e01f8b783e29fbd0b3ee991a1613375f"},"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":"dba947422e5342f3ec1c8c79cd0d382f193ca875a3cf3b831fb3cd646cf4c808"},"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":"fc16fdf0e4ca3c006dcf9b77d9a081a8b34a38c11900be60f6df82ee11d0b584"},"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":"158220d202c678f8c32f7a174e777ad0de2f56ad0d96c887de9fcdfbdf4fd5ad"},"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":"33394ee39f39770f7a430febd0131f24983c2f80ad8e34937c28618fa87f07ec"},"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":"f19fc865c57216518582aaae5939801ded8e425f8e1c3772a07b58b8f7b10068"},"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":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"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":"77847d4d9e715398297c158f302f573115261fa4ec2a7243fa64534887cf387b"},"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":"1d29731245b8fefd4bb09880f288ae64fd44bfb38979e8d2c5d18df2a4a375f2"},"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":"b2dfa463d44b04b40df622bc3bd03588b62a1f391af760009fa92ea000c303dc"},"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":"ba53e35d8c4fe6daa1edad36f50a3d60ddac91682fb010b9b8c1e51c01896d89"},"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":"e6adf4dccb1becab817c0793d69ff3b5fda73d36bc199d1d5cbd553ae09933a9"},"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":"43d099e74c51b795dae41d617cbafe829c6b6d0c214e842cc8bb794b942afb0f"},"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":"be1832d8825d4985d15aedf72fee94be12ceff17b9c3d99b98e54c7a391e7b66"},"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":"4f54ebe8227db81079b909f45c06e84d0d9f717137f4498b6eed157c1927b13c"},"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":"801e60aed41b1830aa35670f62ac1a60a301a9b98f6d9a13478d3be3430260a0"},"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":"4d34ff32cbcea7e40ec70f2e90aa46f6270b0f2db494e5affd3d8eaf33bb7035"},"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":"a9c90ddd58b0c44dc79fe75225867537ffd20997ebcd45b207923190aede7588"},"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":"a143feda08aaab40a2a736cf877db71424d6a8d09936d0316a393f7744b1d05a"},"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":"73fcb0b29eb802b4ea339bae66780415b76ab4acdacaa9dc3c466fefdda0a861"},"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":"6deff68edcc60e368cc0382dcef7bf5dd7b9e2e9573626a3fbc3cff6baa9aff6"},"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":"587475df71c06d253cdb434b7d0e1681a333a36d3dba21ed9b254a4338f917bb"},"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":"ad55762915a00c022bdfbb7d4950713e12d7b3aa2fe4fab64d39f9cc75d81953"},"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":"d1c8099c7ef2013a8812c98ac636dd763212ae1bc0df3979fbca3aa1fa922dcd"},"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":"51f7851ac16d4219175c3d3d55f021d82a771b98d09d599daac772eccc895dab"},"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":"19af336b4d4f39feec8ef85d03d6ff6d96647f91b4390d1035970f420e5ac273"},"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":"21292659969e62ffb8d004c5461a090ca9c36735adf7942a44c09a324b41241d"},"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":"c401d2c9c1dfb390b775ad31257d82eb5e26d73bc29c01161ad948422286c386"},"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":"d645811b744a88b1b26983664efd79d1fdd7d3ae93bfb4ac2dbf34b5c0976793"},"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":"e02b27f7a99dac30cad69f5b5569872dd6d912f953f0308cefa6de358636add4"},"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":"55aba414e4213b549500b21e788ad39b6a74a263279538c7821228a26d4996d6"},"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":"abd8659d560770ef61d289df9ac8fc6ba7238b15d4175c5c2d4e1abdc40a0a72"},"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":"baf02f90c74e2025a4d5f8ade90ca7c4d07e8808b67f36192422f8dd433f25d6"},"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":"102d1680f0ae32022b2e3694ddb884c7bcf7a2595a52c8e5061f733bf898c848"},"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":"b64066cf71c8181cea42098e1cac943617a6de39933b9f1a10fd2dbcac3628a6"},"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":"a1ddbcb204e5daf0a7ba04acaec2bfe75940e998f292054a3d9e21cb49fcf92c"},"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":"8ececea9194ff6914917bbe2b775fa5a06da42245c38ffdc47544440def01db2"},"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":"41befbcca6f210912cff077c9fa5243dc2baedeccde8e9e047ca1861c598f2f5"},"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":"641058376f21f968d032526c6427997024a65703d74ba5a29d7668fac6a094cb"},"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":"caca13955f2c5f6bf0cada6310b8a7f9eec646fdcb648459f1a4404857bdb291"},"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":"5da167d2bddacff4149d9ccbe305a41a91418342e1e63a6a7866367fbd566c8a"},"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":"6d5ef0e5918798ffa6a9dab98c02c5563eeade2a5d2c899bf954f4ce054f0710"},"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":"61dd7b90c9a7bd4a7dbffb813f603188374fb91bb3b274e85d82862255632691"},"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":"46e8865ea605f5152a9d64a4e650d50f47664bfa88b013def3864f99f8d43b99"},"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":"74bae2993beaf0ef37cb175bfd628f364330c78d55d398735d556b2d6526f5f8"},"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":"352b561df5a9988cf604bc12aaaf1e232f5a11820a29a2114024ef58a3f9ba6d"},"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":"ae3493607e19438143066a0af33e32aca0afed5702adfdf9f6874bfee2c78553"},"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":"89841154563227dc5f714036f2b251f46f582b99bfffcc4ad6e5b8edbba43a17"},"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":"c2c56d83d0aa1087194e5c2dfeb681534f530be263d1ca1076c1ebd57792149b"},"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":"c07843935c68afa80aee1e059759bee8d532d3f466415a183e07f54a4cc66964"},"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":"b344bc80814ee694c81a5fc58fe2f29f89f29dcc03b052d9531c1f608636ec86"},"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":"9fca5a7d6170fc8f1ddc17650e3ced883c862242c1f64bbf09528374c94f17bf"},"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":"262c6f64be2ba740768effffc262caff80f0ef15aa70502ac90b594f75110d74"},"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":"bd1c370ffcb2352832f7ee50ebd5fc1c689a90cb497baa7319a208db7c76eec2"},"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":"6229cf537335c1a2d85e357f8939cec97b8336742965bce3cbfc9366b69cb64d"},"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":"90d943d22dd3e6220dbb359fceaeb6f9b67e88ac0009b6c59de838599ca0768b"},"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":"4a91abc651b6c73f42f93e1c6bae3d77782e1988d561821fa137194e0b2a0424"},"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":"586a61ac69a75644266dffb81013412fd4a6b877e6e79a51900f79f863aaf266"},"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":"8b2e750035d54709f4701b9aaab2aa0ed6484a21b114b6e08c8f2e42c50699fb"},"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":"15992d72488d980744a0ee2c90bf93f12671318f7ebc96f74aa49b8d8d0dc7fb"},"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":"2ff8c37852d9b6faec1358de787f8f8e22a704fd9f99ea61b621114d8cc3e5ec"},"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":"9ea2ac96a4d0c41818fd0a5b71c3c35a247484df216b3831a42241e0d15f6ded"},"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":"a0c4f899062798d38a93d3883c8ff6176ccd5126d9aab2af9e4c35f7f280921f"},"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":"3cc8d9f3b26807461498442606752f39012cdab8f51a0b2844d02ea625376047"},"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":"8f26eceef0fc95eb1a6393f2aac97f0cb5a85fa783d3540d198c3c3fe5988c89"},"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":"8de5ef5aa1561a773be97426e1b268044b967820eb824c926ace0184106f6720"},"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":"723f6ceba8aceab9115f201f552f42dc3dbc8a0e0d609e634a034cbb8c67b0d5"},"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":"84d386e58ce18b57ba02e6122d7f17b62383663e42c0aa96d976d1cabaefb844"},"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":"4650952f4f937c847638301b4ed31749640d16d88c9b0f043af40de26d561e50"},"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":"97114b38f7717ef060c6761e74fcbcb0694933d535b450c2168c85431677072e"},"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":"cd231e0213e0437c85ed8d3512be0092c811ce4541cf647b2230130739533ccc"},"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":"fb6240bd126d564ef84d20fb46e789ef075aad163ce58bc0abf8ed926f30070f"},"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":"67102ed63f3cf29a946c0fd9e63092834e26ea6fb691bca862aa74703a3e88ef"},"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":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0344d9a66464f8dc0490269224ed7c1be10c52c10222e4e75633f31a9a44dd1c"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76675bdc0c93363dd11722ca5974d6563a26a60b809e532294903c358ffb6da3"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d5a5c3b007094febe9b2aeada3017de0bd7d4e8effe0178feebe5c9d3ab6982"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b9561e298af2e3d337e60c3ca165cf90720e2192f98b742cf9757b63e6ca153"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"64fae131778119e87eca2edc9738c0a802edb68408efd7ea99a03051745be73d"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43ddd2cf89d68f61eadc84e7e03957082ca55fef97eacaaa38e5cc44f5640647"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"10c54250023935f9ecf56f947eadc6d951ea0bfe5f962a094430cbf8029b453e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8b94f5864572b92c622272f69f42132893abe79ca7bd86925e475493a8070db"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.8.4","relation":"transitive","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":"7d9312d138ba7e43d7979bbaeb0fad465084e7e0f1d1004a8f6dbdc6ba93c958"},"properties":{"dependency":{"package":"shell-quote","version":"1.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"critical","fixedVersion":"1.11.0","relation":"transitive","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":"8363acc8af13d2dbef89aa69ae973d79edc90b2c4c58e19d3b442106ab1bf782"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"c2f576dfcbda625ca129c4354da4151b169497a44462e0caf447cd9186a1546a"},"properties":{"dependency":{"package":"node-forge","version":"1.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.4.1","relation":"transitive","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":"c411994aa68810b0305b139748ff31f4993fe6ec4597c899adb274253a4137ad"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"5a84d2f87cb7fe71f186b97571b1aea38c5cb3418c7f7e4f4765866bfe096d76"},"properties":{"dependency":{"package":"ws","version":"7.5.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"7.5.11","relation":"transitive","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":"d383cbf625b2105eb2737a4cc2013b736aee5fe8bb13330b22dd93da577681fa"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","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":"5663b5d3983a9f6f7744b9af8d10ede9d273d65b8a859266b06bf516fc0e4e27"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"transitive","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":"4a21438245d407370ca8b4ebe4d904d00f4e18d6680d84d0759b89d12dea0df0"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.3.2","relation":"transitive","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":"56d7c0542bcbbd8d8c61f07327aa2080292f8d213e8f982f1a0933ffecde0a9c"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.1.16","relation":"transitive","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":"9299c8bec39d44a6490c6c739e9035d3c6f3392f33ae12e1a08c160f49420d43"},"properties":{"dependency":{"package":"compression","version":"1.8.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.8.2","relation":"transitive","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":"25ecfc0e65e47aece2eca1ee4cd676e6a293d8113904d8901928f1bc32daa5e1"},"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]"],"severity":"high","fixedVersion":"3.15.2","relation":"transitive","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":"d83e3a34f05bf58ce5d7f0ffd2f01b3fa9f9c90ba4ee16d5aebdb39f11031323"},"properties":{"dependency":{"package":"node-forge","version":"1.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"1.4.1","relation":"transitive","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":"a143e49def50f6267786be10dea52190e0d09245364207bf6c8be5fcae3b49ff"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"87acedc051cb89a8ce4b5f36de7264e8d1c5c5fd3ed662cda178e80e0c31f9d8"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","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":"e4cfb6798f85650e6a2b96aa0bde73ba64ca3d5635fdbfd351d4b900506dbf35"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","severity":"medium","relation":"transitive","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":"7d5bf2f4dbaf7320b76f0f33992ba4f0c10de83a61f126a2093b1045a3cecffd"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"transitive","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":"887ea3a1ff3153a9cfdb47ab26d66c802ac6ac0061444b9e5f7cd3bc4a22059c"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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":"566890a7c40751bc837457d29e8484c42723d2861a715031795555ad39af4023"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","relation":"transitive","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":"00352edb998d500cd9087b982d72391439d7501392fb87a265e8e3762b436935"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","severity":"medium","relation":"transitive","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":"1d3146dba65db0f9b874d5cf00073a63e4e0c685741a86171ce5a3732874a22e"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","severity":"medium","fixedVersion":"5.4.2","relation":"transitive","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":"43eb89ddfb98ca48fc6c3f34f596f12e00153149a238739a1ba956c55e0e015f"},"properties":{"dependency":{"package":"fxhash","version":"0.2.1","advisory":"RUSTSEC-2025-0057","severity":"medium","relation":"transitive","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":"dc1aacd036cfbee17b7bab645e774292429c88f99b4283167487287bd0f70596"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.4","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"severity":"medium","fixedVersion":"0.13.5","relation":"direct","declaredRange":"0.13.4","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":"734fba9d0608d6b88ff58292d7be0765ac0bea8bb105f7ef907d022218a8edba"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.8.6","relation":"transitive","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":"b52297a2bb05fda250de312d6478431f368b8bf1027a918dfe3367349a0c182e"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","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":"f1a4967412eede86351348e685c94d573304c4fd7999633d6f5e7e02251350ee"},"properties":{"dependency":{"package":"smallstr","version":"0.3.1","advisory":"RUSTSEC-2026-0215","severity":"medium","relation":"transitive","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":"185c0b2cb435cbd464bbefe2ec79822bc7b3eace5f72a673ac6489202d1acad8"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"37e0ad87aa4a2b5b53c0cb1aa019b7a0985f8046be44cecca939df85173e66a5"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"1c60465e252e12f3b5f2684db83f8c7e1ed2a94b325dcdd9a9ae217e5fbaf557"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"0d31e20f9e95216b43571d5e21960883aa290336bd35e47efa9b0ab97a56ff7b"},"properties":{"dependency":{"package":"uuid","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","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":"b57bd94a9054ab1a78280337953ab23bcb5d2500ea7f4b4abe8dc82a1ef1d633"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","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":"254e159535de5a467ea5671a4a81fbc3bf399623b11dcd1fc4071f2230ac5cd0"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"14.0.2","relation":"transitive","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":"c93c9e9a7508d1bb1d419bfe67a538fbd81572ddc053c684d546cff31ca78570"},"properties":{"dependency":{"package":"uuid","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"severity":"medium","fixedVersion":"11.1.1","relation":"transitive","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":"fb45f73a31ec5b7dfadd7e26f395be98af8be00aa0b04ed42c943ff1c1f7c42a"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","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":"2d7c8846e5c2786ac6f200262a5ae377f0a0f36f03fcc336f877638db9b57f15"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","reachability":{"kind":"test-or-tooling","file":"scripts/tests/android-rn076-consumer/package.json"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: NativeRichTextEditor.tsx \u2192 EditorToolbar.tsx, NativeProseViewer.tsx, useNativeEditor.ts: \u0060src/NativeRichTextEditor.tsx\u0060 changes together with 3 other files \u2014 \u0060src/EditorToolbar.tsx\u0060, \u0060src/NativeProseViewer.tsx\u0060, \u0060src/useNativeEditor.ts\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":"src/NativeRichTextEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"631caa65998516a814408872da910501e2a220343a74c3e3e01d5e04197de24b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: editor.rs \u2194 NativeEditorBridge.ts: \u0060rust/editor-core/src/ffi_v2/editor.rs\u0060 and \u0060src/NativeEditorBridge.ts\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 9 shared commits counted here, the most recent 3 are \u0060ae762158\u0060 feat(core): place initial caret from document handle initialization (\u2026; \u006015c1fa63\u0060 feat(snapshot): enable scoped local HTML snapshots; \u00600316cf38\u0060 fix(collab): apply native updates incrementally \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fb77d89b0cc6c60ed422d7bc7c6615c4435f8e2e33653e5d8f1463ee599223"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tests.rs \u2194 NativeEditorBridge.ts: \u0060rust/editor-core/src/ffi_v2/tests.rs\u0060 and \u0060src/NativeEditorBridge.ts\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 6 shared commits counted here, the most recent 3 are \u00609dca5ad7\u0060 fix: harden Task 4 deep document lifecycle; \u006083723f67\u0060 fix: make deep create parsing and handles authentic; \u0060cfdb9475\u0060 fix: close remaining create boundary gaps \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5c3655980ce75bbb2c734fb92b399416b1a01181190ebfe65de2463a8a592d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: CoreTextProseLayoutEngine.swift \u2194 PreparedProseDrawingView.swift: \u0060ios/Viewer/CoreTextProseLayoutEngine.swift\u0060 and \u0060ios/Viewer/PreparedProseDrawingView.swift\u0060 change together 52% of the time (12 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u006061b42731\u0060 fix(layout): collapse sibling margins and trim quote spacing; \u006062435277\u0060 feat(viewer): render custom React atom components; \u0060109b85e6\u0060 fix(ios): localize viewer accessibility geometry \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/CoreTextProseLayoutEngine.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a001e97b10363162d6606bc44eff101fe548700934bc1ff17131988df2ea7809"}},{"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":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","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":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaPresets.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f173af4bfb98a354934d19176626fab5e74e50597cb3cce478b6f159636179e"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"RUST-STANDARD-LIBRARY-NOTICES.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80b02aa84c99c1c8f3b2bcc4ba3bc41ed7c4503eac9be042282f3759a918341"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"RUST-STANDARD-LIBRARY-NOTICES.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"65715a9361a09c0c1279d37d41b2c318b1ec45f54a3e94801aa2042365259c68"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/code-highlighting/RUST-STANDARD-LIBRARY-NOTICES.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b007003d7c5d3697d376bd470f8096599c381ea3c35045d107904aba8c5e6d2e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/code-highlighting/RUST-STANDARD-LIBRARY-NOTICES.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a332337e907a4b607b772b9f39ece44da5037651177e1345295a463382d2db"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaPresets.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00b5afae055d7a99c9b066b035f0359d1270ac18a292c373dbe423db6b92862"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking wait inside a handler: NativeCollaborationTransport.onQueueSync: \u0060NativeCollaborationTransport.onQueueSync\u0060 is an event/message handler that blocks on a synchronous wait (a semaphore/queue \u0060.wait\u0060/\u0060.sync\u0060) \u2014 it stalls the handler on a peer or resource and serialises throughput, and can deadlock under load. Await the work asynchronously (\u0060async\u0060/\u0060await\u0060) instead of blocking the handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/NativeCollaborationTransport.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f2401077573a4df84ac1e7ffdf827810486763d81eb7cdbf04cdf58a96c27"}},{"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":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060packages/code-highlighting/rust\u0060, \u0060rust/editor-core\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"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 2 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/ci.yml"},"region":{"startLine":19}}}],"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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b237f7efe841e3a95b381b232502a3a473094adeb069a11eaca8ca533fb1c34"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060startPeer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/controller.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53a0ae06cad72b651d8d279d42359c06790f4e94a329763c4de9193d6c7b68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): scripts/table-interop/continuity-evidence.ts:164 \u00B7 scripts/table-interop/supplementary-evidence.ts:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 283 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":"scripts/table-interop/continuity-evidence.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d933d7787d7283407c43c2826f7603a9546fc3d107dc2725e7037fcfd100e4d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): src/NativeEditorDocumentBridge.ts:343 \u00B7 src/NativeEditorDocumentBridge.ts:392 \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":"src/NativeEditorDocumentBridge.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a680dabb52e2cd644b43dea9773722e314717fc5926754dc7f20cf098d3206"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): scripts/table-interop/checkpoint-io.ts:193 \u00B7 scripts/table-interop/checkpoint-io.ts:226 \u2014 the two spans are one implementation copied and then locally edited \u2014 134 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":"scripts/table-interop/checkpoint-io.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c3d68fedf13aa844a2ea74b60493cd964652ded57e2ffb5d530b4629654f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): scripts/ktlint.mjs:37 \u00B7 scripts/swiftlint.mjs:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 165 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":"scripts/ktlint.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ac9372f86857138d223311381dadb54c55bf49158755b074c311979da90ef9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/useRichTextEditorMentions.tsx:201 \u00B7 src/useRichTextEditorUpdates.tsx:521 \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":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27fdf0e04442a6a0680ed76eab92dc85ca9b2efd7418548a141c94ae7cee1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): scripts/table-interop/availability-evidence.ts:55 \u00B7 scripts/table-interop/checkpoint-evidence.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 131 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2500fc395d6f777a78c32be1762e97e0b9d582020790ca3be1e6f8e6d1c65626"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): scripts/table-interop/checkpoint-io.ts:44 \u00B7 scripts/table-interop/run-continuations.ts:82 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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":"scripts/table-interop/checkpoint-io.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0d5e1256bc908e7c6ef515e0fd890ed815ec82c771951414be5a4f95b1a5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/ExternalTextComposition.ts:415 \u00B7 src/ExternalTextComposition.ts:433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14dea9acc7deb9fc49375c47d2d26b89c948128ee70cde59dfd510e38c1d336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/useRichTextEditorState.tsx:241 \u00B7 src/useRichTextEditorState.tsx:271 \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":"src/useRichTextEditorState.tsx"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf85d688c1a4863e13ce0ed1cca0fc3ef1be7ee04cd4e6680feeb8d5b7a1392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/useNativeEditor.ts:559 \u00B7 src/useNativeEditor.ts:607 \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":"src/useNativeEditor.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9baf4082ea72f5671edcab9346bc68dcb490d022546d63dcfbfe4a222efad2a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/NativeEditorCreateJson.ts:105 \u00B7 src/NativeEditorCreateJson.ts:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4af16852bf5b9cac87b535d82b54b8357e31738a33a0c2ac2bdd1ae257661c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/table-interop/assertions.ts:154 \u00B7 scripts/table-interop/controller.ts:91 \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":"scripts/table-interop/assertions.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f354684aa2cf5964a0373401b047bd4caaeb1b83d4afe700346be8385cf11058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/table-interop/continuity-evidence.ts:303 \u00B7 scripts/table-interop/continuity-evidence.ts:427 \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":"scripts/table-interop/continuity-evidence.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d9b992c225f50a3c1a802d0bba57838a228858b7df4ca66ed43898a8d2587a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): scripts/table-interop/rust-peer.ts:131 \u00B7 scripts/table-interop/web-peer.ts:177 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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":"scripts/table-interop/rust-peer.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f42c9a80b6c7854864191596a3736ecd66e1981de4ed6e6bb9ee53c69e0203f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): src/useRichTextEditorCommands.tsx:111 \u00B7 src/useRichTextEditorCommands.tsx:233 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d68051ab03e5d420f750d660597cb716e75cedf314cd538e472ef9a75fa0c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:156 \u00B7 scripts/table-interop/corpus.ts:184 \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":"scripts/table-interop/corpus.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493e62a2bdcb9d46936e6abd1b540e72664f26076cd73555d19e353270b1b00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/useNativeEditor.ts:323 \u00B7 src/useNativeEditor.ts:343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useNativeEditor.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ca8d96277ab4b7f33417a4586cb1733d2b2b9b73f237733273fb769f57f7b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/NativeEditorCreateJson.ts:298 \u00B7 src/NativeEditorCreateJson.ts:340 \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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0312c6991f6606b58778cf409e2b389acdb128b7081aa7ce2fe6e79b987a6a20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/schemaNormalization.ts:200 \u00B7 src/schemaNormalization.ts:257 \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":"src/schemaNormalization.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a747e501878d00fb10474315fec68d52c5f3bfeb41a4954f1e5e0ff9b1d887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/table-interop/availability-evidence.ts:222 \u00B7 scripts/table-interop/text-history-evidence.ts:28 \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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b65a5464c61d8c1c7ec8aa978607e647918c51bb46975c2583a2fb482d70c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): scripts/table-interop/checkpoint-evidence.ts:149 \u00B7 scripts/table-interop/corpus.ts:1393 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/checkpoint-evidence.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c4352d340d33a2fed75c2c76fd594e4ceeb853bf8e8609cb64bd0037c806b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:337 \u00B7 scripts/table-interop/corpus.ts:975 \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":"scripts/table-interop/corpus.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e7e1b0bb2cd24f2ac1c676c6b6b12aa2e2ef672412ca2006dcee226b1e27a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:602 \u00B7 scripts/table-interop/corpus.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/corpus.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dec1d49432009f5ec742293af6da0c64aba4eb59cf2a58f611a4c0ef7318ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/NativeEditorCreateJson.ts:433 \u00B7 src/NativeEditorCreateJson.ts:671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff44666682a9477498c2e1319ae3809068ec7d933a81dccac14c88abbebc8ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/NativeEditorResultNormalization.ts:240 \u00B7 src/NativeEditorResultNormalization.ts:314 \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":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05daee576c1ac5583ca82fca3fdeb9e1ace850cc47769845e7736e0916b4d87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): src/RichTextEditorTypes.tsx:295 \u00B7 src/useNativeEditor.ts:61 \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":"src/RichTextEditorTypes.tsx"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cadba61817fc8fd53e27612ceed5a62a6e319d16ea796bf1d2236b90036de7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/schemaDocument.ts:31 \u00B7 src/schemaResolution.ts:154 \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":"src/schemaDocument.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb27efd8887732a5da2e025892cf2490035debfcdeb38c7653ee952121fb353"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/useEditorToolbarPresentation.tsx:173 \u00B7 src/useEditorToolbarPresentation.tsx:438 \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":"src/useEditorToolbarPresentation.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d735a5c58aed98aa9d995b456fdfa4711f4508b7b60fbd3d6fb1ff3212b49c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:2009 \u00B7 scripts/table-interop/supplementary-lifetime.ts:118 \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":"scripts/table-interop/corpus.ts"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca2134cc24240adaadac372e33d76e00b6af9daea5acfdacbcea965eeba0cf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/ExternalTextComposition.ts:238 \u00B7 src/ExternalTextComposition.ts:255 \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":"src/ExternalTextComposition.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e631483318c1ccdc31ab22b60c8ec22679e8b9f15dce0f73327e8b3b261c536"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/ExternalTextComposition.ts:397 \u00B7 src/ExternalTextComposition.ts:627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a14102ad9c42fa8e655d5c114299fe6f88baa0bc67279afc893a988e0f04b39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/NativeProseViewer.tsx:134 \u00B7 src/RichTextEditorSerialization.tsx:436 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"src/NativeProseViewer.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b3bf8b04950e9e33a2e71f0a5ad6bd7bcc20e9b00d4dfe3c9e4d9d418e1310"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/useNativeEditor.ts:619 \u00B7 src/useNativeEditor.ts:631 \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":"src/useNativeEditor.ts"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"248a807c6a486d0b73ae989f9ea02abca7462ad69128c6f4dc8c8393178115d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/EditorStyleSheetNormalization.ts:105 \u00B7 src/NativeEditorCreateValidation.ts:136 \u00B7 src/NativeEditorLocalAwareness.ts:85 \u2014 the 3 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. There is one copy in each of 3 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faaa89d45afb46422669da57def7945e04bbc4504183e71a48c7f9cd8c8168e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): src/ExternalTextComposition.ts:771 \u00B7 src/ExternalTextComposition.ts:784 \u00B7 src/ExternalTextComposition.ts:800 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6df61b4eccf3023cb47c58d98e8025dbbeb8260044bf451dbec9e9d61d6ecc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/NativeEditorCreateValidation.ts:136 \u00B7 src/NativeEditorLocalAwareness.ts:85 \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":"src/NativeEditorCreateValidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"830143241b8a251c1c4570aca95f120f1d270158bf5358179d9538fcb2401ed6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): src/atoms.ts:336 \u00B7 src/attributeValidation.ts:38 \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":"src/atoms.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"479e6c1b3af34cbf7e73aeb91efb2d83591f8090ad1d1393c90fed42641a0fd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/useNativeEditor.ts:423 \u00B7 src/useNativeEditor.ts:436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useNativeEditor.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"60657940271e875cd7c43d35c7d18f600f313b9224f3927da40b12391242bec4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/table-interop/availability-evidence.ts:173 \u00B7 scripts/table-interop/corpus.ts:1444 \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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc224067c51ccf309cbd7946f530f41876a17c628f9ae6c2294f6aedc55c065"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:140 \u00B7 scripts/table-interop/corpus.ts: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":"scripts/table-interop/corpus.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"073a1f6f220affd01304485b93e3d1eda5942a6c6f176b9798a4e590e4471927"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:668 \u00B7 scripts/table-interop/corpus.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/corpus.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7491e6cf40b03c267822793b0da98f738e8c7a287eb8b6c3feae1e2bf5437b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/NativeEditorCreateJson.ts:157 \u00B7 src/NativeEditorCreateJson.ts:205 \u00B7 src/NativeEditorCreateJson.ts:551 \u2014 all 3 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3ea2531243205557d17d229bf90ce89eda44af1982e83292430bd0e50e565a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/NativeEditorCreateJson.ts:261 \u00B7 src/NativeEditorCreateJson.ts:594 \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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5318223f2e3c3e08e56bbc4fae4da025d161a918cf66470bdfdf8b4b927fda5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/NativeEditorResultNormalization.ts:513 \u00B7 src/NativeEditorResultNormalization.ts:530 \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":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"329a0b3f1eaaa636cac186fdf26f6f16a68136d678a6ce36a91ace4efdb69e1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/table-interop/assertions.ts:20 \u00B7 scripts/table-interop/assertions.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"scripts/table-interop/assertions.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf302566d59ece09701504c9eb348a4b8086a47139edf30d8cf8002489707c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/table-interop/corpus.ts:182 \u00B7 scripts/table-interop/corpus.ts: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":"scripts/table-interop/corpus.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c56c152c80b9c12a36183d21b66a49fab274d841b5103fc48c5e4f510975c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/schemaNormalization.ts:385 \u00B7 src/schemaNormalization.ts:466 \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":"src/schemaNormalization.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17fcb3b5edc81a1b8c7aba0ec761fa6be098079c4d74fbd15a684c9a66194e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/EditorMentionThemeValidation.ts:9 \u00B7 src/ExternalTextComposition.ts:120 \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":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c8bf05e6772314d7d940913f1ba383703c35d5c7a6a571dc0d3450fd3d4a1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/table-interop/assertions.ts:98 \u00B7 scripts/table-interop/table-schema.ts:128 \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":"scripts/table-interop/assertions.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"974209995e990b75b0468830e424ce32c18af57bcd009b675e7758e13817e1ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/table-interop/browser/peer.ts:861 \u00B7 scripts/table-interop/browser/presentation-observer.ts:213 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eadbfdcbf0aa5690ba551dc15c42a598998e3c522b56fc0b66e8eaaf8bea399"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/NativeEditorCreateJson.ts:623 \u00B7 src/NativeEditorCreateJson.ts:651 \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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"614666f0678d466301e0c4056546293b78b14e283323e12647c99bacf9daa99d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/table-interop/peer-build.ts:8 reaches into another package with a relative path (../../rust/editor-core/Cargo.toml) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/peer-build.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a9a4517dd8ee5b2ea6b2dd6395e2017baa7e9fafc722bde981357348fc79c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertEffectivePresentation (cyclomatic 60, cognitive 132): assertEffectivePresentation has cyclomatic complexity 60 and cognitive complexity 132; 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aef2a872ae750f7b692ea889874ef3e805cc28a2edcb37419f04a8f76dfaef7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observePresentation (cyclomatic 52, cognitive 93): observePresentation has cyclomatic complexity 52 and cognitive complexity 93; 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":"scripts/table-interop/browser/presentation-observer.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec79c98743bb95f9bbaa6de1d680ac15444347a0faa249ac86080505887827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSchemaDefinition (cyclomatic 49, cognitive 73): normalizeSchemaDefinition has cyclomatic complexity 49 and cognitive complexity 73; 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":"src/schemaNormalization.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b24aad052ae30dfec661e2b87d2eb4fed4a6ae3ebcd93696f7174562f462cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useRichTextEditorPresentation (cyclomatic 49, cognitive 39): useRichTextEditorPresentation has cyclomatic complexity 49 and cognitive complexity 39; 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/useRichTextEditorPresentation.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defa91727d5e4ff92a4e7c2d95b472d3f47fd34e5009b033c862234424b8109"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 48, cognitive 94): (anonymous) has cyclomatic complexity 48 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 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":"scripts/table-interop/corpus.ts"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56906fb24b9eeb17d7f25efc2c305dac44fddba76f193948544b39e50876cec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertFamilyEvidence (cyclomatic 48, cognitive 80): assertFamilyEvidence has cyclomatic complexity 48 and cognitive complexity 80; 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4de49286d31059615059c53423e0a30579497349201954ed837138e5a6fbb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDocumentSchema (cyclomatic 47, cognitive 56): resolveDocumentSchema has cyclomatic complexity 47 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":"src/schemaResolution.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd0cb2a75cabc58108286cd59fa3a7d5d4d375397b50918ef7602bb504464a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationPassed (cyclomatic 45, cognitive 35): continuationPassed has cyclomatic complexity 45 and cognitive complexity 35; 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":"scripts/table-interop/corpus.ts"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"14052fa1a506d9ed68dcbcc4a6b8e080d57af657fe0134cc740e5dddb48ed52a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validLeafRenderElement (cyclomatic 43, cognitive 35): validLeafRenderElement has cyclomatic complexity 43 and cognitive complexity 35; 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/NativeEditorRenderNormalization.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"506562a4053598faeb0d187a2bb10356f7216a24804cdca617cad69644ca2bc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeV2JsonValue (cyclomatic 41, cognitive 81): normalizeV2JsonValue has cyclomatic complexity 41 and cognitive complexity 81; 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7300bcb69b353a8e83beacef6d651043638b458b6d0fa0681ac0152536a46512"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFallback (cyclomatic 41, cognitive 59): validateFallback has cyclomatic complexity 41 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":"scripts/table-interop/presentation-overlap.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7472f44d02c2b5e4bbaf37decdb1a067789ad0a574f17a7ca0fdb59f2af85a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 55): (anonymous) has cyclomatic complexity 41 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":"src/useNativeEditor.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede00a7a88402d0a0c9aa29ec7b82ff013ae4b077d8e162587ab5e88e360a78d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 33): (anonymous) has cyclomatic complexity 41 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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/useEditorToolbarItems.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6318d5c6a883d1e76340aba2fc5f6c71798f10a4ff01b892500d63afe3050730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 32): (anonymous) has cyclomatic complexity 35 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 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/useRichTextEditorMentions.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a37b46559a60cf77e950540510bb714007aeca5055a11bea76f51a11bdc1e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stockLimitation (cyclomatic 34, cognitive 43): stockLimitation has cyclomatic complexity 34 and cognitive complexity 43; 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa269b5aaedf23e2cc01804ab01bb8e7888a423950eaf203962cb509c5d8076f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertActionEvidence (cyclomatic 34, cognitive 39): assertActionEvidence has cyclomatic complexity 34 and cognitive complexity 39; 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93896cde2350dc8703da9618485f4b3ace0a6638a18e55a5400990796f9829e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeCollaborationTransportEvent (cyclomatic 32, cognitive 38): normalizeNativeCollaborationTransportEvent has cyclomatic complexity 32 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ac77f6a560e16b18c9762afa72f3f713645a3c69ca383d9432e8935db7ff69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 22): (anonymous) has cyclomatic complexity 31 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":"src/__tests__/helpers/createFakeEditingModule.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"779926343e47d733e54c620c9705c3744045e937a0b7259a35d33c48f181a56a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveToolbarButtonVisuals (cyclomatic 30, cognitive 19): resolveToolbarButtonVisuals has cyclomatic complexity 30 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":"src/EditorToolbarVisuals.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c76fc1d3fbfe85512e1fbc6c4c4af58dc261ca2525780561b70eb06d8a1d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeV2CreateEnvelope (cyclomatic 29, cognitive 54): serializeV2CreateEnvelope has cyclomatic complexity 29 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d721c83b877fe18497aa4430778bbfd8dfa4aacea227e01e930586b1ac4c0c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 29, cognitive 46): visit has cyclomatic complexity 29 and cognitive complexity 46; 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d7160b7ab5663a3067e0c7e045d71a65c4a2c41544dce17e5429bfbbb3796"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 29): (anonymous) has cyclomatic complexity 28 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":"src/useNativeEditor.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"179a9a7cb691b3aabf2bf26b7511fc45286b142bbfcd3a6d92e28f28e4c7ba12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNativeCompositionResult (cyclomatic 28, cognitive 28): parseNativeCompositionResult has cyclomatic complexity 28 and cognitive complexity 28; 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":"src/ExternalTextComposition.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54c0d125b25aab056e01915492f8107ab70d16c808c17a385acef017d7ad469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildV2CreateRequestUnchecked (cyclomatic 27, cognitive 32): buildV2CreateRequestUnchecked has cyclomatic complexity 27 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f7bf662539c55aee4675c2bd3acdccbad2d3221cdd5f0559bc6a55cf321a4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSample (cyclomatic 27, cognitive 28): validateSample has cyclomatic complexity 27 and cognitive complexity 28; 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":"scripts/check-table-performance.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f681ca625031166c85d2fae82966631dab281886544e949b984ca040e39c494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useEditorToolbarPresentation (cyclomatic 27, cognitive 26): useEditorToolbarPresentation has cyclomatic complexity 27 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":"src/useEditorToolbarPresentation.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b74a89d1e33f2e55885247df56c890dc2fb10496e7e019049fe9039274c7bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkpointProof (cyclomatic 27, cognitive 18): checkpointProof has cyclomatic complexity 27 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":"scripts/table-interop/checkpoint-evidence.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00118d178c3adc4d027b92dd80988a6641638871b0df878b57a9595aa65251"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defineSchema (cyclomatic 26, cognitive 52): defineSchema has cyclomatic complexity 26 and cognitive complexity 52; 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":"src/schemaDefinition.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f23f1058fa41fd9d1d6154959e4ab4be894921c675b84c0d0bf7308c1954b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleReceive (cyclomatic 26, cognitive 34): handleReceive has cyclomatic complexity 26 and cognitive complexity 34; 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":"src/__tests__/helpers/createFakeRuntimeState.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b5d1897829207294b920fc1564da4c340b5ef2295d9572071a01ef4b1a63eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAttributeSpec (cyclomatic 26, cognitive 29): validateAttributeSpec has cyclomatic complexity 26 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":"src/attributeValidation.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ec8a8a4d0e564968ac0f529229263d64da1f1f33cb2fb6d7beca58995e1315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 20): (anonymous) has cyclomatic complexity 26 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":"src/useViewerAtoms.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"74804045c20be258ee5ddd6298a39333107d3e1461eab1a83c192673047f653e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeEditorV2PeersValue (cyclomatic 25, cognitive 40): normalizeNativeEditorV2PeersValue has cyclomatic complexity 25 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":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd62edbe906c45dde6a2b218b00304f84a0aa0e18030504eca33a8d26b667154"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evidenceCall (cyclomatic 25, cognitive 30): evidenceCall has cyclomatic complexity 25 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":"scripts/table-interop/evidence-observer.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd2cd21a9138c3ae1dda8e35b834fcdc514d3e58fd215fc801b9ac9f1cd6c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 14): (anonymous) has cyclomatic complexity 24 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":"src/useEditorToolbarItems.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9e38d469e8a57574858d16f43ce6ca80bf88aa676c5041d5719ce8a2dc05c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 29): (anonymous) has cyclomatic complexity 23 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":"src/__tests__/helpers/createFakeEditingModule.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a2608a835816f25a31c0a41c94666d60fdea26e77d186f3678bc579b54a04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defineAtomNode (cyclomatic 22, cognitive 21): defineAtomNode has cyclomatic complexity 22 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 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/atoms.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e68ce67c479332d6a7b28c6b20a614cbfb983de57754acff3db27467fcd21d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRenderSelection (cyclomatic 21, cognitive 30): normalizeRenderSelection has cyclomatic complexity 21 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":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be53ec5d6422d61ff14ba1caf0d7b3579c3957228279693da5b655ec1dd9373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function property (cyclomatic 21, cognitive 22): property has cyclomatic complexity 21 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e9d036952694ac3709735695f0ea58433f38c1d8131990d3f78937f504f50f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 17): (anonymous) has cyclomatic complexity 21 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 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/useRichTextEditorEvents.tsx"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97889f66f5a503e7bbd13b472c0805e53bd75868bb08e7f952b9a717d8cd2b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collaborationProtocolAdapterDescriptor (cyclomatic 21, cognitive 16): collaborationProtocolAdapterDescriptor has cyclomatic complexity 21 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a284c519518b4071f3c50ce2d13b5b2dfd2d0a31cf12c4db5115ae25efd89cb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function malformedRawTable (cyclomatic 20, cognitive 29): malformedRawTable has cyclomatic complexity 20 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad509a777f425f68a77a3c542a5253b7d63f8ec27002e489d0c55d41eb8ceb95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeRowInsertion (cyclomatic 20, cognitive 29): observeRowInsertion has cyclomatic complexity 20 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":"scripts/table-interop/browser/row-insertion-observer.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f56ffbaf4ca618c7f814a36aaac86fd6ef728f917981c72d6bd714ae5a5fd99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendV2JsonString (cyclomatic 20, cognitive 25): appendV2JsonString has cyclomatic complexity 20 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"81636bcb08b82eb6f2ed63249fb652ee019282fcb069637c6c047b2f52c0a732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizedHtmlRules (cyclomatic 20, cognitive 25): normalizedHtmlRules has cyclomatic complexity 20 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":"src/atoms.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eedc08fd5e94d26deef6d2adcf5bd619e4cf07f749cf5895156de3c6858ad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714c3cd5484e5b17953cd7ab88e3ad9c74a2b71d8632e4e40ffd566df3ccafd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admitSchemaCollections (cyclomatic 19, cognitive 30): admitSchemaCollections has cyclomatic complexity 19 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":"src/schemaResolution.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a81323f3f01f1b3596efd8f6b7337d7f111f389cf8598384991841956d22eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chargeV2JsonStringBytes (cyclomatic 19, cognitive 22): chargeV2JsonStringBytes 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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ae1793937da87de3e428ac8092450e20c92e1ab781115152c386a7a2f926ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNodeJSONProjection (cyclomatic 19, cognitive 20): normalizeNodeJSONProjection has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaNormalization.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eadf75dc5ea224378e559575355998354360bed2e6e1ccc95bf6741733830c"}},{"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/EditorStyleSheetTypes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa5e0b4d17e75ba7cc66a5d70c23b9b44495fd1589c15a984ba05e99a616773"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEditorAddons (cyclomatic 18, cognitive 31): normalizeEditorAddons has cyclomatic complexity 18 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":"src/EditorAddonNormalization.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f7bd25ebc4b452593c780fce05ce2e8e6be117183201b9ef5fbb165e526ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fakeScalarDocumentMap (cyclomatic 18, cognitive 31): fakeScalarDocumentMap has cyclomatic complexity 18 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":"src/__tests__/helpers/nativeEditorV2FakeDocument.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6943dc072f116c03517a082f18cdc5d0bfb3ca10bbc28fa40da09f44ecbdc772"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 28): (anonymous) has cyclomatic complexity 18 and cognitive complexity 28; 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":"src/useEditorToolbarItems.tsx"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b1b90d32dbd843761e8e50d2aee57b14c489f50400d2ae89bb700aca01026"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activeStateAt (cyclomatic 18, cognitive 22): activeStateAt has cyclomatic complexity 18 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":"src/__tests__/helpers/nativeEditorV2FakeDocument.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"888eaf0875cf69a43cc8e9c88e5b97637adcf69d7e1135f646e2a8c1fe86efcf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) has cyclomatic complexity 18 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":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d0ab3273eb413771e7daee59c8ccdeb9ccea68eb4f46b5815c30f09ac2e45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGrid (cyclomatic 18, cognitive 16): validateGrid 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a430776cf6077f5fe83994dd84b50c1b38476442bb3029ed9a23f21b8b463a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function availabilityVerified (cyclomatic 18, cognitive 10): availabilityVerified 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c9d030bd3d58460314aa721e91417221f491ef60bc79ae62e95b38790dbc54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supplementaryRequirements (cyclomatic 17, cognitive 40): supplementaryRequirements has cyclomatic complexity 17 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/supplementary-continuity.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da024140a747c5c3d429eeb8fcff385ad0b9b47e4c550efffaa565ab0f12432"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 28): (anonymous) has cyclomatic complexity 17 and cognitive complexity 28; 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":"src/__tests__/helpers/createFakeCollaborationModule.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"78331318072a224a9d9c712b1d16e4642965e0813f37639e6a89f54b34ddb965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructDefaultEmptyDocument (cyclomatic 17, cognitive 26): constructDefaultEmptyDocument has cyclomatic complexity 17 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":"src/schemaDocumentConstruction.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1322415d9d578cea7c3cb2e21dda41fd53317bd95fa0848d2f950e5a5ea9b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateHardCase (cyclomatic 17, cognitive 22): evaluateHardCase has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-table-performance.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1fb2d5ed5b4f6a3788d3c8b3697fbd62866888bbe585416b59af34823c78ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationCheckpoint (cyclomatic 17, cognitive 20): continuationCheckpoint 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":"scripts/table-interop/corpus.ts"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0380f3cd33c13a7b0672b67956bea4e82caba822f96be6bd6b6e687e9a30be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeNativeCollaborationProtocolBytes (cyclomatic 17, cognitive 20): decodeNativeCollaborationProtocolBytes 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de08a7577169b8af4e2749bb175d0eca6f9dd97549b36fce0cd634474931d74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) has cyclomatic complexity 17 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":"src/useRichTextEditorCommands.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19b0905c36d6095dfb68f798ba96828b2aed4bd5956351fd1e567b6251ba92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitCorpusNode (cyclomatic 17, cognitive 17): visitCorpusNode 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":"src/__tests__/PreparedProseLifecycleContracts.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"976692c7fded178ad92d25f6e5069f30480e0147ef280ed649e4b18bc881795f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) 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":"src/schemaDocumentConstruction.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6cf52ec037365dcbd6f535bbed4589e695dcaeed35eb1ff93809dbf9c4a508"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeTableSelectionGeometry (cyclomatic 17, cognitive 16): normalizeNativeTableSelectionGeometry 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":"src/TableNormalization.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e965375263727ae0c225e0bb5288f5ff66c7f226055b63825b6ee70f3786256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) 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":"src/YjsCollaboration.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"af09a8161eb05ff7227e8a696fa1af661484e1b96d48b9374d09ef1a0cf46a4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useRichTextEditorState (cyclomatic 17, cognitive 16): useRichTextEditorState 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":"src/useRichTextEditorState.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4caf9455559bdf8b312a9a627cbfc2d830447fa4edebbf90ff839e200c4a3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAttribute (cyclomatic 17, cognitive 15): validateAttribute has cyclomatic complexity 17 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 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/attributeValidation.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"690fdf58072025c101cab2eab016c6447dff84ef61fc97123c9211a20b54c7bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 15): (anonymous) has cyclomatic complexity 17 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 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/useViewerAtoms.tsx"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d36f792cdb695d95bedc7e5a7015625a86f36a0aa091612b145b52d4e3a6a2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nativeRefusal (cyclomatic 17, cognitive 14): nativeRefusal has cyclomatic complexity 17 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"292bde0a76d771d42b6a3ca34c95bb1255b81191da4462b0bac1bb9168bc3001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function meaningfulGaps (cyclomatic 16, cognitive 21): meaningfulGaps has cyclomatic complexity 16 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"11493c815a55e75a455c0b8926aca09c3699cdc9a78325f5d21e6a5efd8224a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 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":"src/__tests__/helpers/createFakeLifecycleModule.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d178c88dc03396208d3fb77d49d9159fb9c0f1163b974c98ccd27adfbde90b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 16, cognitive 20): commit has cyclomatic complexity 16 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":"src/ExternalTextComposition.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f2a58b93150175b0462f0c9be2fca09b251571fb8da22cacdfaad05a173257"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addContinuation (cyclomatic 16, cognitive 18): addContinuation 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":"scripts/table-interop/checkpoint-report.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"43828e59695ae3bbaa866c18996a53b2d6ac9cc80d725d63176dd261097b96ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 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":"src/useViewerAtoms.tsx"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f13736f1f9e1c6f922251605fd9a7cf80e2a3e2ed91a99eb7b080e4e8ed6ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSelectionFromUpdate (cyclomatic 16, cognitive 16): parseSelectionFromUpdate 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":"src/RichTextEditorSerialization.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ab2da6810bb2b17119597cf4e2f595006733e9038923eaf22bb04047a0f70f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateOverlapEvidence (cyclomatic 16, cognitive 14): validateOverlapEvidence 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":"scripts/table-interop/presentation-overlap.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d5e2ba5fe9f8408c92f613ec4c642815b076be6e966ca3d61f6b87578551d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function minimalContentMatch (cyclomatic 15, cognitive 35): minimalContentMatch has cyclomatic complexity 15 and cognitive complexity 35; 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":"src/contentExpression.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac44afcf26109a5b893359c136f665de7478f6f850b4c7d21661206b9bce1c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEditorTheme (cyclomatic 15, cognitive 33): normalizeEditorTheme has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f90d39ac8701178f991afd815bae83c0ea8dd89af523c4a454772d9de3d0eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function semantic (cyclomatic 15, cognitive 29): semantic has cyclomatic complexity 15 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8548f48d3d611439a90da97c12593e22b54224a9970fd4120029b125328b016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeContinuations (cyclomatic 15, cognitive 28): executeContinuations has cyclomatic complexity 15 and cognitive complexity 28; 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":"scripts/table-interop/continuation-runner.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddc093f3c938169420b49c6ff118ae27cd507fe3e1d2d7e49740e07519d406d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeStyle (cyclomatic 15, cognitive 22): normalizeStyle has cyclomatic complexity 15 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"929fda7cd9d5dd8ca4fcc6d67aa6249f35ef58ce65ef8ffa67db358e42d0d090"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) 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":"scripts/table-interop/cases/presentation-semantics.test.ts"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"64de9930bb62a17b13b6dcd425caaab49174f41fe7de20f0ea9d995c5fe033c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAttributeDOMRules (cyclomatic 15, cognitive 16): validateAttributeDOMRules 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":"src/schemaDefinition.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9366c976f32e82e1e12bdf5f9d6ba08ee3a6d3f6bc74d14c4db767d7a39e00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 15, cognitive 15): execute has cyclomatic complexity 15 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":"src/useViewerAtoms.tsx"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ce1a7f809ff08cd4e709f8a7d7cfd6075dec99d25b217c4088491aabf5f89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCaretRectJson (cyclomatic 15, cognitive 14): parseCaretRectJson 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":"src/RichTextEditorSerialization.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d0c6d9c0960fc0338d3314c6adc07da2245499e8d076d386ce193e6ce4403a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1219513fa52d07043955e432bec64d19fab41d9654f0a86d02747bd81fc5e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b8606a19df85c6520d1e388ceb6ba2329d7befe4d6b6f18d2be1692d76093c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeEditorTheme (cyclomatic 15, cognitive 13): serializeEditorTheme has cyclomatic complexity 15 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":"src/EditorTheme.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a09ab897e0639f03f2babbd21a93aee28f9b370c84e949182dbb52b542ae1c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) has cyclomatic complexity 15 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/useRichTextEditorPresentation.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8438e37857db6a56e4c7a3837e6d764e1b5b20235924ed314cc2bd53742801"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRaw (cyclomatic 14, cognitive 25): readRaw has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/browser/presentation-observer.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a35e338656cab927a9194d7d4f4965b296ae1d0c6505fb2ddd30d01b3b826ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overlapWitness (cyclomatic 14, cognitive 23): overlapWitness has cyclomatic complexity 14 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":"scripts/table-interop/presentation-overlap.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d2645d920c0308412fcd89fead4bd516349a9831e02fc71951774de2bbc2ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableTheme (cyclomatic 14, cognitive 20): tableTheme 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb942278e2376fcaaefa15eb2ccf57c248356d2644cdff26480dc845c2999357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertRepairHistoryFootprint (cyclomatic 14, cognitive 19): assertRepairHistoryFootprint 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9250f61217cecbd1e232846e7a32810e7c097edaa2a69ea4bbbb55c9b1d8dbd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validEditorMentionTheme (cyclomatic 14, cognitive 19): validEditorMentionTheme 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":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9936a103931bcd5ad0635854794a7a99b13d40813fcbc1edec2694e19ad838d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRemoteAwarenessDelta (cyclomatic 14, cognitive 19): applyRemoteAwarenessDelta 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":"src/__tests__/helpers/createFakeRuntimeState.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2e355ead12bb60ade953baf864b24241d512e5c47d0e7fa45fc0a98d40e1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safetyResult (cyclomatic 14, cognitive 17): safetyResult has cyclomatic complexity 14 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":"scripts/table-interop/checkpoint-io.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc442b6efd8d6de0d1b7dddc17651aae4d85d31711d8a246cf5b6c171bfe800"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCrate (cyclomatic 14, cognitive 13): renderCrate 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":"scripts/generate-third-party-notices.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2616088823723ca8dfd58838f441a13c0a57481a37af89c1591e83881e67b65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNodeHtmlRules (cyclomatic 14, cognitive 13): normalizeNodeHtmlRules 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":"src/schemaNormalization.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3785195ab0178c7ec5e03a46432a437bf48f4c67be34b56200198f6a96d6b059"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 14, cognitive 12): finish has cyclomatic complexity 14 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":"scripts/table-interop/checkpoint-report.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bcbd0da6e5892f41b8e857dd3f59909eb18587f58c14991d39528549dc8685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFakeTransportConfig (cyclomatic 14, cognitive 12): parseFakeTransportConfig has cyclomatic complexity 14 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":"src/__tests__/helpers/nativeEditorV2FakeAwareness.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a01b13b80fd288bccf9266ce5674ce287e1620b358e93bbfcf53902eff52a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateJson (cyclomatic 14, cognitive 11): validateJson has cyclomatic complexity 14 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/attributeValidation.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712ba0fed68139a952956e67b5b5c9306fff75b2ed93eadb37c7118a8a49bd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cloneAndFreezeDescriptorValue (cyclomatic 13, cognitive 21): cloneAndFreezeDescriptorValue has cyclomatic complexity 13 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"807247ef5bffcc515ffd9ada7a3f5d3e21add2640bebfc669f2d3f200800313b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e305e1224e16cb846a4a44c955280e86f05f98a9b28df659065f59a1bb3144"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cancelWithCause (cyclomatic 13, cognitive 16): cancelWithCause has cyclomatic complexity 13 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":"src/ExternalTextComposition.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f6ecbc027f8f04e696f0c842f220e9a96f0cc3a91093554efb0889c22c7d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withTablesSchema (cyclomatic 13, cognitive 15): withTablesSchema has cyclomatic complexity 13 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":"src/TableSchema.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e07209537d4fc84f2aff656ea9c2997287029651e7830a1ba097760e10710f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertNativeRemoteLifetime (cyclomatic 13, cognitive 13): assertNativeRemoteLifetime has cyclomatic complexity 13 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":"scripts/table-interop/supplementary-evidence.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0099c9bab08dedfdda8b28b5463f970f359179f2e275052d9e05d8fcf784c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyboardSafeViewport (cyclomatic 13, cognitive 13): keyboardSafeViewport has cyclomatic complexity 13 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":"src/TableToolbarPlacement.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"28eb994a02f1064b43ff3294cdadd593600622f19eeb789a3682f89a6b39fa2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertTextHistoryBoundary (cyclomatic 13, cognitive 11): assertTextHistoryBoundary has cyclomatic complexity 13 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":"scripts/table-interop/text-history-evidence.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a700eb502cf126cd5931b5ff0e00787aab5923e1046d9fed8cb5fdc233356fd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 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/useEditorToolbarItems.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0672019894ce50908a966d30b440f701be9346f067dd099ee80001e398df98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyJson (cyclomatic 13, cognitive 10): copyJson has cyclomatic complexity 13 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":"src/atomUpdates.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"212482b6ab6b4c154e908190b93b055f3e0807361f57799fb721df088b7ddba2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function equivalentWebInsertionRun (cyclomatic 13, cognitive 9): equivalentWebInsertionRun 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3028b208b0b0eb1cbec2706c22da7d77425a14caebb9ccff0ad5f0b2e10ab6b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSafeHtmlAttr (cyclomatic 13, cognitive 9): isSafeHtmlAttr 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":"src/schemaNormalization.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef67b55dfe07ff16f1cc5e75f1335cf849d26176c8e0832a1210af8738eccf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 28): (anonymous) has cyclomatic complexity 12 and cognitive complexity 28; 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":"src/__tests__/helpers/nativeEditorV2FakeDocument.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"17185b5fdd792ac6bce1ee709b85b1ce450c2f85ce852799696f8c10247e82d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orderedMarker (cyclomatic 12, cognitive 18): orderedMarker 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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab019b9769e8ba5764301bda9718dcbf196994949ace0a8224cf756cf8fe2e37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function documentToScalar (cyclomatic 12, cognitive 17): documentToScalar has cyclomatic complexity 12 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":"src/__tests__/helpers/nativeEditorV2FakeDocument.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f59777c3a3331cb02542bf8647bf013773bea074481c39891e1d2098ec5af85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalDocumentShape (cyclomatic 12, cognitive 16): canonicalDocumentShape 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":"scripts/table-interop/assertions.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"124e2eb64d6d6aaaf0b53d4d55b9605dac75808afe499874e0eba002918cc6c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvedColumnWidths (cyclomatic 12, cognitive 16): resolvedColumnWidths 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":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af44a2d84a84fdddc30a6e2a059e213eddb6f91efe7349808b2a21030407e23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forEachGroupToken (cyclomatic 12, cognitive 15): forEachGroupToken has cyclomatic complexity 12 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":"src/schemaNormalization.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ec198564727d4b75928437ea04c005dc956434c2300d9736535a50e2a50ee6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 14): run has cyclomatic complexity 12 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":"scripts/run-android-api24-smoke.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"496e97eade4d5c8c0a76606c0e181d0aec2fd102d7d3f8b46dd3512bad00b06f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preserveStructuralPayload (cyclomatic 12, cognitive 14): preserveStructuralPayload has cyclomatic complexity 12 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e9c77fbbc16826808821c092def6650cb82dff56e732a5f8d79590e5dcb6bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonical (cyclomatic 12, cognitive 14): canonical has cyclomatic complexity 12 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":"scripts/table-interop/table-schema.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65306a2855ce04735677c2da65fd81d3f777399c457a019f462f7a1643a7b3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeEditorV2MutationOutcomeValue (cyclomatic 12, cognitive 13): normalizeNativeEditorV2MutationOutcomeValue 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":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a12ff7c1287b91629a1b582f33b75b2afe3b29884f3a69ed43a9abb106c495"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReplyValue (cyclomatic 12, cognitive 12): parseReplyValue 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":"scripts/table-interop/peer-protocol.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d046ed9741fac63fc13343745a34e1d3a337239cb656941d28f9ba2a885355c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validListContext (cyclomatic 12, cognitive 11): validListContext 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/NativeEditorRenderNormalization.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e0bd6e2320b7b6f426561245b3b83350733c0ff45a21b5a8316baeef48f9b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFakeAwarenessIntent (cyclomatic 12, cognitive 11): parseFakeAwarenessIntent 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/__tests__/helpers/nativeEditorV2FakeAwareness.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b418d43f5cf16dd13cf801f8f97fda41d25735c54ce5bf49858b21f5c2b338c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalNode (cyclomatic 12, cognitive 11): canonicalNode 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/__tests__/helpers/schemaFingerprint.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a89260bb57eb9bc84e4f7d4108094822bbe64d786d2561bbe75d7d3e50150c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fakeAtomLabel (cyclomatic 12, cognitive 10): fakeAtomLabel has cyclomatic complexity 12 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":"src/__tests__/helpers/nativeEditorV2FakeDocument.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec88c5f25cd38191626d0b870fb055b8964578aa7b82dbae16913f26a1e869fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function schemaValuesEqual (cyclomatic 12, cognitive 9): schemaValuesEqual 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":"src/atoms.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a70ae2dfc88be165b61cb2db372b3d12b3ab28101042cb308867d7c3a8b1025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArguments (cyclomatic 11, cognitive 18): parseArguments 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":"scripts/check-table-performance.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d9a5e5cea1711870f7ee5defe017f60ee5e7b93f8d72e449fbb46bb7770a11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectAtomInstanceBlocks (cyclomatic 11, cognitive 17): collectAtomInstanceBlocks has cyclomatic complexity 11 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":"src/atomInstances.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0137394f7ab7df95473efdf8c83c21cd1e39f6964ff3f45ec680305fcaf3f492"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drain (cyclomatic 11, cognitive 16): drain 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":"scripts/table-interop/scheduler.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b942c114242f02613bf21059c9d51645f913cd18cdea52e08227803edb17f93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCommand (cyclomatic 11, cognitive 15): applyCommand 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":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1accd219caef5b80be89af7d1c340e7907ddc76f698f7fe2a3c58d1797258b6d"}},{"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":"src/useRichTextEditorEvents.tsx"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d498248f9914c1d7d9a62dc64fd1eb7004102305c18ce92c7eafe992bff0990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 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":"src/__tests__/helpers/createFakeCollaborationModule.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a312820a945867d6c002a46d9f10dedb7d4adc92fe559a14e9be0299f8c5e47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de29b7065e0c22a70b56b06402a9cd82396955785bc08bd81f3ad0cd9f59516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeable (cyclomatic 11, cognitive 11): mergeable 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":"scripts/table-interop/assertions.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35c8bfe25b5794680e1ae2d025d5d4d15f68ff0e1c516a8e33f907171ae9986"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"scripts/table-interop/corpus.ts"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed4331df6223da5e082380a5375b8477ec90f68f80827102b7ede10c955ed7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CounterCard (cyclomatic 11, cognitive 10): CounterCard 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":"example/components/CounterCard.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca740c8a7941752abec28f2c6f90ffbc8f56e2e8624269d226f16381f8a5e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeCollaborationTransportDiagnostics (cyclomatic 11, cognitive 10): normalizeNativeCollaborationTransportDiagnostics 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f12409dc2bf1576435a7f92e368fd2223af732511e7316edac7ebdc4a516e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeNativeEditorV2StateValue (cyclomatic 11, cognitive 10): normalizeNativeEditorV2StateValue 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":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b75a9380377389e60b6aace5ed1747dd1d7bea7a6685ea4fc06f6b25cab4a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useEditorToolbarState (cyclomatic 11, cognitive 10): useEditorToolbarState 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":"src/useEditorToolbarState.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0459799085099067559d132c6d63e2efa17c7b5f5501f8b764efbaf2f89a70a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"66726884fb9d6c8963533b346bf907bca9b6a748b1f1a0459f3b87cecaba193d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeCollaborationProtocolAdapterResult (cyclomatic 11, cognitive 9): serializeCollaborationProtocolAdapterResult 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":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef66221702d364195549de0b351f10890ff2892b90e89a70177166db9cb8d976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeV2CreatePolicy (cyclomatic 11, cognitive 9): normalizeV2CreatePolicy 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":"src/NativeEditorCreateConfig.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c076a4ebd62db41bc7cf2bebe7407b7c51c9b7e2bfb59da7ca59e730dbfc0e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRenderPatch (cyclomatic 11, cognitive 9): normalizeRenderPatch 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":"src/NativeEditorRenderNormalization.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9add5f90f48e161b1a22bcbe6e33041e1e36e08f419a79082e705c65e6fb89"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/corpus.ts: 1961 lines of code: scripts/table-interop/corpus.ts has 1961 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":"scripts/table-interop/corpus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29108faf39b4107aa3281bdd50592e6dde171762eed4c4491b8e7f09e8edb6df"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/browser/peer.ts: 985 lines of code: scripts/table-interop/browser/peer.ts has 985 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":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c2e918fe80c28d361a33ecf0c82723280a1023f5ff2713fcf2d848d0845ff5"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/scenario-evidence.ts: 819 lines of code: scripts/table-interop/scenario-evidence.ts has 819 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":"scripts/table-interop/scenario-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810435328358c2d0bc673b75c67fae05c0bd2162613478f9dbfb53fe0b72bb2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorPresentation.tsx: 713 lines of code: src/useRichTextEditorPresentation.tsx has 713 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/useRichTextEditorPresentation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d31e723b5814196587757dde32bb26f33ca771376bfe4ea01a03509206155be"}},{"ruleId":"R3","level":"warning","message":{"text":"src/YjsCollaboration.ts: 694 lines of code: src/YjsCollaboration.ts has 694 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/YjsCollaboration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efc99d334b2967e707679f31c70ab3178fed770a9334c2f977ba00a2f57074c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/ExternalTextComposition.ts: 682 lines of code: src/ExternalTextComposition.ts has 682 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/ExternalTextComposition.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf5dc27644852aa36128a4c2bb437ca4d8094e67cb2723e85716e6cc323dfa9"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/availability-evidence.ts: 638 lines of code: scripts/table-interop/availability-evidence.ts has 638 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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3054d63e2c1d009c9c0f1f370d1a68b7b13058670a5272c7ce90e0f11e4389d"}},{"ruleId":"R3","level":"warning","message":{"text":"src/NativeEditorCreateJson.ts: 590 lines of code: src/NativeEditorCreateJson.ts has 590 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCreateJson.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1118c78f12d40e990844997fbaf937ec501fe0f4b72fe7792dd5ccaf350196"}},{"ruleId":"R3","level":"warning","message":{"text":"src/NativeEditorResultNormalization.ts: 585 lines of code: src/NativeEditorResultNormalization.ts has 585 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/NativeEditorResultNormalization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b54f48df0e7a6f3d1417cafb0d53daf6247ecf509ba36197895f82cece443b"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useViewerAtoms.tsx: 585 lines of code: src/useViewerAtoms.tsx has 585 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/useViewerAtoms.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62d1ed6da30a611c86a162157eeceef2c477002d285b4a39f8db4074194f927"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useNativeEditor.ts: 578 lines of code: src/useNativeEditor.ts has 578 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/useNativeEditor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830d14e3b8e972d6fca8161ea7ea3b10ea43167ffebbd9342d75e138e721f045"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/presentation-semantics.ts: 570 lines of code: scripts/table-interop/presentation-semantics.ts has 570 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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddc6d8a8be8c25e60c8ec15ecb111a32d7cc68f21fd29fb5d09e4a4a2d2c18a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorState.tsx: 568 lines of code: src/useRichTextEditorState.tsx has 568 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/useRichTextEditorState.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87327ee452abcf28742547f1a2faab013e50571ebf93a46f02ddc5faec60fe24"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorCommands.tsx: 564 lines of code: src/useRichTextEditorCommands.tsx has 564 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/useRichTextEditorCommands.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9caa8a90c244e89d5e1f02de9030d129c29b6155d70ff6e098fa3e1d72ded"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorUpdates.tsx: 556 lines of code: src/useRichTextEditorUpdates.tsx has 556 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorUpdates.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14290032c7b4acf494629ea79530903300feeb3727bfe093b87735734ab13b28"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/controller.ts: 553 lines of code: scripts/table-interop/controller.ts has 553 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":"scripts/table-interop/controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16171b4678bf99c4c89d9f15cc3c77196b8486d41e39d2d642450fbd74361299"}},{"ruleId":"R3","level":"warning","message":{"text":"src/NativeEditorDocumentBridge.ts: 534 lines of code: src/NativeEditorDocumentBridge.ts has 534 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/NativeEditorDocumentBridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"834a0905b717bfc4ce4be3e6aa2933cb3b58ab5e4c64cdf3a7da76cf5162bd93"}},{"ruleId":"R3","level":"warning","message":{"text":"src/NativeEditorCollaborationTransport.ts: 494 lines of code: src/NativeEditorCollaborationTransport.ts has 494 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/NativeEditorCollaborationTransport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7c26550e8aab0a5e6d315c2d2510ecaf8396bd29a0e28e9b7ba03440dcf7cd"}},{"ruleId":"R3","level":"warning","message":{"text":"src/NativeEditorRenderNormalization.ts: 492 lines of code: src/NativeEditorRenderNormalization.ts has 492 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/NativeEditorRenderNormalization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"019400a97dfd10979701f0346968ba627ab3276e3b5e4b94692163cac7d35936"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorEvents.tsx: 470 lines of code: src/useRichTextEditorEvents.tsx has 470 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/useRichTextEditorEvents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7cbbc488166d3ccbf99d39e8a635d57491ed68c5346a4f731ffe31cdfa947f"}},{"ruleId":"R3","level":"warning","message":{"text":"scripts/table-interop/continuity-evidence.ts: 452 lines of code: scripts/table-interop/continuity-evidence.ts has 452 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":"scripts/table-interop/continuity-evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f4718e658efed0abd23cdaab9f98b7da42b783cba62cda0adb4885be48fd81"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useRichTextEditorMentions.tsx: 445 lines of code: src/useRichTextEditorMentions.tsx has 445 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/useRichTextEditorMentions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72b40b9c5c91decc82f88a73a109921795b070da66fadbd58695830f64cc6bc"}},{"ruleId":"R3","level":"warning","message":{"text":"src/useEditorToolbarPresentation.tsx: 442 lines of code: src/useEditorToolbarPresentation.tsx has 442 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/useEditorToolbarPresentation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"847f741c3a69e974e56f40d37984fb83db5ea89a42630ec5999958d45a9baad7"}},{"ruleId":"R3","level":"warning","message":{"text":"src/EditorToolbarVisuals.tsx: 419 lines of code: src/EditorToolbarVisuals.tsx has 419 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/EditorToolbarVisuals.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b377a719cb28101da533e9074cd1b6190a9bca67167fb463c2244742c2b9411"}},{"ruleId":"R3","level":"warning","message":{"text":"src/RichTextEditorSerialization.tsx: 413 lines of code: src/RichTextEditorSerialization.tsx has 413 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/RichTextEditorSerialization.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05a4ac130b661a84496e89d3ea3a655923cb25848239b6535fc0839fbce905c"}},{"ruleId":"R3","level":"warning","message":{"text":"src/schemaDefinition.ts: 406 lines of code: src/schemaDefinition.ts has 406 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/schemaDefinition.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37795f7a0b4a71343d78961680f2069cde25ea36fa0adce2e156096fae16ebb2"}},{"ruleId":"R3","level":"warning","message":{"text":"src/schemaNormalization.ts: 405 lines of code: src/schemaNormalization.ts has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/schemaNormalization.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cade9478521b638147305f6c8afd7245f5f621db4c40b1b97d37f08ff21c1d2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c9e0546da0634fb7efa849fff7a5adc35e399874e344c17caabfc9d5b77bff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400402be6e98eb4b72c7975411a80b05a8e128857c17f188fe2e95cc14e93dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/components/LinkEditorModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6642c74740c29cd305f2ab4abb96468e3e4a713adb732be91a7127b4fdae918e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/components/CounterCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621a7208c062662567cca6bf5c1fa81db1ab76b8976f7261739618efed8ba9a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.plugin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0456eeb5ae0f622112356e1c5b6fdb7712c91a4299731b38623569d54257cb7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/listMarkers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf7892a8ff150555caf1169553eb72c4c7e879a200b11b8f36d2623a893796"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The root package declares the lint script \u0060validate:package\u0060 (\u0060npm run prepare:example:native \u0026\u0026 npm run install:ios-test-pods \u0026\u0026 npm run lint:ios \u0026\u0026 npm run lint:kotlin \u0026\u0026 node scripts/tests/validate-prepared-prose-viewer-cutover.mjs \u0026\u0026 npm run validate:security -- --release --behavior \u0026\u0026 node scripts/tests/validate-security-contracts-negative.mjs \u0026\u0026 node scripts/tests/validate-publish-lifecycle.mjs \u0026\u0026 bash ./scripts/tests/validate-generated-bindings.sh \u0026\u0026 bash ./scripts/tests/validate-packed-xcframework.sh \u0026\u0026 node scripts/tests/validate-packed-package.test.mjs \u0026\u0026 bash ./scripts/validate-packed-package.sh\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run validate:package\u0060 in \u0060.\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a99e059e3a0cba570f525a46a8aa11293b8fdff66bdcbb6aab0186748d534a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~285 LoC): no import path from any entry point (98 application, 23 tooling, 167 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf224b72b57c2d63b8665827a62b790d31e43e396a6727b76490dea176cc75a8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~208 LoC): no import path from any entry point (98 application, 23 tooling, 167 test roots considered), but 3 in-repo import(s) from 3 other file(s) do name it (example/App.tsx, example/components/CounterCard.tsx, example/components/LinkEditorModal.tsx) \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":"example/theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9263eb929339c635890e41eefa37e1af5ce95a1d367b802d04ae536cbb1aee26"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~203 LoC): no import path from any entry point (98 application, 23 tooling, 167 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (example/App.tsx) \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":"example/components/LinkEditorModal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"494dcc253886034470c967104e44ec0b6cf91bfa38b3d1882977e0a92a82932e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~165 LoC): no import path from any entry point (98 application, 23 tooling, 167 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (example/App.tsx) \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":"example/components/CounterCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c40964db7b06ec25d50c1c173f521c79d7510fb95c1fa7246c06e3dba229fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (98 application, 23 tooling, 167 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/listMarkers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6971e474ec12f20224dc05295490f659d49bc295752e8a55db7609f66ed4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MENTION_NODE_STRING_FIELDS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129487f111a4a05ef7bd05e739e0d5dfc0fb0933be410d37ac6bd6b95d8f091"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MENTION_NODE_NUMBER_FIELDS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12cad27341b1867c6d793c665dcca0c4392573d00f18c4c76236bd5fdf9f6a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isEditorToolbarFocusPreservationActive\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/EditorToolbar.tsx, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/EditorToolbar.tsx in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorToolbarRegistry.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56559920755b5e13fa61b4edc46b5dd61c6731f5de59444912670596311172d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_setEditorToolbarFrameForTests\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/EditorToolbar.tsx, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/EditorToolbar.tsx in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorToolbarRegistry.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5ae0f7cd7634b16104906fdfd30dae1cdf1074f2ef1c82f07af143a560f9b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_beginEditorToolbarInteractionForTests\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/EditorToolbar.tsx, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/EditorToolbar.tsx in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorToolbarRegistry.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"afafdd99fcc9bc12287e00fabc484120067ba64209d95185dfebdce7803e40ad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_endEditorToolbarInteractionForTests\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in src/EditorToolbar.tsx, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in src/EditorToolbar.tsx in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorToolbarRegistry.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae07473e3636792ca65622f4399cdba3425cb6cd74863645b633b60bc483a54"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_COLLABORATION_PROTOCOLS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cb63e3427f147140d89a102ce92abb18e64fc3690167203c6c0f8fe5ac0c92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_COLLABORATION_PROTOCOL_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e9b3ec63dce78c866dd7c6331a682d261c2706555b8adaab0b6a3304995429"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_COLLABORATION_ADAPTER_FRAME_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ccd522b21b0f995d3520a6271debc6dcb6d5eb8b95459ff6baf0950560754f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_nativeEditorLocalAwarenessSelectionBrand\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/NativeEditorTypes.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd483801eac84f702e32e2c28fbe4894b1eb35afdfb3e5853763018a59471db5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_nativeEditorLocalAwarenessCellSelectionBrand\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/NativeEditorTypes.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e5878337395258a1708b5f0961d444af8d21be22901c0167b2ca46aee5e90"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@tiptap/y-tiptap\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"972c082f17d651058cba20efe789e00f687a480e46bc80d1e431527258092c8b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027prosemirror-commands\u0027: Declared in scripts/table-interop/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":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/package.json"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96785526b409969d8e74fa2ad4d4075f75f456b86de4fdf23c42480421ff16a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027prosemirror-transform\u0027: Declared in scripts/table-interop/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":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/package.json"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b28736258af2aa417c7e425bf188ed4899711ec1ef93034840d43f4ae84b05"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@react-native-community/cli\u0027: Declared in scripts/tests/android-rn076-consumer/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":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/android-rn076-consumer/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc62329cb6ec2bc8bfd02fa28b2d89971082a3afd2dccd8f437de72c2925744"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@react-native-community/cli-platform-android\u0027: Declared in scripts/tests/android-rn076-consumer/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":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/android-rn076-consumer/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"894b132026ba9664990aca1c9aa7a21acbe92f49037e46e8229b60f4e49e62ba"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@react-native-vector-icons/material-design-icons\u0027: Declared in scripts/tests/android-rn076-consumer/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":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/android-rn076-consumer/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dc9eec13c1a9af6e57417114606f946327ebf7e8b3ec218dedf392a99a4981"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): scripts/table-interop/assertions.ts \u2192 scripts/table-interop/controller.ts \u2192 scripts/table-interop/assertions.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/assertions.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a297fd4f6c882f4f7f8761f01db974248071b4701a0236f16cb672ec7e76b88"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): scripts/table-interop/supplementary-continuity.ts \u2192 scripts/table-interop/supplementary-lifetime.ts \u2192 scripts/table-interop/supplementary-setup.ts \u2192 scripts/table-interop/supplementary-continuity.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/supplementary-continuity.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9e59461ec6509196c9c2a3df3e05701dbd22e8f9507e64e53ce64d873b5230"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/NativeEditorCollaborationTransport.ts \u2192 src/NativeEditorResultNormalization.ts \u2192 src/NativeEditorCollaborationTransport.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorCollaborationTransport.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0dfa681e8eedaaa80059106c0f957031238d4565f0f43860ccf680be2fb0bf"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/RichTextEditorTypes.tsx \u2192 src/useTableToolbar.ts \u2192 src/RichTextEditorTypes.tsx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/RichTextEditorTypes.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cc13cdb2ee2cabee256d0f8b0d8bc0faeb0790d9432311fa73c2a5159b10c4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: scripts/tests/android-rn076-consumer/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":"scripts/tests/android-rn076-consumer/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f659ee63fb1d1340134af38a5dd89450e83f8e61471696c08ddc9bb4cf35bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(samples) || samples.length !== 5\u0060 appears character-identically in 2 files \u2014 scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-yrs-document-foundation-benchmarks.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"458e81fe35caec7e1d85002e26dcc0c3317fd8572798063986927840a6d7b581"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(value) \u0026\u0026 Object.getPrototypeOf(value) !== Object.prototype \u0026\u0026 Object.getPrototypeOf(value) !== null\u0060 appears character-identically in 2 files \u2014 src/atomUpdates.ts, src/attributeValidation.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":"src/atomUpdates.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfbb2f50f2897f289fc6d94d970d76c70dfae6b418e4e758abacd81320e83e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(colspan) || colspan \u003C 1\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/availability-evidence.ts, scripts/table-interop/browser/row-insertion-observer.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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0419eb27a4ef8e7b3a5b096c7d3212349163ebe37c79aff77eaf441f31a8cc9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!allowExtraCases \u0026\u0026 indexed.size !== REQUIRED_CASES.length\u0060 appears character-identically in 2 files \u2014 scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-yrs-document-foundation-benchmarks.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e00af3f957ed1f554af7a7351712c7d84a7211b8e7737a6a14d9c634ef68f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!collapsed || !isPositionInvalidError(error)\u0060 appears character-identically in 2 files \u2014 src/useRichTextEditorMentions.tsx, src/useRichTextEditorUpdates.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorMentions.tsx"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"392e8f9836afce28cf3e49c12bb74d1de0ceab42fcabe4eeb5fce33bc09f6f42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!result || typeof result !== \u0027object\u0027 || Array.isArray(result)\u0060 appears character-identically in 2 files \u2014 scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-yrs-document-foundation-benchmarks.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dd20476a8358976bd4958bcdb05ca60345a32e2a4058f0c3cf9257dcb837ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sample || typeof sample !== \u0027object\u0027 || Array.isArray(sample)\u0060 appears character-identically in 3 files \u2014 scripts/check-table-performance.mjs, scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-table-performance.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"609960b55f0fe008f4fef38ce37e55ab0c2ddfccbfc495cbebc49c683fbc1bbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^\\d\u002B$/.test(part) \u0026\u0026 node.content?.[Number(part)]\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/availability-evidence.ts, scripts/table-interop/text-history-evidence.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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1280c10f05f6c3e41a40f82b9ee2e6b962fdc27fbde486279df747204eb0896"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ATOM_HTML_IDENTIFIER.test(name) \u0026\u0026 !name.startsWith(\u0027on\u0027) \u0026\u0026 !ATOM_HTML_DENIED_ATTRS.has(name)\u0060 appears character-identically in 2 files \u2014 src/atoms.ts, src/schemaNormalization.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":"src/atoms.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ffac6fa2c7b13595c020bacf1ef6613863d3055fb22ba1fd6ef164609afbb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ATOM_HTML_IDENTIFIER.test(tag) \u0026\u0026 !ATOM_HTML_DENIED_TAGS.has(tag)\u0060 appears character-identically in 2 files \u2014 src/atoms.ts, src/schemaNormalization.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":"src/atoms.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd26e2305663ddc58a8924394433a4776a50334814769736a5d6f20cb285da6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060boundary.kind !== \u0027rust\u0027 || (boundary.passes === 0 \u0026\u0026 boundary.autonomous === 0)\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/availability-evidence.ts, scripts/table-interop/checkpoint-evidence.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":"scripts/table-interop/availability-evidence.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece70c8f9ba44f02fe47fee4942a3fdb55dbe7573277ecb57597f1d047f7c7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060descriptor === undefined || !(\u0027value\u0027 in descriptor) || descriptor.enumerable !== true\u0060 appears character-identically in 2 files \u2014 src/NativeEditorCreateJson.ts, src/NativeEditorLocalAwareness.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":"src/NativeEditorCreateJson.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a495f7901502e1de8f59f95f7f9e9d021342b83b2116ecd49e4bb237d77bc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060documentHandle.isDestroyed || !isForThisEditor(event.nativeEvent)\u0060 appears character-identically in 2 files \u2014 src/useRichTextEditorEvents.tsx, src/useRichTextEditorMentions.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/useRichTextEditorEvents.tsx"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"254670ee97b68351d2d2433e1da62292fc6646e32bb7f7c8f66f1511608a6a6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof NativeEditorOperationError \u0026\u0026 error.code === \u0027REVISION_MISMATCH\u0027\u0060 appears character-identically in 2 files \u2014 src/RichTextEditorSerialization.tsx, src/useNativeEditor.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":"src/RichTextEditorSerialization.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb49f53c0762e547eee724b4d482da9e31710cce50d159e8448b10e214ebae4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key in CELL_ATTRIBUTE_DEFAULTS \u0026\u0026 value === CELL_ATTRIBUTE_DEFAULTS[key]\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/assertions.ts, scripts/table-interop/table-schema.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":"scripts/table-interop/assertions.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7caeb02842e8cd06908230972da38bd02ada428309772486f5de0548baae6ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left == null || right == null || typeof left !== \u0027object\u0027 || typeof right !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/atoms.ts, src/attributeValidation.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":"src/atoms.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dfd1793164a8cb270aded89e81f8b27adfc5d0a3806e7019dd1bb26bda6b16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node != null \u0026\u0026 typeof node.content === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 src/schemaDocument.ts, src/schemaResolution.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":"src/schemaDocument.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a756717d42fbc3dcaf74eafab7a8fc12f9d33fcc3371acde715aa4908a5ab23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other.source === table.source \u0026\u0026 other.kind === \u0027overlap-fallback\u0027 \u0026\u0026 other.evidence === \u0027live-overlap\u0027\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/checkpoint-evidence.ts, scripts/table-interop/corpus.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":"scripts/table-interop/checkpoint-evidence.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c69fa412d9dc93646e39938b2d9594bf4795af35087ded95c92d9805da2633f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prototype === Object.prototype || prototype === null\u0060 appears character-identically in 3 files \u2014 src/EditorStyleSheetNormalization.ts, src/NativeEditorCreateValidation.ts, src/NativeEditorLocalAwareness.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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f866038731a870325e10ecb3750f6224a9d21ac5f7669ae69c04a4bfdee51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slot.family === \u0027overlap\u0027 \u0026\u0026 slot.proof === \u0027history\u0027\u0060 appears character-identically in 3 files \u2014 scripts/table-interop/checkpoint-report.ts, scripts/table-interop/run-checkpoint.ts, scripts/table-interop/run-continuations.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":"scripts/table-interop/checkpoint-report.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f56cacce95538a5adc7fbf73cf31bab10fcaa0f9bd4a30de1f3c4ec3ad61a50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060suggestion.label?.trim() || suggestion.title\u0060 appears character-identically in 2 files \u2014 src/EditorToolbarVisuals.tsx, src/addons.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":"src/EditorToolbarVisuals.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec30cdcf676326a604dcdd922d152aea8db955f0293d9a2c5c8f72bde03dad75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.name !== \u0027string\u0027 || result.name.length === 0\u0060 appears character-identically in 2 files \u2014 scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-yrs-document-foundation-benchmarks.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b8b99d6d361e2a252f4b5c6a23e1de79931487249ee6e3aa0f7517a6495b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.p50Ms !== \u0027number\u0027 || !Number.isFinite(result.p50Ms) || result.p50Ms \u003C= 0\u0060 appears character-identically in 2 files \u2014 scripts/check-yrs-document-foundation-benchmarks.mjs, scripts/check-yrs-editing-semantics-benchmarks.mjs. 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":"scripts/check-yrs-document-foundation-benchmarks.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0576cd2b38ad2edfa7d43905e92e5bc4331638eb7738244d2c592118a22763c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || ancestors.has(value) || ancestors.size \u003E 128\u0060 appears character-identically in 2 files \u2014 src/atomUpdates.ts, src/attributeValidation.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":"src/atomUpdates.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b488599dbf77c7e2f9113e9203b1da56a19058da2a5cf0a66575ba25ba4114"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 src/atomUpdates.ts, src/attributeValidation.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":"src/atomUpdates.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ca754d4363c47515b58a1344eb9f59dcc3e69f1cdca39f2bbeb7b2450872b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 scripts/table-interop/browser/peer.ts, scripts/table-interop/peer-protocol.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":"scripts/table-interop/browser/peer.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"032e9c6473bf53e10119a3c127245dfe34f5f010dc5a97b0d9c66de51add594b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value != null \u0026\u0026 typeof value === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 src/EditorTheme.ts, src/RichTextEditorSerialization.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorTheme.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4d6b97ceb808f3d08791e8e2b6ffbfac6cca3f4d8eddf4f1b10e99e2440cc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value != null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 4 files \u2014 src/ExternalTextComposition.ts, src/NativeEditorResultNormalization.ts, src/RichTextEditorSerialization.tsx, src/useViewerAtoms.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ExternalTextComposition.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ef47887b127be1dde4d1b267b049293ddfaddfd68ed7d2f1f7bc1c71d859b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 src/EditorAddonNormalization.ts, src/EditorMentionThemeValidation.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":"src/EditorAddonNormalization.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a96d452fc1d33781c8e9be008c0edd8b6873eb8513acfdc76c6806618a2266"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == null || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 6 files \u2014 src/EditorStyleSheetNormalization.ts, src/NativeEditorCreateValidation.ts, src/NativeEditorLocalAwareness.ts, src/atomUpdates.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":"src/EditorStyleSheetNormalization.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de9ea4ea934e4257958bfe034be9a8be80b7af7d9e6e41982ec7941388c86e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 3 files \u2014 scripts/table-interop/presentation-semantics.ts, scripts/table-interop/table-schema.ts, src/EditorAddon.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":"scripts/table-interop/presentation-semantics.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d06984860370a341f7507cb8e43f109ce57f3c2c316827b1f96b27bb1a77df3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value === \u0027string\u0027 || typeof value === \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 src/atomUpdates.ts, src/attributeValidation.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":"src/atomUpdates.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e4c58175ceeb17dae169796d42d28ce1e4c246a80691939a9efd289a5e7698"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060align != null \u0026\u0026 EditorTextAlignment.fromWireValue(align) == null\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt, android/src/main/java/com/apollohg/editor/NativeToolbarItem.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdb7c46aa499164b5d0a89f385beb6274d4890aae01bed88887e91a508749fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060canScrollVertically(-1) || canScrollVertically(1)\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditText.kt, android/src/main/java/com/apollohg/editor/RichTextEditorView.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c582fb6d690934db8c8f7250029c53328e1cd6e4f4d550404c11ac5439f13be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060commitExternalTextCompositionBeforeInteractionIfNeeded() \u0026\u0026 prepareForExternalEditorUpdate()\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt, android/src/main/java/com/apollohg/editor/EditorEditTextToolbar.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e623956e2999d9e5115e232bacf379ee48208f51877251599ceab93d92905f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060drawable.intrinsicWidth \u003E 0 \u0026\u0026 drawable.intrinsicHeight \u003E 0\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt, android/src/main/java/com/apollohg/editor/ToolbarImageButton.kt. 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":"android/src/main/java/com/apollohg/editor/EditorKeyboardToolbarView.kt"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4c0367f87167a88fe71a72f51d3477a67d290408d3a75c749df4a975a559f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.actionMasked == MotionEvent.ACTION_UP || event.actionMasked == MotionEvent.ACTION_CANCEL\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt, android/src/main/java/com/apollohg/editor/RichTextEditorView.kt. 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d3fcc163a653e87bc081e655487b43be03c18dc4b7b0aecb0424d3686ee173"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.isCtrlPressed || event.isMetaPressed\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt, android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302ed21feed684a03b61346ad0699d37165e69e767d2f17ab900919ace8e901"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id != 0L \u0026\u0026 NativeEditorViewRegistry.isDestroyed(id)\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt, android/src/main/java/com/apollohg/editor/NativeEditorExpoViewBinding.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d4a8ab48a96b5eae6b46113c4250a6c7c5c530d5178834790b3be8ded4e46d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isTableCellInput \u0026\u0026 !canDispatchTableCellMutation()\u0060 appears character-identically in 6 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt, android/src/main/java/com/apollohg/editor/EditorEditTextDeferredUpdates.kt, android/src/main/java/com/apollohg/editor/EditorEditTextDeletion.kt, android/src/main/java/com/apollohg/editor/EditorEditTextNativeMutation.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe9851d1b75dc8c5b04f06bcdf1bfa2660d1db261f671ac2144970e850259a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.keyCode == event.keyCode \u0026\u0026 it.downTime == event.downTime\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditText.kt, android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c09e88ef8a09d6e78f4e09a30af5d2e394b6b7908804fcc76c25a0f26f1d57d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.surface == owner.surface \u0026\u0026 it.leaseHandle == owner.leaseHandle\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/viewer/FabricAttachmentSidecars.kt, android/src/main/java/com/apollohg/editor/viewer/PreparedProseLayoutRegistry.kt. 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":"android/src/main/java/com/apollohg/editor/viewer/FabricAttachmentSidecars.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf84946db478dd45a0991fe713d5c16cca984871dea261446281fb02696e7af2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyCode == KeyEvent.KEYCODE_DPAD_LEFT || keyCode == KeyEvent.KEYCODE_DPAD_RIGHT\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt, android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt. 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":"android/src/main/java/com/apollohg/editor/EditorTextSurfaceInteraction.kt"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5623d57dcb48a7933f337e3ae3c7b1ffd58a8f0d772c01058715d475c90817f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyboardToolbarView.parent == null || keyboardToolbarView.visibility != View.VISIBLE\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/NativeEditorExpoViewNativeActions.kt, android/src/main/java/com/apollohg/editor/NativeEditorExpoViewOutsideTap.kt. 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":"android/src/main/java/com/apollohg/editor/NativeEditorExpoViewNativeActions.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"69238e41a903354aee0a676ce8181c2308b977c145eac67c2727969f210a91ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lastHandledHardwareKeySignature == signature || didRecentlyHandleHardwareKeyDown(signature)\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditText.kt, android/src/main/java/com/apollohg/editor/EditorEditTextHardwareInput.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"027df91030467bb308added46b341137e8ee58b543fb98db82e5416fb00f7208"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.fragment == null \u0026\u0026 payload.html == null \u0026\u0026 payload.text.isNullOrEmpty()\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt, android/src/main/java/com/apollohg/editor/tables/EditorTableSurface.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"065701021af19dc41df56d5e4a441826a27d191060066126e64e62faef0d1754"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060right \u003E 0 \u0026\u0026 left \u003E Long.MAX_VALUE - right\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/RenderImageLoader.kt, android/src/main/java/com/apollohg/editor/viewer/PreparedProseDrawingView.kt. 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":"android/src/main/java/com/apollohg/editor/RenderImageLoader.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60ba94663f525c250ba97ac291c57acf7b94f44a3c5cda2f0f95c0b411ff6a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rootTablePositionMap == null \u0026\u0026 !rootTableRenderNeedsRefresh\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt, android/src/main/java/com/apollohg/editor/EditorEditTextImages.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextConfiguration.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae74b72ea14a1bd018b2d9821b2d6fa7948043c8cb74bd94d8cfc1a8a86b7115"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rootTableRenderNeedsRefresh || rootTablePositionMap != null\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditText.kt, android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditText.kt"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dd7bb347a751ec4ef7c2ec558a3f34b753ff0b760cb4ba2f2aa5ea7433b234"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectionStart == range.start \u0026\u0026 selectionEnd == range.end\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt, android/src/main/java/com/apollohg/editor/EditorEditTextSelection.kt. 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":"android/src/main/java/com/apollohg/editor/EditorEditTextClipboard.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a7c7c4d47fc09407a42ec0a6a2d1755a5d529544cd865063d40c639d12b6e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u003E 0 \u0026\u0026 total \u003E Long.MAX_VALUE - value\u0060 appears character-identically in 2 files \u2014 android/src/main/java/com/apollohg/editor/ProseViewerView.kt, android/src/main/java/com/apollohg/editor/viewer/PreparedProseViewerManager.kt. 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":"android/src/main/java/com/apollohg/editor/ProseViewerView.kt"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee9cdee3995b810d36458f7dfe5c4211c1b392915f36e2114796d30bf015cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!child.is_text() \u0026\u0026 resolved.parent_offset == offset\u0060 appears character-identically in 3 files \u2014 rust/editor-core/src/transform/apply/node.rs, rust/editor-core/src/yrs_engine/compiler/positions.rs, rust/editor-core/src/yrs_engine/mutation/lowering/attrs.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/editor-core/src/transform/apply/node.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"567af75e1f211b024e5b5e8abfb4e6aa7992191e847a3a775576a68155f1edfd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.node_type() != roles.cell \u0026\u0026 cell.node_type() != roles.header_cell\u0060 appears character-identically in 3 files \u2014 rust/editor-core/src/tables/commands.rs, rust/editor-core/src/tables/projection.rs, rust/editor-core/src/tables/reference_grid.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/editor-core/src/tables/commands.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789f778381f0df089b5469910f87866bea5912dc3b05b0727f75d1a2a6fa47b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.rect.row == row \u0026\u0026 cell.rect.column == column\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/tables/commands/paste.rs, rust/editor-core/src/tables/interchange.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/editor-core/src/tables/commands/paste.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8d47cc8d355cfe97d97a64f37828d902c5b202081f0b3625beedb42dfc0576"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.node_type() == roles.cell || child.node_type() == roles.header_cell\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/tables/mutation_guard.rs, rust/editor-core/src/tables/reference_grid.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/editor-core/src/tables/mutation_guard.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e27961fa93b47d15aa8671c14860dd0ce61c8bb85abaac5642a445f742232ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060collect_lookup \u0026\u0026 lookup_attribute_work.failure().is_none()\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/yrs_engine/codec/projection_match.rs, rust/editor-core/src/yrs_engine/codec/projection_write.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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c02db7b60a0dc504971f920d928e2dc031718fc62227551b03e7c08728896"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060collect_lookup \u0026\u0026 lookup_capture_work.failure().is_none()\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/yrs_engine/codec/projection_match.rs, rust/editor-core/src/yrs_engine/codec/projection_write.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/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb6660ca91f1c34ee3a2b523a252425de50a6e8b480e0ad28c0dedc617f8a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060from_child \u003E to_child || to_child \u003E content.child_count()\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/command_planner/structure/diff.rs, rust/editor-core/src/yrs_engine/compiler/positions.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/editor-core/src/command_planner/structure/diff.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccef3c8329005f11f9a60809cfef84dd6a05a04b06a1e4430079a00b4cb65da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060localized_derivations.is_none() \u0026\u0026 !prepared_candidate_matches_preview\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/yrs_engine/compiler/operations.rs, rust/editor-core/src/yrs_engine/compiler/semantic.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/editor-core/src/yrs_engine/compiler/operations.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"56714104651365a8f92f79ad7673da69a2b66f9d63a2e6c17c78240e8489ffae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.html_tag.as_deref() == Some(\u0022p\u0022) || node.name == \u0022paragraph\u0022\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/schema/construction.rs, rust/editor-core/src/schema/mod.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/editor-core/src/schema/construction.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71246e7d0aaf84083941db83c1a3af73cf8a53643f21ccaa3d83d548f4919d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous.is_text() \u0026\u0026 child.is_text() \u0026\u0026 super::steps::marks_eq(previous.marks(), child.marks())\u0060 appears character-identically in 2 files \u2014 rust/editor-core/src/transform/apply.rs, rust/editor-core/src/transform/apply/validation.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/editor-core/src/transform/apply.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bf0ccda4889e7c8a30cef189251c8c1d08ec8ef88d1e14e6d5d3fa9b312843"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060txn.store().pending_update().is_some() || txn.store().pending_ds().is_some()\u0060 appears character-identically in 3 files \u2014 rust/editor-core/src/yrs_engine/mutation/plan/envelope.rs, rust/editor-core/src/yrs_engine/mutation/plan/model.rs, rust/editor-core/src/yrs_engine/mutation/plan/preflight.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/editor-core/src/yrs_engine/mutation/plan/envelope.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd77bf4f946d75e85f5bfe9b3ebdb931ee30a19035dc12ba65373b71245ce55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$0.isEmpty \u0026\u0026 $0.width \u003E 0 \u0026\u0026 $0.height \u003E 0\u0060 appears character-identically in 2 files \u2014 ios/EditorInteractionOverlays.swift, ios/EditorTextView\u002BCaret.swift. 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":"ios/EditorInteractionOverlays.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea93c056b3d009769e4cd9ef47576e5adf6620446e91ed4f0084797a267ba487"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060autonomousOwner || richTextView.textView.ownsNativeBinding(adapter)\u0060 appears character-identically in 2 files \u2014 ios/NativeEditorExpoView\u002BBinding.swift, ios/NativeEditorExpoView\u002BUpdates.swift. 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":"ios/NativeEditorExpoView\u002BBinding.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f3f65c645f8b34e409c5804065c8581783777abe0d259976714d2c804e06d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060displayScale.isFinite \u0026\u0026 displayScale \u003E 0\u0060 appears character-identically in 3 files \u2014 ios/Tables/TableGridLayout.swift, ios/Tables/ViewerTableSurface.swift, ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift. 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":"ios/Tables/TableGridLayout.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"48335b82f0d776ced74607397975b13d4baef47b66f1db91a726a8bb14c2ba2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.domain == \u0022lifecycle\u0022 \u0026\u0026 (error.code == \u0022ENGINE_DESTROYED\u0022 || error.code == \u0022ENGINE_DESTROYING\u0022)\u0060 appears character-identically in 2 files \u2014 ios/EditorV2Adapter.swift, ios/NativeEditorModule.swift. 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":"ios/EditorV2Adapter.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"48211e7eb4d3a38028f06a729f8d80e967bcd0f671d39564308e9b77c0d4baf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.type == .group \u0026\u0026 item.disclosure != .none\u0060 appears character-identically in 2 files \u2014 ios/NativeToolbar\u002BButtonStyle.swift, ios/NativeToolbar\u002BButtons.swift. 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":"ios/NativeToolbar\u002BButtonStyle.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac8e27fb8daa3f5e1b27920fa83f8a96458fd2490cd239d6c220f6bddcca69e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060markedTextReplacementScalarRange != nil || markedTextRange != nil\u0060 appears character-identically in 2 files \u2014 ios/EditorTextView\u002BMarkedText.swift, ios/EditorTextView.swift. 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":"ios/EditorTextView\u002BMarkedText.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ccc40245788ff54698ff140298c5ad9ce4ff999c8cb9878c852cc02dcc5f44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nodeType == \u0022hardBreak\u0022 || nodeType == \u0022hard_break\u0022\u0060 appears character-identically in 2 files \u2014 ios/EditorNodeTypes.swift, ios/Viewer/CoreTextProseLayoutEngine\u002BAttributedText.swift. 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":"ios/EditorNodeTypes.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4902a85fbddf5969c548ba330ac09f1679177bb8aaf391797850684fd15dc4d"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let _ = self.serialized_len.set(exact_len);\u0060 follows \u0060{ return None; }\u0060 (line 828) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc0f3e238bb876eca97e89bede36638690583984cd95460ba70e0aa7524435"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let next_document_revision = checked_operation_increment(request_id, self.rev\u2026\u0060 follows \u0060{ return Ok(HistoryPopPreparation::Unavailable); }\u0060 (line 203) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/undo_redo.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe036ae899c03923ca6aa451f3804737c047337c27df78425d4b0e87092cbf2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validJsonValue\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 472 (\u0060validJsonValue\u0060) with a piece of \u0060value\u0060 (and at line 475) \u2014 and nowhere in \u0060validJsonValue\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060validJsonValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/NativeEditorResultNormalization.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2991383cca8d6a03b99c3d371cb264f61ce2f893d92f346fdbba1eec3e467"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validateAttribute\u0060 is exported, takes a document from its caller (line 67) and hands it to \u0060validateJson\u0060, which calls itself at line 32 (\u0060validateJson\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060validateJson\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060validateJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/attributeValidation.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db743c147a843d4d385d48083799c8aabd10527210cfc3414e90edbc2decdf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validateAttribute\u0060 is exported, takes a document from its caller (line 67) and hands it to \u0060equal\u0060, which calls itself at line 59 (\u0060equal\u0060) with a piece of \u0060left\u0060 \u2014 and nowhere in \u0060equal\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060equal\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/attributeValidation.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db69ea697fa81830b5061c4e138681c5a8e8331f3f35e775aceca1b5d264dfb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060node_text\u0060 is public and takes \u0060node: \u0026Node\u0060 from its caller, and it calls itself at line 223 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060node_text\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac32f0e7dae9b18bda9a4093ca3c66e81d2ce7ec0e6e41b3cea699b4353186e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060document_node_count\u0060 is public and takes \u0060node: \u0026Node\u0060 from its caller, and it calls itself at line 562 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060document_node_count\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/editor_state.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b0d7f5b92923bdd1193f0866adcee92da56bb9e83a4f346002eb089d754880"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060node_text_bytes\u0060 is public and takes \u0060node: \u0026Node\u0060 from its caller, and it calls itself at line 445 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060node_text_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9130e15a601c0bcb2302780936957a109d87bc97a5c8d61eea412a2e72279878"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060prepared_nodes_metrics\u0060 is public, takes a document from its caller (line 451) and hands it to \u0060node_metrics\u0060, which calls itself at line 506 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060node_metrics\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/plan/estimate.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"170ed8f0d0d8c88b60b409c443bbaf660f02029ecef153b7678c8b0c82381612"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validate_fragment_marks\u0060 is public, takes a document from its caller (line 371) and hands it to \u0060visit\u0060, which calls itself at line 386 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/input_limits.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399464fceb611bab0445cacb7a84601d1ca1575da4a748485123ea7b07078ff"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tables_flattened_into_blocks\u0060 is public, takes a document from its caller (line 143) and hands it to \u0060flatten_tables\u0060, which calls itself at line 161 with a piece of the document (and at line 167) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060flatten_tables\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/mutation_guard.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5d2b6f6734b6e7c10bfbc56c49925a253ac8e8e523b957b08738221f8852dd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060TableRenderRecord\u0060 as its receiver from its caller, and it calls itself at line 171 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a45e4b1cb858045970c64259e43756ed6258504dfadd20cb7c37a6e4d0a73a3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060RenderElement\u0060 as its receiver from its caller, and it calls itself at line 123 with a piece of the document (and at line 127, line 128, line 135, line 144, line 155, line 156, line 169, line 170, line 182, line 183, line 185) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9e789702e9117ef092b896f84e2f0edcea34e4010fe2dfdeae6044f8bb11eb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060render_element_bytes\u0060 is public and takes \u0060element: \u0026RenderElement\u0060 from its caller, and it calls itself at line 24 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060render_element_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/output_bytes.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4600d9f760408668eb63a92be5372a218af8c7a3bb94e47103ca3fea0c6c833"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter\u0060 is public and takes a \u0060Fragment\u0060 as its receiver from its caller, and it calls itself at line 46 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060iter\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/fragment.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b64636d6cf3e5776bce60d7e94454ad25fc8d7ed06ac993e78a24c9f0f084b4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060NodeData\u0060 as its receiver from its caller, and it calls itself at line 56 with a piece of the document (and at line 57, line 60, line 61, line 68, line 69, line 70) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/node.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd410e6dd2adc483075f7f3805c4bca6f9fccae17d14c0f9116601d764c56040"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060child_count\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 269 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060child_count\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/node.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d71f12b96d4983b5e339fca637d7bbf5cc72a3033f039c7401fae5cb57b3a7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060child\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 277 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060child\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/node.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71f0cb9c7fb0d62f94dd5c953635b861d4bff523c597324d2254c075423faac"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060replace_node_at_path\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 325 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060replace_node_at_path\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/node.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a380b0b656af42249f633f614a7adba37dea080eace73aa0b0e90284df970b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060transaction\u0060 (line 419) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commands.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7470fb6edec98a8ab4fb0eb85cb788d5034ac71f31883f03622ea9b26a84b31"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060transaction\u0060 (line 598) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commands.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"258efbe41f4e6367dc4f1492f722fc7f4ff4aca98f8910f50b466659ecc35090"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LocalEmptyInitialization._kind\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbe796c34969b3fa0a8de2cee2b1e1af0ad402c0e891cdbf54ba9de76678a65"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LocalJsonInitialization._kind\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6043b614c1a84980fec908dd0c861e4a82f644988918b1f2f1587b403ec1cb9a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060LocalHtmlInitialization._kind\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c95fba3aa3987b6add5d227d5090115e1aef8dbd519774b94a45844eb61201f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RoomInitialization._kind\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4d97d3a2ac102a75a48a60ba5a658be15895578120d6d813afa3329119bb3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022DEP_MIMALLOC_INCLUDE_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/build.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf48ca3ac530f286df8db0c18172e0533870e4c5ab0589a7231884ed1bd9079a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.checked_add(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d99cad882a99c482f8dd56447e90e934574ac393f93e5daf06ea6d6c900014"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.len().checked_sub(len)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_json_value_stack_safe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca04892e4b89eede68088793f843cbcc71652b63b9786c27b8948562746b40b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.len().checked_sub(keys.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_json_value_stack_safe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58aa3ea1c2497057432863495bb23aa861453c45f6e5aa5162cb168eb209eab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_json_value_stack_safe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a0b292966a749d066fcc457a9c5869a3cc35850b7b998da19f85bece86d274"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write_json_value_stack_safe(\u0026mut output,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_json_value_stack_safe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaa5950cd70991dfce92e7bb3d293d2e9af052b46cebac9d6ac909480b94e30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060string_requires_json_escape\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/boundary.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dd6c06a6635829d4469ee20d0976df862e7a8bc0aa2c9bb8a9742d11269bb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060left.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join_edges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"631c11b30f9ea9b0cc0576af729bda353edbe6109127fe5985dad68bbe15eaee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join_edges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83fa759f73940dd366aee3e9dd73e0da0466b84dc0a2c3c9454b4716e23defa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join_edges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/clipboard.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47c2b2f7351febe5141af308d1d9bdf7b87fab9722e401e0407f79d4bd1554d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.mark(mark_type)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_mark_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/command_planner.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bbc6e2774ad3e161c6afe93ad4ca8ad6bbe103064d052f4986227dd816c12b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_surface.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060command_applicability_with_known_node_count_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/editor_state.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"21292dad996a82126b4ee4ce7c0d7c28bd30584d646e277727616cbb277fa10a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060map.block(block_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060submit_selection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/native_transaction_bridge.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcf426325da1c1568d6ed902c3d223316b93cce03bd52032d7f7cbb0201b93c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060iter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position_epoch.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b783bdc6ea294695459d503c78d24665e3d6797827bebdf059219fec5c38ce0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060installation.replacing\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position_epoch.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"443da62c4b1f0570a601b3bd92c2c28f541e2bd017043c692c96d8f6835c097d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_outcome\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/table_interop.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f5593a8d85338798775f3613540265a01125e1c5b5cfc9ba049468db0f4ae8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060position_map.block(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060for_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/block_branch_index.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9d21628cd2b45e14a3c5f528b43a30c363173e19c9133e3a463b80db73f9de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.blocks[index].as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/block_branch_index.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956444caeb2deedb55d6341c28335a8794511b1085bca2fa0b9624192b20657"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::serialize::json_out::write_node_json(\u0026mut counter,node,schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060measure_node_json_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edcc12dde6b63da9cbfbf9f4eb564d7d192f8400127721d645d7f0e9fd38aca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.write_canonical_json(\u0026mut serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonical_json_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd94d43efb24ae5b339a0d59fb40beb38adb911b9d13ba4d10f52961b04b678"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060projection_hash::projection_sha256(\u0026serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sha256\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3088aa7744db7d9cdd8212c1990a766c7c58e01ca4eecb289b34dabc982fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.projection_sha256.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060projection_sha256\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0da2795ba6f1eef317e1c973ef677d15fe62dd3271c0f025c9ab4348b024aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::serialize::json_out::write_node_json(\u0026mut serialized,document.root(),\u0026self.0.schema_context.0.schema,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060matches_document\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"056491c8b916b84b635fa087da842c2815ae78ff8b821722f1b836e214acc2fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060projection_hash::projection_sha256(\u0026serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sha256\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ce6d09052e1600f6bb587e5e0ab508835803d322bfd51bf8bed03513e98268"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.projection_sha256.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060projection_sha256\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/canonical.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d342944165734ae0b0ad36e6a5fdc1814c07a478e9594410eb05d14745c65a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.canonical_artifact.write_canonical_json(\u0026mut serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060document_json_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"becef4b4b559c8385a75643b7cff5c1fa467511f607ef7508ddaa9681b742cdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(serialized)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060document_json_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"511296d70d9744bba1f1dcb1b94584654572efd6966f5b81d748d3189d65f1b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060txn.get_xml_fragment(self.fragment_name.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reset_history_binding\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c357ce9f70d8b2d75552d4c7cf9e4a7e97d59591db74d2290353f89b2feb9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.slots().after\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060set_after\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5e9a8227ad99b8343cb0709ff8fdf963484b7943315dca27f876a54cc02781"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.targets.peek()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff4375a723bbd9f7a881497e59856a3f2125b209e2c72d0c1aaac9c01dd1ba9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.targets.peek()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8725d2653eac8420c833be8d4fe329c1660b58cb2a1ab6f3aeaae53d84953aed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060scalar_prefix\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/position.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fbbd977bd94c6f1f6718d69f6ff72568450defa91196f829feba20df66d34b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060staged.materialized_identity()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060into_finalization_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/prepared_admission/deferred.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bdf9e2d3d891bd63973fa891063823f1d4e1fdda21864bdb5f8515f7f2ee75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepare_direct_root_wrap_batch(request_id,operation_index,list_node,schema,limits,true,)?.metrics\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060direct_root_wrap_metrics\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/prepared.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f2d39e203a5c8e0edb7ff9e8feaf4909de180fabcfb088451980597bfcd5d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ready_payload()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_authoritative_store_rebind\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/mutation/lowering/index/lookup_seed.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5349b42ec21271ca30ea299c7a5285dfbef9573a67ee215c8f3db4081d9385"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060after_metadata_bytes.checked_add(if compatible{0}else{self.retained_before_metadata_bytes(\u0026before,rolls)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_capture_with_limits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/capture.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"78962e25e22ea39613458ee11992e49322d2ec8b0c8c7274125f61f1a561895f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_capture.lock().expect(\u0022pending history capture lock poisoned\u0022).take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_replay_capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/capture.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b17deb6f0a0e1ca81fea1eaaa948dba7a0fd678c23f506f2c53a073b6e6431c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.replay_metadata_bytes.checked_add(metadata_increment)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_capture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/capture.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a32bfddf47cd93dce27f0f3ec00640ffbe61c5138a18aa88b958b4cada63cb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replaced\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060exclude_protected_containers\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/deletion_filter.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30d6bbd31d71f34b2fc064bef7fdb0f93721dfad95f3bd95f5edf4a3f744b44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060after_metadata_bytes.checked_add(if compatible{0}else{self.retained_before_metadata_bytes(\u0026before,rolls)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pre_admit_recorded\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/recording.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"39213e314dfc47ed213164341c84d22c77fd35f0f587024fb2082fcc2270ae02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060candidate.manager.undo_stack().last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replay_into\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/recording.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4cd765b1476063a8f7535887803335ba33481afb6eb92253858e2f1cf865b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060replay_slot\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_prepared_excluded\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/replay.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec13ec7647474a79bbd3ae2fda5efe2488e9847ec277f19e36d4062660eec776"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060beneath.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060isolate_top_stack_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/replay.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f5bd6c7e8a58c63c835a7f52f7712fe6f996a5e2ebad1fc959d236ef878b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.popped.lock().expect(\u0022popped history metadata lock poisoned\u0022).take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pop_isolated_stack_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/history/replay.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"167cc9bc0bf61614a8ba52d443f1ab5f5e2bed462bf8efa41bcef6dae360ff82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060txn.get_xml_fragment(self.fragment_name.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit_candidate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/candidate.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b7c90598cd74d3ec92bcba69ad0e52d30713193ff623f4620b4bcdfbdb355c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.derived_state.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_compiled_transaction_with_history_and_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5496a9a1854445dfd834737acbff9b8a9dcd77acdab28e23e1bda1c8765666"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.derived_state.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_compiled_transaction_with_history_and_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbe3e7e2b81237efa180d0812669fda1d18b33b36fd09b678d591a7538b2d48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060render_cache\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_compiled_transaction_with_history_and_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6919f514141e54cf1d338727af9d60ac996b2c72c5ff6220a97b68b016afe9db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060history_after_template\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_compiled_transaction_with_history_and_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33a31461e620bdc838be0d52afa1fc2a5dc80ce11368b9ad94a6030a99a9508"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared.history.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_prepared_yrs_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit_installation.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"93585fd83ae8ada929f4317c9b153ca167921531f22fa85a0c14f0106b40a3a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared.mutation_plan.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute_prepared_yrs_write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit_installation.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ad3b955abe943e9656cf172ecb9320bde4b3e048956fff25b240ea57fdc9a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared.next_derived_state.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_prepared_changed_commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/commit_installation.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"892d52f5895dc94e6acfdc599193e362dd78f785b95fef8ffe7440bab6314d73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(scalar)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spans\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/position_epoch_cells.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1dcb1f1632f2c65893e4d4febc6150862dbca5b3292d225edd393176349603"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(offset)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rebuild_spans\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/position_epoch_cells.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f132bbd3b61915d83fe774a940d9ab913f8e8804577e2e6b2aa633f8d8dcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::serialize::json_out::write_node_json(\u0026mut fingerprint,child,self.schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pin\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/position_epoch_cells.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e462752d88db0ab95a03e85822b47ab0cf591923bf31e6dec0c6ebd6ce58ebe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060collect_nodes_starting_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/position_epoch_cells.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad33297d992624d344d64d15f40c4984b5959280b55abf2f3456fbf8ab1d3507"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060txn.apply_update(live_update)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit_prepared_remote_update_internal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/remote.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d486bd54ca2a56d41ba9f110c478e77dd964ac630228218c841faa902f79c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060next_state_revision\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_selection_commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4799b111be4f1771e1d2e21548171068ed71d069d4c8728b50f5d285f6b42244"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.derived_state.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_selection_commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c540833b5a79b7c55d50470b4d0794e062a0a1d7c7d126d987440bef0db7ca3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.derived_state.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_selection_commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/selection_commit.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af876f29687c79fb1ac177f8746fcc9308da5d8c9a5ade267c54845fde00bda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060txn.get_xml_fragment(self.fragment_name.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060restore_snapshot_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/engine/snapshots.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"de584a5cc2b387296f86f18bc0c4158140e05fd1e6094b0853da8cca4ca7853f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.state.position_map.block_path(self.admission.plan.leaf.block_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060block_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/insert_admission.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"445aed2b875afcf382cbd677ad8701219c0f9460992c13f5469d4a445f4850c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cursor_sticky_index_from_doc_pos(txn,fragment,mapped_position,true,schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preserve_with_mapped_fallback\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/selection.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac6f1c03709337b408c170937e2742d51987adc4f543dd763feed68fdbe0e7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sticky_at(position,Assoc::Before)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060operation_result_to_relative\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/selection.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e81e00a8b6768df24b85bde3e30b21c600ab97149c347cbff509f730118a87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indexed_view.and_then(|(index,map,document)|{index.sticky_at_doc_pos(txn,*anchor,Assoc::After,map,document).or_else(||{index.sticky_at_doc_pos(txn,*anchor,Assoc::Before,map,document)})}).or_else(||cursor_sticky_index_from_doc_pos(txn,fragment,*anchor,true,schema))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060operation_result_to_relative\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/derived_state/selection.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3baa54223bdaa6b3d1295eeba4c1ec47664a251660edab06a8231c67e3f1a38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared_semantics\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_transaction_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/semantic.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"346eefe8b3b03b6d6d28cb454796b35c622c00fd83d5299afe6ca5dbdce770de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060localized_format.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_marks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"550e56b17c18810061a40822bc9c7a2f54619021354839570bef06480f6b3a5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060localized_format.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_marks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/marks.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c25cb3c439a092585d199b1f3f8cfe27d1ce286aef44d9d9f71e401cbf40e26"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060localized_root_window.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_structure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/structure.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f059ab018f3cf7564d2b7015ef2e0a4f204a8a85fe3bbb848bfe7a351a742"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060localized_insert.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffeb87f0969b492c69a3ecf2f6045868e2cc5b3a5b34e04fdb0f708a4c96a2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.child(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9a1f693dc30fd4617878dade05e0d2f89de30c945516fd927a698dae776da7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/compiler/operations/text.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2404254dce6b9904ec1065a65a6052733a4e2461436ea53aeb49cfe132caf71d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060candidate_seed.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060semantic_transaction_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/commands/text.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c66f1432fd56614404c9643245d00b3174319f5372ec325c61c3f94ac880166"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060attrs.as_value().as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060prepare_element_attrs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/mutation.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"69153478c456dd8a0d797236703d408fd481477db57aa2a05b139d63dce410fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_text.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060observe_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/yrs_engine/codec/projection_match.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9d203b3fb44f02222dea08136c3ee3c313327649500e10a7e731de4cefafdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(serialize_json_value_stack_safe(\u0026value,0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonical_attrs_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/viewer/compile.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6980e510d91c12b406696707bbd36b2c39db41f43d37889d49a99b37beb129"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(serialize_json_value_stack_safe(\u0026value,0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonical_list_context_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/viewer/compile.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1fd9e87429362c40a69fd0ddfbad9f52170b96fef7efbec38073c08f20a50b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.len().checked_sub(child_count)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonicalize_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5758ea65016b8fd88b081d26d05e2f804d07ace6815a760445b6ce8648aac36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060canonicalize_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eb7d21689c1ae1242e5533f3eacf0b00c8d73426c6c86c50990cc950b557e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.map_position(pos,false)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060map_pos\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/mapping.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0785970b4e0f3e7654f8d9bcb50ba152ab79d84939007d98b5ec52888fdadeab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_text_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/steps.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c3333ca85725470c07a266a2c2e5a579dc0b3ed9725222b2bc699d4762c95f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060merge_adjacent_text_nodes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/steps.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7af25923e3467f5578a22deb3229165e0352d3d44cdb0372a1a965468edb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060merge_adjacent_text_nodes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/steps.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c183e18f56a5d7eae959dace5c1e46a05a5255301c28c48c9f590f0cad6f36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060grandparent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_split_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57b00340df8cc013b95883e3f638077c9c5e4eeda38b5b74f61701b1d84caa6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.child(idx-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"133ae3aeadad8905359a873c1e9f3f362baa2d90d9bf8a0c0b48ce9b4f8b20ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.child(idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b8c941184ffdfa9067cd3a15cf09aa8fbdd42598a7385cfc4697f691a20c01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060first.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb886303f32e360a9a2638b553c845afb341246d06090156b1fbb7280517a88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060second.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/block.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b9c57e065a453a9cab586425ad29d7a3c62344925a75c8d8896b2b9f7af87b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_indent_list_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"578804c3f622ab606717f2c824f7482741b0efcdbfc442f87d98af5f7f38c8e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nested_list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_outdent_list_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974115c33e98b87e994baa87712016ea19a7fab7a8a4e60174b8da42b827fa7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nested_list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_outdent_list_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e76aca6099c414de69185d539067019dc3df2f9f4981cbfc81a0243d1c602b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent_list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_outdent_list_item\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_indent.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fba43687fde3b92ae5d8afcf7060f69df901b28eed76013fc0418764e41d3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_block_idx\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_wrap_in_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"346855b990075072b3d0c5805e6c03e79cdb5af4857edb2a2c2512e6e0c40e67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_wrap_in_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5319886929bae234ec5b7e65431138ad1c20bf7148b3efcd089ed98d59f99a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc01eb1fe015387cf106bc7f18b798fbd90313dea46abf393d09560d536f7ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4302d3d9b38636a014fdb4c633bb18af91153f73f04158d3d048c565f6513d6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4bc9c77bc89a840beedd9a9b9c6720a3f0edb895788ee14c287d225ac6d47a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b12c785c885161062e044bc5764792e66fb9506f400e1de101696aac0da613"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4140793a0a4441157fb47435a4f1ab25bef25e993daaa13e0ca67e22298182b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd7b80b507af6702045367099a6e628f33b3700cf638217c7957bab9843725"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.child(idx as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a71dd9e9b3d11eac1b24df965c74ca37c5ac7616e5a68a8d33689d71255a6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list_content.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_unwrap_from_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/list_wrap.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d238066b98a3f6254b79fbbdaa5ab48f68955cd62967bbc24aec5edc704cb18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060insert_node_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"88600d59b9c4edc279386c4d2e20193a1a59a429c0674f7c8fa6ff8a8d3af1b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_replace_range\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5959039c530ef27c4fde2614bce6c552d21ee47d5cf1a160e04e8db4e5ff025"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060insert_nodes_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"029d120b9a28596fb36b0597d29268decccbd025387369893ebee013ff6725d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_cross_parent_replace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8950c61b645384128912493c56d1926dd616a15bef3635778bf99307fcefbaa0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_with_two\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e64b6d256636a561da45ef2ee64ee97cf781d9cbd9d657fbc88fd8a5ce2cbe4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_with_two\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28028b972108fac8b377ce8d955097358c58d260b28fbfba46d4334303d1b87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_with_many\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be6e684329bd7266b4cc497c0eee47f445d8b1af630c2fa38a0c7e187b3bdf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_with_many\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78873b08e6f7fe1f86e93dfb3810d54328d829a4e0610982e6253a12c566ce3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_at_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/range.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3837b4c32ba08036540e29b1f0f96900daaf96fafb0cf041e4da3b5215fbaf77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060insert_text_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac847d8c5faa5bd0bb7ec80e4a60a18eaa8a71154b140d6a111948af93b65949"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060delete_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32577b65beaf4e41f999e3fc218e064fbc42faa183b2d26236924a9e5828ffc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060delete_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a8ee9b14462cd3be312be1ff901632e036926ac8d6340cbe186659a5f62c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_mark_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"864ba7d22433ff5282ead518a13aa821dbdb2007bc2892f50b5ee706de8a1925"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060add_mark_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea781e068deac2f1f866c15bc963a5b2bb735b45fd10260e3ed78ac0dfc3ec1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060remove_mark_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"60518bb645abe6bd1a41c34d2e969d3becc2638bc15c0c1f9d63382d77318786"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.text_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060remove_mark_in_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/text.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3a7c9e4acf2834bc58355af9fa8ae9a47e0edaa1c5378bb8bb71b969533970"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.mark(mark.mark_type())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_mark_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"783b49f9c2d747b1f971537d8f2197f4e4e74b2f73fee736e92b801940a1a24f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060placement\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_opaque\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ad1ab95544eccb7ba9dbc9bd712bef58aab6203593c48047ceebde0272ed6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060placement\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_opaque\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/transform/apply/validation.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c4480d641951b823cb6fc18e334a2e0e0aacd27ffc80f087a597cfc4663321"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(attribute_key_bytes(digest).to_vec())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attribute_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4853c48b10192e756e952b6ac1811d6d729536b35e837a18e4fd013a48537a3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cell.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060content_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1834663852483a253282ead682ca737636f92c352d1d93d4c1fb639f79786aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::serialize::json_out::write_node_json(\u0026mut sink,cell.child(index).unwrap(),schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060content_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de50697fb8f545345a83c9a69f27dd4600e5e25ec69e2eda678f5d7bb0a8e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cell.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_cell_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111a74feb423bbd39d842cf333545eb261a2ef6bbdfb0504b0dadee9dcd3fb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f3652030cdf456636ef732747bd9261a82574d9342fc0f7436683a0d72e2e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b56ea9ea311b9adb656a5092313e9df494a7aa69962144bbc843f943d88aba2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(row_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb0a0371a80dc987e5fa072cb484c03800b936f69b8d591f5c03b15dca69ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row.child(cell_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060generate_table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"00692ce856a228c23b0e1acd9c514405bc17cc1dd8fc6e9369fae57e7fc1d2f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/tables/render/content_key.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"df306aaf055b89a1c005d97b69433a4523da45f072cf59bb2c1b82d25aaf22b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::ffi_v2::render::table_keys(\u0026self.engine)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060retain_native_render_cursor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/session/native.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f77b9b2ffecaf48d1ae07db29b0338bf78abad3ddd513a3c329a8fbfb2fe87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060html_tag\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_nodes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee0aeff34214a53f1bf2fc2a8a67c4ea61d8216f8369e273fd218908bc579d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spec.html_rules.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_html_rules_node_open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf8666ddde735dc331774aac75bea13b3b456edeeb6b42107384cf42d447f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(crate::boundary::serialize_json_value_stack_safe(value,0))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060json_value_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d418235e25043c1b52402fedb452e46893e14904014473966bfef501eaa5881"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022\u0026#{};\u0022,u32::from(ch))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060escape_inline_html_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/html_out.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef570cd219861218efa89bbae081804f6690870e06cc44c279e77d4fc66ad6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"776260146be07efa16fc47e61fe2583e4805e65c3f490e0bee2d5194e4e3281e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.len().checked_sub(child_count)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rehydrate_reserved_html_opaque_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0478d236e1e261983e0880c0a0855aa825252787ef8c751a76ce3c729e212"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rehydrate_reserved_html_opaque_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_in.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aeb1e6a32d8902424f73e508585d3bd1be2e10d4ab959deabcc82d2899672e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.len().checked_sub(child_count)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060node_to_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_out.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa1481485b306aff3d167bd162fe92ac4eaffdbaa3a83985fa0fe4f6ef8a15a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060node_to_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_out.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d5d51a8d9e8ab89476271bd8c6771bc798884c9fc369a7b537a104cbf93181"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060built.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060node_to_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_out.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa178106a8a7afc20d62ca96c529ef357f8550716a662fe4b70a82e3491c0103"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::boundary::write_json_frames(\u0026mut bytes,frames,|():(),_|{})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_attrs_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_out.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbe42c9a6172a442d1c8eabd26a49d9fe21c7802578ad910cc81ee6fbb64bbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_attrs_json\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/json_out.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"020656a05a1aecf2f113e590ead3e56d41915f194924220262d3da86abbcc476"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(index-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f132751cad9a6a5568b25bdea5d8218d626ce316fe625cf59b5ad0f0a6bcd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060join_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3d3f7ec82fc3414bb601ac7c5f98465fc737e2dbca0230228a808859daf0c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d1459bd479c30cb6cceb6ce85f4310e456109ff1c346ea1791d2d5b199fe31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa6d521fc87e27207df42278f799357d4f2c6d0ee268fcf633c7dde10be27c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8b94b994825a4c280af61769d2343c2c02d61a8bb00ec355b975a8f6fdf14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cell.child(0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b42df29b5b385f3cef97c437d67c42c625bfb759fe14565448b8c1ddef3cef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffers.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d7ef44d228322e711b91ce574c5722a01ee35eee009b848a9e5f8fbb39e54"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffers.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"05934571c778ad272b8cb48421ab47b09e51d0881050aecae101c912ca67604f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffers.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_mark\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad020c83f61ab1c7a699b53cb2b88c3eb93ce4d5cc08b28c3ac39ec7b65b7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer.mark\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_mark\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d0a25bf848074f282461ef609cd1ed5179d8c91ac4632d0932380ff187d351"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffers.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close_mark\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/serialize/markdown_out/inline.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95bce0586abc560491d85420c69bf7ee8e907a53c5932cf64c43fd8b679d800"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(nodes,marks)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2ecd4a50f15754c6aedca6e058d4a2f24d92daada7713f0c9790104fcc8e58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.html_rules.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fda4f0184a4f487fd8b1e4e528601318707d42c27b51e0a58b622aa6835b68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060previous.html_rules.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c367ccfbc16ba70f9ec6306b02b00ce5a2ae7ac1504629ec5ee9c36bf28cd7ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.json_projection.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38cb72a77de01174d92400dd6dd772b6be1d6c4923a4c72a8e675e77bdad67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060previous.json_projection.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec285b61a7106b88d78d4d6201decf70bf2fb82bca0813ebec9ea7c7c10d531"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc_names.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4f25baa1512a012206817bc720d9fd63bae5fe224b7147dac3bd9a9f26e777"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text_names.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_new_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e8a0ade04406f6e837534719a9996b72f76989a07203a2edb4ed24f0a1f5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.nodes.get(\u0026name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_constructibility\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"01126bf5d5e626b2d7543509359d9086315e8f659779b38fca0648257ac6aa44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.nodes.get(\u0026name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_constructibility\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/construction.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5423ed29a300227fbdf5bbac10ba5e78196951590d0aacb05dfbb71f873a60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parser.peek()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_with_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/content_rule.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8418ecbea3aa3f33fc915fd91376fae6146c0ab0a1081d98dd808ac9bd31f58e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.compact_closures(\u0026WorkBudget::new(usize::MAX))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compact_tables\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/content_rule.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8d938d3b5bb50f6aabb29aca200fbcc96a569d30030ef8df8a5e7cf5dc4bd8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_f64()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/fingerprint.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c9a5ea299acb80235f4ad800e762e59ec4de0d7aaf09b5a0b3361e04c352d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026canonical)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schema_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/fingerprint.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e287a3941d7c9c21fe543bc11b7971a458fdb4731850649f2b534dc7559af31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(TABLE_CELL_CONTENT)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060table_cell_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e17237974ced626a4434d73ac0cbb7ad8b7f9752d77d6a0f6698c8cd0cee33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0026format!(\u0022{}\u002B\u0022,names.row))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060table_node_specs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e74eff7201d3d7e2678a7ba1cfcc77ed64b37eddb4f55dfc1a4548db2e00cdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0026format!(\u0022({} | {})*\u0022,names.cell,names.header_cell))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060table_node_specs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eb0c06f81bf4727705ec41d2148a7f3105a24844cdc8619f994427352b9e56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022block\u002B\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24005f511c7a7ce1aab913d79f73a84056d3a60ee144f9831e255d526c0ba3b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022inline*\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ca496c06154244a9fb863159d2aed9f1edba6509cea1aa0722915cb6ec7b7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022inline*\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a543457a095437454427fdb77a2572dfcca9bc1b3e742ffeb02e3754fed62e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022block\u002B\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891cfdc3efbc425e57f68fceccf0977655260d3928ca7c4201862372a7f4fb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022text*\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"af781254cd83d5315e7e9e0e1b94ddfc518bd28fdf2531d1947a8ba8bad61c40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0026format!(\u0022{list_item_name}\u002B\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43a3c2e41e1a98f5a2dc593a55d3c40b3baa50681d59aea19a9db9b01fe721d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0026format!(\u0022{list_item_name}\u002B\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"397e6c58dae1c0996fa64a8f8f5595b3e99c0daacd15555c131326aaa12a89eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022paragraph block*\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3974d8fb247e95718fb5e72fa067f98df0bf787687db71e43eb8200ed6a64d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"35682dac1909ed306c507de819a6267be922f0367767966c1e663b9b66f7145b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d8dbc69709eac60c71d1112854265140d9648be9d06cff1666d82ed0991fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3d7f4e59b7c8932e2d9b0cad8631bc94725a0d298645df7c44cff293bbab36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0022\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"476f2c6cee07dee6ee2de464ccc150595b38ad0d23536823d0751d50a5a15f9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.iter().find(|node|node.name==\u0022bulletList\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0cf81b7e18689a11aa6ad4587521f5c500e447cfe19eb205a437762afd7c1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentRule::parse(\u0026format!(\u0022{TASK_ITEM_NODE_NAME}\u002B\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"07323ef60ea5e6630f57ccc3354c56179b31f7125f87e4b9f615cd2e75ef6000"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.iter().find(|node|node.name==list_item_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_schema_parts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/presets.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ae1137af070f0ca76505206b2ac8fc6fc8a07788b8c2eabe5d5064a6ad2132"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060attr.default.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060construct_default_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/schema/queries.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669c96cb69955a9ea51384c04e64888cde7b09cca2b7435734b347f273c26f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/generate.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6b563dea8c5325d1402c9cf53656e3712d96a2d763f753823d51e6c2b7447e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root.child(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_incremental\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66ff53a926f9af60ffc2768c5f5f8ac43108fdf557f4823c559364b1c4ad960"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060try_incremental(doc,schema,affected_indices)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060incremental\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6096ce765a76979a3d281b23a33388445303fbab366bd179e2dcd5cc8595098"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060try_render_blocks(doc,schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b41e93958bdcf002fa76c3f80f77da82ccdc94a005a12ca00dc9b2c644def8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(j)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd8d6a854836a85b8c2f44fca006d71680b46a250021146acd0cfbbc45d83b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(j)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8789c7848e47e24d0601e28ceba3b00b4de2aafad83bcb1218464f5a96e2be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(j)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"92220232e9d06c07b9cea08eb095ed1949da9bb28d399ff0d169d04cf992f395"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(j)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda24e4cfb2754d73bde7e2994c6ea011b5f64af3c66b2adaf58fd48afb0c4fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(j)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060generate_block_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/render/incremental.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"6217853c2b39dab354416c9310bda84b16b3cf4513ab4734117fc49e00d1de01"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060blocks.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060walk_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f1b64a2b612023c6583f0abc2381dd25dff85015932020bde2442400feb888"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.content()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb49519b6bc649f90b6f65843e9b12f725c1738963a1be6a0c1951fd8775685"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060blocks.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060walk_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22fefa562bf6b359acb82e3eebf78e5b64cad12a14b3826bec7661f37703a97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(child_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_node\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fe290ef488296fc1dafe0f8b6be5d1c6cab148ec7303f3d046d5a90777ace3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(child_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_marker_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"856e80cd4da43ec6d761a9be3faf8887c22b70448846bab59a6f93b0bd187d98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060render::ordered_list_start(list_node)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_marker_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1e481a2188b4f91780796d93221e901277c394227b263495a2fe948e65e735"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start.checked_add(item_offset)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_marker_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ded315f1a67ebb4a4fc4293e49f09a900cba0c9974ea7cb995c8d751ebefb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item_offset.checked_add(render::DEFAULT_ORDERED_LIST_START)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060list_marker_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/build.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8691413c6d9d34519f4e737503c5b778321935c03cb2d32cd1ad710dcb43d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(self.blocks.len()-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060total_scalars\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f58aff618c2b63323cefd38d1058d6779dbe330488d121b490c222c77fe4ab1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.offsets(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060effective_doc_start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5491c016e040644960aa7371756351eee83db9aefbeb5f357cd0cc30103f38d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.offsets(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060effective_doc_end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"102dd483818f26a92f8443f58358135d352526712086990f0c10c16e08c9d3da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.offsets(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060effective_scalar_start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f976a5d3c9431ec2e5e671dfe6ae0f65cf80cfcbfc55d978565b289e90c4704b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scalar_to_doc_metered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29eaf77e915c507c6bfb818da0d0689b93a368d4ee3f9891b0ccdac74111b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060doc_to_scalar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ff4c73de58d6603d6fad16068e57f4a2dfde11d8c81a1b52f7be48dc7d961d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060normalize_cursor_pos\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e13aee8dfab81596a96a951bc6f7651bb596330e21208f83d8c8d046257b77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/storage.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"477f2f48227560c892eb17095ed8a68a45b74a5d6345d795afaa798979b85157"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060iter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/storage.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02a8d959ec674201f6c487791b0004b0faba9e92c9a9f6b0c04e9d7d0d2b315"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(mid)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partition_point\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/storage.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e465d425eab25bf7f7c2e9abd861df0d1f09fd0bd9fd029de5ae289c0e0b3418"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prepare_incremental_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/update.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4143b1b8a7a378a1d1d36a592ce01ed56bf2eb9b65eb6c3e9a64c81fd34ae52b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prepare_incremental_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/update.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d724c2115a839da197fd892b36dbb91628da2932a1d54f2b851bad12538261dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.blocks.get(block_idx-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prepare_incremental_update\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/position/update.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"488ff868d006856deb78fad1b4a0048572ccaf318300cd39b395a69d943e0def"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut self.data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060replace_node_at_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/node.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f0855f8dcad2718a6ed9bf8ba4c9c01edbbce3f8a85c91d61eff1c6ae10a0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node.child(idx as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parent\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/model/resolved_pos.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24be47fc197a98c69a59231f1fcdbf0148968710bfc6fc591309f970ca4890"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026html)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060editor_v2_get_content_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/editor.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab5070672b9209482aae448e55b1371d85253365959cc6d14aaf043a5d998ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060starts.nth(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cell_starts_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/native_frame.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bda146fc03a4b380c62b1aeb53fb23667cf05b47090ce5ea59fc93e2ec6940"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060position_map.block(last_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060extent_for_blocks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/native_frame_mapping.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"13087461f1a379d0a37ead3e7077625922821de16fab225085642336fc91c123"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026snapshot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060editor_v2_render_state\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c96791c72ff205180370c538407baae9777b51d3a0ab33e2fb38edc7e860e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026snapshot)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060root_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9046ec82da440cb4966f1c5c9ac028b0886ad8ea00684d226f055b6b5f9d291"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::value::to_raw_value(\u0026values)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060serialize_root_block\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"0136da7f7b3a2c7551f7fba384e3b31a1fed5fecae37161fe3cb8d271ee1f770"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decimal_u64(engine.revision()).as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_state_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ff951776e98445b8a29c6630e6d5704b829d62a2837a87ba9a85c305b84921"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decimal_u64(engine.state_revision()).as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_state_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af8b06abd1a3d90333764f33f2fe5ef02cdcfe10478c9f808169b6093fe477"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(render_state_fields(engine,None)?)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060native_selection_state\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/render.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de98649f5224661a2ffbf9a4f3e4c05970ff1b59c499ac0e0b5958c5c1bed2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(Some(value),None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ok\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df9f6fc201b8b9b3bca1bb13c5d61ec516712f08e2fee62c26849477c78f5c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(None,Some(error))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060err\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8d440f95dd07f8ee4e6c260f9b4edbf3562214dbb04dc1a207255e10bf675e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(Some(value),false,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ok\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e7bcfd7918f4a078fe710df02d83952cfc24fffc8639cd6aafcb8d8c5a297"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(None,true,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060empty\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1406e158635668990a2bec745fa5eda3321e3afd251d926fbfc5e8595addb206"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(None,false,Some(error))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060err\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbfe040f9f66aedce47d6380b486db29bad970eaf6358a8032bab18ddd35a24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(Some(true),None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ok\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b344a03617719fc26121c899471dac8c6a2669d05a4032f2f8cf52d144f561fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(None,Some(error))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060err\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/ffi_v2/types.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0bb5d673f6891ea148118e661761dc22c417452feaf2381b2de1a81bd5f844"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.awareness.pending_withdrawal.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tick\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/awareness.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e42328418d9eb8bec2bcfd9dbf2e21d3bdc1f00c1cf45fa8c151db5c45dbcc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.awareness.pending_withdrawal.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060tick\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/awareness.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b759846532a11ab2972af3eb153ee396aa1cff3e9fa4623ae9ca828fbc0d4f4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_protocol.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b23ffda7b9f1bba81a603c010e8fb4781ced4f367015404410049a8ac22803"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_protocol_bytes.checked_sub(entry.message.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf8a2192401fcba6230cc4ce83940e404286be8c7ea3df34807c452cfe465d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_ordered.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"55651513e3a7d1c7d0e12ada097ab6d2f7a4d222593f06bfce80eabe55f44754"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_bytes.checked_sub(entry.update_v1.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bae4f924b1b7706e6c7038cb95b39129f7690b87d75125b185ea9925e19da96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_ordered.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adcc1413a3634b930aeee739795341d3e8083bb9ea4b47bc68334affed3825d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_awareness_bytes.checked_sub(entry.message.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ack_lease\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d24a3d97b1153e0b0a5cc18b52e8327acf29d45a197d1a5115f8826b7bbc8f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_protocol.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_leased_front\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"2952ba8643411ad46c5ccd5ee4a2d665a093626408177bea60709ba53c745484"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_ordered.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_leased_front\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56011e5af3aee7619c36e1ba59f6f9236b48715cfd0f8d93709ac04e4c14874"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_ordered.front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clone_leased_front\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/outbox.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"8897c79d981dd66a5dbf2d50cbcbf9b9c61573064e0b9c8787d3d41a0739bad6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060transport.socket_closed(request_id,generation,failure.close,now_millis)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060receive_message\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dc64d3dd56f8561fd914e25d626f3bac9aa2502bc5a91d5fefb9d445199bb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060transport.mark_synchronized(request_id,generation)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_step2_synchronization_gate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust/editor-core/src/collaboration_runtime/protocol.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2b5085eda9ac2525ed8e70b80fbf7a2ff39070e848b81c0655a7891274e48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cache.remove(index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060highlight\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/code-highlighting/rust/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3f254da20548b19df38d64fca95d6f1c48179fbd550acff475edb60db3afd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060preferredHardBreakNodeType\u0060 swallows every exception into \u0060\u0022hardBreak\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/EditorEditTextRustCommands.kt"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4fd91b3d455fd8fe6286003cb511f95d6cada4ae899ec7c9b51abb21ddff2e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060peers\u0060 swallows every exception into \u0060emptyList\u003CAny\u003E()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/NativeCollaborationTransportRegistry.kt"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f17c015a9d374754e8536ac0a4362c960ef33da9a3410e14d2973e0f9f970"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fromJson\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/src/main/java/com/apollohg/editor/RemoteSelectionOverlayView.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"558b10d2e9a8f66abbc7152b8f274279f83dd9d6681fe09b6f42441b6fd36d99"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060cacheStateForTesting\u0060 turns every thrown error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/EditorV2Adapter.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be10cf8c0577268b7f148ec3fbcce4a6ce1584e860843fc719e2384faab961f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060atomLayoutsJSON\u0060 turns every thrown error into \u0060\u0022[]\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Viewer/PreparedProseDrawingView.swift"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa18ea26ec6030c34cbfd3110ca208b78608a8c5b2e2e2da3f9846407670f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060highlight\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":"packages/code-highlighting/rust/src/lib.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fbea5133be9aa62dbd44eb164057ecd7e0619cb47947a8d928807ba7872fae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060targets_in\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/editor-core/src/alignment.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7198ad1568fc3a0d8f20bf02e28cacc2ced96d7c0a8491000073d71cd1f85035"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nodes_at_position\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/editor-core/src/editor_state.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"2357247a65f455c14bc5793a087bbaa206bcb046ced8abdca5e5e47fd08502d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060continuationTarget\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/table-interop/continuity-evidence.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5682e2c7047136a9c658a0fe09fd5dbfba796fe42e55f53321fe7d1e56ab1f15"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060validEditorMentionTheme\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/EditorMentionThemeValidation.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeaf65cb6b9604a6bb08608041df55427317e9dae667ecc5cbe1a73e8c6cc58"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060acceptingContentSymbols\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/contentExpression.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"21200a5657fe313f51f6ddc4c9eebf25f0701a865f128b86577e36a1ce05ff25"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"Improper Export of Android Application Components","shortDescription":{"text":"Improper Export of Android Application Components"},"helpUri":"https://cwe.mitre.org/data/definitions/926.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":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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":152,"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."]}]}