{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"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":"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":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"LockedUseBrokerCoordinator.handle (cyclomatic 178): LockedUseBrokerCoordinator.handle has cyclomatic complexity 178 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c119b5db0f4660cea2d53ee1a5fc44488aaf3b38cb94c61a95e25f60cab2d51c"}},{"ruleId":"D1","level":"warning","message":{"text":"LockScreenInteractor.probe (cyclomatic 99): LockScreenInteractor.probe has cyclomatic complexity 99 (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. This shape REPEATS in the file: one other method here (LockScreenInteractor.probe::visit) 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":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff69c1f3ace4058b5f6a9427bc09ba81f135cfc91409575c3be6c7c64b1df80a"}},{"ruleId":"D1","level":"warning","message":{"text":"BrokerServer.read (cyclomatic 55): BrokerServer.read has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"96238c6937061a20b18973e8e131fa279adef9653827f3e299cd3d26175db9d1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppAgentConnection.handle (cyclomatic 49): AppAgentConnection.handle has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47f73420ad364deac740eb27362d39ff970201c79b8539a34ff6341303887e"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardianMain.swift.runWatchdog (cyclomatic 49): GuardianMain.swift.runWatchdog has cyclomatic complexity 49 (threshold 15). Of this number, 48 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":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7da0f9f838b6e2a6e8385d0a5ee6b6257720ed644cec167f716340d36ff6c0"}},{"ruleId":"D1","level":"warning","message":{"text":"GuardianMain.main (cyclomatic 42): GuardianMain.main has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa03405326b35789cfbb62af27c375114f03e2550833f3150e02094db2767e83"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayGuardian.poll (cyclomatic 40): DisplayGuardian.poll 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2bb22b39bd293157bbf290198f2597b1d03f34f731758b91d959b0a40e4634"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeRenderer.renderSelected (cyclomatic 40): TreeRenderer.renderSelected has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eadd52d941b0bc97fd905dce88da1fb6099231516f09da0970a84f4b618dd69"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCaptureConfig.resolve (cyclomatic 39): ImageCaptureConfig.resolve has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 10 of the 39 points are its own statements and the rest belongs to 4 function items inside it that branch (number::valid, disabled, number, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89ae77e8e565ece4c881e6957a84f84d45cf2c2bd4cbedcc1995a1efd298dd9"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseUnshieldedDiagnostic.handle (cyclomatic 34): LockedUseUnshieldedDiagnostic.handle has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseUnshieldedDiagnostic.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91a8f51078e90cb57de1ba3b85abd2f8288d3840db97530a614b66d6ee7445a"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseRecoveryRecord.validated (cyclomatic 33): LockedUseRecoveryRecord.validated has cyclomatic complexity 33 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 5 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseRecoveryRecord.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"155e07282190d72c0b38b9d2e1f4f31d60b83af75f8033fc4dba4fee64646677"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.perform_operation (cyclomatic 32): runtime.perform_operation 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":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"019d2bca5531e010a4242a1bbaeba3ab3374459bcbc88f262cc2fd65b08a6845"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseSecureStore.read (cyclomatic 29): LockedUseSecureStore.read 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseSecureStore.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeb442232fa1fd6dc20f67f81587311e72fb1af1259d5d72fc4bce4b25233db"}},{"ruleId":"D1","level":"warning","message":{"text":"UnshieldedUnlockDiagnostic.swift.runUnshieldedUnlockDiagnostic (cyclomatic 27): UnshieldedUnlockDiagnostic.swift.runUnshieldedUnlockDiagnostic has cyclomatic complexity 27 (threshold 15). 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, 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":"experiments/LockedUse/Sources/Guardian/UnshieldedUnlockDiagnostic.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c261838d21d82ce2bb522dca1a34eef3698be4007ea6d7abe24e9547b6c7faf3"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerUseService.click (cyclomatic 26): ComputerUseService.click 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce086fabdc80c8af4ad9d125fc8ff79951d9b34939b9033076435a3e51d69522"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseConnection.acquire (cyclomatic 25): LockedUseConnection.acquire 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":"apps/OpenComputerUse/Sources/OpenComputerUse/LockedUseConnection.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbdbe2ce5c7410ad9d4bfddf20b503df9d75a66012d639f7afcf7897d72da54"}},{"ruleId":"D1","level":"warning","message":{"text":"BrokerServer.start (cyclomatic 25): BrokerServer.start 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":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"52889d0f3f8d14139d72885eaf7771c0e3d36ef9572cb8d2481edd9fb4f639d2"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallerMain.reconcileStoppedGuards (cyclomatic 25): InstallerMain.reconcileStoppedGuards has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee29205d06b5b6908020c4010fcd20bdcb7b8b97275c7beb014cfb8db05790f"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenComputerUseCLI.swift.parseCall (cyclomatic 25): OpenComputerUseCLI.swift.parseCall has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"316ff48d414eabae0b587f36853094f38347c26cdf8ceed660ee2bb2e12dc0b6"}},{"ruleId":"D1","level":"warning","message":{"text":"service.callTool (cyclomatic 25): service.callTool 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d869b8a700df04f1fd98c2c771b80bff39ec5c4c222447d03e7593a2eb202c"}},{"ruleId":"D1","level":"warning","message":{"text":"service.callTool (cyclomatic 25): service.callTool 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d434a5fcf2bdadeb0f27d089a6afb7ddfc8d99e8cdd30e1ccc2eae74c6423e"}},{"ruleId":"D1","level":"warning","message":{"text":"LockScreenPresentation.presentation (cyclomatic 24): LockScreenPresentation.presentation has cyclomatic complexity 24 (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":"experiments/LockedUse/Sources/Guardian/LockScreenPresentation.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"725508c49608c0eef3b4dab0dcacda2ebb762bda4f8ec92288f7a04d1b025e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeRenderer.plan (cyclomatic 24): TreeRenderer.plan has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae742fd798ea39e0bbee412ea7f5bd05e46b595d3f1bd940829e648a743ead3"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseStateMachine.observe (cyclomatic 24): LockedUseStateMachine.observe 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseStateMachine.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cca0e01a02aed18d592857ee23a3f940e394a0089cd35193cfa0783c71a8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenComputerUseMain.run (cyclomatic 23): OpenComputerUseMain.run 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":"apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f45e1b6c9575c4d8ab664a6e1a7db78ba2aa20a388d741e4127fbf8144ebb17"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerUseService.performAXClickSequence (cyclomatic 23): ComputerUseService.performAXClickSequence has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8947992b8a0caf842a395ddac00fb09ffebc17e5840abe7ac974370746b0cb47"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerUseService.typeTextUsingAccessibility (cyclomatic 23): ComputerUseService.typeTextUsingAccessibility has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7381c7d5ba4c5242224beb52c246042881d7c9a31f112929c7284222c6aeac8"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenComputerUseCLI.swift.parseSnapshot (cyclomatic 23): OpenComputerUseCLI.swift.parseSnapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87eb18311a56f639e050def5d368dd1036625bf1e521eadddaefb1437f36cbd"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runCallCommand (cyclomatic 23): main.runCallCommand 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"057aa994d99ee6588b1e872377853be4b33d0514ed6f4e6ab718898fab25efa0"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runCallCommand (cyclomatic 23): main.runCallCommand 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbed29c002adc462a7b23683f3675ddcaaf20ae2adc1a9fc1a4dd2839321c8"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseClickAllowance.accept (cyclomatic 22): LockedUseClickAllowance.accept has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseClickAllowance.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd7917b4af43336553d87c38af79c114b9c664f1f23200b054503cabe8656c4"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runCLI (cyclomatic 22): main.runCLI 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7badaca7b5fb734e1b8b409e89f2dded79a13fb9062537c604b763b39b4cd3fc"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runCLI (cyclomatic 22): main.runCLI 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3725c2e44b120f64931c490b2dd161b7d1e11759eea1356b231e306dc20a008d"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallerMain.main (cyclomatic 21): InstallerMain.main 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad0d462e8b05125a9c0425a375cfef2539df2ea50bba2ad07de3cf4cc081db7"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUsePrivateRecord.write (cyclomatic 21): LockedUsePrivateRecord.write 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePrivateRecord.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d51b473d3a334e4bf806a7d88946bd24c7b09d93a2416e133e0c7eb3c5c9900"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionSettingsWindowReader.context (cyclomatic 20): PermissionSettingsWindowReader.context 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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa13aba9893d01c18c431b3b17260270f48e397e90addfa33d10788fe370a46"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayShieldSurface.coverageFailure (cyclomatic 20): DisplayShieldSurface.coverageFailure 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":"experiments/LockedUse/Sources/Guardian/DisplayShieldSurface.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c108a1564b62db2b81a901821a9e4e375bc2b1a4ff564103e14f5c9f0f8e8b46"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotBuilder.targetedSearch (cyclomatic 20): SnapshotBuilder.targetedSearch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69b5e97840c73bccf1366856bc59a04f95818b4ac6136e53dfb255536d91b77"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseBrokerCoordinator.reply (cyclomatic 20): LockedUseBrokerCoordinator.reply 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b91ad4d7caa5724c9f4abf0d7421c8249d499efc171695762bd0b7099de06b7"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseIPCClient.request (cyclomatic 20): LockedUseIPCClient.request has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPCSocket.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea659900016421e7bb333b2ee910e2384c39a287415594d210581cf69e22ee3a"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilitySnapshot.swift.preferredDisplayTitle (cyclomatic 20): AccessibilitySnapshot.swift.preferredDisplayTitle 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e164fd2f8d7a459b9b6e3800d00eaec8219d3f97824975206b217d1c57177c27"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerUseService.swift.isLikelySyntheticSideActionCandidate (cyclomatic 20): ComputerUseService.swift.isLikelySyntheticSideActionCandidate 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f97dd0aae0edb69590233da2afcf5f5447327925ac657f8bc5590f61328c796"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallerMain.install (cyclomatic 19): InstallerMain.install 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e483b178253c396c7a6ae85593e6a849e0029152918d9ad323df5866488520f"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseGuardianPolicy.poll (cyclomatic 19): LockedUseGuardianPolicy.poll has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseGuardianPolicy.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6a5b0613dadab9e5847f732456c564129e3ffd2728e3fdac6e83ef9204d6d0"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUsePeerIdentity.verified (cyclomatic 19): LockedUsePeerIdentity.verified 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePeerIdentity.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c16412ef3c3343e348d680d1436727a67c67291b9c45c5e039e54995d8564da"}},{"ruleId":"D1","level":"warning","message":{"text":"LockScreenInteractor.wake (cyclomatic 18): LockScreenInteractor.wake 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":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a21ec16bd2b6899fe80a4f0fcc31144eef94a5533822e054b53f492d5d2019"}},{"ruleId":"D1","level":"warning","message":{"text":"LockScreenInteractor.probe::visit (cyclomatic 18): LockScreenInteractor.probe::visit 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. This shape REPEATS in the file: one other method here (LockScreenInteractor.probe) 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":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9873c48ee699f01dd4e23834b67c135f9e3e4f5af6db1c048e247e282572e42"}},{"ruleId":"D1","level":"warning","message":{"text":"PhysicalInputMonitor.start (cyclomatic 18): PhysicalInputMonitor.start 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":"experiments/LockedUse/Sources/Guardian/PhysicalInputMonitor.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c03b882dd9c814fe006c8cede6e6b304c7f74113b8ba11b8c2ab4182d73c13"}},{"ruleId":"D1","level":"warning","message":{"text":"ElementIdentity.read (cyclomatic 18): ElementIdentity.read 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ElementIdentity.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a4360f05a6e4a309f2f7e7d0208b42f43bc7aab2a0d97ee2ff7675fe5c056d"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseDiagnostics.current (cyclomatic 18): LockedUseDiagnostics.current 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedff5e394b2daa923d8cf0810a86b5f33f01e0e76a4acae5a570024eb30dd71"}},{"ruleId":"D1","level":"warning","message":{"text":"LockedUseReturnAllowance.accept (cyclomatic 18): LockedUseReturnAllowance.accept 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseReturnAllowance.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc75272148d74d9ed11f7941fc7c6f86852a6466cf24a1cc30e2d6b6241e22cf"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayGuardian.verifyCaptureFixture (cyclomatic 17): DisplayGuardian.verifyCaptureFixture 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46f781ea1f48ce9cbd2a4ac7fa8b38eb9736933860311287662aa00beb7f1dc"}},{"ruleId":"D1","level":"warning","message":{"text":"ComputerUseService.selectText (cyclomatic 17): ComputerUseService.selectText 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351d9f07c9e970cdcb317320ceb714d680f0788ceec58bf1687ccee6b0b8659"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilitySnapshot.swift.encodeScreenshot (cyclomatic 17): AccessibilitySnapshot.swift.encodeScreenshot has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8837d7e6de4adbddb7b79160654f9a38a7667209b06220910fb7c4bcc8b291fc"}},{"ruleId":"D1","level":"warning","message":{"text":"AccessibilitySnapshot.swift.shouldElideNode (cyclomatic 17): AccessibilitySnapshot.swift.shouldElideNode 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1084979a196aa1c5355b8a61f447ade485b6ade1b5b97be6c5ed1ca5ddfb5e08"}},{"ruleId":"D1","level":"warning","message":{"text":"service.click (cyclomatic 17): service.click 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0f3f18041aa3714000734c0bf61138e4a76e408d94ae91b84c023e22479f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"service.refreshSnapshot (cyclomatic 17): service.refreshSnapshot 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad82dbb25f97adf85e0e8c1ed51b954a7f38eeb03edd56dc407f004e68bbbd"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionListAnchorSearch.first (cyclomatic 16): PermissionListAnchorSearch.first 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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb822f06875d5dc242bd82653f53c3f8c8108698b402650962347e902393ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayGuardian.start (cyclomatic 16): DisplayGuardian.start 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa61452caaa184d13f19dfa21295c3e9390d7f996b7e7eca9f6079b45d5d0edd"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayGuardian.installTap (cyclomatic 16): DisplayGuardian.installTap 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789295d988c62c5c0c8da737f78dfc8d91ef5ceebdee5c858032465707e6c19"}},{"ruleId":"D1","level":"warning","message":{"text":"SetValueReadBack.swift.normalizedSetValueNumber (cyclomatic 16): SetValueReadBack.swift.normalizedSetValueNumber has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SetValueReadBack.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c40d89fe44fc693205205af5f6c993684e42bf9377756a19fc1e753d2ed60e"}},{"ruleId":"D1","level":"warning","message":{"text":"service.click (cyclomatic 16): service.click 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c804175dd02566ef2630ac176481442c1502f2d4515902fb6db544c9836451ca"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseBrokerCoordinator.handle (cognitive 216): LockedUseBrokerCoordinator.handle has cognitive complexity 216 (threshold 15). Drivers by points: if/else 53 (108 pts), boolean chains 104, ternaries 1 (3 pts), match/switch 1 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64059012fcdc89f31bed6fef9cecb27f047a04f6212e251d5bbe34e16d315cb"}},{"ruleId":"D2","level":"warning","message":{"text":"LockScreenInteractor.probe (cognitive 116): LockScreenInteractor.probe has cognitive complexity 116 (threshold 15). Drivers by points: boolean chains 75, if/else 37 (54 pts), loops 3 (7 pts), ternaries 6, error handling 1 (2 pts) (nesting depth added 22). 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. This shape REPEATS in the file: one other method here (LockScreenInteractor.probe::visit) 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":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d352e516533b8ada68fdf8d6a7ada11c5fc785b4010403b207b82e4110ec0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerServer.read (cognitive 112): BrokerServer.read has cognitive complexity 112 (threshold 15). Drivers by points: if/else 28 (78 pts), boolean chains 21, error handling 4 (11 pts), loops 1 (2 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5253b094c87da84c04b01f3412bfe92523e36869075268b100077e096b80c6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"AppAgentConnection.handle (cognitive 102): AppAgentConnection.handle has cognitive complexity 102 (threshold 15). Drivers by points: if/else 22 (79 pts), boolean chains 13, match/switch 3 (9 pts), error handling 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"304bfac636db8136c422be2da2a06c4728f924ac340f99f31414f779cf8d8f71"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardianMain.main (cognitive 63): GuardianMain.main has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (49 pts), error handling 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbf27a4551bf2c5ec0836ce3ef3bfe97ab55a1be3cc83bc5a75a21d8d7c8ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardianMain.swift.runWatchdog (cognitive 63): GuardianMain.swift.runWatchdog has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 25, ternaries 2, loops 1 (nesting depth added 14). Of this number, 62 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":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f486782c5bda1fa1a64ddba77ffe83c01b603e03a2549efc29e9a1aa126629cb"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.poll (cognitive 59): DisplayGuardian.poll has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 18, ternaries 1 (2 pts), error handling 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"da785b3438c4e5622d4baaa77fe45f948e30571888d61d505051816829930d17"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCaptureConfig.resolve (cognitive 57): ImageCaptureConfig.resolve has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 16, ternaries 2 (6 pts) (nesting depth added 12). Of this number, 17 points are the body\u0027s own statements and 40 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac4530e7ce92d409b8a1e75f363963744d705e498ab572a521df2869416071"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerUseService.click (cognitive 50): ComputerUseService.click has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 2 (6 pts), error handling 2 (4 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"393654d6af3a2fe5d7f153d055d0e0bff6194a4a5db5bc232be863dfe243040d"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerUseService.performAXClickSequence (cognitive 47): ComputerUseService.performAXClickSequence has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (10 pts), boolean chains 8 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49134ffeb8916b1e544bcef32a9a9116fa649da8b86521664fcd31e62e8a398"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderer.renderSelected (cognitive 44): TreeRenderer.renderSelected has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14, ternaries 12 (13 pts), boolean chains 10, loops 4 (7 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a518b8e773a43f042674654d033597b56f8e397873a169d3418b510b34ff074"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.perform_operation (cognitive 41): runtime.perform_operation has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4ca9a8e2916ec21f0dacd4abaf819ab54df4976e894ef8915f7a863e3f9af"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseUnshieldedDiagnostic.handle (cognitive 39): LockedUseUnshieldedDiagnostic.handle has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 20, if/else 9 (18 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseUnshieldedDiagnostic.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c0bcf66f208c57a9bf1bbf546733924877263739760fac191c0a1d509fe296"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerServer.start (cognitive 38): BrokerServer.start has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 10, error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc30e53b7233a1e14bcfb2184a4ee9f1fe436671e2c15c31cb7a6535461e4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseIPCClient.request (cognitive 38): LockedUseIPCClient.request has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 8, ternaries 1 (4 pts), loops 1 (2 pts), error handling 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPCSocket.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7777a7f5c7dbccfc7f3586f9877fd0c8731252de733fc664aa13f1611ac2a4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runCallCommand (cognitive 36): main.runCallCommand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 2 (3 pts), boolean chains 2, 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff761fc4103941e8bb6a30575c0a1d50385e77cdfde0edb0e9cac7237c0807"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runCallCommand (cognitive 36): main.runCallCommand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 2 (3 pts), boolean chains 2, 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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e48cbfaf53b57b6dbf7e38e469f8ea3bd368a521e3665a904cb64eb3d5cb084"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseSecureStore.read (cognitive 35): LockedUseSecureStore.read has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 16, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseSecureStore.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c33df68fc20ae8267e71a63735416ed11aa277f542f8e3e4a92c96e6b1e8e73"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenComputerUseCLI.swift.parseSnapshot (cognitive 35): OpenComputerUseCLI.swift.parseSnapshot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 5, match/switch 1 (2 pts), 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ebe678e593f4d1e259d290c3fdae58419aef9848a6ab61d14f4fcfd38f5b33"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseRecoveryRecord.validated (cognitive 32): LockedUseRecoveryRecord.validated has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 31, if/else 1. Of this number, 27 points are the body\u0027s own statements and 5 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseRecoveryRecord.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8d24c440046ec98ff07b765a1a0391c437cf7770cd2b2fd0cf89068bf49a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseConnection.acquire (cognitive 31): LockedUseConnection.acquire has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 12, loops 1 (2 pts), error handling 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":"apps/OpenComputerUse/Sources/OpenComputerUse/LockedUseConnection.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d2eaab0cc35f2321f1a01e6cf0556c98533f39931b0b1973269a5748fc27e2"}},{"ruleId":"D2","level":"warning","message":{"text":"UnshieldedUnlockDiagnostic.swift.runUnshieldedUnlockDiagnostic (cognitive 30): UnshieldedUnlockDiagnostic.swift.runUnshieldedUnlockDiagnostic has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, if/else 10 (14 pts), loops 2 (nesting depth added 4). Of this number, 29 points are the body\u0027s own statements and 1 belongs 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":"experiments/LockedUse/Sources/Guardian/UnshieldedUnlockDiagnostic.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"816533be83dbc25c05ac4546f6df85c7b7d7370677a227a62f395078a49a9491"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallerMain.reconcileStoppedGuards (cognitive 30): InstallerMain.reconcileStoppedGuards has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, if/else 8 (14 pts), error handling 1 (nesting depth added 6). Of this number, 28 points are the body\u0027s own statements and 2 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014f3a9303a36640b2aa84b2a02b1ab40ea41031c5939e2bac0ae64a20967f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerUseService.typeTextUsingAccessibility (cognitive 30): ComputerUseService.typeTextUsingAccessibility has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0b5bbfeda8d6aab2a05453c66c274674e2299aeb8a86355e243bba93e7c16c"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseStateMachine.observe (cognitive 29): LockedUseStateMachine.observe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 11, ternaries 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseStateMachine.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77b01104dd680e4d4b7dc8706863de16b60855671fb126bb2afb8d9a604c697"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetedQuery.swift.boundedTargetedWalk (cognitive 29): TargetedQuery.swift.boundedTargetedWalk has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 2 (5 pts), loops 2 (4 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/TargetedQuery.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb4190c6fd0442af415d9607c64a9e42b63d1c218716841bb61efb65e1119d"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.start (cognitive 28): DisplayGuardian.start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, ternaries 2 (5 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f177be9d00e6fec366ce0e3094ba752f18e3a2f193e0fb3a09ac779ee0a8de"}},{"ruleId":"D2","level":"warning","message":{"text":"PhysicalInputMonitor.start (cognitive 28): PhysicalInputMonitor.start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 3, error handling 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":"experiments/LockedUse/Sources/Guardian/PhysicalInputMonitor.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e809cf5f675a4c8b771105e62d3964b31857ae54449004f63fcdd61bb93b0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallerMain.main (cognitive 28): InstallerMain.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 9, error handling 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeb378668b5a94a4fd353e9a08559c0015a32dd3094db8b7cda250e77b7d3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseSnapshotArgs (cognitive 28): main.parseSnapshotArgs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16aa37b5d1991f6020fbbcc55d4b8d3e837271f4e4606ec251f8a94d28baa7f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.parseSnapshotArgs (cognitive 28): main.parseSnapshotArgs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebb9a8422f1b183ca6d05014466c85759b508346d95de43a7ecf09b9df13dac"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayShieldSurface.coverageFailure (cognitive 27): DisplayShieldSurface.coverageFailure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5, 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":"experiments/LockedUse/Sources/Guardian/DisplayShieldSurface.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc7c6778478980085402287a4d7e8f8bf2fbaebfc72c989ff6694a8a8d6936"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenComputerUseCLI.swift.parseCall (cognitive 27): OpenComputerUseCLI.swift.parseCall has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d85d7e659e7f88e9f0fc7459f94c5f6aaba2375bfc2fa1b888e58585a09b8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runCLI (cognitive 27): main.runCLI has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d008da2c9547db6af3e86723c5c1b129e196637ec973cf97bd6e1f57f8fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runCLI (cognitive 27): main.runCLI has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde71fb124a1db7e36f984ff8b8de047b8b750e070ebd88ba6ea451001d0162c"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.execute (cognitive 26): DisplayGuardian.execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, ternaries 1 (3 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a2ad88b8e481c4b0f1997b70656ece8245607dc28c1dab469db6bbe7521487"}},{"ruleId":"D2","level":"warning","message":{"text":"LockScreenInteractor.wake (cognitive 26): LockScreenInteractor.wake has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"812b01bcab63de16089ee68d0f9df94337deadc378c4f66e2d10ac0f23e5043f"}},{"ruleId":"D2","level":"warning","message":{"text":"LockScreenPresentation.presentation (cognitive 26): LockScreenPresentation.presentation has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (11 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":"experiments/LockedUse/Sources/Guardian/LockScreenPresentation.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900f06ff8d670629db8cfa07c772a7ed48b22a7b1d6d7bba08efab134000a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderer.plan (cognitive 26): TreeRenderer.plan has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, ternaries 5 (6 pts), if/else 3 (4 pts), loops 2 (3 pts) (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac768929c74cdd504d4780d8ab2cfc890a632252d276cbde5ddf1b4b0ce7a54"}},{"ruleId":"D2","level":"warning","message":{"text":"service.callTool (cognitive 26): service.callTool has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9493d47cea6f54b231554a3244c1c72462c6435d98caa85b0e869be405183222"}},{"ruleId":"D2","level":"warning","message":{"text":"service.callTool (cognitive 26): service.callTool has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"00650715ef89857ea4a6fe56a0567e48374a2367cec2fbb3cabce87c48062390"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionListAnchorSearch.first (cognitive 24): PermissionListAnchorSearch.first has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"502d95728be7f6c99ab189ea36fbaab6f65dd57e2f455836e0b235b5af342002"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.reportToBroker (cognitive 24): DisplayGuardian.reportToBroker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (4 pts), boolean chains 3, ternaries 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bba78195cc1626e3876a037d12910eeb367dd240afef76fe3982013903f06f5"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallerMain.install (cognitive 24): InstallerMain.install has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"533226d255c15656a4534190cc1e77f21ed03256c29af18a8418d57578688dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseGuardianPolicy.poll (cognitive 24): LockedUseGuardianPolicy.poll has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseGuardianPolicy.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c64df239a933bf87de34e3f4e282f75d6e9dc412acf37ae96c80de4928a8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"SkyClickDispatcher.click (cognitive 24): SkyClickDispatcher.click has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (6 pts), loops 1 (2 pts), error handling 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyClickSimulation.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"168148b9e82b6310adfb1287980667ce2b47834f809960ebdcc56134a4beac01"}},{"ruleId":"D2","level":"warning","message":{"text":"LockScreenInteractor.probe::visit (cognitive 23): LockScreenInteractor.probe::visit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 5, loops 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, 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. This shape REPEATS in the file: one other method here (LockScreenInteractor.probe) 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":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c92042eb3f83f60cefeb156c4bc720f0eb98c93534a7df5a471b03567d1fe05"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.targetedSearch (cognitive 23): SnapshotBuilder.targetedSearch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, ternaries 2, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a466668a16bdab594db14df65ba2d3bc7513e9545abdbe9b72bbde0d498b54"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionSettingsWindowReader.context (cognitive 22): PermissionSettingsWindowReader.context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10 (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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e34fc21bcc7a5bbaed3ffeaa45747e1d1634a811f6d0d7914bcc3d5f6fec08"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseClickAllowance.accept (cognitive 22): LockedUseClickAllowance.accept has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (9 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseClickAllowance.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"34412f442be7cded3ded1dd801457de25320477878f062b82262c2d8501232bb"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUsePrivateRecord.write (cognitive 22): LockedUsePrivateRecord.write has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (10 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePrivateRecord.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c517b6d3c5b2dfc221a42c2cdde017c31ba2b80e101085770b3d8024a8f3af5d"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenComputerUseMain.run (cognitive 21): OpenComputerUseMain.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (4 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":"apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f842f3e4e3d6be40184cc35c90cc530b65501b7ebf34559bf1b78cebd74c72c"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.verifyCaptureFixture (cognitive 21): DisplayGuardian.verifyCaptureFixture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, 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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd36b97a42244410d917d6a5bfd1a85abcab2ca6ec6467dc9fafdfcb95fd5d"}},{"ruleId":"D2","level":"warning","message":{"text":"ElementIdentity.read (cognitive 21): ElementIdentity.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ElementIdentity.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"24513aabfe79f147b52d95f783e533e17327ca1b07e1467db4fb52712e1f03e5"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseBrokerCoordinator.reply (cognitive 21): LockedUseBrokerCoordinator.reply has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), ternaries 7 (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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71c91d19029821eb758e6eed25d78a7f7a8697a9c41a69c4e1df409880162a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerUseService.swift.isLikelySyntheticSideActionCandidate (cognitive 21): ComputerUseService.swift.isLikelySyntheticSideActionCandidate has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (9 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0713117beaa68c11ac466b8dbcf71fc19a964796debe459fea721d0849788c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"AppAgentConnection.runCLI (cognitive 20): AppAgentConnection.runCLI has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (7 pts), match/switch 1 (2 pts), boolean chains 1, error handling 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":"apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1000561b21fb773cc50725d683d490d8e41a29732fc3ec50afaa2ec45e1c5b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskVerifier.swift.verifyBrokerTask (cognitive 20): TaskVerifier.swift.verifyBrokerTask has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts), error handling 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":"experiments/LockedUse/AuthorizationPlugin/TaskVerifier.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"712e9390b760a51cc8d2777141832f1afdec5f0752a08898a60b71d84001f179"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogShield.init (cognitive 20): WatchdogShield.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1, error handling 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":"experiments/LockedUse/Sources/Guardian/WatchdogShield.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbed184bd4490edda73be37b4dea427d0cee14a149aeb46a697427d7f92045df"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotBuilder.buildAccessibilitySnapshot (cognitive 20): SnapshotBuilder.buildAccessibilitySnapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), boolean chains 2, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97bd4313fe1f47cd9f1e3fa05167085e684eefe5f3fe61e04799c91189339f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ComputerUseService.selectText (cognitive 20): ComputerUseService.selectText has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), loops 1 (2 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"100e0957d223ef14b0640067c5b00e459584e8710fb40ed5662e431a3e6ec0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"service.refreshSnapshot (cognitive 20): service.refreshSnapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b218ab7f225b37b75cc13005277365b52d7a79d5f5d04d2aaa87dba1134221d4"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerServer.flush (cognitive 19): BrokerServer.flush has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, 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":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"788f83a77dbff01b8820c37c19fcdd9255dc30cc1db9f401c9573fb5e27f2c12"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogBrokerLink.report (cognitive 19): WatchdogBrokerLink.report has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"experiments/LockedUse/Sources/Guardian/WatchdogBrokerLink.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac835b8b7d8f2d7966a58060a2f6b317a9fc0eb5856c2979bac5f3df409cfbf"}},{"ruleId":"D2","level":"warning","message":{"text":"SpotlightAppIndex.recentApps (cognitive 19): SpotlightAppIndex.recentApps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AppDiscovery.swift"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fe48a66a3a57bb23571c0a60849ce265814a6a25c0267fb385659db4597ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseIPCFrame.append (cognitive 19): LockedUseIPCFrame.append has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPC.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51dadb8ba75e868cebbdc24c3a3133dca7ce0ccef5e0e208aa83122cbb2a05b"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilitySnapshot.swift.preferredDisplayTitle (cognitive 19): AccessibilitySnapshot.swift.preferredDisplayTitle has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca8b6567b3cae96771a629675d5b417ec30b5dfd52c13978a92002b971c7e39"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilitySnapshot.swift.isPlainGenericTextContainer (cognitive 19): AccessibilitySnapshot.swift.isPlainGenericTextContainer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"4255f5ba17b1cc80a27f2b2c6e0815af4170487810c51a2512675ddcda403082"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.find_element (cognitive 19): runtime.find_element has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, 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":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1cb60f8c069921bb46224f0944003cd3c7c23ab810b9871e7f7b6633760ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallerMain.trustedTree (cognitive 18): InstallerMain.trustedTree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, loops 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4359255f6aa3e74c65c5bd3e90af08263cdfff5fced4e14dce3b754e5a3ad948"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallerMain.removeOwnArtifacts (cognitive 18): InstallerMain.removeOwnArtifacts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa674f304bbfe1dc0eb043358348c4b2883b9e05bfed838a30361ed39cb7f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUsePeerIdentity.verified (cognitive 18): LockedUsePeerIdentity.verified has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePeerIdentity.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"86650471d555cad3cbd741d9e77233a6585c820a7db94f7e0d9e7ecf77779354"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseReturnAllowance.accept (cognitive 18): LockedUseReturnAllowance.accept has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8 (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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseReturnAllowance.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971d1bdae44f04775e17c697b82dce0934c6d05a5d8e2f38a025a28ed9b0b75"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionSupport.preferredInstalledAppBundleURL (cognitive 18): PermissionSupport.preferredInstalledAppBundleURL has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (7 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad439237715529eba497bb06934d20f37d3b51a834b5883249218c91e9df0af2"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorMotionPath.measure (cognitive 17): CursorMotionPath.measure has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9717b9ee5327213df230aa668cc3088c28189a187c16555375b6d873018722"}},{"ruleId":"D2","level":"warning","message":{"text":"CursorMotionPath.measure (cognitive 17): CursorMotionPath.measure has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4f180f67044ad46f6d2c8cc7aae6eba71f72ebddef7ad0e9b588a15b7cbc0d"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseDiagnostics.current (cognitive 17): LockedUseDiagnostics.current has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 13, ternaries 3, if/else 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aaac2dc896b9bb7367c358b2ee2ab0d2cf5ecd34461f87215ded9ed83c120b"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseIPCSocket.connect (cognitive 17): LockedUseIPCSocket.connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPCSocket.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67c80350754791e49637c83c8dec97f2bcbb16ef03a9ae9ca1c8273686eed5"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilitySnapshot.swift.summaryImageDescendants (cognitive 17): AccessibilitySnapshot.swift.summaryImageDescendants has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b525c372979f1cce5408fc62aec84131a07fe2e4e5529bb170cef85f4384845d"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenComputerUseCLI.swift.parseTurnEnded (cognitive 17): OpenComputerUseCLI.swift.parseTurnEnded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0e527d66eea2bb7f1ca604b3f498a1c3eb7f4075d781e7d4eeb05727e2419"}},{"ruleId":"D2","level":"warning","message":{"text":"SetValueReadBack.swift.normalizedSetValueNumber (cognitive 17): SetValueReadBack.swift.normalizedSetValueNumber has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1, ternaries 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SetValueReadBack.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fae374dca8ac04b8c5b7244921519859eb33c1e3ba7d8ec751c48b2a7382218"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.set_element_value (cognitive 17): runtime.set_element_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 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":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6b0aa77de4c6e1b61164bc643356a254ab7588387f5339fe7a1fd4e26e71a2"}},{"ruleId":"D2","level":"warning","message":{"text":"main.sessionBusAddress (cognitive 17): main.sessionBusAddress has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec9370287c98c504c8433bbd693c488a4c7faa2f70f4ad8c9e70a34a4eaa598"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerServer.accept (cognitive 16): BrokerServer.accept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, error handling 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":"experiments/LockedUse/Sources/Broker/BrokerMain.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee00a93db36267f75fa785eab25689348e2a1cb9c40119340068270e1f673249"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayGuardian.installTap (cognitive 16): DisplayGuardian.installTap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5e4fadf5b622eb0bce702122f1fe7167bd99001720e926003407323c430fe"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardReleaseAcknowledgement.send (cognitive 16): GuardReleaseAcknowledgement.send has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 2 (6 pts), error handling 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":"experiments/LockedUse/Sources/Guardian/GuardReleaseAcknowledgement.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cea4622917a2b5bdb99954a25e9d9469df2fa86d38ef9bf21619107143e3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowCapture.resolve (cognitive 16): WindowCapture.resolve has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 2 (4 pts), if/else 2 (3 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f1973c82aefb04023f5f216f553b238fd83cc410f9d33462927ba77c18f9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeRenderer.rawChildren (cognitive 16): TreeRenderer.rawChildren has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c663b4c4ce0535990151ec71529defaeed9b7c5269fb83efb9499ad7bbb724e5"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDiscovery.bestResolutionIndex (cognitive 16): AppDiscovery.bestResolutionIndex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AppDiscovery.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adc5b7d706b4abd4ea2f2de89484e744b4b586b7261cd84f77c0c99b9a50c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseSession.from (cognitive 16): LockedUseSession.from has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cb76c0bff328dd449930e14fad45dd0db8d6e30900ffce97136d5edba4a1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"LockedUseDiagnostics.installedGuardianPermissions (cognitive 16): LockedUseDiagnostics.installedGuardianPermissions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, loops 1 (2 pts), 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a22993f01d952b24b09cb44c82b04eb202b83cf97190b53cd3c1e7a7af6a5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"AccessibilitySnapshot.swift.shouldElideNode (cognitive 16): AccessibilitySnapshot.swift.shouldElideNode has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ae3a1731b6e7719760c868ec7a37f8b39fdd50a487eb97826bd349d519b901"}},{"ruleId":"D2","level":"warning","message":{"text":"service.click (cognitive 16): service.click has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc44ec2537935831a591c2fdc6f93523c5ee49c8ebd40f2bb555fd8c1dcdaf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"service.click (cognitive 16): service.click has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2d9c303b43d90affd9fbfffe983fb5cdc9292ff5e5d1034be2eed3a0a6e3b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseKit/AccessibilitySnapshot.swift: FileTooLong \u2014 1804 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1304 over it, 3.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"650988127fc7438e73394ca4ddcdb12f6e18c386c59a1afe72324d5e11fcd10f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseKit/ComputerUseService.swift: FileTooLong \u2014 1659 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: ComputerUseService (648-2540). The bar is 500 significant lines; this is 1159 over it, 3.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59166572d0b8a98fb6033b1c707466dc47b8f6283c35044bab3c3f411e7238a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComputerUseService: ClassTooLong \u2014 1264 significant lines (blank, comment-only and punctuation-only lines excluded), 94 methods. The bar is 400 significant lines; this is 864 over it, 3.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2735c627caa50e4ebee1edf877d9d05509e7d921c84d35761d85cfac83205e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComputerUseService: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b5322f0c486410937087255918902582e421d02e8d643fcff2c305f111c97b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CursorMotion/CursorMotionModel.swift: FileTooLong \u2014 1488 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 988 over it, 2.98\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfe5b4fbdfe67d507f01bfba65a56e05bc120eb1c9e5c7ecddc1245b0506f4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseLinux/main.go: FileTooLong \u2014 1295 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 795 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92515a30bbd822d1048a9760649eb84dfe491247a8621e9fde43dcb4f7be850e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseKit/CursorMotionModel.swift: FileTooLong \u2014 1163 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 663 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85bff0692dd25e449b24717e340ebf562632e0ae2dc0053caa4ffe7fcf05627"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseWindows/main.go: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b8e6586d1c86ae580a41f722b44283afcc8242672f00bea4d6957ead9467d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LockScreenInteractor.probe: MethodTooLong \u2014 probe runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee0371467fc1b420cf3cb313710e7be56c9f64c997fee2e12a718f482042b87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUse/PermissionOnboardingApp.swift: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 488 over it, 1.98\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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bf06bc9b63ef2b38c165905f0cca087b25c1a0752d62f196f36002dcc757f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadingDrivenCursorMotionModel.descriptors: MethodTooLong \u2014 descriptors runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1049e2c5d21ddcfa418d7f43ab9b4039e7d8abd74d8ed06adce8486b76b607"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadingDrivenCursorMotionModel.descriptors: MethodTooLong \u2014 descriptors runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"93020543bc71c83dbf0b229e020073907b2ff2ca6ca22b1bc8f4518b5efc7518"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LockedUseBrokerCoordinator.handle: MethodTooLong \u2014 handle runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"821f784a6c1e8a6dba37cf7ec02c2e11629952d011f23c6108c084d1ebe4f11d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseLinux/runtime.py: FileTooLong \u2014 844 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c7498797d195368d1300e445c6ed41415dcf17b8656f3d1c12278b42fce0e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeRenderer.renderSelected: MethodTooLong \u2014 renderSelected runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"7576f357f074e8f38cba12424a05945a452172e5d103102993eee7748592232f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HeadingDrivenCursorMotionModel: ClassTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 193 over it, 1.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fd9831212d45216b23fb610f5426f7661095a7fd9c695a7002832a3f2124d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GuardianMain.main: MethodTooLong \u2014 main 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":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7fa5a5c6384a91ebe79e4dcf303102e3aa927b6c0fb74201c320990d112a77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComputerUseService.click: MethodTooLong \u2014 click runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c6f948cad8d0f26646af64d7414d3d721e7dbd35ac69b0db8545bd64e4323b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadingDrivenCursorMotionModel.makePath: MethodTooLong \u2014 makePath runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"532d91253544a0de31f04c0b1b28b08986d7feecc7bbdab730da7fd99dda2861"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: StandaloneCursorSupport/StandaloneCursorModel.swift: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d29effae18758884414f3281fef4e1a2f0de28bb7b9cb4e3cb45d43464c6e2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OpenComputerUseKit/SoftwareCursorOverlay.swift: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: SoftwareCursorOverlay (186-912). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a0fb70047a7575d05e070f9e33720ce4e680c4357963526175258d0ac66a39"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SoftwareCursorOverlay: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 87 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb46564e8e37394b57530a35528a87909199e9df64df21a6a6771def31897597"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OpenComputerUseCLI.swift.openComputerUseHelpText: FunctionTooLong \u2014 openComputerUseHelpText runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/OpenComputerUseCLI.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebbddd4874d8d79e4c60ae7d296336400cef7ac8e998ce53609e3d788f7d80a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: CursorMotion/CursorLabRootView.swift: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a5c59849e8549b9fe02ea583406dfcca8a395367c5f6d74e3c536dfde64549"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: StandaloneCursor/StandaloneCursorRootView.swift: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11815efb0b8ab50fee1eadeb88f32bacb65b5e8aa97c845774bc7a1a54f144"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HeadingDrivenCursorMotionModel: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 62 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56b6629bd934f6c999ca139ad7e08ae346d1d56026ed13185f7fd681f9467f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DisplayGuardian: ClassTooLong \u2014 453 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 53 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f772f686372abe2235116e6efa7cd8a26c0697ac1c8ebf325acf2c21d3320b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppAgentConnection.handle: MethodTooLong \u2014 handle 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":"apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d7709b860dfe3c79b959a332281a039e8294fc955792c11a6ec8a09492c2b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StandaloneCursorBinaryGuidedModel.makeCandidates: MethodTooLong \u2014 makeCandidates 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":"experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce3a38b8c22aebbeec19f471f36c3f87cbb64ff56cdfbe52d19739c556d77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 70 shared lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:437-564 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:420-552 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:349-476 \u2014 These 3 members are variants of one another: a block of 70 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"822973d7a4d8b49220d7b8557e4ee281d43366a01e57ec7bbe14d3ef58b7408f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 25 shared lines): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:196-227 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:239-270 | scripts/render-synthesized-software-cursor.swift:266-321 \u2014 These 3 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b197770c57d389c4b8bcdb85cfccb38527e064591936485cb9f5a892bbaa8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): apps/OpenComputerUseLinux/main.go:201-293 | apps/OpenComputerUseWindows/main.go:267-359 \u2014 These two members are variants of one another: 89 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d6411ddaaf75f5d979be99ba877a7dcda3ee7eac9afcd370244fc67c9e121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:108-137 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:43-72 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11990bba1dfef4507ad14c77c1240986a5f3c8a7e439fbe95c9a1afecb503da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): apps/OpenComputerUseLinux/main.go:380-399 | apps/OpenComputerUseLinux/main.go:401-424 | apps/OpenComputerUseLinux/main.go:484-500 | apps/OpenComputerUseWindows/main.go:443-462 | apps/OpenComputerUseWindows/main.go:464-487 | apps/OpenComputerUseWindows/main.go:554-570 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"43586fd615ebed00419485729e21f9654833225c322bb5823e444bb4cb112023"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:566-579 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:728-741 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:478-491 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:642-655 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffba240b7239c4dc2a03441417dbb35f4eeac66ec22f2e46b872f8b59eff167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift:1177-1242 | scripts/render-open-computer-use-icon.swift:78-141 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcbeaae8f5cb59260dfc5ae3873b0319352105d43d4385ea8a920f406c30a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): apps/OpenComputerUseLinux/main.go:1454-1529 | apps/OpenComputerUseWindows/main.go:1119-1194 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4afc6acc421ccde9ea230cc065859bdc1113a1441507a0ce960cd1660a4fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 49\u002B corresponding lines): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:108-156 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:130-184 | scripts/render-synthesized-software-cursor.swift:173-226 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 49 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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e83efafbb7425d2a1a4109ac9c7a81f3b5c25ffbbd8b48d13ca6bde61290c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:951-1008 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:764-813 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f8bfa06b149aeacea6a9a3ed4b0925f80d273af083b85615c9d61f16ea0685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): apps/OpenComputerUseLinux/main.go:594-645 | apps/OpenComputerUseWindows/main.go:675-724 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e9a243c892637aae425ff2f2393390c6e7c35288f10454dc0b591d2afd7765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1531-1570 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1285-1329 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04118dd9dced94afe7ec06eea772650bca3f3d6bdcf1d31b8f51e0b8c26ca2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1572-1616 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1331-1380 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"749adc4a58dbf71aa5ba2ef4a3cc07b25df88932350d03d011c683567fe76c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:158-194 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:186-237 | scripts/render-synthesized-software-cursor.swift:228-264 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c98613f66f4869b2077b09fe17aa0b7938abc1cab8ae19345b2f65ae1a20868"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): apps/OpenComputerUseLinux/main.go:334-378 | apps/OpenComputerUseWindows/main.go:400-441 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3abc026b9288d8195aa9146c73be28b4c3b15fc6e00eafc3b9f46b18d718156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseClickAllowance.swift:21-40 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseReturnAllowance.swift:19-39 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseClickAllowance.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba6d14349fefd2a3071ba6f749545675ef7a3a99e710524125b0a1abc186232"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:166-182 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:184-203 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d686efe34e29e0334bc2dcd8ef1a93bc4063aa27a417a5cc1612b59f6cd8c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): apps/OpenComputerUseLinux/main.go:102-129 | apps/OpenComputerUseWindows/main.go:111-140 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cd4333296c5f4a8a92d267edb46256b4c2b7caf868a74ee2e61bc956753131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:677-726 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:597-640 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1b0a9a4b038ee796382fe646b7a558120a9cadc6240ae242ec03737e7fdd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1860-1870 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:855-871 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"642c87c4220cef02f45fa4dc021700406f3b84a704d387396e7bcab3b550f67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:58-70 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:72-84 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b058cd1229386f78f53d871bf7def1162d05fe6a595b602c90c04f3044cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:20-41 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift:20-40 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffeb34f2d50dad4c7d0cfd59c9c2776002f2126e05f7f305050a604129d56a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:71-89 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:105-128 \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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de2a9e5aff6f00a98f3860ab4f5b3c74b85a6382289e708ab2caa7447deaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2166-2189 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2191-2210 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf0198201815548b754030e9d123edec7b6cb372ec5f750870780d3aeb0b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): apps/OpenComputerUseLinux/main.go:426-450 | apps/OpenComputerUseWindows/main.go:489-513 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56ef4a62cde2ff6dead107efd4704ed4b66c337fd630510f769494a5465d225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2283-2307 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2309-2336 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d40564a191afdc7d7362a100768ca912cd56b8caf24f0a49293740253c3e0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1496-1529 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1247-1283 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a0e34fa6037657489f933f2a304c453d7ae2790972202fa075ea54fe81fc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): apps/OpenComputerUseLinux/main.go:309-332 | apps/OpenComputerUseWindows/main.go:375-398 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f6deb54b7bcee7f75e670601b750848543563f74e67af0bb76419c80a8a02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift:43-59 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/VirtualDisplayConfig.swift:9-24 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"397bd8109c56825a5da2b64ba728bd421011eabeaddf3da6f46b4d5f737b6a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2395-2416 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2444-2479 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":2395}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c2e879a518fdc35d4ed8c179a3b923328e5273503355cabb7177680d4e4077"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:254-280 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:459-485 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a0be5c0f199c7522b3d8a4b11677a1a23e33f03f12b0eea88a8c9565967d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): apps/OpenComputerUse/Sources/OpenComputerUse/LockedUseDisplayPreflight.swift:107-122 | apps/OpenComputerUse/Sources/OpenComputerUse/LockedUseDisplayPreflight.swift:154-169 \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":"apps/OpenComputerUse/Sources/OpenComputerUse/LockedUseDisplayPreflight.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1c1c7a9b7f27ac0ecd94f7fcf16ec427b0361b77271016372d8409c321cb1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): apps/OpenComputerUseLinux/main.go:23-53 | apps/OpenComputerUseWindows/main.go:23-60 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c750278c3d6a1b5b70f565b6f723da43b5e6308aecb369c6b354865306e5ec39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift:140-148 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2639-2654 \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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8dbcb8d14ae4fd7310fc491c5758d7bdcc96db4b4f304fe7b7ea0a7811b6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPC.swift:21-30 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPC.swift:53-61 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseIPC.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ed0c3fdb0da72b5fef14e830e9ce784a76d02b2cf66d7e8a2fc9ed64370c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:21-45 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/FixtureBridge.swift:99-125 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de790187ecdfc3ab80ffa88ece177c4a1399ca9141068c86c0973381a138133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:120-129 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:131-140 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef89f66bcb522988b913b8f87abe1b7c2562a1fce552a29dc2880fa0488a769"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:293-303 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:347-356 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabf5b41545a98adf66c7136cf5cc418e341ff36488bee509feb9fdee37674ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:385-413 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:301-325 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4c88dcbb7fc683ff72868121bb8da849e137544ece0c62064782eb3d1b0966"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:39-49 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:56-72 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7481d91ef30bbac6725645eb1df1838fe1454a04e41015f1a725fd8f4cea48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:238-258 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:273-293 \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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f8f5bfcfd2382b3a3df7d4657ad7f02a1498864f37230204f9bf3fd7d5b063"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): apps/OpenComputerUseLinux/main.go:145-177 | apps/OpenComputerUseWindows/main.go:207-240 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"867499a2383a9fd6005aff1e70beb350c024ddeb5cde19a87d997105cd4b5d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift:13-26 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:28-41 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:68-81 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d1d37716efda2f3733d1b5de47a7434a890e501554bfd237453f1c3a52373d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift:248-271 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift:273-297 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cada14b92b6e9ae564478e3bf2166ef40ea64490d6682396aac236c9469531"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:160-185 | experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:233-252 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"934cdf41c31d6d63b496940d59bf064f0ad9d42e3b37e1f6797fb840695ac595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:507-520 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:523-534 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0da86a15ae36873bdf8ad3b3b30469a0a5e686349525f3a389c47182e2e565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1403-1417 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1154-1168 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"125de94496390a9d71cbe68cb7a77f02477dbd4fd8df66b1292c7b442e7bc7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift:364-378 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift:380-395 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"801bc1678eeacc71bd01a9a3b8cc1d651912f68fe2953e87cd29dbdab620ec66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): apps/OpenComputerUseLinux/main.go:76-100 | apps/OpenComputerUseWindows/main.go:83-109 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d4aaa40cacf109623e27e1b05ab35e7973a568c20a7150fc308b5e3d30adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): apps/OpenComputerUseLinux/main.go:452-466 | apps/OpenComputerUseLinux/main.go:468-482 | apps/OpenComputerUseWindows/main.go:519-533 | apps/OpenComputerUseWindows/main.go:535-552 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"836b92d3dfd1bab33171762012fd0ab1c8e98fabf53a9d2a7f9c3730e02baf3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:1382-1395 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2183-2195 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf11c08e2c35f961e5bd594ea9fa69b7c236b1592859b7ac2afd53048300d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:331-349 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:368-387 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"decd69e7027f09d214cdbb1ed381f3085d168d49144bba1e3885f33e438a2360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1463-1479 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1214-1230 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"436e45f13db6072ec9ac56a405559ad2d23319fae243041f7d11b557e21fbc48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilityTextSelection.swift:15-24 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift:306-315 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilityTextSelection.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8435a2bc092d9166f85a4f6da328ce544fbbd267fb3fe70f8584736a2d4cbd19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/OpenComputerUseLinux/main.go:295-307 | apps/OpenComputerUseWindows/main.go:361-373 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb554d4b17c59b92471fc7bd19eb358a0bee4aecc300a2bd566a9f556c3d311f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): apps/OpenComputerUseLinux/main.go:570-578 | apps/OpenComputerUseWindows/main.go:651-659 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"353ef7c8503f6e5443798f4ca921d88028d37fd5edfa9b1ff3cc38a6ad009b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilityTextSelection.swift:6-13 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1961-1969 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilityTextSelection.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69465b8439b48014f1fafdbb835dbb016e541e201e26d86fcfd961d79f308c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:253-262 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift:27-33 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"abae6289b3f6029366ee81a07cfcbcfd55fedb7a5e7a05681f9eed342cf27056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/OpenComputerUseLinux/main.go:131-143 | apps/OpenComputerUseWindows/main.go:142-155 \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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"746d1d00da6b9a0ddb30ccbba14990a75c40eb570ff555c6b81d6e05934f4724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:191-207 | experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:209-223 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc79032710a7b92fa51fb0beb73fdf3f5b452e31af4c387c6655c2dd413a0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:630-636 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:642-648 \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":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ba9285098e98d89c8978d724eaab5b3e70982a9884061c187e65f69fa4781c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift:290-296 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift:298-304 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bf7f4bea5efa3d391588a993e5dda3ed6c028cf999aa201bd64d8e71408e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift:421-424 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePermitRegistry.swift:84-87 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerCoordinator.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"af20a465e9e7b94c7aa4d2bf170db0d34a577fc6c27acc3448924bf476c4ed6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1315-1317 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1067-1069 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe8c8ab522b3011a78b44801aa4f584a43da1a49670ec4fdf2806d4e6116059"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:61-77 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:282-300 \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":"experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9bb75874342810bdb705e68c6ff5dc626adb3b7bb3f95229432d805d6b31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerConfiguration.swift:21-26 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseRecoveryRecord.swift:55-60 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseValidationReport.swift:23-26 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseBrokerConfiguration.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3986bcd117856f0d3a71282a96ea9d41e63e6ef779d4c0c9ddf48ae32a273d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift:10-22 | apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift:24-37 \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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1e1a43b7004bb764dcdc3844cecad450b81db3fcdf019a1d45ec64d9d3c7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift:186-192 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift:336-345 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/MCPServer.swift:162-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c66a0c6649e4f12c8d974d9723fb80bce54182b39e767879fbb71aa28ac07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift:198-204 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift:499-505 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseToolDispatcher.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd958c27af420b2eea6d35888703701be03e1f01b62f506b81b57f828be5f976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2173-2181 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:416-424 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a446b7990e8d7dd8c3cf7833a39fe1fad302e80904fa9a15a36a25b2ee3b329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:1364-1373 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2153-2161 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c354c0c42c4bd1b391eae3328618a1cb05cf0531d0559f89d771433f1f6fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:543-552 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:139-148 \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":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75bd7cee76feb1c0d76403be2bd743e14600efb1ca230ddf0f83a3b4f0d964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift:134-138 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyKeyboardSimulation.swift:257-263 \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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionSettingsAnchor.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e489ec947d0e00666b859ecd856864681dd7fe14f066ade445b44b57dcf840"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1684-1688 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:400-404 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77dd16ab03b9820ed3c4e08bfffb3c8654202e7435f42914268f8277ceac331"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1257-1260 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1062-1065 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f61f1c9cf3e2793bd3547c647d5c761ab96fbe3ef859d72f7d1f1af6d95dc59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): apps/OpenComputerUseSmokeSuite/Sources/OpenComputerUseSmokeSuite/main.swift:507-509 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1872-1874 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift:909-911 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseSmokeSuite/Sources/OpenComputerUseSmokeSuite/main.swift"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89617dae1d3472505b9422dac1852aad9d8559a20f665b07de50b9e51157db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift:120-122 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/VirtualDisplayConfig.swift:51-53 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ImageCaptureConfig.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179f83f525a4a7d8dea8d3f2313b6799895ff08943353f03fbe125be3f5b6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseGuardianPolicy.swift:107-110 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUsePermitRegistry.swift:80-83 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseGuardianPolicy.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eb04ab1be85f70c180a9bb8f8bd79c945a0199ee89a881ed653579b0ab2a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1326-1328 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1077-1079 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c6257e84757ddbbdbf74cf37d01bc02c472afaed299e0fbdc807c711054b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1330-1332 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1081-1083 \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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42e9f05aa3ba47fd57d5fda6d8b48b3658af6b09f97d97f4f76ad6b42126d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift:80-84 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/WindowOcclusionKeepAlive.swift:97-103 \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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AgentDisplay.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa2fbd46cafc05609ddcc5ae587f6a0f41435e8f4096ede698b64c9a25a0501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (208 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1010-1217 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:815-1022 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1acb68336a079146db5bad8ef93d318a763d2a6f3114e56d186461f21fcaa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:203-254 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:127-178 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eaefba73ab1dd6c0a321b991693ee2919cfd66b82a41ae29570f490a1309b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:158-194 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:111-146 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:82-118 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b390fac365d90ba69af02efc71f66df1eac25fe44daf91b8a2a55332e14f5233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1581-1616 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1345-1380 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1581\u0060 it begins part-way through the construct above it, so those exact 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f00fe9734562a9626ef67ccb0d20c85ff63d7f51e775ed363612cfe395a5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:920-949 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:733-762 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08702794bee29fd79ee1bc527b9b87511a98e5d64f84d5a42524acf0e91eedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:203-227 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:246-270 | scripts/render-synthesized-software-cursor.swift:293-321 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:203\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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0599a6dabe1a052979b70e478c98ba83e803bae68fb77a97986efb3f57687327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:438-477 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:421-460 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:350-389 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8876d5400271662ded47d91f60510d460c9a626238c47e840cd69a33c948b6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:516-541 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:428-454 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:516\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b703a5b4b238c1d6325cabc5946a371e9abfd75395629a248c781c3157c6577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:350-374 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:266-290 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7958835456ddd3de0c9934c368d10e449a3e9903f8f850ac614d31b0148c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:951-984 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:764-797 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:951\u0060 it does not close everything it opens, so those exact 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, \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:985\u0060 calls \u0060max\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:798\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"3621311462e9d991fdc99684112296c119613c8e685b48d87010873d69484d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1548-1570 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1305-1329 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1548\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"565fa77e5199d1fb768d111c828f216ce47d05282e5755804af757069909e541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:463-486 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:487-510 \u2014 both copies are in the same file, so extract the block 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":"experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"619568738594f7df701997d9b7af6f742697101cf2af19f6c32f6289e00cb611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift:1183-1238 | scripts/render-open-computer-use-icon.swift:85-140 \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":"apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c753520c3c8863b916effa4faee7a81adab269cf03ee0de3612b0e800af61b00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:581-603 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:497-519 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"698b4b894a8ec4e16fa1813fdc131121557917537f10658d8c7ac627d3c397d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:392-413 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:304-325 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:392\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b2d2acbf6a480fba439245f8610998637ef8f47f2f3522b89ab6524f905c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1843-1858 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:833-853 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1409-1424 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56b4394e1182fdf8df22acf3a02ee2643f15d646a7c96105b531943e6fda45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:116-136 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:144-164 | scripts/render-synthesized-software-cursor.swift:180-200 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:116\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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"45af354fe7f26f6497ecf178ddf868316c9309ec9469f8810743497d002b376b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:86-106 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:21-41 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9516e9cc76184f457a4af05c047158e8688d954ce7fa8233ea70dd252d5de1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:328-348 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:244-264 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79eec4edb6e192b854fe7406e8f4607d9e216ca4bcbe65ac0a526fcbe6343b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1219-1239 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1024-1044 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"58972637ba8e5adb5dbec4df05f4f7d93f288dd2c528693ce406b0e8c1e4aa6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:644-663 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:803-822 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:560-579 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c7b99dce4cbd6c615c1599a9d154450e0c4092f532fd8803bcf13ffb52e36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:614-631 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:773-790 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:530-547 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8459211208ca67093a705b0e9a09dcdb515b4eb4866743176b11dfd66c9d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:108-132 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:43-68 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e9286071a9bb91051b8255a6efdcd037db2f0d675ced3050b378680e952aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:134-156 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:162-184 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:134\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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7056effd618f99088a78c336cd9c79574f6db90e0b369903a00731b894e5cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:139-154 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:167-182 | scripts/render-synthesized-software-cursor.swift:203-218 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:139\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":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea851dfff2569ef3579ddf45d125b8125d3389dab9bf6fc105509bb127b24b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:682-696 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:601-616 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:682\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4d629d8a8695876f2e596b100f9ec77a97c5c00c3dfd4b9b986f4a121dcf65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:517-531 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:506-520 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:429-443 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:517\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1743906e70887250bb6bcc85f25fc8bcdbfddf43d9bd99a5de42c919f418a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:550-564 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:538-552 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:462-476 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:550\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddddb9e5d308286020c982267f725ca55147532d9231059af3ac4a2353cf1e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:254-268 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:459-473 \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 \u0060experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c78eb76f8dde4e719c2f927211a4f43ee61ca5b0c93cca940514e62c1a277e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:480-494 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:501-515 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:480\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"0717f171b3ee7a5582624a089ccd100ae7beeba71ed5955336c6bc9043aa506f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1241-1255 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1046-1060 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"408051841243b8b6ea1fc7cb71de92475423aeb03b28f00c65014bc8aef1c2f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1502-1516 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1254-1267 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1502\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea00b0169fd7135045688394e6d9655272bd2f1b1b9da9a3f1d33bf9cbaa8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:392-406 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:413-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:392\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6cc106d7d566fe38344e9d17ba356b88c8a198882b4be0c8e874e6934dc869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:121-134 | experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:142-155 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:149-162 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:170-183 | scripts/render-synthesized-software-cursor.swift:185-198 | scripts/render-synthesized-software-cursor.swift:206-219 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d986384b9ac5abca3760ea82a7138b1b6d070f6d2cc3eb584128c49749bb1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1618-1631 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1382-1395 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfbee0cb96d0b131693962a6e349740ce2b8f1aab5626427fbd5b0d96c385d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:241-254 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:276-289 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baca294e518bad3a1c70ab1e28822a737be890e362d27f188f7259b74639cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2168-2181 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2193-2206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:2168\u0060 it does not close everything it opens, so those exact 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6ce9511f0aaa4707e600128df030efc94a37b4234cb71742e32d75d15917ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:20-32 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift:20-32 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:20\u0060 it does not close everything it opens, so those exact 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 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e3b7324c9d9a90aaea12ad187d489310376bd574c7861cab94ccbbb7a90034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:567-579 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:729-741 \u2014 both copies are in the same file, so extract the block 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"263fdd37a672f9f4ba668bd11e84a05c1d4c6fc5b8f8d584223e3fd446553cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:823-835 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:857-869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:823\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f9de138da0fcfada57340ad038e2e3ec95408f0aa45aea2fcd41209e0ada42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:804-816 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:866-878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:804\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba6a77c8b4fd2b8d83252d1ee8804d64127375f70388b63fb3ea348a7f1bb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:479-491 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift: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. 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c011e74a19fe50dc18950f04aad97dc8a9940b9bdc8da4895b68f6cdaf3893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:402-413 | experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift:416-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea9f4e9a4749ec7ec2bc9a0ae80f3052d29a061a766285580fb17fa52f81221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1403-1414 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1154-1165 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d929c2d6f9370f965c2293c83def50abd72cf0963bec7e1407c2ba83e79aa40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:204-214 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:177-187 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:128-138 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:204\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7092f8f549f5bb923b36ef036a361f483768aa798ff83ed301e89b259365952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:47-57 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift:46-56 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77616488c1e81edb49592a8f145ce3583a608a0d3f90d737d26362687c34656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:471-481 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:383-393 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift: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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e726289bab81d05edaadd3a6bd901716c510c839185da300a6a393be9abfe600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1534-1546 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1289-1301 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1534\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d851865897ae172e8dc793c530edeeaaedd6403bcae59547cf102946c2f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:52-62 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:65-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"50544080b10d51ba37df4e43679325b988c5031ebde141c5464f1a386940b66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:566-574 | experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:728-736 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:478-486 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:642-650 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb0164f1ab4e689e3849b1e7fd726149517c342d68f12fe6fcfaee0f57e2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift:174-182 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift:217-225 | scripts/render-synthesized-software-cursor.swift:244-252 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorGlyphRenderer.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 126 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/SynthesizedCursorGlyphView.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f3685d55c2dfe0442b7e1e283eccd424326e41d2d747cca5de88fec7bedcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:229-237 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:240-248 \u2014 both copies are in the same file, so extract the block 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5372b5ede21f4db4212ddb64eaf9710277860f091e5bdc05818fe30702eb872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:605-612 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:521-528 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"537d4adf47b7ea47ff0c00c0746ee182fab792184f796abd899fdd859a0745e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): experiments/LockedUse/Sources/Guardian/ShieldPreview.swift:74-81 | experiments/LockedUse/Sources/Guardian/WatchdogShield.swift:55-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/LockedUse/Sources/Guardian/ShieldPreview.swift:74\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":"experiments/LockedUse/Sources/Guardian/ShieldPreview.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea34fd6f8a862b6a82f77e1de17f696a3ae07e60ea6853bb7241d8ca7b38150b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1378-1391 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1129-1142 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b993da60aafd4f5d340abe78ee70c4ab20c9e0fff728c54493a31cc3a01d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:237-243 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:252-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift: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":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e8199c3bbbed3296de7bf981201825aa03d54e39d02c8665a26f990101ac92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift:1729-1735 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:2208-2217 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef86037be75d8000b195264ae024db2db50b840f15b67c5cc01d90396bd2f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1032-1038 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1080-1086 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1040\u0060 calls \u0060actionResult\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:1088\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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d98fbb1d069edb5c4fc19bfc61173b97e6a277478b2df4ce88fbfc54fc603dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:40-46 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift:57-63 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9eb5d52e1241d92b6ff09409eeacf018a9a74f9ddaa42638f926657b4d33ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:334-341 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:684-691 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:250-257 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:334\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f022cf78da5c9ef012cfd5010210b41539a9a61975eac4cb80f34c05258dd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): experiments/LockedUse/Sources/AuthorizationProbe.swift:16-22 | experiments/LockedUse/Sources/RemoteVerificationProbe.swift:25-30 \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 \u0060experiments/LockedUse/Sources/AuthorizationProbe.swift:16\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":"experiments/LockedUse/Sources/AuthorizationProbe.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b0d8c3f2a8a145fd56af598d8b12e020bdd3e883524d02521a4f18a24ce400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift:254-262 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.swift:28-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. 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cbd0958a2db72aadef6d33ed538e6f6e2de9ac5504e49dda707fad11b33f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:294-299 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:348-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source\u0060 to \u0060CGEventSource?\u0060 in one and \u0060CGEventSource\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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"47af1aef7a26670cea8172c988e23c0e728d559c99ed68619e1cb57101cd6852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1861-1870 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:862-871 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1427-1436 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1872\u0060 calls \u0060distanceBetween\u0060, \u0060hypot\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1438\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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c628a336d21b03e14cfd40c5756de71ca7cbfa1e0a0fc9251c3ee81ccf250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:591-598 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:601-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:591\u0060 it begins part-way through the construct above it, so those exact 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, \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:610\u0060 calls \u0060ArcAnchorNode\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift:600\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":"experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorRootView.swift"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"1535f01d2cd0836e58280b3782730a180245c4ec6d64558b4a4ba8b1bc4012bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift:288-292 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift:297-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift:288\u0060 it does not close everything it opens, so those exact 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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/Permissions.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0fb75ead6677525979419406da9135a874a122777c7dbdf4da8955a9f25220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:196-201 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:120-125 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc1d64a3172ba517d3670bc6a25d19d7e78298da3002742d18be326e7531f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:376-383 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:292-299 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b866da623e2cd0ef51bed3e3d68affb95e818dea278113fb0376f842e9da636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:633-642 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:792-801 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:549-558 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba116d0ee0532d7976aa77df40ea93395b6b8ce38fe8a0d6c2498ec6f1155c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:665-671 | experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift:824-830 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:581-587 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 212 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"294416556da5d40c92f7c3ab57f9f2cac14b2c7b15a9499ecd5889b5190290e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift:1633-1642 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift:1397-1406 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift\u0060 and \u0060packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift\u0060 as WHOLE FILES: this scan already matched 39 separate duplicated blocks between them, totalling at least 934 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"78756cb700f85acfbdac014f03c49066b2056cad029f56491eb428a0ed24cc06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift:6-13 | experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift:6-13 \u2014 before extracting anything, compare \u0060experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift\u0060 and \u0060experiments/StandaloneCursor/Sources/StandaloneCursor/StandaloneCursorApp.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionApp.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"44757368791805f97d199203f1a2cc653f43da9af2e4c678f8d45585925842c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift:217-221 | experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift:236-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/LockScreenInteractor.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb8e0008b1bebf66ad856514cb203be0722ffa464391a90a6904c82b62b54c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): experiments/LockedUse/Sources/Installer/InstallerMain.swift:30-35 | experiments/LockedUse/Sources/Installer/InstallerMain.swift:350-355 \u2014 both copies are in the same file, so extract the block 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 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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4183593132384a832bdf8d892307d055a388aa6ec594025992b16349550efb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:121-126 | packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift:132-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5444abc27cbf355288fa5caa2800eb6b729f9f4d003df164aed0ebffd9ebf16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1636-1709 | apps/OpenComputerUseWindows/main.go:1301-1374 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"71239837ed0f54268f34f00f6a897905ffbcf9ca233d81b3778aee2c10e72ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:225-278 | apps/OpenComputerUseWindows/main.go:291-344 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a982e71c9cb6d3d4bc47ae1ad5466a2cc526c3d5eb5eec31986ec08b82eef0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1478-1529 | apps/OpenComputerUseWindows/main.go:1143-1194 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:1478\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"29604cb1956ab1fd4f96410304a191c7e6fcaa7e4aac34625fce772bcb4cbef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1563-1614 | apps/OpenComputerUseWindows/main.go:1228-1279 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfb607351eda05ad5b830157aaf5c2975912dd078203c0c8f97be94be6992be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1811-1844 | apps/OpenComputerUseWindows/main.go:1476-1509 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a305893b24fa962d8b2e566c2cd7ad2b30d9952faa2107e50942b3a876ae085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1740-1772 | apps/OpenComputerUseWindows/main.go:1405-1437 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77561d0c1dd19aa8f9d9931801b6b8c26a509930cca62c8bd3f4d2d7b46c4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1532-1560 | apps/OpenComputerUseWindows/main.go:1197-1225 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889d2471c18490aed00df00ab858d4f0b01a027d1f38c64be1ae76522105c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:146-170 | apps/OpenComputerUseWindows/main.go:211-234 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d53f4818c33d7134fc4680df5ff0850d27226e1fcbf9711aa5277da6dcac02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1455-1476 | apps/OpenComputerUseWindows/main.go:1120-1141 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:1455\u0060 it does not close everything it opens, so those exact 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"152efa81e27ccb96e9ff2cb9c89c03fe2988e98bdcee26d429ecd5fb8190d1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:202-222 | apps/OpenComputerUseWindows/main.go:268-288 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:202\u0060 it does not close everything it opens, so those exact 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cce4c9332b87a56a7085c3896375b33d5ac69d453eced5687a258b358ae652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:402-422 | apps/OpenComputerUseWindows/main.go:465-485 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"15405f79bd951c646ee0ffac808e909951ac0f0004e454fdee03cc5d7beaede7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1717-1737 | apps/OpenComputerUseWindows/main.go:1382-1402 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cb3d39b6cbe0b23b124f02e510ebd3b6c297b0377155b9211e1176b2be0d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1789-1808 | apps/OpenComputerUseWindows/main.go:1454-1473 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b3dbf86c68105f8b5d18ec00d8cecd33ba75a952a28096a985d75a90558b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:314-332 | apps/OpenComputerUseWindows/main.go:380-398 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:314\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b1e7fd1aa6b8c686b63207c1cd50f33b3cb7b74278bc1718af5f1bc85ef73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:427-445 | apps/OpenComputerUseWindows/main.go:490-508 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"69356741d873aeffcfdae4a37a49b7a60687482607e2c45e409e78569366f64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:547-565 | apps/OpenComputerUseWindows/main.go:627-645 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca8eb48625e20bc06761417b7ded107225889c2f1647bddbf21c6d1dc4918e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1103-1121 | apps/OpenComputerUseWindows/main.go:757-775 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e4a4e7b365ed7e93854548830e156e1f5356372155f2709c568a9f5f6f3c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:103-120 | apps/OpenComputerUseWindows/main.go:112-129 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"413839a486d4f312061449cd530183d60f6a3395fe5459525c0740ba48b68e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:361-378 | apps/OpenComputerUseWindows/main.go:424-441 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:361\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4719b504418777a61c03bf7ad588d1bdb8f7e10e43e95173af326d4f9d2c94ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1181-1198 | apps/OpenComputerUseWindows/main.go:835-852 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac6bd333372a335ee4300ed28152d7d0ef04c73c79e02abc90f1a16c6d38ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:381-397 | apps/OpenComputerUseWindows/main.go:444-460 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a164bce30fd213a9f3b9cc38e721ad5c291168be1102310cb5c1137432f9a0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:280-293 | apps/OpenComputerUseWindows/main.go:346-359 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:280\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6d97e7dfe0bd4dc6afc0b988c17067688d78a34a60691051f375d0865eb6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:485-498 | apps/OpenComputerUseWindows/main.go:555-568 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c18437e6fa23fc6875ffb1d7d53e4ebf711ea83047ea5d8e024ce2e5ef0987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:581-592 | apps/OpenComputerUseWindows/main.go:662-673 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50ac33e55fec544909b5e26fb1a2e4179eeeaae41fb47182189ab4c3007061b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:608-619 | apps/OpenComputerUseWindows/main.go:689-700 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:608\u0060 it begins part-way through the construct above it, so those exact 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 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba06a3dc588468cb2cac20fe1acd035b506936416d534a84d4fa15cc4f32a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1159-1170 | apps/OpenComputerUseWindows/main.go:813-824 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2dff0094f011a6d19f608060d34b00cb916ef03ab97c199caa01afe92e0dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1246-1256 | apps/OpenComputerUseWindows/main.go:900-910 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf4093a02db87da5652167cbe1dc09fdb0f5e8f3917d73ef89020bc5036d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1259-1269 | apps/OpenComputerUseWindows/main.go:913-923 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2a7221c78a7d002b42e7bc5760682c56f8d8730a5a097a461da2712919453f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1272-1282 | apps/OpenComputerUseWindows/main.go:926-936 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a953e9f99372893bb43a9e891e47c7d99b2ac62b3965ca9c3bf00f1eecc79f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1617-1625 | apps/OpenComputerUseWindows/main.go:1282-1290 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2ffa526262f82d18cbcc7ea00fa78c6117cf2229065ee79e589cd7aacfdef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): apps/OpenComputerUseLinux/main.go:390-397 | apps/OpenComputerUseLinux/main.go:415-422 | apps/OpenComputerUseLinux/main.go:491-498 | apps/OpenComputerUseWindows/main.go:453-460 | apps/OpenComputerUseWindows/main.go:478-485 | apps/OpenComputerUseWindows/main.go:561-568 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a87051dd66498c7d3b3914555402837477aae5d57aba6b4b2a651ce07ba596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:571-578 | apps/OpenComputerUseWindows/main.go:652-659 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a954c8fecda6c20294df97aebc264fd854d39d38c8484b5b1fa93f755422172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:123-129 | apps/OpenComputerUseWindows/main.go:134-140 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:123\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060apps/OpenComputerUseWindows/main.go:143\u0060 calls \u0060sanitizeScreenshot\u0060 and \u0060apps/OpenComputerUseLinux/main.go:132\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f7ffe132218bf389179b66634fe535c4aceda7f7363582dd455b6d82dd8dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:59-70 | apps/OpenComputerUseWindows/main.go:66-77 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce9d32fdbeb79cc14342822b914bbf8976773b741af44a526266d1e663062b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1082-1092 | apps/OpenComputerUseWindows/main.go:736-746 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f6c2fc0f6393485beb451e41abd79ba029d4416bd0caaefd3e1dd12fbb223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1123-1128 | apps/OpenComputerUseWindows/main.go:777-782 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069dd64b81176a6997f3bc65733bc8ae66450239af2ffd356661e99dc2edbab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1134-1148 | apps/OpenComputerUseWindows/main.go:788-802 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1598b40d35942c08cd2d7e117456dc6ac9fa2b7ddd0f5294c6ce2bf6832870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1200-1206 | apps/OpenComputerUseWindows/main.go:854-860 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836853675ed76af1233ab9fcccb5f8d96e05c9a8ec504362005f17fcb7e5e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1208-1214 | apps/OpenComputerUseWindows/main.go:862-868 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8154de4f473ed2b6596db652c265809c5605df4388d24c75bc2c53cd735cc6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1284-1291 | apps/OpenComputerUseWindows/main.go:950-957 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3921ee93051f1f15570ba3de9d88965cad49513e4c2a2bc74ed55f8f28c45788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1395-1405 | apps/OpenComputerUseWindows/main.go:1060-1070 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"619fef21714a7fbaee53d341de815d36d1f130c667d8aa31a6955918e5bee724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1447-1452 | apps/OpenComputerUseWindows/main.go:1112-1117 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f35f60e39b3103d7e012888a59b19fee6ad95d7ecf893cba5bcd5f29787850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1627-1633 | apps/OpenComputerUseWindows/main.go:1292-1298 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6652ca5537e320bf761a612f22612bd0247d3458c332ef0cb52cc3c76d8a7097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1774-1786 | apps/OpenComputerUseWindows/main.go:1439-1451 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d8a6402fa2a7782c6934de06250327ddc1090ee9faff34b91a11c11c36111a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:1850-1856 | apps/OpenComputerUseWindows/main.go:1515-1521 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fff482f0d219a1f003fbc3637ab9a595ca2bccc819de9c037e801de894d9bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:34-53 | apps/OpenComputerUseWindows/main.go:41-60 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a8d0ee3e4a58f6dd7a9f6a577da56fccb8d9fd780efda0ff7fc3cba098d53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:297-306 | apps/OpenComputerUseWindows/main.go:363-372 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"389c278b4b6d2d826070a5de4ff04ba4c50827126beede90b1eb41b3082eda19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:335-344 | apps/OpenComputerUseWindows/main.go:401-410 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/OpenComputerUseLinux/main.go:335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb0683e2d9a5ced06ed5c72c4430aba27a9a829a0600d3da63d12be57ec91b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:347-356 | apps/OpenComputerUseWindows/main.go:410-419 \u2014 \u0060apps/OpenComputerUseLinux/main.go\u0060 and \u0060apps/OpenComputerUseWindows/main.go\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 49 separate duplicated blocks between them, totalling at least 894 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"989eb14279ce226f47b8d6e8f1622a433dae3430df6374b9ef545c5fcf9560c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): apps/OpenComputerUseLinux/main.go:456-464 | apps/OpenComputerUseLinux/main.go:472-480 \u2014 both copies are in the same file, so extract the block 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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"949bf7db97e3a14b7ee5d37992b11a1962b7855c3646ee362b6dd517652d98f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): scripts/computer-use-cli/main.go:139-191 | scripts/computer-use-cli/main.go:271-329 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/computer-use-cli/main.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5df361cbb14fd6bc8bb68307b0ccc20eb449c2703225ae901069e47ceae611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): scripts/computer-use-cli/main.go:777-806 | scripts/computer-use-cli/main.go:808-840 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/computer-use-cli/main.go"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f5133b2f21af93a3e6cbd76a3e51b18e75a9a3f77dbb4c61d287f14940f191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift:22-43 | apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift:61-75 \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":"apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03dc0b5bf663bf4baa5de708abaefe2ae7d5e4050a95631b732709d884d344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): scripts/codex_dump.py:332-349 | scripts/codex_dump.py:352-368 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/codex_dump.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba50adcfe8eeae26232d077b803ab98b15147b5a2d575ca93cde13c4462215e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): scripts/computer-use-cli/app_server.go:210-223 | scripts/computer-use-cli/main.go:384-399 \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":"scripts/computer-use-cli/app_server.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a6e2a85f9a40fef165a7961fb6fedf96ea81493cc8d6a3d9a282cedd0457ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift:24-35 | apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift:63-74 \u2014 both copies are in the same file, so extract the block 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":"apps/OpenComputerUseFixture/Sources/OpenComputerUseFixture/main.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae93238a262e5bf090456b11795cd9fd67eb93049aed3b1cf93e2f9c5c985549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): scripts/codex_dump.py:332-349 | scripts/codex_dump.py:355-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/codex_dump.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a345443039afe11da6a8a2f9ca1621e46496b3df7302fd69273675d0091d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): scripts/cursor-motion-re/official_cursor_motion.py:1037-1054 | scripts/cursor-motion-re/official_cursor_motion.py:1055-1072 \u2014 both copies are in the same file, so extract the block 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/cursor-motion-re/official_cursor_motion.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"1064d8a81e196b797f6ec4c3275d31caae8fe7604dc2beb57f47ff4b9a25c4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/cursor-motion-re/official_cursor_motion.py:1658-1667 | scripts/cursor-motion-re/official_cursor_motion.py:1678-1687 \u2014 both copies are in the same file, so extract the block 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/cursor-motion-re/official_cursor_motion.py"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dda807038db13f2264795a67466e8554c26f094e78264d00cbc982f13e64985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): scripts/computer-use-cli/main.go:226-241 | scripts/computer-use-cli/main.go:292-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/computer-use-cli/main.go:226\u0060 it does not close everything it opens, so those exact 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 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":"scripts/computer-use-cli/main.go"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf3f4e9757ba48c1869a3ca3a89460fa6852672ed88aca22904c6e79fcc799d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/computer-use-cli/main.go:152-166 | scripts/computer-use-cli/main.go:230-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/computer-use-cli/main.go:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"scripts/computer-use-cli/main.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a6284a21583c9fdf2a94ac9f97f8714c2002b9006a451a5cdf40584dbdd36d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/computer-use-cli/app_server.go:350-361 | scripts/computer-use-cli/main.go:475-486 \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 \u0060scripts/computer-use-cli/app_server.go:350\u0060 it begins part-way through the construct above it, so those exact 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":"scripts/computer-use-cli/app_server.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7afffa07f4abbc1c9d2ae54a2b7ab1676d1f4121e473eb1cfc6014f72d94b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/computer-use-cli/main.go:172-181 | scripts/computer-use-cli/main.go:250-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/computer-use-cli/main.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e376b845ece32e36470b836cb6aed6ccb10202463664750d7f0367749bee481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/computer-use-cli/app_server.go:312-322 | scripts/computer-use-cli/main.go:419-429 \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 \u0060scripts/computer-use-cli/app_server.go: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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/computer-use-cli/app_server.go"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04fca3bbbf49a3ec730c035463bf088dc8aa58df6b6d279e2926f23a9b00f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/computer-use-cli/main.go:120-128 | scripts/computer-use-cli/main.go:140-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/computer-use-cli/main.go:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/computer-use-cli/main.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"564e752f0ac491478d60cbd791be86872be600bedc65f2998e1534b140f4c4d3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: StandaloneCursorSupport: StandaloneCursorSupport: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"27f1077236c8476baf0db2235b77fae0c9620879d88573be2a8666dedaa1765f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: OpenComputerUseKit: OpenComputerUseKit: abstractness 0.01, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ece0d65511890d10d6605a7d84db648e07b393b014ea6971acb4aaf2997d9b71"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SkyLightSPI (LCOM4 6): SkyLightSPI\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SkyLightSPI.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"df571b51299a6a5977cf6be3d2fad86bc4ac9944db20776e89712dde1a982c3f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MCPAppRuntime (LCOM4 4): MCPAppRuntime\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":"apps/OpenComputerUse/Sources/OpenComputerUse/MCPAppRuntime.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5bcd0719d59a161e4874956a08a5fab1d6e4637cce940dddabae70908104c1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNativeHoldCreatesAndReleasesPowerAssertion: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Tests/PermissionOnboardingTests/LockedUseDisplayPreflightTests.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c599e7ac798195a0cd303d18445d0e2c9ca187486cf16d2fcc1facc2b535026d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testLiveSettingsListGeometry: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUse/Tests/PermissionOnboardingTests/PermissionListAnchorTests.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb677ae0b1d39b3dd04cc1c3415e794f044f0044d0ed5ff29cdadcf137aa0157"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testHiddenChromeIsParkedOnTheAgentDisplayAndRestored: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/AgentDisplayLiveTests.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e89ce8398fd045da2c209807069499fe4de3ad558414f4d91f9bfa4d6a98f2d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testSurveyRunningApps: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/AppMatrixLiveTests.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb3097138f62cae50bab8ab25180d12defaeb2636cc25efe91daeb9de45aa57"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCoveredChromeClickAndKeyLatency: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/BackgroundInputBenchmarkLiveTests.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc4bdd3f580ecbdcf8c6fe24f6965fe4518c316ee0383ad3d7b1ccd0aeddf3c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testWindowOnAnotherSpaceIsReadableClickableAndTypable: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CrossSpaceLiveTests.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"587fe7fa824d39d6d6fed96444df173955dba3030e89ffa76796d6b181efc77c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testServiceClickRegistersLiveWindowAndFeedbackMatchesMovedButton: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed4a7b2c27f4c1ccc81232d7dd6b9797a2b731d379ba617aa0e64524c1d0c0"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testRealAccessibilityWindowFollowsTravelPulseAndIdleAcrossDisplays: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7731d60805a273cc6b710707b75e242374630af4b5a7af311c84d3da9c1233"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testRevokedLeaseStopsInputAndQueryBeforeResolvingTarget: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/LockedUseDispatchTests.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d97ede2cba1389245c2bb5e6718b07ac51248c305a691f5b75cacfcfcb602f1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testKernelRecheckAcceptsSameLivePeerAndRejectsForgedHashOrToken: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/LockedUsePeerRevalidationTests.swift"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdbef372bd695906e6b663ce54f203991bc4706e1cd873043ee627f4838f6aa"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCoveredChromeKeepsWebContentAfterVisibleSnapshot: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/OcclusionKeepAliveLiveTests.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafcffbf9b9751416eea2f18f87c69f9f9995115df1dbaf4f028a7607e4f18f7"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testSkyLightRuntimeSPIProbeCanStampEventWithoutPosting: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/OpenComputerUseKitTests.swift"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"531fd9aad5884c756ffa55a14d6c67c9dceef350fc5146a490c6c094d978897d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCoveredChromeReceivesExactlyOneSkyClickWithoutForegroundSideEffects: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/SkyClickLiveTests.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a910db28f1ee4d18bd2099b1ccc24658e68c7e2f4720b4928b50ebca9eff7066"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCoveredChromeReceivesSkyKeyTypingWithoutForegroundSideEffects: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/SkyKeyboardLiveTests.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4654ceac20fda8e256bc1eca6ffc5050433f50f3b1a75ca75064a012d476d013"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testRealAXTextViewSupportsUTF16SelectionAndBothCaretModes: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/TextSelectionOperationTests.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c1e6e0f72f56a4f3be1fe2f16600d5133ac8ec1d152c0e2f85fa1f3e31795e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCompletedLaunchUsesExactTargetSize: 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":"apps/OpenComputerUse/Tests/PermissionOnboardingTests/PermissionAccessoryPanelTests.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53442862cb68d92203c2d48112d1f1acc6575e4fe4082b730a506d376aa2f54d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNewGuidanceAfterInterruptedLaunchUsesFullPanel: 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":"apps/OpenComputerUse/Tests/PermissionOnboardingTests/PermissionAccessoryPanelTests.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc299f3a2967142cf1ce10b746cca48976ca49dab4933a57f0e933285ca36606"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIdleFollowsRepeatedMovesAndReturnToOriginalFrame: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce369fa10f75f9926a4dd508a669dac4eac232f4de0dcc897622a33af5122d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testClickPulseTracksMovesDuringBothClicks: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc1e0448f4a03fafe386e8d719cb6143ff7dea3350e9141e97e421afcac9cd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTravelAbortActuallyPlacesVisibleTipAtMovedWindow: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad355dae260c2958c5cfa250ea922a80698c1d32bc64b1aa6aad458e54a3e4ea"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnanchoredTargetDoesNotKeepPreviousWindowTracking: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/CursorWindowFollowTests.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29d837029fc2473221b6ffa4377cd460029bedfd6710a085fdca8750a218fd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testWedgedRPCQueueAndRepeatedRetriesCannotExtendRecoveryDeadline: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/LockedUseRecoveryDeadlineTests.swift"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"018cf17d450ad962d14a6b3930142466028b4f5fbd2138a67ff690d1e809ee94"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCompletedCleanupCancelsExpiration: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/LockedUseRecoveryDeadlineTests.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0489478c77cd48d0895b39f963c193e0ae47125f9ed5149a0ed9e5c9e94d3eee"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEarlierFailureShortensAcquisitionDeadline: 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":"packages/OpenComputerUseKit/Tests/OpenComputerUseKitTests/LockedUseRecoveryDeadlineTests.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"683edee5bbc9a55babd09e265a8658cda62a9ed1a2c4c145cb11df5596c56f01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TreeRenderer.renderSelected at line 951. 7 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a02e9583ea39f6a71660186be9d80dd698385c2660cefabc8ec200c4b3ad2e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/OpenComputerUseWindows/main.go: apps/OpenComputerUseWindows/main.go changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in service.callTool at line 267. 7 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- apps/OpenComputerUseWindows/main.go\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":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d1be433148f1c0edfadf59d333b29f7abd323f1eb1b6a377b8b7e2ad0e1dc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ComputerUseService.click at line 743. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"822e3beab0861458f4fa82aba778ef4046d49257268585babceee07fe4a8552d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/node-repl/open-computer-use-repl.mjs: scripts/node-repl/open-computer-use-repl.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in open-computer-use-repl.createCuaApi at line 308. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- scripts/node-repl/open-computer-use-repl.mjs\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":"scripts/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cc25f27655a29f346daea4509e06ac52b905b9a519bbbdf484d7906b6a46fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/OpenComputerUseLinux/main.go: apps/OpenComputerUseLinux/main.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in service.callTool at line 201. 3 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- apps/OpenComputerUseLinux/main.go\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":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d202d544df432f7a402e33bc97cf55d101a1eb42e827f09319e5c8c83f76f580"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/OpenComputerUseLinux/runtime.py: apps/OpenComputerUseLinux/runtime.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in runtime.perform_operation at line 924. 8 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- apps/OpenComputerUseLinux/runtime.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83a39da98ea3b6b4d8d1dce552607131f4bd12ba941728f6e22605529191784"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.swift: apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in OpenComputerUseMain.run 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.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":"apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aa82c3c0a5732fe6b78acaa80a7b43f26ad8eb331735efa1d2d5ed880e2f28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: experiments/LockedUse/Sources/Installer/InstallerMain.swift: experiments/LockedUse/Sources/Installer/InstallerMain.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in InstallerMain.install at line 195. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- experiments/LockedUse/Sources/Installer/InstallerMain.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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"632cc139a57cddff412adebe3d406cd5befbf88d5c0096d4570d67edf71661ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/install-config-helper.mjs: scripts/install-config-helper.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in install-config-helper.main at line 763. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- scripts/install-config-helper.mjs\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":"scripts/install-config-helper.mjs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a7ab876a726d5a49c7157b2713b6011959267c1880ee1f68d3eb7eff0d3ac4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift: packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LockedUseDiagnostics.current at line 94. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:13:46 \u002B08:00\u0027 --until=\u00272026-11-13 23:13:46 \u002B08:00\u0027 --full-history --no-merges -- packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"33496a5ed7ea39d74e2942e645b95ec863aeb4e2d8d26fdae46dcb0ff33316ed"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 21 significant file(s) lose their only recent owner: scripts/cursor-motion-re/official_cursor_motion.py, experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift, apps/OpenComputerUse/Sources/OpenComputerUse/PermissionOnboardingApp.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.swift, experiments/LockedUse/Sources/Broker/BrokerMain.swift, experiments/CursorMotion/Sources/CursorMotion/CursorLabRootView.swift, experiments/LockedUse/Sources/Installer/InstallerMain.swift, scripts/codex_dump.py (\u002B13 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a1d9fd559497d50134a83f394d533704307fe48d0f2e1ac3177749b8b531689"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. The most over is \u0060(repository root)\u0060 (33394 LoC, 387 module-visible types across 16 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1064881b1494a0979eb931b13cfb0b74dbf92ef7ecd5b042ef3e895eea67bfa2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e98aa0ba6171e514f475168284d1cb56b33a2d6c51374f8bd32839accd7df187"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"e79ccc84e65bb373b7e7e3d1f0acf9054419226ab0c3c3232c7cf8fcc31b9f7f"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"apps/OpenComputerUseLinux/main.go","line":12}}}},{"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":"fe8eaf20c8542cbdb888277183b5f18bfff94a4070f8415e6d81fa30dc159721"},"properties":{"dependency":{"package":"stdlib","version":"1.22.99","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"apps/OpenComputerUseWindows/main.go","line":14}}}},{"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":"36d72eee69fe8522ed4bc8d53a38fd4ba822bd1c98c8f0da3e1595402f806be9"},"properties":{"dependency":{"package":"stdlib","version":"1.26.0","advisory":"GO-2026-4864","aliases":["BIT-golang-2026-111943","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33810","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-46600","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-4865","GO-2026-4866","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5942","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"scripts/computer-use-cli/app_server.go","line":10}}}},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D37","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":"2e96dfd6d93fe913fb2e9028610c982dbd322c76ecf26cfdd7734b74da991d0f"}},{"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, \u0060apps/OpenComputerUseLinux\u0060, \u0060apps/OpenComputerUseWindows\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 CodeQL\u0027s Swift pack (Swift/Xcode) (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 4 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":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runJavaScript\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/node-repl/open-computer-use-cli.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0efa4388062a872ac2856eff3f7999095655a991f33ab8644b8e9083d80a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\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/node-repl/open-computer-use-cli.mjs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ef826abcec736df45a9638aefd52fc8ab76c8f7a77dedacfb8ffa9eb03392e"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 31 plain JS \u2014 the untyped files are scripts/install-config-helper.mjs, scripts/node-repl/ocu-config.mjs, scripts/node-repl/ocu-config.test.mjs, scripts/node-repl/open-computer-use-cli.mjs, scripts/node-repl/open-computer-use-cli.test.mjs, scripts/node-repl/open-computer-use-kernel.mjs (\u002B25 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/install-config-helper.mjs:233 \u00B7 scripts/install-config-helper.mjs:270 \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/install-config-helper.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61454ee9edfbf9b8aedfcc4c1492ddec257f75e6d6a0eb040ab7bd339a4ba36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/install-config-helper.mjs:792 \u00B7 scripts/install-config-helper.mjs:813 \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/install-config-helper.mjs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0eb288e590b8ac41c09566e0f9202c8670bc5cea8370ed21c2bdc0a4e728e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/npm/build-packages.mjs:140 \u00B7 scripts/npm/publish-packages.mjs:74 \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/npm/build-packages.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"225474022c5c9b9e2191996fbf503e9f3b4e599a65f854329dd379600adbf53a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/install-config-helper.mjs:642 \u00B7 scripts/node-repl/open-computer-use-repl.mjs:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/install-config-helper.mjs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e1918ad65e996b4b276f74ba2b2f93f5af22ae037203a2ab423e4f430aff8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 31, cognitive 35): main has cyclomatic complexity 31 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":"scripts/node-repl/open-computer-use-cli.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7600cec720d37979734adf129e795157e96966be9c4067d4031ffefb4fd05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSetting (cyclomatic 24, cognitive 24): validateSetting has cyclomatic complexity 24 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":"scripts/node-repl/ocu-config.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"29738a4ff1c323eca8de0c46f0b05d1c48c77c14ef9dba105b40db68488371e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 23, cognitive 25): query has cyclomatic complexity 23 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/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"68565aeb16e89b8f4eb52883c7640081bee28b52feaa37ae63d9a9e652eae05e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configCommand (cyclomatic 22, cognitive 27): configCommand has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/node-repl/ocu-config.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17b85e04f449a779d3012640a6fa69e2572b7c7cb092f0c3e6b1bd865e48d34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installOpencodeMcp (cyclomatic 20, cognitive 30): installOpencodeMcp has cyclomatic complexity 20 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/install-config-helper.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"facd9e868ed56d5461e945eb5deb5d72226686f7eb3338416e36fa5a9990cd1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runInteractiveRepl (cyclomatic 19, cognitive 40): runInteractiveRepl has cyclomatic complexity 19 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/node-repl/open-computer-use-cli.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcf9f2b29f9c53c371d7c1e6dafb11537fb93bf757b54d0384c6bece28485df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 19): main has cyclomatic complexity 19 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/install-config-helper.mjs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b9f6e9770e0d440327162c42f0af3752778788a225f7ebb1c7dfc4f2ecb900"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJavaScriptArgs (cyclomatic 16, cognitive 21): parseJavaScriptArgs 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/node-repl/open-computer-use-cli.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"070ac19b7918b835282f2ff586dd6dbe50b26153dd215241f9d86bf76ab105b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectText (cyclomatic 15, cognitive 16): selectText 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/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572050e3ece87aef9ae1916b13816d59a4ab2db8d03e9808b6101d3fe0539fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishWithRetry (cyclomatic 14, cognitive 23): publishWithRetry 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/npm/publish-packages.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"88445e83d37c7e380de735c9c35c2b03198de92b8df57eda8cb88b1ff4a1d7d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 14, cognitive 18): handle has cyclomatic complexity 14 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/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f86139c57979aac34a583528d7e6abe32e347354c13b5fa40612d85cba4852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeImage (cyclomatic 13, cognitive 18): normalizeImage has cyclomatic complexity 13 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/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"efffeb0e253c19406b219d42bd4805548e8feee014e5f4809d9c60cb9caa959b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateNotes (cyclomatic 13, cognitive 12): validateNotes has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate-github-release-notes.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c618ec4bc1211c458842316cf42eb3fa704cdfa0bf173a1417ba0f039c3e74aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optionsToSnapshotArgs (cyclomatic 12, cognitive 15): optionsToSnapshotArgs 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":"scripts/node-repl/open-computer-use-repl.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c0a7e48b52bd15fd92f91a38d67e1dd75f50b3c8e15224cff1bd1b43288f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectConfig (cyclomatic 11, cognitive 18): inspectConfig 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/node-repl/ocu-config.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"966c42d1d57588175b11e14015aba2422223f07be26574a2b768c7e7e50c8d8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfig (cyclomatic 11, cognitive 11): readConfig 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/node-repl/ocu-config.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41d99a4bce3068716c35c6e356198dcf071e1986aa7962431c4e050cbc50cc"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027reset\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/macos-set-value-smoke.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ee56430583cacb9f025828951564868b88d58e447ec73bea3a0cde4c7a7aac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!json \u0026\u0026 !permissions.missingPermissions.isEmpty\u0060 appears character-identically in 2 files \u2014 apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift, apps/OpenComputerUse/Sources/OpenComputerUse/OpenComputerUseMain.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":"apps/OpenComputerUse/Sources/OpenComputerUse/MacOSAppAgentProxy.swift"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc445abb1f4c984e39c0bb89e0ee55253f07b7a5f932fddc56c85b041b7c1a8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attribute == kAXValueAttribute as String || attribute == kAXSelectedTextAttribute as String\u0060 appears character-identically in 2 files \u2014 packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be8047f1e8df35dbcba443ab367dee2bb908f8829e3f3657c9b4d52f3d88fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error == .attributeUnsupported || error == .noValue\u0060 appears character-identically in 3 files \u2014 packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AXSnapshotReadCache.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ElementIdentity.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AXSnapshotReadCache.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9862d26a12a4b8446578e03b41dcfd5c634ad25dd2c947b1264b62ccc4525b53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060length \u003C minimumLength || length \u003C normalizationEpsilon\u0060 appears character-identically in 3 files \u2014 experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift, experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3dbcdd1d24d3a8de704e8345a5e5c066098092ba73d388f8a4a4f0e6d081fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs.measurement.staysInBounds \u0026\u0026 !rhs.measurement.staysInBounds\u0060 appears character-identically in 2 files \u2014 experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/SoftwareCursorOverlay.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":"experiments/StandaloneCursor/Sources/StandaloneCursorSupport/StandaloneCursorModel.swift"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0236b21ad00551fdd72f58537a2ba91b6adf69d640da2a9619ddbca138c0a12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progress \u003E= configuration.closeEnoughProgressThreshold \u0026\u0026 abs(target - progress) \u003C= configuration.closeEnoughDistanceThreshold\u0060 appears character-identically in 2 files \u2014 experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/CursorMotionModel.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":"experiments/CursorMotion/Sources/CursorMotion/CursorMotionModel.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c17916baedb5ae63c0372865ff936a6cbf3115a17e1f63752cd8c8884867ddb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result == .success \u0026\u0026 settable.boolValue\u0060 appears character-identically in 2 files \u2014 packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/InputSimulation.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":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/ComputerUseService.swift"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"8711229fe626c6ba766e7fe3506638d4b370d580fbe6c0cee2d7a68c2fe61250"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.phase == .idle || status.phase == .awaitingManualUnlock\u0060 appears character-identically in 2 files \u2014 experiments/LockedUse/Sources/Installer/InstallerMain.swift, packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseActionScope.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":"experiments/LockedUse/Sources/Installer/InstallerMain.swift"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"104f5d2189f3fcc995a61705ae1db3f4fb654969f1f85a667d12a02c8d97fb71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type == .tapDisabledByTimeout || type == .tapDisabledByUserInput\u0060 appears character-identically in 2 files \u2014 experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift, experiments/LockedUse/Sources/Guardian/ShieldPreview.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":"experiments/LockedUse/Sources/Guardian/DisplayGuardian.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aafcd8d67876d9d85234681d502483fda3784518f4f4eb8ee329d893d5357c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/AccessibilitySnapshot.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9e3989a81b4c472d7c7f62eb44514751c0beae86b5c7a711333f7b9bc280d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/LockedUseDiagnostics.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec46de1441d19470add524bc1b6aa0a6f1244a709d51dcbf8d6bb36319da52f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/TargetedQuery.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"260b5caa5b8ceac71cc278659484f4f56871942042da53c198acec759ef32622"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/TargetedQuery.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d284d6938dec0f02b1dfeab6398148bd13a509ff0ed5a07f0f93ffe2980e07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/OpenComputerUseKit/Sources/OpenComputerUseKit/WindowOcclusionKeepAlive.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3feb3feb910ba692f4473e0b28a268ff9835626b58157dc12175a9dc45b5cec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edabed5e2148adb3450e968d1de8bfe7f96f29415c4110eab02441f4d41470d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/Sources/Guardian/GuardianMain.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61fa43dca02a32d898186d69e9df7b6a2c056cd632afc43b1b44f05bc8beb50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/AuthorizationPlugin/TaskVerifier.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d70d74c01998cb3d6521587f54b83d80486b095bf3fb8c9f773848a37098031"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/LockedUse/AuthorizationPlugin/TaskVerifierDiagnostics.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedd383208344a5ba9cc4da2ccd8255f8a6a9c050aec03f59572c33831816bb5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb1bf50ee9e82a5ec12729100fd2b785a395384a29b4080733ba4f9269bef9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"856f8964fe55c4e9602d902add5a8d7afac133cf21396a5d0b56ec01600b6e9c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"895c3fab26cca0d899a42f21f748c028c7bfa6ea52c29c9501c64819d22daa84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf24d5a21654295c7f4817bfd315c3c44bd41192dc80b0046f7b60a71cb0840"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e809eba41fd792dde73c0d8d10eb4231f67453c64a90e30b198146108554eef4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a90c1fd1c42102e9cd9a2f7c5b0cb11374b84e865d7a6ba9ab14492fc9ef556"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9880c5adb8ab35118dc6e8f156034d567f094d1687a348573b4d184ae1772c69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c780d49ce976e25d52b1df7b56d46dd4ff1b27018e4a2a3fd4c3b072e650cc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"84794471a211a2f399db7aa64a0ce76438912dd350d1ec12ac431bc0013fdc67"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0f1eaa7bb9ba44aa43ac2ad8681e53524a757859fad533a080548be8df0dc4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060node_pid\u0060 swallows every exception into \u0060return 0\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":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a67a0fd6ead840798bd7907710dfea5cb98e805294090af963d6c8937e8e40f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pixbuf_looks_black\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":"apps/OpenComputerUseLinux/runtime.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc783582266d74e921bcfc3ee11390bf3f883f75e8eb4faeff85906b35bdf1c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060firstWaylandSocket\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseLinux/main.go"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb725c712f1ae494db5523b95fbb41f8bc611d839d5ba77d1771d24c5189d4f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060validateScreenshotPNGBase64\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. 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 \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/OpenComputerUseWindows/main.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26fbdacc4fb77a4b41c9e8038de249f2dab642192509b2c903ee9be19612fb6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060diagnoseBrokerTask\u0060 turns every thrown error into \u0060-3\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":"experiments/LockedUse/AuthorizationPlugin/TaskVerifierDiagnostics.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f01d687497f0d1600c5678741ae7a440d42bf7789619528a61dbacf173ab9b2"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-668","guid":"e2cb99db-6d24-b056-b0d0-885a733ec403","name":"Exposure of Resource to Wrong Sphere","shortDescription":{"text":"Exposure of Resource to Wrong Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/668.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-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":9,"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."]}]}