{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"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":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 1729): main.swift.top-level code has cyclomatic complexity 1729 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (main.swift.top-level code::vec, main.swift.top-level code::arm) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b555ac059f53c7882863a1fade180b2c794462b2a2a92796d28cae83ec9052a9"}},{"ruleId":"D1","level":"warning","message":{"text":"PerfScript.perform (cyclomatic 252): PerfScript.perform has cyclomatic complexity 252 (threshold 15). Of this number, 248 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b916d97ff03b627af7ee49b4cbf9489973ab47836119606a39cb1fb5fcde0b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 176): main.swift.top-level code has cyclomatic complexity 176 (threshold 15). Of this number, 168 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46340b59c864581691dc86aa4c1907cbd2795da7cc598d5737789c8ab4c27db"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.index (cyclomatic 156): Indexer.index has cyclomatic complexity 156 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (Indexer.index::updateTimeLeft, Indexer.index::handleStream, Indexer.index::flushImages) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486a3b9f3ce1e089926df3b43ec3b407e745f54f191f3fdc1facf8e4f37856f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 105): main.swift.top-level code has cyclomatic complexity 105 (threshold 15). Of this number, 91 points are the body\u0027s own statements and 14 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/mutbench/main.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd29d4245039a0f651b117065c094a2918bb584692137a341aab388a4f07a68b"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callSearch (cyclomatic 82): MCPAdapter.callSearch has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1c87bda91dd0a24ab89cbf04959927c4414467ff6b443994395edb8c4e5b43"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.decodeContent (cyclomatic 79): Indexer.decodeContent has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4721f83a83982394f155fd6da5e857a86d54856b7b099fb216eef34c82b020"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.tryAdoptRowSidecarLocked (cyclomatic 79): VectorStore.tryAdoptRowSidecarLocked has cyclomatic complexity 79 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13384}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ea62f99a974a73d53969abd6b331cc80e2510c1cc9bbfb8abe7bd8d7e64d13"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRModel.decodeContinuous (cyclomatic 79): OCRModel.decodeContinuous has cyclomatic complexity 79 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 19 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c965040a5955c591952bf656730762a42adec2e934d14cb987f45f48c6ae626a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.tryAdoptQuantReplicaLocked (cyclomatic 72): VectorStore.tryAdoptQuantReplicaLocked has cyclomatic complexity 72 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f3dd1a80d1ada956e9f6808b3107e737510e01cfcfb8b7ba644ec0e143f86"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.update (cyclomatic 68): Indexer.update has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Indexer.update::flushImagesU) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c8378bcb95b2a2d00850c73392dbdfa316f25def7e4980939ffd7959fa7b78"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.reduceTopK (cyclomatic 67): VectorStore.reduceTopK has cyclomatic complexity 67 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8741}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96e6b43b1b3d25b774bf097659b8ce42d6d7226148cb63db934a19fe4bd5bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.recoverChunkTexts (cyclomatic 64): Indexer.recoverChunkTexts has cyclomatic complexity 64 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 18 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2482938e92af42db818eb1d8b04b06621a9ff7e5b70056c857329c524c8071e"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.enrichOne (cyclomatic 62): Indexer.enrichOne has cyclomatic complexity 62 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0f7fa9a3736c15fc65ea1840a50eec24be31000c800a86ae7db276fec534bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenText.recognize (cyclomatic 61): ScreenText.recognize has cyclomatic complexity 61 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenText.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e4ec5ee6c7d35460d96ac6ea1d5d8b336ff582e0edc8331720ab74409c2feb"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.loadBySlotLocked (cyclomatic 60): VectorStore.loadBySlotLocked has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0cdfb0adac3dd22291e260485f37c9e4d436f658721a07652cb575c9645d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRSession.run (cyclomatic 58): OCRSession.run has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"923454a202d0910c75e73fa946d71217fb358dbb3adfa72f8826a2b67e0cd149"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.loadIntoMemory (cyclomatic 57): VectorStore.loadIntoMemory has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6908f0dee633770110462842d49a7549d9eb0eade22dde3cbb7848e37e11e846"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.listMatching (cyclomatic 56): VectorStore.listMatching has cyclomatic complexity 56 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7ac1858ae4f7fe703ed1af79aca64a040a83f2a29577626a0165040de7a797"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.rebuildBaseLocked (cyclomatic 56): VectorStore.rebuildBaseLocked has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14084}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d72f56434108fa1984299729d28a9784d60b0780f29ceb0788de662e2bf9a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalCommand.evaluate (cyclomatic 56): EvalCommand.evaluate has cyclomatic complexity 56 (threshold 15). Of this number, 55 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb7527dc7563174a5d73fb9ccbf736dc9eb482e0444b1ffa2b542816067d188"}},{"ruleId":"D1","level":"warning","message":{"text":"TextSlice.read (cyclomatic 52): TextSlice.read has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b9145fc29123869d105e5d81cad3710c2c3e54f48ec6c7e745aef02d8b4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.search (cyclomatic 52): AppModel.search has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6290450b6aec64ec5f819a85e27a42142ec6c789818780cb4f1f83eb4a224a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.init (cyclomatic 51): VectorStore.init has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b40a7fe4195d9bd2cb8610438d94d8a271a821c3edd9f1c90b1749d99abf63"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.run (cyclomatic 51): ShotBench.run has cyclomatic complexity 51 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"e246a0a4d45975874b2b2ef670cdf0587135950f21f2edcbb43c45a393a1559e"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderHistory (cyclomatic 50): index.html.renderHistory has cyclomatic complexity 50 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 29 belong to 12 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"site/omni/index.html"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca389d526f44b6c75441ac92ace2c78971c3697750138f866c27b4bb803b353d"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityTab.body (cyclomatic 49): ActivityTab.body 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":"App/SettingsView.swift"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a7f5e63cb1da61dd755d586185ef6e13896957a660667e6f585d6700b2f419"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.searchCandidatesLocked (cyclomatic 47): VectorStore.searchCandidatesLocked has cyclomatic complexity 47 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 18 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7602}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafe90f6143f7ee9d0bbeefc844f258e4c4d320a716f9eb1a4ad83aa2c9c274"}},{"ruleId":"D1","level":"warning","message":{"text":"PaperSuite.run (cyclomatic 47): PaperSuite.run has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperSuite.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d8bc384e46c6e76ee869ceba2d0e0d6dff72823bab1f73339af0c240f9c8e2"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRSession.runGroup (cyclomatic 45): OCRSession.runGroup has cyclomatic complexity 45 (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":"App/OCRSession.swift"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffdeea3b294fc88b6a3ff61f0f178b8b74114595cbde9138832c1bbc93cda36"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.reduceTopKGPULocked (cyclomatic 44): VectorStore.reduceTopKGPULocked has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d923da404601329834a319005bddad16674fb56b8b4ce6c6c4ad2d5a965470f"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.relocateTailSliceLocked (cyclomatic 44): VectorStore.relocateTailSliceLocked has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12539}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3a144595e86a7c80aff2427836e3a33a386725822df19b639e8b8a396e42f0"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.stampVectorCoverageLocked (cyclomatic 44): VectorStore.stampVectorCoverageLocked has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed932d6ebdb5eab82199989326eb1d17ca5255a591e2f80a60310c4ff1d1e5"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.catchUpPendingRoots (cyclomatic 44): AppModel.catchUpPendingRoots has cyclomatic complexity 44 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":7249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aea3272abfd66a15f788a5e13e6720818a2dc235675dfdebfea3a63cfad8ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.streamedVectorsUnderFolder (cyclomatic 43): VectorStore.streamedVectorsUnderFolder has cyclomatic complexity 43 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 24 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2e9fc0d475dbcee1c4e92c10059fc4a8dadd3ad060152bc2f9c5713d49297"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.mediaTurn (cyclomatic 42): Indexer.mediaTurn has cyclomatic complexity 42 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"15684ba00a5ca89686dba8c8fb53f7a9482532b543b13225e9618c44139ebe2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.pipeline (cyclomatic 42): Indexer.pipeline 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf45a44aea2efbcc2c15fb384e6b88171aec67977859eb3086146468c361b57"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.searchDense (cyclomatic 42): VectorStore.searchDense 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. This shape REPEATS in the file: one other method here (VectorStore.searchDense::coarseFastPathLocked) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d412efadb6fda3bca4c8f9973116fcc683305adf45c0972aa01a119d77c6fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.applyParsedQuery (cyclomatic 42): AppModel.applyParsedQuery 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":"App/AppModel.swift"},"region":{"startLine":5050}}}],"partialFingerprints":{"codehealthFindingId/v1":"516bd8d2548340344199324dd8f07689ded56a34f5eb9d31c3df505ed392897f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 41): main.swift.top-level code has cyclomatic complexity 41 (threshold 15). Of this number, 40 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":"Sources/crawlbench/main.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"989700fb8b30280152e603c97f7db8c8ff3930f5ef10eb9aaf5979dde3043887"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.churnbenchRun (cyclomatic 41): main.swift.churnbenchRun has cyclomatic complexity 41 (threshold 15). Of this number, 40 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":"Sources/omni-verify/main.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d76a5eeeaa3e6a80716ef44ee3d0432621717a3e60cc4c86a94b3700955f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.anchorStarts (cyclomatic 40): Indexer.anchorStarts has cyclomatic complexity 40 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 18 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef38105c8e1ec1729e5c09ab3c39c371b082fb6da1ea02e811bdcbd8d7be26d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.storeStreamedText (cyclomatic 40): Indexer.storeStreamedText 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c05718a8d525317c69bc9243f70e0d851f75e70b6aacb00d366fb42d3ceee51"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.rerankLocked (cyclomatic 40): VectorStore.rerankLocked has cyclomatic complexity 40 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7831}}}],"partialFingerprints":{"codehealthFindingId/v1":"40abb12e86dcef2d3f486306ca1be1e37a956a8455adb1e89f4a4e05cc8e73d5"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.recomputeResults (cyclomatic 40): AppModel.recomputeResults has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623c880a9abe4c6c31eb50b874d4b309e4e88671501954d6ecae18cc76f7227"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchArgs.filter (cyclomatic 40): SearchArgs.filter 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":"App/Serving/SearchArgs.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4695712f40191e3088566f1d62e7ec2e2d0c98df89395cd107e70644ac5611"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.bootstrap (cyclomatic 38): AppModel.bootstrap has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a63ef4bf2e909cf6e38651cecab665af9e0583c7878f3c61fda21acb418f2"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.migrateScanKind (cyclomatic 37): VectorStore.migrateScanKind has cyclomatic complexity 37 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d575404e98f78e84a4a7fc6301a49cebff93276dd665f565bf263f59af0b83f0"}},{"ruleId":"D1","level":"warning","message":{"text":"Sidebar.body (cyclomatic 37): Sidebar.body has cyclomatic complexity 37 (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":"App/Sidebar.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"328ac0e8592a60bb27652937f3af3d4b18e9c9769a33f1da1c014753fb41bb8e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatOCRAdapter.handle (cyclomatic 37): ChatOCRAdapter.handle has cyclomatic complexity 37 (threshold 15). Of this number, 36 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":"App/Serving/OCRAdapters.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"405b844ffdcc8905a56150106728c6fdbc80ab00e6b4196aba185462ca4616ee"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code::arm (cyclomatic 37): main.swift.top-level code::arm has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (main.swift.top-level code, main.swift.top-level code::vec) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":5166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40067d6954e55a4153f060fac3cbb7bb899e88ca4154ffa75a4c7ed7c60260a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.arguments (cyclomatic 36): main.swift.arguments has cyclomatic complexity 36 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff353cbae1e51c15cd453a41cf09e04df8e5297b6448c974e2a954e987941f6"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.setComputeUnit (cyclomatic 36): OmniEngine.setComputeUnit has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c7c5cb62bcb2147538928bc8a60a2f7c3e876346770addf650a1cbd7862638"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.loadFromCoverageLocked (cyclomatic 36): VectorStore.loadFromCoverageLocked has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11075}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b02d79e84a393cd40ea8df094225aa18827fab39529b0c278203a9a092ff49"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.migrateToV4Locked (cyclomatic 36): VectorStore.migrateToV4Locked has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21569f1b29f733ad070c1f7b3ffdb73acd77fa7fd2b6b173657096d9d7cda9"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.stillSize (cyclomatic 36): ShotBench.stillSize has cyclomatic complexity 36 (threshold 15). Of this number, 35 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7068f2ea6305534b7145490063b772636f0f3febadb353d3c09fafa8eb7d7bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.deleteProvenOrphanTwins (cyclomatic 35): VectorStore.deleteProvenOrphanTwins has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577549272defc43170e90a5898a5d8d8c6087487478d846af4090e2a9fef4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.drainPendingFSChanges (cyclomatic 35): AppModel.drainPendingFSChanges has cyclomatic complexity 35 (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":"App/AppModel.swift"},"region":{"startLine":9413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5be6d62044de6ca9c8718caacae6aa7123cc40537d57e7b08b8a25b7c30872e"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEAudioBackend.encode (cyclomatic 34): ANEAudioBackend.encode has cyclomatic complexity 34 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANEAudioBackend.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c50670e677f31806877edb0c7b9b52275d0b9a62da381ab6d319bcd3ed4fc9a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.vectorsUnderFolder (cyclomatic 34): VectorStore.vectorsUnderFolder has cyclomatic complexity 34 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6187}}}],"partialFingerprints":{"codehealthFindingId/v1":"739bf6d94d986e90ceba6f49deb3c71224977e5393e796d1c99e90d1871f56a8"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.startIndexing (cyclomatic 34): AppModel.startIndexing has cyclomatic complexity 34 (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":"App/AppModel.swift"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a07131ebacf385502f875126b4cb5f7bf47005005bfd627a17e70392054e97a"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniIgnore.inSet (cyclomatic 33): OmniIgnore.inSet has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8129d73aa1d415ec9ced62528defb831bb705c5dbe9aa1c9291773a47f2ede"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callReadFile (cyclomatic 33): MCPAdapter.callReadFile has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4693953128be48aec8da686d58b27b24341c111cf4a8890608532a844572b304"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.sameVectorSpace (cyclomatic 32): Indexer.sameVectorSpace has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aedf494866ad632aba4dd7ade5a337d776843016c007c231e059d8460ffd65e"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.embed (cyclomatic 32): Indexer.embed 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4844}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaf7ee08d7a13100f58fe7eb68e36ef798273762fca787294409d4e826c0854"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.reclaimVectorHolesBodyLocked (cyclomatic 32): VectorStore.reclaimVectorHolesBodyLocked has cyclomatic complexity 32 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efed62b774310eee5caf39622c66840c5e9a295213ce4266161c18181f0de8f"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownBlock.parseUncached (cyclomatic 32): MarkdownBlock.parseUncached has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/MarkdownBlock.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9ecfca69a00a3b056e196ddf7e9c9906bfe49221a9091d049fc3495592554b"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.invalidArgument (cyclomatic 32): MCPAdapter.invalidArgument has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f2d8d2cde9e3637a9d8d76712e08190caec26742d58aa49e896b944c40e302"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 32): main.swift.top-level code 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":"Sources/opentime/main.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3091de60068b81f4345e2fe9862272919252945626cabf5629a910713b2cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"ANETextBackend.encode (cyclomatic 31): ANETextBackend.encode has cyclomatic complexity 31 (threshold 15). Of this number, 30 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e60bc463469d3adaf5463d953f4d067fa78ae20a3d2de3d6f679b63df5f2e30"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniCommands.body (cyclomatic 31): OmniCommands.body has cyclomatic complexity 31 (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":"App/OmniApp.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bbf5d3074a35e63fffbfbe18a24bc96f71ab7696a4e1389eac5d67b03df872"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEQuery.engine (cyclomatic 31): ANEQuery.engine has cyclomatic complexity 31 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d95dc05d96dda4a11ca96562fe3ce754b16b1ab7aa4265f50e9e212f687c3"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.rowwindowcheckRun (cyclomatic 31): main.swift.rowwindowcheckRun has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 3 function items inside it that branch (run, observe, reopen). 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":"Sources/omni-verify/main.swift"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"07616ea4cadd072012f1e879d404534f82b7280a0516eb4888533181e3743989"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.chunk (cyclomatic 30): Indexer.chunk has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2dc91ac3eeacf504ed99b823f8aec8cb476093f9dbc89f646e79f8524f27ea"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.repairIndex (cyclomatic 30): VectorStore.repairIndex has cyclomatic complexity 30 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895d5a1996ec499c45eccf56b7e2554007c57705423248f9cb5a74dc39e1298"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentView.body (cyclomatic 30): ContentView.body has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0d669ad4bdf1a2cc351e79f820375931b756848a830f2d4f6355a8e17e1fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.audiosegcheckRun (cyclomatic 30): main.swift.audiosegcheckRun has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7276}}}],"partialFingerprints":{"codehealthFindingId/v1":"230bec27e1125e395da7a7ac0c55872b3f7a178d62e6c1aec40816ae8c23381a"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 29): main.swift.top-level code 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":"Sources/OmniCLI/main.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c9ad2176f0dc27ecfc3244c0e12e1274e2bf7369f6bbd6c4dec5d5f9efec6"}},{"ruleId":"D1","level":"warning","message":{"text":"IWorkText.storages (cyclomatic 29): IWorkText.storages 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":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"336059b94a7b128c1b159a0edad84b2a225822a0e969049dea9899ab409c024b"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniImageEncoder.encodeChunk (cyclomatic 29): OmniImageEncoder.encodeChunk 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":"Sources/OmniKit/OmniImageEncoder.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc52472a074962ca397320487b2a636ecadeacf72af3dd60725481035aef5629"}},{"ruleId":"D1","level":"warning","message":{"text":"PagePhrase.unique (cyclomatic 29): PagePhrase.unique has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PagePhrase.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cf3125fb711ee2e983459572051948b3e4d018ed3609ebe864cf0f8cd99ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.restoreCoveredBlobsLocked (cyclomatic 29): VectorStore.restoreCoveredBlobsLocked has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab5e79c949ba4a756f19dc273b92d91cba95b82ed87c488938cb3f2aaad6490"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.compactRowsLocked (cyclomatic 29): VectorStore.compactRowsLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15582}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ca210e35619a7f926a9eb43cde2e2ae3913222be02dfc1d2db8fb4f60717b6"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightStore.init (cyclomatic 29): WeightStore.init has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/WeightStore.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"246cc46c35972c7274e4916826a2a08db9d2774ee2399ef8805189d3681bc016"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.scheduleTagBackfill (cyclomatic 29): AppModel.scheduleTagBackfill has cyclomatic complexity 29 (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":"App/AppModel.swift"},"region":{"startLine":9327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e12e4885fb38ebd65381c3311b85aea422bac2de6a968b770368160fa7eb0f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Coordinator.handle (cyclomatic 29): Coordinator.handle has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentKeys.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"671a0018d389fa80b9307d6e131d178803fd2cef10e7ed87e094127c1c30ed7a"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.readPicture (cyclomatic 29): MCPAdapter.readPicture has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e4f1fc022ab59c432e82702817d0247f29b6a6734da37e3d07f8d533b69b94"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.embedGroupsReusing (cyclomatic 28): Indexer.embedGroupsReusing has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9549f35dbfde42ddc89ba9d44afc3bd808b804cafca4e440fd374c4ab32f9537"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectionEngine.project (cyclomatic 28): ProjectionEngine.project has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2f528ea7cd26f586d87829470807f5be0a384e7ed068c9fb3b8591b2fceb3d"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.rankChunksAcross (cyclomatic 28): VectorStore.rankChunksAcross has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14601}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c6672787e18a2f0fe3ac021064501fec1e0ffd1c5a79faff09edc5ca7d677"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRModel.decodeGroup (cyclomatic 28): OCRModel.decodeGroup has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"575d41fe219f2db89fb0d58d473ff262959623155901a759b460572ec6877c45"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderRow.body (cyclomatic 28): FolderRow.body has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36dddbb5c8e344f98bfe71f24189110987a32b45c9e5a4e0e037cf9f7e32464"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validate (cyclomatic 28): index.validate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f45a162756402adb632500841b80671c21899d05560e995d3be609e151c3c55"}},{"ruleId":"D1","level":"warning","message":{"text":"TextSlice.find (cyclomatic 27): TextSlice.find has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f62330d8b24d61527511bbc9e6fa686a2ba567d615b75ecd47d809a8ff744f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.takeInStills::pass (cyclomatic 27): ScreenHistory.takeInStills::pass has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"447996603f24d50cfd92b68e2bf8652f0f6a862ab9fcc2405f1ac30180ae22c8"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.searchGraphDense (cyclomatic 27): VectorStore.searchGraphDense has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6677}}}],"partialFingerprints":{"codehealthFindingId/v1":"11977243e606dd0682e02e57a2ebc2f7c5753d0d4ff7f05d0d4ac62f8bdff0e7"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.persistQuantReplicaLocked (cyclomatic 27): VectorStore.persistQuantReplicaLocked has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced682ea53754703a2842de1dc8aa30c49ecc2c2ee43f995139896df7c5c4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"PerfScript.ocrStep (cyclomatic 27): PerfScript.ocrStep has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: PerfScript.applySetting (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3680f6630a4f1ee870b677b3da0d0dd99de9b09782c3ab49540ecdbf676d4411"}},{"ruleId":"D1","level":"warning","message":{"text":"LexicalIndex.refreshIncrementally (cyclomatic 26): LexicalIndex.refreshIncrementally has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/LexicalIndex.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"267ee4def08aad0173cdd65500d61d0f276dd1fa0171be2f0e861a205ec6d486"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaDuration.isoMovie (cyclomatic 26): MediaDuration.isoMovie has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/MediaDuration.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c83d1b39ef6492009b80a26295c7dbb4accabeed631762bea931ec4387fc49"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.selectMaskLocked (cyclomatic 26): VectorStore.selectMaskLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8979cadeb2a21bf65afb124a114d731364b30d59fc3997174d018e80d2f0434"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.measureSlotOffset (cyclomatic 26): VectorStore.measureSlotOffset 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef51554360b91d6c372c5d2b93937e9ef2a28edde3c2f779b4c225e15a09d79e"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.reloadEngine (cyclomatic 26): AppModel.reloadEngine has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1d3b26c687ced8a5c59089593b6660ae6a094ef9f61ffd5ee1fee38e9c1d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderEmbeddingVisualization.rebuildPoints (cyclomatic 26): FolderEmbeddingVisualization.rebuildPoints 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":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"80783ca5f9618c2236346c3eb0346b991254c6985d3c6fec219f31ca2a734554"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenRecorder.capture (cyclomatic 26): ScreenRecorder.capture 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":"App/ScreenRecorder.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ebeb8549b171287be8d59b6b8215bc41d14efce7d54125771e714cb12dd21a"}},{"ruleId":"D1","level":"warning","message":{"text":"Router.handle (cyclomatic 26): Router.handle has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/Router.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"875cf37e25ca3933e9b2169054f8b5fdccdb1140f2a9e348b54c85530c4cbd50"}},{"ruleId":"D1","level":"warning","message":{"text":"TagAdapter.handle (cyclomatic 26): TagAdapter.handle has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b9bc820aeba46e8151f49cd17867e9bfc4d98572644004417af3df63091a0"}},{"ruleId":"D1","level":"warning","message":{"text":"FileCrawler.walkBulk (cyclomatic 25): FileCrawler.walkBulk has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/FileCrawler.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0b44a787a69f9903cdc2859a1581436fa0cd552308f5ecc05b21ed3c19ec5f"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniTagger.finalize (cyclomatic 25): OmniTagger.finalize has cyclomatic complexity 25 (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":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9b529b0be7d89f411884321135400f1c10baa5e918f9aea7747c81687cf8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"PassageWindow.best (cyclomatic 25): PassageWindow.best has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"850c511d2204b79154026cef14dfbf72a12ee160af6c90eec560b1df56a60ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchQueryParser.parse (cyclomatic 25): SearchQueryParser.parse 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":"Sources/OmniKit/SearchQueryParser.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"746636baf1ff16fb362a21f009fb51e3e91f879c629d542d96c2ca10ee4eba69"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.deleteFilesInSlices (cyclomatic 25): VectorStore.deleteFilesInSlices 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdfed789ccbeb6624849df07ee13e64c1fa2575d08bfdeac386b53f58faf776"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.acceptedFilesLocked (cyclomatic 25): VectorStore.acceptedFilesLocked has cyclomatic complexity 25 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb77c7ba0f099f999339ec1dba3c05859495f3725739ec835c3f156cc402ef2e"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.dropV4TablesLocked (cyclomatic 25): VectorStore.dropV4TablesLocked 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, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f728c203c25e6fafd1f077c8d40a014eb911eb84fa52060467e09b9081098a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.applyResults (cyclomatic 25): AppModel.applyResults 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":"App/AppModel.swift"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ec6f166e8dc87492edb83454a0d86b1b0a0a43a1a9acbd0f44673b6b8cb4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderEmbeddingVisualization.body (cyclomatic 25): FolderEmbeddingVisualization.body 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":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d168fe892e89d8eacfdec2d5c1aab57f6f8fe2d65b724f5b1c1c9a2796e99c"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.notIndexedWhy (cyclomatic 25): MCPAdapter.notIndexedWhy has cyclomatic complexity 25 (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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"e952edfbedb26b8e22803350a803835728c8e06f83acd8b85144a4e94b559c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.streamWindow (cyclomatic 24): Indexer.streamWindow has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2044369e3c006a8e0131fb794bab115c72b6a1d117aa743608d582400a7cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.embedPagePictures (cyclomatic 24): Indexer.embedPagePictures has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc6c4d6bf0bbc7ba91790f28491e3847c09d9c42bf7cbbf91c68c1bfc738391"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectionEngine.gridify (cyclomatic 24): ProjectionEngine.gridify 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":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9582fa82faafa6496f57affc6ef660b770db0a3350ad3335bbe8a7224225d95a"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.walk (cyclomatic 24): ScreenHistory.walk has cyclomatic complexity 24 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd992bef8ee4caf6bdb05161ea18ebfea1eb4467ff1cdffea4f4ba8af5c846d"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.fileFactsToCorrectLocked (cyclomatic 24): VectorStore.fileFactsToCorrectLocked has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d5ddb5b640426c50c4051c07f5334ec0d1c18b10440baf85e72ad987b9c9c7"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.buildChunkSplitLocked (cyclomatic 24): VectorStore.buildChunkSplitLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab610d9e8d7473fcf1ec441c11e41ca6ea07dd09a77a7c7658b4ec8cf00bf79"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRModel.decodePrepared (cyclomatic 24): OCRModel.decodePrepared 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":"Sources/OmniKit/OCR/OCRSpeculative.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1df8e3f2887a4dc618bbba35b1b2ff26dabdc97de214caa2bfb25e838000d37"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.applyComputeUnit (cyclomatic 24): AppModel.applyComputeUnit has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8db4e97365fba92b0aa966229501eb1821504a5d8d79a75f4c995a43d16359d"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenRecorder.tick (cyclomatic 24): ScreenRecorder.tick has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenRecorder.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1187dadec34b114f13692cec89478dc39e56f3275dafc4a16c6e27798c735c14"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchToolbar.toolbar (cyclomatic 24): SearchToolbar.toolbar 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":"App/SearchToolbar.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99632f2d1de87295ff79f85869066f32dd4dc5b0967c6abdc81a391f01f364d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentOCRAdapter.handle (cyclomatic 24): DocumentOCRAdapter.handle has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/OCRAdapters.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea73040b137307ce30d0384cb3c40bfcfbbb8bb873ad717be2722304312f17"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRServing.parsePages (cyclomatic 24): OCRServing.parsePages has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/OCRServing.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd89e211549a35f2d7128446e9e715ceb77d618593efcfcd6f07b9d0be4ca3dc"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchAdapter.handle (cyclomatic 24): SearchAdapter.handle 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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc91ebf9f4739dbc3037e3184e445f2ddb6c74300a9f0526dcfa41614c04a3"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.embedFileQuery (cyclomatic 23): OmniEngine.embedFileQuery 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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"700e3cc28e1e38ae80c6489e5eda41eca638b3cece85ed832b8a486649bf444e"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.bestChunkScoreLocked (cyclomatic 23): VectorStore.bestChunkScoreLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f2d39b983d2a924f05a479cf84e3f18cd982d1ab5f7a37a97b2c610d8163b"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.stampRowSidecarLocked (cyclomatic 23): VectorStore.stampRowSidecarLocked has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba347b6629054ddc468bbfff953a0739bc0e7c221c12377d0cca2ac3d5cb20e5"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRWeights.init (cyclomatic 23): OCRWeights.init 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":"Sources/OmniKit/OCR/OCRWeights.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0161c49c41e35fbc1e01b4fbdc4cd113cc35fcbb9dcaa03384d38d868f549432"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkNode.pairingHandler (cyclomatic 23): LinkNode.pairingHandler 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":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bac1517d8d3050ff87936ec91c2bb573950ba11cafffebec5a8118cc19a44f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.refreshIndexStats (cyclomatic 23): AppModel.refreshIndexStats 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":"App/AppModel.swift"},"region":{"startLine":6371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae22745dcd80e3c7385bfd49641a9b9eb7c8f81b3363c470c784744062abbdac"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenTimeline.body (cyclomatic 23): ScreenTimeline.body 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":"App/ScreenTimeline.swift"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d8955bc69483c764dce0f0c14d06c2fb402737c04e37036ca08fd0ec19161"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexStatusRow.body (cyclomatic 23): IndexStatusRow.body 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":"App/SettingsView.swift"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99559eb023b4d945d9366ab0bc37a513a0ec49b6fa6816c5d1891f7d0ebf639"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalCommand.matches (cyclomatic 23): EvalCommand.matches 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97fab880b7343805189456a60ebc985002893fbc6460fd46bba01f2722b260d"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.reader (cyclomatic 23): ShotBench.reader 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d8b38cfbc9d8019cde27f15007f624787737b0639569162a4676e2407ba30a"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEVisionBackend.encode (cyclomatic 22): ANEVisionBackend.encode has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANEVisionBackend.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e994b9409d4410f4dc38f5b0218b06836bf98f053b9e8783b492f165e551376"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.index::handleStream (cyclomatic 22): Indexer.index::handleStream has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (Indexer.index, Indexer.index::updateTimeLeft, Indexer.index::flushImages) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"921123ecd93ebf219a54cd1da9563c29484e61ddaab028f8e6f09ee72c715b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.pdfTextTurn (cyclomatic 22): Indexer.pdfTextTurn 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"96661383e3297097269f7e7ad7baadcec2985ca7dc2d2f181ce901ea0c146798"}},{"ruleId":"D1","level":"warning","message":{"text":"CompiledPathFilter.accepts (cyclomatic 22): CompiledPathFilter.accepts has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PathTable.swift"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"52258545d61e1e39692c53a63db29158e64797c293ee9ba460418d8851c0e4f7"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectionEngine.pca2DBasis (cyclomatic 22): ProjectionEngine.pca2DBasis has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 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":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ed0907143830d314c7d31e374fa2bad6b03bafcf4f30ad9a291ea65ff0d26"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.record (cyclomatic 22): ScreenHistory.record has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ffd88cab3da0632ab2ab517933b2f78efef872a2277365a76ccf0a1a89ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.folderAggregates (cyclomatic 22): VectorStore.folderAggregates 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":5861}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f0c510bc449cb5a4730099ac45e54d2dafe228e46ca4f2758575c9358e22d"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.repointSurvivorsOfReleasedLocked (cyclomatic 22): VectorStore.repointSurvivorsOfReleasedLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70df5ef117ca7d9089177058a4f1aa04f3a008cb57b8d8195178365d0ef11f9"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.pooledVectors (cyclomatic 22): VectorStore.pooledVectors 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15043}}}],"partialFingerprints":{"codehealthFindingId/v1":"820394765a4d10dcce8de88c6f203d30c496bb9dad961cadf35c83c2594fec3c"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.backfillSlotsLocked (cyclomatic 22): VectorStore.backfillSlotsLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17873}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2a4f33f907b83cf7871bbec7ce93321c97de9e111d89252347b40ac0a03294"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderBrowser.reload (cyclomatic 22): FolderBrowser.reload 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":"App/FolderBrowser.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f8865fe7333214714a1e01e577b033503e831194d30e6a3e7d456674844734"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRSession.open (cyclomatic 22): OCRSession.open 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":"App/OCRSession.swift"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12d0087ae702f557f630c719256aece0b2487a4850707125df5cfe1b584911"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexTab.body (cyclomatic 22): IndexTab.body has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c92ae518ebdd5d73fe829ff4aa4fc44147850243e9ee9f85afa11f46272ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 22): main.swift.top-level code 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":"Sources/searchbench/main.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"db90184428a80085575984d5260d6dc3a4271707cd50f99b8843e0a5f2bd6f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.renderTable (cyclomatic 22): index.html.renderTable has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"site/omni/index.html"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb31fa82d4235eb79e17d72ab5948cabeb84c250ec11c9132ed7a3fd447a82a"}},{"ruleId":"D1","level":"warning","message":{"text":"ANETextBackend.runLayers (cyclomatic 21): ANETextBackend.runLayers 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e061e1f8c3986148f8c324d92cd7c3a967c1e6199f2c8616a37ee7c0c7b7a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Zip.entries (cyclomatic 21): Zip.entries 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":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"123256aad4d7e27fc4f7dc3f52e34561608c89584ce9c53c3681454754be0739"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.index::updateTimeLeft (cyclomatic 21): Indexer.index::updateTimeLeft 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. This shape REPEATS in the file: 3 other methods here (Indexer.index, Indexer.index::handleStream, Indexer.index::flushImages) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"96203a2ed63d7c4e07b543f7768432ec9b7bb4c2eb28981dbe35f4a669bc3f36"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniIgnore.parseSet (cyclomatic 21): OmniIgnore.parseSet 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":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"7095eac24d702b7413eb5a97f217b141a28bd42a11086331e53b4ed74d099f11"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.wallSeconds (cyclomatic 21): ScreenHistory.wallSeconds has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"5501be48759c26cf04ace5d33c72fc5c43ccb55d02898effccf7448a802a4e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.replaceManyLocked (cyclomatic 21): VectorStore.replaceManyLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"46054ab333b50d50ae2108c080abd3ffb4e45fa17ff0c3a345aeeeaac7eed106"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.pooledFilesLocked (cyclomatic 21): VectorStore.pooledFilesLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b341f9d2a2c6c159e9f414d41ad09e9818d70821bba09fe80338b6d502b2a68"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.fuseLexical (cyclomatic 21): VectorStore.fuseLexical 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7054}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d0447cd9421cf7c39fb4a54a313b58bb4360465e71fe0a4a5c9dd55f61678"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.placeVectorLocked (cyclomatic 21): VectorStore.placeVectorLocked has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54cdbc04edc239b70a6d0dd519233dcba1e1bb99fd90edb65bcfcc3ab5cd8e0"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.commitReclaimLocked (cyclomatic 21): VectorStore.commitReclaimLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12842}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1e17c927f775a09aee946310a99af0a562eaa46a92ecdd41554417b43b5805"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.persistSlotsLocked (cyclomatic 21): VectorStore.persistSlotsLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee242017f7f9321aa2ccc537dfb0428e17744b2550571c2fd806c2bc99cc5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.internPathsLocked (cyclomatic 21): VectorStore.internPathsLocked has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30adb89af703d29c3bafe9d8c57481270b9d90f00fd234e8211091f061786c"}},{"ruleId":"D1","level":"warning","message":{"text":"Drawer.run (cyclomatic 21): Drawer.run 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":"Sources/OmniPages/main.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8766a0fcb0a804b04e94bc8cc880ef2fb099d6314be77f76165fb3a8259acabe"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.perfSeam (cyclomatic 21): AppModel.perfSeam has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":9709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf28f3cbff15cd9d1fdfe1e5c355dc525fc374eb85f825acb26dc3087a971f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.runPaperBenchmark (cyclomatic 21): AppModel.runPaperBenchmark has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PaperBenchmark.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c3f7855f858ff1d9018d4447229aab9858987d9c2c59be263f14fb4733963"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentScroll.scroller (cyclomatic 21): DocumentScroll.scroller has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRView.swift"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ee95488e1663b3b55f6351b73343e3179096c6cc07597b947334f7d20f052"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultRow.cell (cyclomatic 21): ResultRow.cell has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2114dd42bfaf6ef17d051ca00c51ec2a85769cfe0e4d870b1d2a41c1c865a97"}},{"ruleId":"D1","level":"warning","message":{"text":"PerformanceTab.body (cyclomatic 21): PerformanceTab.body has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e16b94199cb76b435d061c8543ec72f8eaf7c48e1a35c175ec5b0cf3c2c9b56"}},{"ruleId":"D1","level":"warning","message":{"text":"Sidebar.reconcileSelection (cyclomatic 21): Sidebar.reconcileSelection has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32f1ff27252f4e6817e11c83263859af3b3626207adf53ea8d847fb5ceae930"}},{"ruleId":"D1","level":"warning","message":{"text":"PhotoSourceRow.body (cyclomatic 21): PhotoSourceRow.body has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e8e54e33a391113626451236a37e20d69b11583183614e78998ef4ca93cc34"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callOCR (cyclomatic 21): MCPAdapter.callOCR has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a354ecd4aea036ec9744663080c8ec944a987f30065a40f86fda12656d2151"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callTool (cyclomatic 21): MCPAdapter.callTool 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"00710ebddcc6381c9b2cf2b5bd96a076207fcd6be3845a52062a769493955564"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.videosegcheckRun (cyclomatic 21): main.swift.videosegcheckRun has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"948897a73633068957ae6c0499f6d33ff4746a1e6483b420090832cfb8c687e0"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.rpc (cyclomatic 20): main.swift.rpc 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":"Sources/OmniCLI/main.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"157e6c213d95b3d532062fe274d9f16aef2555cb6fcb34e6282e4d2677f8a077"}},{"ruleId":"D1","level":"warning","message":{"text":"Snappy.decodeBlock (cyclomatic 20): Snappy.decodeBlock 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":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d525d8a98652dad0bc2d0dd4d695a50d39de1e46ec371c5fc4aee5ec1f037fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.readIdentifiers (cyclomatic 20): Indexer.readIdentifiers 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b6e4b6d0573be018d95cee9cd11caf1473e00a37be090f98753b23e95ffb3"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.pieceTurn (cyclomatic 20): Indexer.pieceTurn 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdff3450b8ae4b5702487addb0d3a818048e201e3e6fb5026515bd61df75835"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniAudioTower.forwardImpl (cyclomatic 20): OmniAudioTower.forwardImpl has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioTower.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8c0fcc137aa76c3f1694ea6ef76e1bc2666957504fb2b6ad2208f792ee08df"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.rewrite (cyclomatic 20): ScreenHistory.rewrite 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aaf87c8df941ebb3bbe4ea0fcebc468b729546f3d1113b0dc4243652e98571"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.modalityScoreProfile (cyclomatic 20): VectorStore.modalityScoreProfile has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c4d1b090ebb46d4acded9b136ce484eedffe856a8822824f5f16a97d0f8a0"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.coverageAudit (cyclomatic 20): VectorStore.coverageAudit 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1884e4b74ae87b00fa25a9f1f15aa566a7225e6b6699eed3ddd7b555c879ae3e"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.advanceCoverageLocked (cyclomatic 20): VectorStore.advanceCoverageLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12047}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea93b630ebacfbc897f444cc3af2f0d75fe81ef29a3816b6cc9ccb4dbaac1a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.rankChunks (cyclomatic 20): VectorStore.rankChunks 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14476}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b3b3975c2444b9632dda53e05969b6512ae241947d03518eb4aeed290b79f3"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.writeChunksLocked (cyclomatic 20): VectorStore.writeChunksLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":16809}}}],"partialFingerprints":{"codehealthFindingId/v1":"310a64f051d256959897d9ae0cacef2605964fdafd055e781ca06ab924237523"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultGrouping.group (cyclomatic 20): ResultGrouping.group 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":"App/ResultGrouping.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"12241a1a51bf5e751dedca1a375f0b44d494e1e01524dae24b52a1c3cee898e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultsList.menu (cyclomatic 20): ResultsList.menu 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":"App/ResultsList.swift"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"568b292f4e4a0ba8396302baabb581e407e8e9e4895e6642806aa679cc4086f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Coordinator.install (cyclomatic 20): Coordinator.install 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":"App/ScreenTimeline.swift"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b62eb7c3184ce91492aa7b11790364ad389f9b859a9d15c7eee6d9cd6d2df34"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callFileStatus (cyclomatic 20): MCPAdapter.callFileStatus 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"51809361ee8a0dcf8d77d8add951bcd140d5c813e7c02ae1efe4dbaff6a93b28"}},{"ruleId":"D1","level":"warning","message":{"text":"ServingController.startServer (cyclomatic 20): ServingController.startServer 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":"App/Serving/ServingController.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8107f46713258cb85dd336b2024f601a17930c647112abb3a5ccdd4bd181317"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 20): main.swift.top-level code 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":"Sources/linktool/main.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"66de89cb230d28fe796539409724c96f88dad4b524282e39f8e6bdd1873e07f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.frameEmbed (cyclomatic 20): ShotBench.frameEmbed has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (video, cos, line). 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"072be20f90f5da23ca73bc6734b55003dfd7d46e8da518c51f5ea5040eefece1"}},{"ruleId":"D1","level":"warning","message":{"text":"ANETextBackend.packedInputs (cyclomatic 19): ANETextBackend.packedInputs has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33f6ac5fcecbdc40be53ea970f983ee9973573a4dfb533090dfb3e84378e931"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPagePictures.imageShare (cyclomatic 19): PDFPagePictures.imageShare 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":"Sources/OmniKit/DocumentPictures.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8590596a5dee14e464903e874abb36f7155141d25527457b4c41f8109ce7f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"IWorkText.extract (cyclomatic 19): IWorkText.extract 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":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7b29655f45646204b23ed4be0bfb10b3373d59082d9b510589710b8e6c591"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchFilter.accepts (cyclomatic 19): SearchFilter.accepts 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b29beeef914dbe8692376f7195cc2a9f1abc8382a0e5c50d1f66566b15d8e8"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.keepReleasedLocked (cyclomatic 19): VectorStore.keepReleasedLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17240}}}],"partialFingerprints":{"codehealthFindingId/v1":"509652634f63da8fb7ae4a81c2553e056c64382ed74e8e35c50a11199f85db85"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.serializeSearch (cyclomatic 19): AppModel.serializeSearch has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60547620e44835fd32046a1474645c516bebeea93d7fff47e1a4b11d9eb2cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.lookAtQueue (cyclomatic 19): AppModel.lookAtQueue 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":"App/AppModel.swift"},"region":{"startLine":8705}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02f16aaa563f86f9b90c86e60752a070e3146bf8aa91bbdd5baf08b4ee4212b"}},{"ruleId":"D1","level":"warning","message":{"text":"FileMenuItems.body (cyclomatic 19): FileMenuItems.body has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FileMenu.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"598023cdbc8a6caec01620f174b68e06772b62154f834ac0baa5db2a71e2a0c2"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEQuery.vision (cyclomatic 19): ANEQuery.vision has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cad79aa2888bf21eff17a3da6c294730507de4b73d6ecd9e15f516b5e01406"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEHintAB.pair (cyclomatic 19): ANEHintAB.pair has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771550be6af426bd973f9275a4ec8d6e7fd246938964fc9045461ad68032d7f"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.reference (cyclomatic 19): ShotBench.reference has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9fcc9b7d40442803cb38366b3d93f44343edddc0509c7a3729b9d9631a4236"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.tombstonecheckRun (cyclomatic 19): main.swift.tombstonecheckRun has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"Sources/omni-verify/main.swift"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6495d6aff28e22668eb3da9cfd87433fb4091e0430820d189e9ce5ae251567a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentChunker.cutPoints (cyclomatic 18): ContentChunker.cutPoints 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":"Sources/OmniKit/ContentChunker.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb38c472660915955aebda967fd441b2b12c3bbeb71fbd13728e650030d6c53c"}},{"ruleId":"D1","level":"warning","message":{"text":"FileCrawler.walkLegacy (cyclomatic 18): FileCrawler.walkLegacy 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":"Sources/OmniKit/FileCrawler.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c04e1bf9348ec5ebff6157befd5a94604c3549e47290066b83e1f6298635ef"}},{"ruleId":"D1","level":"warning","message":{"text":"IDTokens.tokens (cyclomatic 18): IDTokens.tokens has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/IDTokens.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea227df5d3e1eb81a0cfa4fdd9799fec2847bee42a3acfa9f93601057ae005a"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.enrichMedia (cyclomatic 18): Indexer.enrichMedia has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb16ffce52db992fc5ace8941d4e32bd22df00d24dbb83a1c75171be803a021"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.embedImagesTaggedHQ (cyclomatic 18): OmniEngine.embedImagesTaggedHQ 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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef952a5151e38022f4e33355953bdae846bd07f1db77947217d535cfae571bee"}},{"ruleId":"D1","level":"warning","message":{"text":"PassageRecovery.texts (cyclomatic 18): PassageRecovery.texts 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":"Sources/OmniKit/Passages.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad2ff60947631156d07ecd3c0841a6c4ed496646acd50678962a893a941865b"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.rowWindowAuditLocked (cyclomatic 18): VectorStore.rowWindowAuditLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5ff287226e255e55e353bf2eddc4b31ac0267527ccac1389336f385505f679"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.chunkVectors (cyclomatic 18): VectorStore.chunkVectors 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee473f333023f4a3c7de9662e56f53e06ada73756c8169493c3ca127b08d4d9"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.chunksForCurrentPathLocked (cyclomatic 18): VectorStore.chunksForCurrentPathLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd8bbd8ab838b105cd6da1417e02e0e278c08126e24507f63158b68c8190873"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.pathAllowGPULocked (cyclomatic 18): VectorStore.pathAllowGPULocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacd3d6cbf46da933df23c9d4e9c278025b69425a5657995c7854ae40322a4cf"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.fillPassages (cyclomatic 18): AppModel.fillPassages 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":"App/AppModel.swift"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"f238eb3220a3e7feb5073fe5a46310b67b7453287fe745c6a7527c4ec8fa404a"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.finishPass (cyclomatic 18): AppModel.finishPass 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":"App/AppModel.swift"},"region":{"startLine":8998}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f00be892abe4d7418ea03f7f882eae21ae1728cba81c9c58c8c0380326a4802"}},{"ruleId":"D1","level":"warning","message":{"text":"EmptyResults.body (cyclomatic 18): EmptyResults.body 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":"App/ContentView.swift"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b2c18ef7aabf773d23d51127553f2a7e5c8cedee12dc28413dee2c34f726a"}},{"ruleId":"D1","level":"warning","message":{"text":"PassagesView.body (cyclomatic 18): PassagesView.body 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":"App/ResultsList.swift"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25fd1c90c782a856fb9f0c048043a7584e7cf317ddddf4b75db0ecfd1dbc915"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenRecorder.frontWindows (cyclomatic 18): ScreenRecorder.frontWindows 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":"App/ScreenRecorder.swift"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d2c6ee1435d3abb66eb2a6eedff0fb079742c94e0434e2f5c47483c17f59e"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEQuery.parallel (cyclomatic 18): ANEQuery.parallel has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff3c20d941a037860ef2f2b45bea4df13cc86744cf15fd4dbf13becace5ba8e"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.neighbour (cyclomatic 18): ShotBench.neighbour 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"91353134a69b111cb073834e4142c7a2da818740b9818fb5473972b13150c3c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ShotBench.state (cyclomatic 18): ShotBench.state has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb024e2d2a586e2c2b3044d850eb47fbadf78adfe2ea39980517ac12202736c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validateTable (cyclomatic 18): index.validateTable 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":"worker/src/index.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e22a1de44bbe6add1591c3ac33dcd9ec111e80e13db6906794a4733160f733e"}},{"ruleId":"D1","level":"warning","message":{"text":"BulkDirWalker.walk (cyclomatic 17): BulkDirWalker.walk 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":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3defe8f47c80608ef7bf27381033879b6e725b434a1692da5dbe6a0d65d21b"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.extraChunks (cyclomatic 17): Indexer.extraChunks 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"62be6289d92229a82ce96fb77e16c0058a8dc10307c2af6d1bac7ecf28ae3ac7"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.streamedAudio (cyclomatic 17): Indexer.streamedAudio 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c122ef61ee5a1e2bb61cda13a77ca7db01405918c8fcb2a5be1a38b986b01b"}},{"ruleId":"D1","level":"warning","message":{"text":"OfficeDocument.slides (cyclomatic 17): OfficeDocument.slides 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":"Sources/OmniKit/OfficeDocument.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04f564a62920cb9233b201379eb822a9f3694c9e3fcc0b1c8ba77f06cfe6fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.run (cyclomatic 17): OmniEngine.run 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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d329bd79cee082ec7248daa4cce7ad984c167faa9084d1d03e7a030a847e86d"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.embedTextBatches (cyclomatic 17): OmniEngine.embedTextBatches 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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"1773086aee1621f3258d5d94fb1b81d5ec5f7ac7ac01b950739f80f4d38da255"}},{"ruleId":"D1","level":"warning","message":{"text":"PassageRecovery.passages (cyclomatic 17): PassageRecovery.passages 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":"Sources/OmniKit/Passages.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd2e5111a774d41ff9d0413db04e8c80a22c14e1a7d7e56f47f7cdeb77edff4"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.readCatalog (cyclomatic 17): ScreenHistory.readCatalog has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"23334148015dfb3731330d9a662e46d33d143d08e92001917324b7e1d8f1e7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchHit.matchReason (cyclomatic 17): SearchHit.matchReason 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":"App/ResultsList.swift"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb8bbb62496041d3f37b455e0f8726bbcc91e589f952345e6ad9089d4bd83f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Vec16Buffer.mapPersistent (cyclomatic 17): Vec16Buffer.mapPersistent 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb1b0d11b4695f3632593fcbaf30e508056861071171ffbd9db178d7461ad47"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.orphanSlotsLocked (cyclomatic 17): VectorStore.orphanSlotsLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec0166da89f2d581e856e267c25809b9c02b31ac9d7fea2d714cd1ed3cabf1"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.replaceMany (cyclomatic 17): VectorStore.replaceMany 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6200eb4f071726b5bd6abc267bb168ea1842f187d015d29e43882149e4f828c6"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.vectorsForContentKeys (cyclomatic 17): VectorStore.vectorsForContentKeys 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac58ce878239c3c60ec1b6b7e71a15eb27eb0a546341950064b61bf89d7cd7f9"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.deriveUnownedPositionsAsHolesLocked (cyclomatic 17): VectorStore.deriveUnownedPositionsAsHolesLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11762}}}],"partialFingerprints":{"codehealthFindingId/v1":"105962222219eadd02f87cc2d8e035cd4df786af15780311cacc07fd482efea9"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.releaseHolesOwnedByLiveContentsLocked (cyclomatic 17): VectorStore.releaseHolesOwnedByLiveContentsLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11826}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff66ba43e732e3f2cb8d95ff4274a599067ccc34a54b9e1abfdfe72fa1775fe"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.finishTailReclaimLocked (cyclomatic 17): VectorStore.finishTailReclaimLocked 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12670}}}],"partialFingerprints":{"codehealthFindingId/v1":"62992191482766571572c89bc5f31fb4d8d7934b1184642f3ea3d0b62727e049"}},{"ruleId":"D1","level":"warning","message":{"text":"BenchTable.rows (cyclomatic 17): BenchTable.rows has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/BenchTable.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c015cb06c3460e3e5aecbbe5a477b844d2e597a725f24740f7048b372a6f2621"}},{"ruleId":"D1","level":"warning","message":{"text":"PaperLevers.applying (cyclomatic 17): PaperLevers.applying 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":"Sources/OmniKit/Paper/PaperLevers.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"decd5352f20e16f69d5ba23a19c4600fc5e5e7a816b464fffb609969e69c1ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"PaperReport.appendCases (cyclomatic 17): PaperReport.appendCases 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":"Sources/OmniKit/Paper/PaperReport.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a7a7eb4a3454e71e0bd7f7f1ebe2c438cd781f0d01859001ebd5a9c8f5e0aa"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.pickPage (cyclomatic 17): AppModel.pickPage 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":"App/AppModel.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889967a60151fdffdd2e92460e50165c7387b9c16f1c243a2968842257146e6"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.reloadFolderPolicies (cyclomatic 17): AppModel.reloadFolderPolicies 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":"App/AppModel.swift"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa7b9f7045cb0113cfb1d5b47c29344a09b5000da8ced07b7f4840e73faee37"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultGridItem.body (cyclomatic 17): ResultGridItem.body 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":"App/ResultsList.swift"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c82ef90487122d4b4452d92c600f5c6e23e2d565a1b449e0cad09ab150bfd48"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenTimelineState.apply (cyclomatic 17): ScreenTimelineState.apply 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":"App/ScreenTimeline.swift"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63b85411cb86e01927e71e6d74f5a9157e422d87e84ccf654c6205d21e98afa"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenshotsRow.body (cyclomatic 17): ScreenshotsRow.body 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":"App/Sidebar.swift"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aa87e6c691e23cf58015c46f30fb3283d455695e4b55407207124d1acec112"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkController.refresh (cyclomatic 17): LinkController.refresh has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Link/LinkController.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b432410eccf54d005880bd3f69a518721cf9bd0c036340881c94b0364f2395b"}},{"ruleId":"D1","level":"warning","message":{"text":"HTTPParse.parseHead (cyclomatic 17): HTTPParse.parseHead 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":"App/Serving/HTTPMessage.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"012631fdff3dfbcf7965a7270722b52f3074087e136d7a68a1cdfa15484b14be"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callPhrase (cyclomatic 17): MCPAdapter.callPhrase 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a10e88b65cb7722da70e597252872ae1324735516464e45a231bb9ee5626cf2"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.unixExchange (cyclomatic 16): main.swift.unixExchange 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":"Sources/OmniCLI/main.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eb8aa1f69dcd05bcf436a549c3acafcf2956d38d96433ee679eaf6622a6f58"}},{"ruleId":"D1","level":"warning","message":{"text":"ANETextBackend.mapLayers (cyclomatic 16): ANETextBackend.mapLayers 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff8e967514e78f145262393b2e7dddef38b41d3dffa7538812088c02fab5c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ANETextBackend.inputs (cyclomatic 16): ANETextBackend.inputs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"30137e94e5be3303d0028c3a9c68f1498e29283ca13a7da0bc52ea756a5983ef"}},{"ruleId":"D1","level":"warning","message":{"text":"IDIndex.drain (cyclomatic 16): IDIndex.drain 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":"Sources/OmniKit/IDIndex.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e6dc0ee5a7c2ff58f7eaefe66e2ad7f2a01f2933b84fb997bec7ce50c07c88"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.index::flushImages (cyclomatic 16): Indexer.index::flushImages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (Indexer.index, Indexer.index::updateTimeLeft, Indexer.index::handleStream) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2455301f987c1991a9441da073f30a05240ac676631b87f07d2f75f552ea6f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Indexer.update::flushImagesU (cyclomatic 16): Indexer.update::flushImagesU has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Indexer.update) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"35af34a3686badc996f2aebb9b407a615d3c6c851549a5569e6147a4159e93c4"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniAudioEncoder.encodeBatch (cyclomatic 16): OmniAudioEncoder.encodeBatch 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":"Sources/OmniKit/OmniAudioEncoder.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"af99b36789f6aa0ea070b694840385eed4ab91b00faee730f9a6099a1ce6e8aa"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioSegmentReader.nextSegment (cyclomatic 16): AudioSegmentReader.nextSegment 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":"Sources/OmniKit/OmniAudioPreprocess.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6f8af7a4eff349be9b98f8477b364e9623f7833037cb8b9227d0ff2fbb04e"}},{"ruleId":"D1","level":"warning","message":{"text":"OmniEngine.installTowers (cyclomatic 16): OmniEngine.installTowers 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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"227269e4d43a34e667849f68327e5000e774500c5114c848a43e8d33e737e102"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFPagePick.page (cyclomatic 16): PDFPagePick.page 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":"Sources/OmniKit/PDFPagePick.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad628ec32d38b35fc0bd946507a914f5477aa1b77d49ef1cb446720e5a3fa919"}},{"ruleId":"D1","level":"warning","message":{"text":"ScreenHistory.read (cyclomatic 16): ScreenHistory.read 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3334e5ac75d9264896eacccec1a2aa8b51e3f542b9fbc38d479d2c02ea33410"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.searchDense::coarseFastPathLocked (cyclomatic 16): VectorStore.searchDense::coarseFastPathLocked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (VectorStore.searchDense) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7160}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0cf3c62db70ada21e2a77b2629026cbd636670f1779e1fd86fda6108e7c86c"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.correctSplitCoverageClaim (cyclomatic 16): VectorStore.correctSplitCoverageClaim has cyclomatic complexity 16 (threshold 15). Of this number, 14 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11509}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c5ed428e97de60f4b99c820fda1ce1165c9a98ffefbddc7f5fa768c2bc6a6a"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.retireContentsSharingAPositionOnceLocked (cyclomatic 16): VectorStore.retireContentsSharingAPositionOnceLocked has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011c88a8c3acb480cc3a70f9d60ef995d830b9758ca0dbda27b0401cd4ffba0"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.shouldReclaimHolesLocked (cyclomatic 16): VectorStore.shouldReclaimHolesLocked has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c104fd30a63af7fd3149f43427e97741c760c297ae4e3dbf2b4aa91b505f1"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorStore.bitScanCPU (cyclomatic 16): VectorStore.bitScanCPU has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13974}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2952daa835232d6194815555a3a4fe747c6cf2b7bbbb501b3f1fd8cadb4a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.loadPerf (cyclomatic 16): AppModel.loadPerf 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":"App/AppModel.swift"},"region":{"startLine":4970}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a48e3e18d1b6c78106a6bb873681fd05bd67e17ea613f5e49f3d934c167e4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.vectorSpaceDiffers (cyclomatic 16): AppModel.vectorSpaceDiffers 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":"App/AppModel.swift"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ab9eb873cabf3a687d1b584b51c0d1ed25504c4cdf23c21abbce5d73f6ad91"}},{"ruleId":"D1","level":"warning","message":{"text":"AppModel.drainIdleUpkeep (cyclomatic 16): AppModel.drainIdleUpkeep has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":7563}}}],"partialFingerprints":{"codehealthFindingId/v1":"160aa0158f5a503cbe676b36d432f5c2eba4e6e3d1da361ffedfcca4e489c287"}},{"ruleId":"D1","level":"warning","message":{"text":"DropIntake.read (cyclomatic 16): DropIntake.read 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":"App/DropIntake.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8afa8d9a75f7ab4e43998f0635f0affc75afaf87be70decb962c1ee00ea36d6"}},{"ruleId":"D1","level":"warning","message":{"text":"AppDelegate.dumpUIDebug (cyclomatic 16): AppDelegate.dumpUIDebug has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OmniApp.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a2f883c7b5e16a23411e9fa1f62aced06c1aaf168a0b19cef78e516f06c7ee"}},{"ruleId":"D1","level":"warning","message":{"text":"PerfScript.runIfRequested (cyclomatic 16): PerfScript.runIfRequested has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: PerfScript.applySetting (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0648c4342bdedc86fdd3f73abc781d19fd7161a8555a48326bfd1aeb197aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteFiles.downloadOnce (cyclomatic 16): RemoteFiles.downloadOnce 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":"App/Link/RemoteFiles.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73033eb518d7b5a2cc5eea3d3c2b103ec8bf24e06b1095264ef24a311cf70cb"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callSearchInline (cyclomatic 16): MCPAdapter.callSearchInline 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f321d800a1778ca5e7a168789d344ee2f2d452da48303508df23ece1401d89a"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.handleModern (cyclomatic 16): MCPAdapter.handleModern 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"131a416689224d0d08b9d9429001acd913b64b6171b637d21ad96a0233a89d23"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPAdapter.callSources (cyclomatic 16): MCPAdapter.callSources has cyclomatic complexity 16 (threshold 15). Of this number, 15 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc07e509dbcdc60267a0d71801cfcb5cd3b3ff4fc2d3702a7da6a67845486f"}},{"ruleId":"D1","level":"warning","message":{"text":"Job.decode (cyclomatic 16): Job.decode 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":"App/Serving/OCRServing.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"943c9cf7023aded6e7ed4268536ce2b035e9075865985778777dbf677aa4a551"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchAdapter.rows (cyclomatic 16): SearchAdapter.rows 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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"548ee22694bb8e59c088a16c565fbb9977d701318e6dcef5b60ee3b2713c6656"}},{"ruleId":"D1","level":"warning","message":{"text":"ANEHintAB.run (cyclomatic 16): ANEHintAB.run has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 3 function items inside it that branch. 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5fd8a0bc4f7a1f935b26c0b540e73f2322e25cf78a5de0be5f6df4ceed4634"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.pathbenchRun (cyclomatic 16): main.swift.pathbenchRun has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, 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":"Sources/omni-verify/main.swift"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8db00d5cf06be59cf737cc5c439d12566c151d624081a7969ad4e7011c92c8"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code::vec (cyclomatic 16): main.swift.top-level code::vec has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 2 other methods here (main.swift.top-level code, main.swift.top-level code::arm) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"a549ff881515ffd17143c9aa9fd8d21ead343e44768d219b92e9d3f7370f56a9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 3794): main.swift.top-level code has cognitive complexity 3794 (threshold 15). Drivers by points: if/else 730 (1780 pts), loops 609 (1570 pts), ternaries 374 (883 pts), boolean chains 365, match/switch 14 (37 pts), error handling 1 (2 pts) (nesting depth added 2544). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code::vec, main.swift.top-level code::digest, main.swift.top-level code::compare, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50293176c35a45e45799f3d4fb12738b010673ac904f68bececa570b89772c5"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 391): main.swift.top-level code has cognitive complexity 391 (threshold 15). Drivers by points: if/else 75 (177 pts), loops 45 (125 pts), ternaries 19 (59 pts), boolean chains 28, match/switch 1 (2 pts) (nesting depth added 223). Of this number, 371 points are the body\u0027s own statements and 20 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5560a195dcb40603565e01ba35c75031f7883a6d313899b320a19182a9c2a341"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.index (cognitive 335): Indexer.index has cognitive complexity 335 (threshold 15). Drivers by points: if/else 167 (395 pts), loops 46 (113 pts), boolean chains 94, ternaries 18 (58 pts), error handling 2 (6 pts), match/switch 2 (5 pts) (nesting depth added 342). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (Indexer.index::takeWave, Indexer.index::updateTimeLeft, Indexer.index::handleStream, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84c2d09befad4503042f70e512eea571c7bb66f777f0b335f2899cabf410511"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfScript.perform (cognitive 241): PerfScript.perform has cognitive complexity 241 (threshold 15). Drivers by points: if/else 55 (111 pts), ternaries 29 (66 pts), boolean chains 48, loops 6 (12 pts), error handling 1 (3 pts), match/switch 1 (nesting depth added 101). Of this number, 232 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d9f8bbb958841ed001c3ea82917044ace58916ff7c42e12cf65ffa8f74e167"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 228): main.swift.top-level code has cognitive complexity 228 (threshold 15). Drivers by points: loops 34 (86 pts), if/else 35 (71 pts), ternaries 27 (65 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 127). Of this number, 199 points are the body\u0027s own statements and 29 belong to 8 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":"Sources/mutbench/main.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c023c2cd799043cfa8f5e4227b979e7b7eda98dcfde0267f1afb9fcb8bd507"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callSearch (cognitive 177): MCPAdapter.callSearch has cognitive complexity 177 (threshold 15). Drivers by points: if/else 42 (86 pts), ternaries 21 (62 pts), boolean chains 14, loops 5 (14 pts), match/switch 1 (nesting depth added 94). 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"72deda52f5a27f8a28e42a13cda65957b02a608ce387f82178942cef0900cc59"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.decodeContinuous (cognitive 146): OCRModel.decodeContinuous has cognitive complexity 146 (threshold 15). Drivers by points: if/else 33 (74 pts), loops 16 (39 pts), boolean chains 27, ternaries 3 (6 pts) (nesting depth added 67). Of this number, 117 points are the body\u0027s own statements and 29 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":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e505538709cebf04eeb3da917cebd8393254c021765eba2a9c9a314b89900b96"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRSession.run (cognitive 124): OCRSession.run has cognitive complexity 124 (threshold 15). Drivers by points: if/else 33 (79 pts), boolean chains 18, ternaries 5 (16 pts), loops 4 (10 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":"App/OCRSession.swift"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"61473888111ea65e2504d2fc7b8f8cc3345c37b26daab95eae407daacede1919"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.recoverChunkTexts (cognitive 117): Indexer.recoverChunkTexts has cognitive complexity 117 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 14 (31 pts), boolean chains 19, ternaries 5 (14 pts), match/switch 1 (nesting depth added 55). Of this number, 83 points are the body\u0027s own statements and 34 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7abf3aec20834ef8375c3b4c78d4211d004d76b3fac17c037c158d6f499c219"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenText.recognize (cognitive 116): ScreenText.recognize has cognitive complexity 116 (threshold 15). Drivers by points: if/else 22 (66 pts), boolean chains 33, loops 7 (17 pts) (nesting depth added 54). Of this number, 110 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenText.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"192f69144c4f2925033fc50bd1a08b8cbc3ca171e1626db9136988763faec275"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.reduceTopK (cognitive 116): VectorStore.reduceTopK has cognitive complexity 116 (threshold 15). Drivers by points: if/else 35 (79 pts), boolean chains 22, loops 6 (9 pts), ternaries 4 (6 pts) (nesting depth added 49). Of this number, 103 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8741}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe5df6a6e988f18d3ce4f29eb3b38950b9f8c3984cd253dad12909f25298e26"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.loadIntoMemory (cognitive 114): VectorStore.loadIntoMemory has cognitive complexity 114 (threshold 15). Drivers by points: if/else 41 (93 pts), boolean chains 14, ternaries 2 (5 pts), loops 1 (2 pts) (nesting depth added 56). 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15861}}}],"partialFingerprints":{"codehealthFindingId/v1":"db049ce80cd7eea1d49bc21ed8b1c02118d4dcb8276bbf7e5b2a7797a6b33fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCommand.evaluate (cognitive 107): EvalCommand.evaluate has cognitive complexity 107 (threshold 15). Drivers by points: if/else 33 (64 pts), ternaries 14 (26 pts), loops 8 (15 pts), boolean chains 2 (nesting depth added 50). Of this number, 106 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"619dc73a97e0ccc19bb3dc0de76c9907d4e805252899bae0b06ee8aa4d5249ec"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.listMatching (cognitive 106): VectorStore.listMatching has cognitive complexity 106 (threshold 15). Drivers by points: if/else 27 (70 pts), boolean chains 19, loops 7 (15 pts), ternaries 2 (nesting depth added 51). Of this number, 88 points are the body\u0027s own statements and 18 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b184106514990ced007926f1bac5dbe5dea5c7121c480ae5695f062e0f856b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.rebuildBaseLocked (cognitive 106): VectorStore.rebuildBaseLocked has cognitive complexity 106 (threshold 15). Drivers by points: if/else 23 (49 pts), ternaries 12 (33 pts), boolean chains 21, loops 1 (3 pts) (nesting depth added 49). 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14084}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea44c559acf09612ca8e3fa9c499ca21d678ad9f311e208d9fd56bba92727a8"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.loadBySlotLocked (cognitive 105): VectorStore.loadBySlotLocked has cognitive complexity 105 (threshold 15). Drivers by points: if/else 34 (62 pts), loops 8 (23 pts), boolean chains 16, ternaries 3 (4 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c244fed921041ab73ca155985ac17a5b44c05fb5fb894e96803a00cf6b00752"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.decodeContent (cognitive 101): Indexer.decodeContent has cognitive complexity 101 (threshold 15). Drivers by points: if/else 31 (57 pts), boolean chains 31, ternaries 3 (7 pts), match/switch 3 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4482}}}],"partialFingerprints":{"codehealthFindingId/v1":"20160a08798d7b45e44a05aff0f8e11f767393e56ba71558c48a0cd9ac406ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.tryAdoptRowSidecarLocked (cognitive 101): VectorStore.tryAdoptRowSidecarLocked has cognitive complexity 101 (threshold 15). Drivers by points: if/else 29 (43 pts), boolean chains 37, ternaries 7 (12 pts), loops 6 (9 pts) (nesting depth added 22). Of this number, 95 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9388ff29846cd58a13c3ef3068060b12667e502782a91592910f2be24d5d9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.update (cognitive 97): Indexer.update has cognitive complexity 97 (threshold 15). Drivers by points: if/else 51 (83 pts), boolean chains 29, loops 14 (21 pts), ternaries 8 (15 pts), match/switch 2 (4 pts), error handling 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Indexer.update::flushImagesU) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a22e7ab8644bdc5444490d5940f20a477ea4d6871e4c76efc6bfa46999e714f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 94): main.swift.top-level code has cognitive complexity 94 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 13 (31 pts), ternaries 6 (22 pts), boolean chains 8 (nesting depth added 52). Of this number, 92 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/crawlbench/main.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f890b34f8d8923f6ebd500afa9249ad385f7d07d44996a43b6d0202b1859af73"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSlice.read (cognitive 93): TextSlice.read has cognitive complexity 93 (threshold 15). Drivers by points: if/else 21 (46 pts), ternaries 9 (22 pts), boolean chains 15, loops 4 (9 pts), match/switch 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d1e64cab36b4f56f430e1fd1be0f1ee90321c35dbe1fc7f87b9d70dd572008"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.enrichOne (cognitive 89): Indexer.enrichOne has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (56 pts), boolean chains 24, loops 2 (4 pts), ternaries 2 (3 pts), error handling 1, match/switch 1 (nesting depth added 29). Of this number, 84 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"252ae9c6eedd0f0d5681922e85b943f10d11f9233132cb771b231c717b849408"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.applyParsedQuery (cognitive 83): AppModel.applyParsedQuery has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (54 pts), ternaries 3 (11 pts), loops 3 (10 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5050}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3b2ba41600f2645bb3f10f2c964ae20cbc1c2ec65d1a45d491c0ac0e36762d"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.stillSize (cognitive 81): ShotBench.stillSize has cognitive complexity 81 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 7 (19 pts), ternaries 4 (13 pts), boolean chains 10 (nesting depth added 44). Of this number, 80 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee1ae70f3b4ff61e684377bcb252c561cb2b5d77828739a904a08fd84ac00cd"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 79): main.swift.top-level code has cognitive complexity 79 (threshold 15). Drivers by points: if/else 21 (60 pts), loops 2 (7 pts), ternaries 1 (5 pts), boolean chains 3, error handling 2, match/switch 1 (2 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4817cb80e2dcfdf612030ef8f9b1c5fdcd8bb76c477b217d9bb83954b0a99975"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.takeInStills::pass (cognitive 79): ScreenHistory.takeInStills::pass has cognitive complexity 79 (threshold 15). Drivers by points: if/else 14 (48 pts), loops 4 (14 pts), ternaries 2 (8 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (ScreenHistory.takeInStills) 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da2511475d70ed414bb2d13720fe3e376181938ed6563b89163ee3478d2823"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.search (cognitive 79): AppModel.search has cognitive complexity 79 (threshold 15). Drivers by points: if/else 34 (56 pts), boolean chains 13, ternaries 5 (10 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef10b723115a7a799b897fd9fecc65c9edf39621731ee15c07b04d1d3eb844"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.run (cognitive 78): ShotBench.run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 14 (24 pts), ternaries 5 (12 pts), boolean chains 4, error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 30). Of this number, 75 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"64216a0d526307b5f8203e23ff3d574f75cc0490c1b72152c76db49348a76a3b"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.tryAdoptQuantReplicaLocked (cognitive 77): VectorStore.tryAdoptQuantReplicaLocked has cognitive complexity 77 (threshold 15). Drivers by points: boolean chains 50, if/else 20 (25 pts), ternaries 1 (2 pts) (nesting depth added 6). 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f6112871bbe2e465fb9cc7053d6e11b4d1d3c012fe5bcb21774b264835f492"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperSuite.run (cognitive 77): PaperSuite.run has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 12, error handling 4 (12 pts), ternaries 6 (9 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperSuite.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f26433ba9a897298d1de561677132fba442d0f7145ef6eeefd519fb7dcf9cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.pipeline (cognitive 75): Indexer.pipeline has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (48 pts), boolean chains 18, loops 4 (6 pts), ternaries 1 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425f8325a72c099ed06dd38eac088960f4aeb12f991ff074b1d8275eb0d67e2"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.init (cognitive 72): VectorStore.init has cognitive complexity 72 (threshold 15). Drivers by points: if/else 27 (45 pts), boolean chains 19, loops 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb98c2964e268f30b3cefd11dd40a2af179c0a10f3da7bf6f7f186f7d514682"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownBlock.parseUncached (cognitive 71): MarkdownBlock.parseUncached has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 6 (16 pts), boolean chains 8 (nesting depth added 39). Of this number, 70 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":"App/MarkdownBlock.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bf75cfa7350c00c0fd7709ba54872b5c057da8b4c3849dbd473d718a228917"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchArgs.filter (cognitive 68): SearchArgs.filter has cognitive complexity 68 (threshold 15). Drivers by points: if/else 30 (56 pts), loops 5 (7 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SearchArgs.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a0c5ec85a1e51f4039070523263e90e4ea8ccdeef12fd010837b731609e82"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.bootstrap (cognitive 66): AppModel.bootstrap has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (46 pts), ternaries 5 (10 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts), error handling 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c4c347dd94d0f81dff3c84fd5df2bce547b2879e3a7decdb0e90f6765a9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.storeStreamedText (cognitive 63): Indexer.storeStreamedText has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 11, ternaries 5 (10 pts), loops 4 (8 pts), match/switch 1 (3 pts), error handling 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3674}}}],"partialFingerprints":{"codehealthFindingId/v1":"485b82244d1169a825db0dd2f9c1175474424e62a9bdfa84cc8c16f219506b78"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::arm (cognitive 62): main.swift.top-level code::arm has cognitive complexity 62 (threshold 15). Drivers by points: loops 15 (25 pts), if/else 10 (20 pts), ternaries 9 (16 pts), match/switch 1 (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. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::digest, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":5166}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b8f4cde57ba2ae0a2757fc9c465f7798833ed706a3d501a2751f8bc64a32c4"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.migrateScanKind (cognitive 61): VectorStore.migrateScanKind has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 8, ternaries 4 (8 pts), loops 3 (6 pts) (nesting depth added 22). Of this number, 58 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2915}}}],"partialFingerprints":{"codehealthFindingId/v1":"363b23cdb6147f95fda92bc58f9df288ce48e9db2e99d77819e5bb3f14b04a23"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.reduceTopKGPULocked (cognitive 61): VectorStore.reduceTopKGPULocked has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 13, loops 5 (8 pts), ternaries 4, match/switch 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9940f374ac06228f6a1a57ed17ee24f5216eb1ac07b3c14d9d3560cf0ff863d"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.stampVectorCoverageLocked (cognitive 61): VectorStore.stampVectorCoverageLocked has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 21, ternaries 4 (8 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13075}}}],"partialFingerprints":{"codehealthFindingId/v1":"d557d8cc82139dc26d0b08b2203449fb5bb27a67709fa82f9526f8fa814a1456"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.recomputeResults (cognitive 60): AppModel.recomputeResults has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (33 pts), loops 5 (12 pts), boolean chains 7, ternaries 3 (6 pts), match/switch 2 (nesting depth added 22). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"600c2d43e5c434ebb896a354cb0e65ffde37bf01ce85d4d24a52a02461980faf"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.churnbenchRun (cognitive 60): main.swift.churnbenchRun has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 12 (17 pts), boolean chains 7, ternaries 5 (7 pts) (nesting depth added 18). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3becbf8e03f8bc39c26fa366894ef1934ce82658bc5b63c6120e2c693457f1ac"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.arguments (cognitive 59): main.swift.arguments has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (37 pts), ternaries 4 (10 pts), boolean chains 6, match/switch 2 (4 pts), loops 2 (nesting depth added 26). Of this number, 50 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2a2d1c1d2087ba14c529ee3168b1226c6d261a07fd1978c1042c2d6804b2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.inSet (cognitive 59): OmniIgnore.inSet has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (47 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2029657f9a49011ae918e55d65f3e39e563a534d8272bec634a5ce4b9aabe4"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.searchCandidatesLocked (cognitive 59): VectorStore.searchCandidatesLocked has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 13, loops 6 (10 pts), ternaries 6 (nesting depth added 10). Of this number, 41 points are the body\u0027s own statements and 18 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7602}}}],"partialFingerprints":{"codehealthFindingId/v1":"913580fa7d28f19ce7f5c88efc87703dd44b5fa2a8d30e25b7870e417f504e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.rerankLocked (cognitive 59): VectorStore.rerankLocked has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 12, loops 7 (8 pts) (nesting depth added 19). Of this number, 47 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7831}}}],"partialFingerprints":{"codehealthFindingId/v1":"8379ab5ef3224df75bfaf74aa536f27ec1e69e064bd9811f6e3e6e2b41fe4ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"IWorkText.storages (cognitive 58): IWorkText.storages has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 5 (12 pts), boolean chains 9 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a002e5c9f1da39272452748ea78768539112c731a1ff13296f72dc3fcf95e52"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.relocateTailSliceLocked (cognitive 58): VectorStore.relocateTailSliceLocked has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 14, loops 9 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12539}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb725e0b85ce900a87cf6005f5ef4d92f29355e9741af1a278129a49e7232ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.decodeGroup (cognitive 58): OCRModel.decodeGroup has cognitive complexity 58 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 10 (23 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9125eaadcb9f76a3baf3419f5749f9c78cfa516be5212d72c240e93fc2fa043e"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityTab.body (cognitive 57): ActivityTab.body has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 24, if/else 16 (18 pts), ternaries 8 (15 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":"App/SettingsView.swift"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbcddab053a8c5a456c6923c81db817b57b522fa8040c85365e6df7d3f29377"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.embedGroupsReusing (cognitive 56): Indexer.embedGroupsReusing has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 9 (19 pts), boolean chains 5 (nesting depth added 29). 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa49904ebc39380cd86290ad96f9d0b1cc978df25cb1ee445aaba1bd69f78d7"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.vectorsUnderFolder (cognitive 56): VectorStore.vectorsUnderFolder has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 10 (17 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 22). Of this number, 55 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6187}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c8cee3097e7ffbd4a5d385b38affbfbfc4068f04d9831f1b83fed5adc9ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.searchDense (cognitive 56): VectorStore.searchDense has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 27, ternaries 7 (9 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VectorStore.searchDense::coarseFastPathLocked) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b1019acc4beaa6123d6ba4f9dd0a8a2a4192e92c316255d4a4907e66d2086"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRSession.runGroup (cognitive 55): OCRSession.runGroup has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 15, loops 5 (7 pts), ternaries 2 (5 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"660127e635cc830ebc8acada7b3fb331def6551d0d1804a34872f048cf06365d"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.encode (cognitive 54): ANETextBackend.encode has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (18 pts), boolean chains 10 (nesting depth added 23). Of this number, 53 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df26316ae2d92144fde11743fc72cd0afd0092200ea817c8b0d0247385d931e"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.setComputeUnit (cognitive 54): OmniEngine.setComputeUnit has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (36 pts), ternaries 5 (7 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 21). Of this number, 50 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca22fb8e9a206f6be3ad5efa2b3f1e9b74f942c34a2fe9aac87dff430f903de"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.chunk (cognitive 53): Indexer.chunk has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 5 (12 pts), ternaries 3 (9 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 30). Of this number, 45 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be2f17df2eecafdbd7f526072f27e15f64842abf2e083322883c8d00ed8e474"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.compactRowsLocked (cognitive 53): VectorStore.compactRowsLocked has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 5 (10 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15582}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883d6fa523622130230cd13bf392e3a694290585d9c00f8a191c479fdc1256c"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.invalidArgument (cognitive 53): MCPAdapter.invalidArgument has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 14, ternaries 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 24). Of this number, 50 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dfa3b018482b5ad3ee8770dba581aacc8376a53bf127b2c4db6713a9075a86"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 53): main.swift.top-level code has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 9 (17 pts), loops 6 (11 pts), boolean chains 5 (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":"Sources/opentime/main.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f191d4bb8965b82be5d07bf0b83a081d5f1697fdff7b975a3964d5cb3c7eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaDuration.isoMovie (cognitive 52): MediaDuration.isoMovie has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 4 (20 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 27). Of this number, 40 points are the body\u0027s own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/MediaDuration.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85bebd80c7415eb80dd674be672e18ed938a254d568f06bdcabeb1697d20a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.catchUpPendingRoots (cognitive 52): AppModel.catchUpPendingRoots has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 27, if/else 13 (20 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":7249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f894f1fd7dfb7ba3449a0279ba120387bb45917caf943de66b3d6e06bf603"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEQuery.engine (cognitive 52): ANEQuery.engine has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 6 (9 pts), boolean chains 7, ternaries 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 23). Of this number, 44 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e46dfae1540003cde062224a66d1ee3b54852dbd649dd4069aa4c0007d9268"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.rpc (cognitive 51): main.swift.rpc has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (27 pts), error handling 3 (10 pts), ternaries 3 (9 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c257aa5899391bb9c5f73e55a5969b680b5a916fae56d176156a03e12219dd8c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.neighbour (cognitive 50): ShotBench.neighbour has cognitive complexity 50 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 5 (20 pts), loops 4 (9 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"3193910ae6fb80b44f6644559b8b216aeff93d00bc3921354ed94eedff4b3208"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.audiosegcheckRun (cognitive 50): main.swift.audiosegcheckRun has cognitive complexity 50 (threshold 15). Drivers by points: loops 9 (22 pts), if/else 14 (20 pts), boolean chains 5, ternaries 3 (nesting depth added 19). Of this number, 38 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4de608ad26c8c157ac30d1618a6c2cf9d2d31f6600db9d846a7665e27762bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEAudioBackend.encode (cognitive 49): ANEAudioBackend.encode has cognitive complexity 49 (threshold 15). Drivers by points: loops 14 (25 pts), boolean chains 10, if/else 7 (8 pts), ternaries 2 (6 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANEAudioBackend.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab22cac9a4dddd17a710f1eb202096c4bd97e9ebcbcdaec745231385ba5a9012"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.embedPagePictures (cognitive 49): Indexer.embedPagePictures has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 5 (12 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 24). Of this number, 42 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6061f2c9217b760441a646e7ccc25fe2cc0b7e4db4c14df79851b386b8d21fc"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.loadFromCoverageLocked (cognitive 49): VectorStore.loadFromCoverageLocked has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 14, ternaries 3 (6 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11075}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c1912af57196c92658b1b6a2d911de84a60a455aea91127149c8beb2ea4840"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.sameVectorSpace (cognitive 48): Indexer.sameVectorSpace has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (11 pts), ternaries 7 (11 pts), boolean chains 8 (nesting depth added 17). Of this number, 47 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b06dfda7271fe023b34183a1be0ce6c3e09aa803d2cf301fce0ae9f4d8bb6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.mediaTurn (cognitive 48): Indexer.mediaTurn has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 20, if/else 16 (20 pts), ternaries 3 (5 pts), error handling 1 (2 pts), match/switch 1 (nesting depth added 7). Of this number, 41 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9943568a42c99f1dd0f386a2fac677b525725a4121cdc3f6a30a92317e80c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchQueryParser.parse (cognitive 48): SearchQueryParser.parse has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 6 (15 pts), boolean chains 11 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/SearchQueryParser.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da3b79de84e42a95927217c49d344c3e3d1b3de85afb46d9298ace7f078ea46"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.acceptedFilesLocked (cognitive 48): VectorStore.acceptedFilesLocked has cognitive complexity 48 (threshold 15). Drivers by points: loops 13 (29 pts), if/else 10 (16 pts), boolean chains 3 (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b70cf96f1de075d03161c92c67d39751d26b1f9dc2ae967e4e336710cb69e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.rankChunksAcross (cognitive 48): VectorStore.rankChunksAcross has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 8, loops 5 (8 pts), ternaries 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ac354d9d81823b99cc2b01e3fe48c0d6bc419c04d95adcc3672142f6ced7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.embed (cognitive 47): Indexer.embed has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 5 (14 pts), loops 4 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4844}}}],"partialFingerprints":{"codehealthFindingId/v1":"662911ef2d85dafee13a8ef29da3e54b0afd5ae14b8c38bcbc244fc85e4b6834"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.deleteProvenOrphanTwins (cognitive 47): VectorStore.deleteProvenOrphanTwins has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 11, loops 7 (10 pts), ternaries 1 (nesting depth added 13). Of this number, 43 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ac932d20c2bb25942e111daa7e8e841c39d59c2a78044fd94ea8d966dd6190"}},{"ruleId":"D2","level":"warning","message":{"text":"Snappy.decodeBlock (cognitive 46): Snappy.decodeBlock has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (8 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbd6816e408e6a8ed674c7609fb983193df35c0d9a00e2772b64e15c1890565"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenRecorder.capture (cognitive 46): ScreenRecorder.capture has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (28 pts), ternaries 5 (13 pts), boolean chains 4, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenRecorder.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c9a349fe8da6d0ab01da0768e3a18e44dfc8cf9c4f5751f258e7207d33a41e"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePhrase.unique (cognitive 45): PagePhrase.unique has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 8, loops 4 (8 pts), ternaries 3 (5 pts) (nesting depth added 17). Of this number, 37 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PagePhrase.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8f4f2e8daf8aa0e9a305904ba4200312535bb4e9f6dd884b03dc8364fc8776"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.migrateToV4Locked (cognitive 45): VectorStore.migrateToV4Locked has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 10 (12 pts), boolean chains 9 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18301}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d95e6419d7487ba63a238299ff67b4632a7b2f1b4b7194aedd052e78828af"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callReadFile (cognitive 45): MCPAdapter.callReadFile has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 9 (13 pts), boolean chains 11, match/switch 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa63e2449ab2edf1d2a561d01ee84d583c5fb16ab086dc060389f6ccfe8df437"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionEngine.pca2DBasis (cognitive 44): ProjectionEngine.pca2DBasis has cognitive complexity 44 (threshold 15). Drivers by points: loops 17 (35 pts), if/else 5 (9 pts) (nesting depth added 22). Of this number, 41 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":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"87faf03946acb460102f00fed886f245c444eff56a7e2f10c4e4bc42d54839ec"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.deleteFilesInSlices (cognitive 44): VectorStore.deleteFilesInSlices has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 8, ternaries 2 (5 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddedd7c2db6b9f3f81ee14ef60cc268a2c2039bec4191f79783eda04081bcce"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderEmbeddingVisualization.rebuildPoints (cognitive 44): FolderEmbeddingVisualization.rebuildPoints has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 7 (13 pts), boolean chains 4, ternaries 2 (3 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":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"866ef9fc159596fa2cd2f718e5abb45cf311997ba0392361e051672e7c3ae1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRServing.parsePages (cognitive 44): OCRServing.parsePages has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (8 pts), boolean chains 6, ternaries 3 (4 pts) (nesting depth added 19). Of this number, 39 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/OCRServing.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68994ba513ee083cf0de431a1bbd744ed4b281c10d76a238a567cd039f19f26"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.reader (cognitive 44): ShotBench.reader has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 7 (13 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abbe0b2002e439c7f5730379b9ca8d3c04a2fcc60c81dc6d03e4177a71b4f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperReport.appendCases (cognitive 43): PaperReport.appendCases has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 6 (15 pts), ternaries 3 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperReport.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"615facb8730a86d8489848b440404489b26dbfa21f9744cdb69a1f9a0742f18b"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultsList.menu (cognitive 42): ResultsList.menu has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 3 (11 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4807f063107faf5ee703c8b710eec06bbc942483bf7cc94d4ccbf9d47fd683"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOCRAdapter.handle (cognitive 42): ChatOCRAdapter.handle has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 5 (8 pts), boolean chains 3, ternaries 2 (3 pts), loops 2 (nesting depth added 12). Of this number, 41 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":"App/Serving/OCRAdapters.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a68befbff7759b6790586bed9259c4ed19af2576c3658cf7a0527cf845d390"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.measureSlotOffset (cognitive 41): VectorStore.measureSlotOffset has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11675}}}],"partialFingerprints":{"codehealthFindingId/v1":"140dc2f0db21414e6247325d235ed7754a618d1ac2561a0cb37e5704f0d0762a"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEHintAB.pair (cognitive 41): ANEHintAB.pair has cognitive complexity 41 (threshold 15). Drivers by points: loops 11 (23 pts), ternaries 2 (9 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 23). 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"39061a1d57ece30609262b8243ee5ef3b5313116d87ea63f143eca0a7ae06075"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniImageEncoder.encodeChunk (cognitive 40): OmniImageEncoder.encodeChunk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 12 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniImageEncoder.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4cbf480d3ca251218d5b5a2065687b81c7d8d6051524baa1cb5fc2adda3a55"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.writeChunksLocked (cognitive 40): VectorStore.writeChunksLocked has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":16809}}}],"partialFingerprints":{"codehealthFindingId/v1":"d389041f94c8c8e1816a0502bd57e7234a8f40744763088972945cedf0230fee"}},{"ruleId":"D2","level":"warning","message":{"text":"PassageWindow.best (cognitive 39): PassageWindow.best has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 9 (13 pts), boolean chains 4 (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6c64f687c0e97b8e0827a2959b0a7b5d6ef96395b488f4cc07ed7238b1471"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSlice.find (cognitive 39): TextSlice.find has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 4 (8 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 2 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1988e1d1959ce11074ce214e4ca9f5407515c79a56ae56d47ca94ff976a25a"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.embedFileQuery (cognitive 38): OmniEngine.embedFileQuery has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 8 (23 pts), if/else 3 (9 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcff98c9f3da4b98b5c4ff07a0cef6a220ac9e18a3c2442836c09be6884604b"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexStatusRow.body (cognitive 38): IndexStatusRow.body has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 3 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7550dda8443456c3fc13c4b3d48bb18824915f654be2cd9d274486ec8e425273"}},{"ruleId":"D2","level":"warning","message":{"text":"Sidebar.body (cognitive 38): Sidebar.body has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 6, match/switch 2, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278ab354c5ace1fa8688f6ad6bbcc8061dd82fc97a5d66da4ea4cc044b51fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalIndex.refreshIncrementally (cognitive 37): LexicalIndex.refreshIncrementally has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 7 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 10). Of this number, 33 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/LexicalIndex.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c6cbc2c63be952dba19c082e50a19418cc035dfd0b7b6da98e500591a1ff97"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionEngine.project (cognitive 37): ProjectionEngine.project has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 3 (5 pts), boolean chains 3, ternaries 3 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7a37f72855740ece0810ac0dfd7f95b304316fb43870c65268220ba4ea29cc"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.decodePrepared (cognitive 37): OCRModel.decodePrepared has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 5 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRSpeculative.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"be65af37b60830c4803a8a50b9839063802c7abcf41d6fe6cc8fe8240cb00a79"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.drainPendingFSChanges (cognitive 37): AppModel.drainPendingFSChanges has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 21, if/else 14 (16 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":"App/AppModel.swift"},"region":{"startLine":9413}}}],"partialFingerprints":{"codehealthFindingId/v1":"28edf999ebfed8f22d31908ad990dd854ad57dbde97655a277c25fbee5c888ed"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderEmbeddingVisualization.body (cognitive 37): FolderEmbeddingVisualization.body has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 5 (10 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a72877bf6d89eb638cae3e862366773aa637248980376f0b6cf33d17e1c138"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentChunker.cutPoints (cognitive 36): ContentChunker.cutPoints has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ContentChunker.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a060ab46ba98a73ecab33fc2acc54a905ca604a4425d6bb70b753d205d0436c"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.reclaimVectorHolesBodyLocked (cognitive 36): VectorStore.reclaimVectorHolesBodyLocked has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 7, loops 4 (nesting depth added 5). Of this number, 33 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7865796f4a99820ddb8994ef02d3f9ecb05684d89c6744140606cd0a661f470e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.persistSlotsLocked (cognitive 36): VectorStore.persistSlotsLocked has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (9 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17981}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1e3e09ade82e6dfde682f6e3bf8f4e94055d4aa75b0868f3fdb630e6247b67"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.startIndexing (cognitive 36): AppModel.startIndexing has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8855}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafd737ee29bcbc08e09c0da54e125266fdb0b581665c1b4960118387ff9f8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRSession.open (cognitive 36): OCRSession.open has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb54eeeffe949a4d2f5e1ebcf1d424c1c2f518716ed6041a455ce97d08a25398"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.renderHistory (cognitive 36): index.html.renderHistory has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 16, if/else 8 (10 pts), ternaries 7, loops 3 (nesting depth added 2). Most of this is not in the body itself: 12 of the 36 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 1018, yVal, a function literal at line 950, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"site/omni/index.html"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e3fe2cb89c19d41c536407f8b91f271186fd8f5d48a557f5df360b1b18992c"}},{"ruleId":"D2","level":"warning","message":{"text":"PathTable.folders (cognitive 35): PathTable.folders has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 5 (14 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PathTable.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b086efcb18187041ce5952e544562e66233fa77e7bc1e0a0516b9836754bca53"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionEngine.gridify (cognitive 35): ProjectionEngine.gridify has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 10, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad0c157b1ffc82bd0946fd520a9ac8cdd44f2ae917f337d6b67f463cf573f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.walk (cognitive 35): ScreenHistory.walk has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 3 (4 pts), ternaries 1 (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5e9647fe714a3bf24bcaebdb208b058345dafb0ad4b423afae2177b4f507b4"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.repointSurvivorsOfReleasedLocked (cognitive 35): VectorStore.repointSurvivorsOfReleasedLocked has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (8 pts), boolean chains 7 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10437}}}],"partialFingerprints":{"codehealthFindingId/v1":"633a64c882f24a2951ec64a6eb8c862bf4a0fd7a8e124a1274f166f3bf26b490"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.bitScanCPU (cognitive 35): VectorStore.bitScanCPU has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (23 pts), ternaries 1 (5 pts), boolean chains 4, if/else 3 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13974}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f845987c444a226889c148965b2f5d42ab23e8fcffdf07306452e6d33adcc"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightStore.init (cognitive 35): WeightStore.init has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 11, loops 6 (7 pts), ternaries 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/WeightStore.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32b4f7b562505e4b2e043de8aa699fb8df049b3ede4759bf7ea2fee1d3f50a3"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.applyResults (cognitive 35): AppModel.applyResults has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1da1909dec38d6ce1c9a5fd6d6a3f73d1c54a7fba641f7f3e7e0fc73b3309b3"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelAB.measureQueryWait (cognitive 35): KernelAB.measureQueryWait has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/KernelAB.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc0aa7dc913080b9f85a01883e5d18cd5b53f1c8ecef2887bb5ed776d1623f0"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCrawler.walkLegacy (cognitive 34): FileCrawler.walkLegacy has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/FileCrawler.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146166b268735ecde24a5ff36e56b3b6e65e31d74a324005dbe0492fffe0141"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.rewrite (cognitive 34): ScreenHistory.rewrite has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (2 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0458fbc42498e9dcd326336e2ff0ff1b498fc60c295c21c1e6b46ea6fdb4202"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.restoreCoveredBlobsLocked (cognitive 34): VectorStore.restoreCoveredBlobsLocked has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 10, ternaries 4 (5 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10617}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3360871048444cf3d6c7d1010ba69dab7e6787b931eed934b443b84e57afdd"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.repairIndex (cognitive 34): VectorStore.repairIndex has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, ternaries 3 (5 pts), match/switch 2 (nesting depth added 8). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11563}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c04def881ac4a1b62e5936f6627b00a9418b9c79e1cc9a1d6f528c4dad99c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.readPicture (cognitive 34): MCPAdapter.readPicture has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, ternaries 5 (7 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da36c73490ac3b50a45218b427951a10efa484f94f7420aa72101850869916f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.rowwindowcheckRun (cognitive 34): main.swift.rowwindowcheckRun has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (13 pts), ternaries 6 (8 pts), boolean chains 7, if/else 4, match/switch 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 10 of the 34 points are its own statements and the rest belongs to 3 function items inside it that branch (observe, run, reopen). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"1011c7fd77a6a3b9bcb5bb903f121a2f7cc8e43a9d1bdce581829e210d25d5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.anchorStarts (cognitive 33): Indexer.anchorStarts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 20, loops 4 (8 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Indexer.anchorStarts::matches) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d650d712a603a954c59eeef53bf7f29ef7126417b6cf5b382502358aeae0df1"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniAudioTower.forwardImpl (cognitive 33): OmniAudioTower.forwardImpl has cognitive complexity 33 (threshold 15). Drivers by points: loops 11 (17 pts), if/else 6 (10 pts), ternaries 3 (6 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioTower.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d259901f0398a8b3fb403a6aaea09d7700a96c1f6d29d92090c1412c99d30a1"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.fileFactsToCorrectLocked (cognitive 33): VectorStore.fileFactsToCorrectLocked has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 11, loops 3, match/switch 1 (2 pts) (nesting depth added 9). Of this number, 31 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13665}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa094ccfb09f3c202fb25c8d738ed25ae2f42bf55cf3dd06bfd88f32a0f4974"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkNode.pairingHandler (cognitive 33): LinkNode.pairingHandler has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, error handling 1 (3 pts), match/switch 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":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f029dc6124ece3bcb32e31ebf54e4b5753b92fdf4c1d65113730bd4c7ca277a"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.readIdentifiers (cognitive 32): Indexer.readIdentifiers has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 5 (14 pts), if/else 6 (10 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd13d04039c3c54019801154496d51dd535479297a2cbf781217b207558f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.selectMaskLocked (cognitive 32): VectorStore.selectMaskLocked has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9, loops 1 (2 pts), ternaries 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8609774f32e77c8160cf11868c79bbafcf2df8c70ccf17b42e111760b8ac8a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.scheduleTagBackfill (cognitive 32): AppModel.scheduleTagBackfill has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 20, if/else 9 (12 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":9327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f866e2e80dc7d22f9f8de3f606042449a527807c7dfb5190cce7923024b796ec"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniCommands.body (cognitive 32): OmniCommands.body has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 13, ternaries 10 (12 pts), if/else 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":"App/OmniApp.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d20a64bd8dae0f4b7018c75b6da4e280aeae0ad627f4a738beeb8a56d2a7039"}},{"ruleId":"D2","level":"warning","message":{"text":"IWorkText.extract (cognitive 31): IWorkText.extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58a978e275e16cf836acabec46b6833b6e720a25041a7a47c86a1197aa6bd57"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.parseSet (cognitive 31): OmniIgnore.parseSet has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7fed85fa41028982399303e8cc12a83b5155750d7097f114d8967e0022036"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniTagger.finalize (cognitive 31): OmniTagger.finalize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 5 (8 pts), boolean chains 4, ternaries 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c5beecb99117175f88c21bf8c9b0e509728716c08a4b7546d623529e14c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniVideoPreprocess.preprocessRaw (cognitive 31): OmniVideoPreprocess.preprocessRaw has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (24 pts), ternaries 1 (5 pts), if/else 2 (nesting depth added 20). 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":"Sources/OmniKit/OmniVideoPreprocess.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f8b0b086f6c9dbbcb026c78b26f3f00da4756da0ed965896a5a14f8cfddab"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.folderAggregates (cognitive 31): VectorStore.folderAggregates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, ternaries 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":5861}}}],"partialFingerprints":{"codehealthFindingId/v1":"593b3192babfbd23ab4a18bd838eb39a0d590171fe67ad0fa3d751b6a8116a64"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.pooledFilesLocked (cognitive 31): VectorStore.pooledFilesLocked has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 7 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6117}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b770fab2092b486775ce3946347fb4a406ae0ba2611ec64b653d915246b81"}},{"ruleId":"D2","level":"warning","message":{"text":"TagAdapter.handle (cognitive 31): TagAdapter.handle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 4, ternaries 2 (3 pts), loops 2 (nesting depth added 6). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3925b8d1c09124c464da735619876974828c8fd790dbfd649cbad8b9cb6b3fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.frameEmbed (cognitive 31): ShotBench.frameEmbed has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (12 pts), boolean chains 6 (nesting depth added 11). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to 3 function items inside it that branch (video, cos, line). 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd03ddfba1a719ad7f149d5afd3f0b7917de6dbaf330bcdffb9382511df7d91"}},{"ruleId":"D2","level":"warning","message":{"text":"index.benchAggregate (cognitive 31): index.benchAggregate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (9 pts), loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ce7b05375dbb829b94d892ba7b17b9899702db91d62fc4cfc7669e1ef255f3"}},{"ruleId":"D2","level":"warning","message":{"text":"PassageRecovery.texts (cognitive 30): PassageRecovery.texts has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (10 pts), boolean chains 4 (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":"Sources/OmniKit/Passages.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf011ab823c520c0cd117a17147032ad920ad0bf6ed1e04949cce03b6914734"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.orphanSlotsLocked (cognitive 30): VectorStore.orphanSlotsLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe797d1307d3867cbcaba983c9baef4ca865278a1e0f9c935cd0f2dfb7fbf3e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.bestChunkScoreLocked (cognitive 30): VectorStore.bestChunkScoreLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, loops 5 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"70abaaebd1773c90a27cd51e3995e69087151aeff07f84384591924d8197cbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.rankChunks (cognitive 30): VectorStore.rankChunks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 8, loops 2 (4 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14476}}}],"partialFingerprints":{"codehealthFindingId/v1":"da363630658c3254c8431e0f82d67986b75e808526625236d42883add19c7e57"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.backfillSlotsLocked (cognitive 30): VectorStore.backfillSlotsLocked has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, loops 2 (5 pts), ternaries 1 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17873}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70ec36a08caae8ef051255d5a816ffc73b472a262bb85cfc356252c0158ac4f"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRWeights.init (cognitive 30): OCRWeights.init has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (7 pts), boolean chains 6, match/switch 1 (2 pts), 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":"Sources/OmniKit/OCR/OCRWeights.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc4e13a67be49da91f163f4abac9061503c5686f55fc3516221c09dae96ba2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentView.searchSuggestions (cognitive 30): ContentView.searchSuggestions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (12 pts), loops 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee79b6872bcc4e849da9c577dd02515f989708834a47ec80b2ab3bd2ee08bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderRow.body (cognitive 30): FolderRow.body has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 8 (10 pts), ternaries 3 (4 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea92377b332cb32244f89a5e2dc1d2c5d0ffd053d6e7fa398872944f3288873"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callFileStatus (cognitive 30): MCPAdapter.callFileStatus has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 4 (10 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d560ac14b927d3181519f3bf23f09d774cbd04fc67269989673c62a861063b57"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 30): main.swift.top-level code has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 9 (11 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/searchbench/main.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07bfe552eeaa17b17634c8efe80d11be686e9822002078a3952681fcd20315e"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.inputs (cognitive 29): ANETextBackend.inputs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (9 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd303355cd26eb6fe6264433a2a92284adfc5ed84206fd01b2bde149dee02922"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.storedTags (cognitive 29): VectorStore.storedTags has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4501}}}],"partialFingerprints":{"codehealthFindingId/v1":"429d06f2fed285807f3bd99e8c24741f09e532bb34dfa0d6f6a55df45febdbdb"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.streamedVectorsUnderFolder (cognitive 29): VectorStore.streamedVectorsUnderFolder has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22 (37 pts), loops 7 (11 pts), boolean chains 10, ternaries 5 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VectorStore.streamedVectorsUnderFolder::walk::stepLocked) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f78a7b5e9fa8826abf72c3a36b94ac9d884cd3e0ec2e55e170b9bf2a76920"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.persistQuantReplicaLocked (cognitive 29): VectorStore.persistQuantReplicaLocked has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 11 (13 pts), error handling 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9152}}}],"partialFingerprints":{"codehealthFindingId/v1":"66651f9a5d930e1e85852c72b007a451c5759479318ac91c3ab4f6571ca9c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.buildChunkSplitLocked (cognitive 29): VectorStore.buildChunkSplitLocked has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 6, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17527}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea429ad7b493d6a65365488a7bcd8028c3ded1073ac5d1f174f7c60536d6bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperCorpus.writeVideo (cognitive 29): PaperCorpus.writeVideo has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 5 (12 pts), boolean chains 2 (nesting depth added 17). 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":"Sources/OmniKit/Paper/PaperCorpus.swift"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"272a96c1518bd05ee88fd2867213007295da8c6b1bcf0cc3d2e4281535352b03"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.handle (cognitive 29): Coordinator.handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 12, ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentKeys.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a58d95134854c4d4654848ca7d35293ad787d14fbc2685b0bca3b9cb43d6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentView.body (cognitive 29): ContentView.body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 11, ternaries 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65e25d8c41e454ead4d18d53e1a1e7f52ee1fe771559adaef55d3fd2d55f801"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callSearchInline (cognitive 29): MCPAdapter.callSearchInline has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d2ed7d33af8dfbecff30e9570ebadb367d4855018842aee064394f3f6ca025"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchAdapter.handle (cognitive 29): SearchAdapter.handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 4 (6 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e4788f18012e5072135b9311425d322934095b4d1fe3cdc96d341af61097b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 29): main.swift.top-level code has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, error handling 2 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/linktool/main.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b44a596eb5e2dab24ad017d77968041cc88726c665d6b6fb3a17f21d7b71ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEQuery.vision (cognitive 29): ANEQuery.vision has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7 (10 pts), boolean chains 4, ternaries 1 (nesting depth added 10). Of this number, 28 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a154313b3d5df77e1de310294ab7b857dd29ccd3634df0277f9d3f7dadb79318"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.videosegcheckRun (cognitive 29): main.swift.videosegcheckRun has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (8 pts), ternaries 5 (7 pts), boolean chains 2 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15832a43702ec4c1f3c89bea753948248f2d9d7a4abc8722cb778e5c0215336"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::loadedPhase (cognitive 29): main.swift.top-level code::loadedPhase has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (14 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::digest, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c7b84724eecfa2f082628e9dfd636ee8e9cced85aa01dd7b771e2290a9e41d"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.runLayers (cognitive 28): ANETextBackend.runLayers has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 6 (8 pts), ternaries 3 (5 pts), boolean chains 4 (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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a266313a16b95696bb50764c22067bf82d41f6fca2ecc596790a0336a0331ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"BulkDirWalker.list (cognitive 28): BulkDirWalker.list has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1713515a1c50c0e8e6658a8f4d84f80fcdf91f33447af19f91d0a27c665fbe0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Zip.entries (cognitive 28): Zip.entries has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, 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":"Sources/OmniKit/IWorkText.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c3745c28af73ed55680ce5135cdd2a2b8b8db1df0dafe5cc907c1422078431"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.index::updateTimeLeft (cognitive 28): Indexer.index::updateTimeLeft has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (7 pts), boolean chains 6, ternaries 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. This shape REPEATS in the file: 4 other methods here (Indexer.index, Indexer.index::takeWave, Indexer.index::handleStream, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b99dd7cc4f16409887f2e8d21da9892222629258a3458126406ae2c9e9842"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.index::handleStream (cognitive 28): Indexer.index::handleStream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (Indexer.index, Indexer.index::takeWave, Indexer.index::updateTimeLeft, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee707a510eac766ccf6e53475d169ee6f34e69514ef6a281162a0e688e4f88b"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.streamedAudio (cognitive 28): Indexer.streamedAudio has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5064}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ea3039f64327dfe795773d35c5f70711968bf75aace77403925a1c34b419ce"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.replaceMany (cognitive 28): VectorStore.replaceMany has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 3 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fc3e23c3098ebffeead3df7ab9f2c3ba546abbd8e4f88596b000ca3d859a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.pooledVectors (cognitive 28): VectorStore.pooledVectors has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 5 (6 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15043}}}],"partialFingerprints":{"codehealthFindingId/v1":"46598442a9ee6c4ac3696ed5757979aaecc8f5d14733b4e84616fea4479b9625"}},{"ruleId":"D2","level":"warning","message":{"text":"BenchTable.rows (cognitive 28): BenchTable.rows has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/BenchTable.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"32445a12c5f956bae4f4cafcb78ae36449c2983853273b3b2f8c15391bb8db1c"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperCasesCompute.sdpaCurve (cognitive 28): PaperCasesCompute.sdpaCurve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCasesCompute.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f59517d888efdd339b4aa669fcc20df6a367077f71ffebff2a8e8e2cd55d3"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.lookAtQueue (cognitive 28): AppModel.lookAtQueue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8705}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d967f598f95bc048cd65e562bf46f453f232fba505cc304e30b3b2dc124d38"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderBrowser.reload (cognitive 28): FolderBrowser.reload has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e2a43582ee527d20fd567b1650b5fd6f5b37a92b400dc484ce6cbf079de2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultGrouping.group (cognitive 28): ResultGrouping.group has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 9, ternaries 3 (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":"App/ResultGrouping.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"baad29b9eb3e7fd8cadb1617e23c91f018a03556136bb8bd239f757d9a615257"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenRecorder.tick (cognitive 28): ScreenRecorder.tick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenRecorder.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ac0abd2c692ff63e1ab18339dc510242c8bab085281f4f27cf807bcb1e7077"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenTimeline.body (cognitive 28): ScreenTimeline.body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 2 (5 pts), boolean chains 2, 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":"App/ScreenTimeline.swift"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb0de0ca59f3c955372f605c5ac3762237fdf47c366c897a85b2717b9e6d94"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexTab.body (cognitive 28): IndexTab.body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5029eb9ae5e5875a4ff4627207ca70ebe8e271ee30f14b5b4d8874639b56cd"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.notIndexedWhy (cognitive 28): MCPAdapter.notIndexedWhy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbef4980f173a9822419cd1e65a5e42eb1d2f8f927f4ee8587ed4ec9a2f93d60"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEQuery.parallel (cognitive 28): ANEQuery.parallel has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"526dc43ddcda2bf57e303c2ad910250ed640ed03fe6fc4918ecac814bb23bef2"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.state (cognitive 28): ShotBench.state has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (6 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4eac010b9ea79103a5b273c4e811b41faec85fda562f7b668ab040b1671f68"}},{"ruleId":"D2","level":"warning","message":{"text":"BulkDirWalker.walk (cognitive 27): BulkDirWalker.walk has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d445881a51f3e176cec9d20684e1e95c1c3728e8e7de962f1ee1a8b2997d9c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"IDTokens.tokens (cognitive 27): IDTokens.tokens has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (10 pts), boolean chains 6 (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":"Sources/OmniKit/IDTokens.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c28222b6c3c2086d49c91746ce92747856cb5a76731892de4abe054ebd771e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.coverageAudit (cognitive 27): VectorStore.coverageAudit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (5 pts), 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6b33a043233025b58fe43d5521ee230c2c03b70afe5da662570894f50870b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Drawer.run (cognitive 27): Drawer.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniPages/main.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7879078b154f8d2a9d8db3271f6f08fe36134ffbe2aa053f52e0f577ae187337"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.reloadEngine (cognitive 27): AppModel.reloadEngine has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 13, if/else 10 (11 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab3e63b09a2f40c5ce39506d8855dfb07e6b302f756d70ab23a2d52d3bd7bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.refreshIndexStats (cognitive 27): AppModel.refreshIndexStats has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 12, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":6371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aee68513ddf8ba187f75e134c91e876141ea4e3b8f69334cf9c6827c9565b9a"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCommand.matches (cognitive 27): EvalCommand.matches has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 10, 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a9e72fac8d54cfb0a9b5ef542a7ab757a4d5201d8dde34b93c6104a6f2b19c"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.packedInputs (cognitive 26): ANETextBackend.packedInputs has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (13 pts), boolean chains 7, ternaries 2 (5 pts), if/else 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a42efe0e4b22e1f74a40397c5ad977bb81bd55d8e71dc2344a6c874c936f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.enrichMedia (cognitive 26): Indexer.enrichMedia has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 8, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7367a948836e31ea8299d6d5a3b431ddd7805ac6a41bb66fa5e7d21a889f47"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.pdfTextTurn (cognitive 26): Indexer.pdfTextTurn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 10, ternaries 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d653d35856960333a644a483d62682bf79937e79b4a1f8bd712f7bf35f5ef1a"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioSegmentReader.nextSegment (cognitive 26): AudioSegmentReader.nextSegment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (9 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioPreprocess.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf8a7e467c87cc50409e8a628612af81d287be0f50b6296d9b30d871b8dd8c3"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.replaceManyLocked (cognitive 26): VectorStore.replaceManyLocked has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (7 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bbdfee2c1d31f4bfe50bea1b07e8015fdde62da291c84939a59e3ea0dbec08"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.searchGraphDense (cognitive 26): VectorStore.searchGraphDense has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 6, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d96f0172113128dfa51b334f3bbbe585175de69283f5470d60b81ae9a02be7"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownSource.build (cognitive 26): MarkdownSource.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (20 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/MarkdownSource.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced4991ef9a8de31bdc20a00d0877a23f3a2aaf4d02ca6ee6eea445b6ea7dcec"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfScript.runIfRequested (cognitive 26): PerfScript.runIfRequested has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (8 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26abfc69985423e5332121b67765fc8e7c4f4a06046b621fa9dee3fe8b89767"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.pathbenchRun (cognitive 26): main.swift.pathbenchRun has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 4 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b17042fca0aae6b410446f9951fe77d57edd1c87612f23129d6545bf24bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.validate (cognitive 26): index.validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9143417da0f61b097f1ec5471b0dc60df74b33dafd5297687d5ef7108048299"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCrawler.walkBulk (cognitive 25): FileCrawler.walkBulk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 10, loops 2 (nesting depth added 1). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/FileCrawler.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9371bc360eaab47b78160c3a87f782c861001b7b2ad7a81dc45c4f6ff5d97a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.index::flushImages (cognitive 25): Indexer.index::flushImages has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 5 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (Indexer.index, Indexer.index::takeWave, Indexer.index::updateTimeLeft, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d85d4c80309f142251813e5c84f4cbacdf0d2d323cf72003277b8a3462a8537"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.extraChunks (cognitive 25): Indexer.extraChunks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 3 (6 pts), ternaries 1 (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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3909c89142465b7375601095f58fddf5d251772ded1bb58409e89e0075bc3185"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.embedTextBatches (cognitive 25): OmniEngine.embedTextBatches has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (8 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2a3c3f15e67ef292ef922300d32d489062f261be240a8e8a624bddaebe041a"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.record (cognitive 25): ScreenHistory.record has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, error handling 2 (3 pts), ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"524dbcea539163609b3f3e43c78253488f60b6756b80758f61ed20a3fe4bcad1"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.folderCountsLocked (cognitive 25): VectorStore.folderCountsLocked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (10 pts), ternaries 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016f23fea47e0b9e4d5c04138f92f09ccf413021091695383b93d310250ec0e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.fuseLexical (cognitive 25): VectorStore.fuseLexical has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (7 pts), boolean chains 4, loops 4 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7054}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdd39b44d3959782e300c98e5f146d498e57f83220628ab85ac1d33c63086b3"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.mergeTwinFileRowsOnceLocked (cognitive 25): VectorStore.mergeTwinFileRowsOnceLocked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11949}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f507084fde44fb776ea151ca4ef6614198287fbc9021b71c70114fade0ad17"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.stampRowSidecarLocked (cognitive 25): VectorStore.stampRowSidecarLocked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 3 (4 pts), loops 2, error handling 1 (nesting depth added 2). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13251}}}],"partialFingerprints":{"codehealthFindingId/v1":"830349df3d31533e7e6c5dcd3c27b21d3ab6ecd59d366a621ab9e153d87d3f37"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.dropV4TablesLocked (cognitive 25): VectorStore.dropV4TablesLocked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 11, loops 1 (nesting depth added 1). 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, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eab35fe407ffc362f0bc167657723abb7eec69cfc35cf7de0d9271cc21fbb2"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.internPathsLocked (cognitive 25): VectorStore.internPathsLocked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0522d670eb2d10bd29dea0dc2b6f4022cdcd09aa7bd71dba175695310b5069"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchToolbar.toolbar (cognitive 25): SearchToolbar.toolbar has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 15, if/else 9 (10 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SearchToolbar.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2319f152823dd5b8151cb2228994fd08d1670227cf25adcb18c31463c347c670"}},{"ruleId":"D2","level":"warning","message":{"text":"Job.decode (cognitive 25): Job.decode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/OCRServing.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4b039e6a0fccd559cb0f27a38b389ae3f05b6f26aa8e5dee5037d3d0034eba"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.mapLayers (cognitive 24): ANETextBackend.mapLayers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b21de0e59362186b78bc81e09d2bf7953a171b4c8d34efd542bec130126b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEVisionBackend.encode (cognitive 24): ANEVisionBackend.encode has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), loops 5 (6 pts), ternaries 1 (2 pts) (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":"Sources/OmniKit/ANEVisionBackend.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"abea467c3de98b8e3dbbbae0bc3ebb237c301488fe4f89c710bd1d306b6d2318"}},{"ruleId":"D2","level":"warning","message":{"text":"IDIndex.drain (cognitive 24): IDIndex.drain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 5 (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":"Sources/OmniKit/IDIndex.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89b9feaa6df14eef35d7bec3227ceaf800a7e6e7be523f335435fee2fe4768"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.update::flushImagesU (cognitive 24): Indexer.update::flushImagesU has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 5 (6 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Indexer.update) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"849745e49bc67002bef9ae554918c4c0f21f984fa29b06fef68741aa4081c7ad"}},{"ruleId":"D2","level":"warning","message":{"text":"OfficeDocument.slides (cognitive 24): OfficeDocument.slides has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 9, ternaries 1 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OfficeDocument.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a415ffb6168a8f47e612e120ea6f4ab9899ce8d9ef7519105d34c103e4c954a1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompiledPathFilter.accepts (cognitive 24): CompiledPathFilter.accepts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PathTable.swift"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8c4bf5c3f5c6b4ff8ba0c8a48cb8ce393b41bcebfac80ad7621b1b568b9c80"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.rowWindowAuditLocked (cognitive 24): VectorStore.rowWindowAuditLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1e32aff9432c7d9130d7dc717e203b64d7b8566dc8814d96a7b11d5a3b5eb6"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.chunksForCurrentPathLocked (cognitive 24): VectorStore.chunksForCurrentPathLocked has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3616}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0146439de22f258cb02f45c4635c05234992f35f3c1fb578708dc09903d2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.applyComputeUnit (cognitive 24): AppModel.applyComputeUnit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 9, 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":"App/AppModel.swift"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"6286e16f0eeea6332d8cf161fac07d3ca4d148e560c583c4df5cb6730853d81a"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoSourceRow.body (cognitive 24): PhotoSourceRow.body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bd73babb3fd71b2abf3d569a9994b1e0d79b46563c69c44a9fe590b85434af"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callTool (cognitive 24): MCPAdapter.callTool has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 3 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5f388e0f57b466553400070d13539b8949d8062676b40d2cae0c45907d1a88"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiAdapter.handle (cognitive 24): GeminiAdapter.handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fc597c07dcb6a5e9cb6330522f7f53a43ec2de9c90a2364a5feae5f8349264"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.rowwindowbenchRun (cognitive 24): main.swift.rowwindowbenchRun has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 6 (11 pts) (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4386b22de91534d5af6fa6882b44101be2b1f37011149a2a4773d4fc488c64"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.indexedShots (cognitive 23): ScreenHistory.indexedShots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 3 (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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ff225cc216a2259016158838297990e14cd83bca4014e2380fcbc85c2704e9"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.provenRowRangesLocked (cognitive 23): VectorStore.provenRowRangesLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3, boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bfeeb6512fb015dce8378e667560ea4e2273d2a16cb769521c92e5b2bf311f"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.readKindName (cognitive 23): VectorStore.readKindName has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":5523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe96fc4ec7b02e65747c8594b1bfb1ccdcaaa0443993679909bae5db9a842ae"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.modalityScoreProfile (cognitive 23): VectorStore.modalityScoreProfile has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (8 pts), loops 5 (6 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6485}}}],"partialFingerprints":{"codehealthFindingId/v1":"970bef3b9376671edaa8f5651c8098cedce52e01b23d0719eaeeb5e9a0b99718"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.placeVectorLocked (cognitive 23): VectorStore.placeVectorLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9629}}}],"partialFingerprints":{"codehealthFindingId/v1":"268ad7113ec6575177ffe5bd5822cc10ca58a6d2153a763fe16fea986ebb84ba"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.keepReleasedLocked (cognitive 23): VectorStore.keepReleasedLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17240}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a78f1436c927c7262c584c9a8f2ab98a0872f7806bfbcecbb04a74a74854a5"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.serializeSearch (cognitive 23): AppModel.serializeSearch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1d46b7a4eb5a04bba261b9a75f08d1cbe8d622e1ecbf6529ffc37e7f55fdb1"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.runPaperBenchmark (cognitive 23): AppModel.runPaperBenchmark has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), loops 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PaperBenchmark.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9846dd69d446a6b27afc21a5abf25d9a93aca051718629fd5905b44cb65246be"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.bulkList (cognitive 23): main.swift.bulkList has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/crawlbench/main.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55af099e9af13731de6a5715cc4bf87e44dcf5b6ff543692bd5319a8389e45a"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.reference (cognitive 23): ShotBench.reference has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 5 (6 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"347736b0e6b044cd15a24f0e00122c16bf72c1eaeee0b41a46c130e8b12fbed0"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.streamWindow (cognitive 22): Indexer.streamWindow has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 5, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc1d8439eb427c165e82c997de4e4766ae4bb28c79009565c332ab33d114b98"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniAudioEncoder.encodeBatch (cognitive 22): OmniAudioEncoder.encodeBatch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), ternaries 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioEncoder.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44856817a600e5e87a021c5a0df941855f55857b8ffe7fca96323e0c7754c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.mediaPathFinite (cognitive 22): OmniEngine.mediaPathFinite has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e6351f87a3441114812888feb00bef21fc971274cd6749fd2be41d29eece8b"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.session (cognitive 22): ScreenHistory.session has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c8ae74c8a471d2d19f019c286a238012e9f79683b4d48e9593aca8e9347f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.takeInStills (cognitive 22): ScreenHistory.takeInStills has cognitive complexity 22 (threshold 15). Drivers by points: if/else 26 (67 pts), loops 10 (23 pts), boolean chains 14, ternaries 2 (8 pts), error handling 1 (2 pts) (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (ScreenHistory.takeInStills::pass) 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbf516b560eb1f43254974ac5bc246898e5d928846bcb05a401e297b89d95dd"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.chunkVectors (cognitive 22): VectorStore.chunkVectors has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9d33c2fd3b51877ada99c6461cc752b61e2d1ed2d71791cf173d9a895625a3"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.vectorsForContentKeys (cognitive 22): VectorStore.vectorsForContentKeys has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f6c30ca0534c1a7ecc2bff6ee5871c2d605d658279f6fa90309d5e9f6e7312"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.adoptReuseDebtsLocked (cognitive 22): VectorStore.adoptReuseDebtsLocked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 3, ternaries 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":10530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8153f921753277ef727b92f5902ba33b8ac4e0679699e7935bb8d438516d796"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperCasesCompute.indexPass (cognitive 22): PaperCasesCompute.indexPass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCasesCompute.swift"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3be1541d0146fcb522da64bf2a9a6a8b60716c588695c06e582fe2987a37d21"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentScroll.scroller (cognitive 22): DocumentScroll.scroller has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRView.swift"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b5e1c57685958d0f586717e1c2fe65058863a4a8b54f7db136a282f8224a28"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.install (cognitive 22): Coordinator.install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenTimeline.swift"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0288c4e165681170c3f5dbaabade6a331736d865de3072194832068e83f992"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkServed.servedSearch (cognitive 22): LinkServed.servedSearch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 3, loops 3, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Link/AppModel\u002BLink.swift"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb2a68221983e4137f5ec82c2fda1e6e1980fd14126131bb4a0309cd75473f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Router.handle (cognitive 22): Router.handle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/Router.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e91aa107121400bcb0f386ef1885067cc1b7208045acdc6954130276a68cacc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.bulkWalkParallel (cognitive 22): main.swift.bulkWalkParallel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/crawlbench/main.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bbd8b9446b051a97301c0680f94a97ca33e6b7f4dfa95527262c5c85c8e42c"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEHintAB.run (cognitive 22): ANEHintAB.run has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 4 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27a0d631b20793fa71d50a1864644e53a71204cd035d049ce67df438f3ac559"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::gatherTexts (cognitive 22): main.swift.top-level code::gatherTexts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::digest, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2d1fa80245bc7da84fc3a7375565c7ce04b01734ab2b74805bc73fd395effb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.validateTable (cognitive 22): index.validateTable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0d5f93c3e0259c99caa07989063a73b3484b9fcc1a5f3784749e020c1309e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEProgram.constant (cognitive 21): ANEProgram.constant has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANEProgram.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce76a4f45c5a6c725844e482aaea67850ee4f4a5b06db35548564c0d942798"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.documentPieces (cognitive 21): Indexer.documentPieces has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 12). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7dbd0da0954fa8ea8555a8a7d926e9f38ca4b3504c45acd31140a803ce7696"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.embedImagesTaggedHQ (cognitive 21): OmniEngine.embedImagesTaggedHQ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"6239e4b3e9ea377aacb05985a530d559aca727f34a67f945f2e6257e6e47a422"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniVisionPreprocess.preprocessRaw (cognitive 21): OmniVisionPreprocess.preprocessRaw has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniVisionPreprocess.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a819041d98ac3bec9bc26d86594ae26c7ee74141270321a530ac49377eba689d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.wallSeconds (cognitive 21): ScreenHistory.wallSeconds has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (4 pts), ternaries 3, loops 1 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 4 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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d310bbd6fa4204a5425ba30da0cf84a9d620432687f5fcc78619a1a6dc1876c5"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchHit.matchReason (cognitive 21): SearchHit.matchReason has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 3 (5 pts), match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12f5034960f110755b89561ad881b2a4d62ebb16fa0c6b4a3a91342b5e6d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.pathAllowGPULocked (cognitive 21): VectorStore.pathAllowGPULocked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8790fdaaae57a008dc389bc22def4d5b029acf21cd982439be6626e51f50d7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.advanceCoverageLocked (cognitive 21): VectorStore.advanceCoverageLocked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caf8f48511861906ca59be05fb2ac2a40fba4539a7ba1c9cc1d5e76327f4e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"SAMEncoder.positions (cognitive 21): SAMEncoder.positions has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 3 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRVision.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd2af5401c44d9a5ebbafdb76209e2958ae81e110deab01aff2842b8c0e2707"}},{"ruleId":"D2","level":"warning","message":{"text":"FileMenuItems.body (cognitive 21): FileMenuItems.body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 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":"App/FileMenu.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a0fde7ebec5985c7fda38b4d52d1b468e4f092d246120913e6fb50ea07eb16"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackPoints.body (cognitive 21): TrackPoints.body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4, ternaries 4 (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":"App/ScreenTimeline.swift"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ac4c3179cb609a7df78f437332a62d0b0ccd371270cbb174cdf73206c65ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"PerformanceTab.body (cognitive 21): PerformanceTab.body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, ternaries 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec120cea1b3bf22fd687f9ae083dfa6f5bca4573220735097af9b51b1d4536c"}},{"ruleId":"D2","level":"warning","message":{"text":"Sidebar.reconcileSelection (cognitive 21): Sidebar.reconcileSelection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"02143d1e64af0e40011fceb88f2c98b9496916ab1d611fb0a7c5b4273053d3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Thumbnail.render (cognitive 21): Thumbnail.render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Thumbnail.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"345a9161f7e26ffcf6df46f218d48d6826cccf04ab2ee161d8e9e019cc70aac3"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteFiles.downloadOnce (cognitive 21): RemoteFiles.downloadOnce has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (4 pts), error handling 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Link/RemoteFiles.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f67dac23a2a322040d91d587e4362edfa84cd8e1a813e3a58436b7eeb063630"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callPhrase (cognitive 21): MCPAdapter.callPhrase has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 5, 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"3973bf117f3113c5a34037b7f47bf3a14b2b0ef15fe97d89311425bd9abf5571"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.tombstonecheckRun (cognitive 21): main.swift.tombstonecheckRun has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (10 pts), ternaries 5, if/else 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (run, reopen). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cafc7fb89152552fe717e9aed9022f825fdde4bde9d123c2d5364299331cb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.toolHelp (cognitive 20): main.swift.toolHelp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (7 pts), loops 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4fa2c87fd10d8e379059901d321a8d173d5443a8ccdb0e0e3e6591ef914708"}},{"ruleId":"D2","level":"warning","message":{"text":"ANETextBackend.fillTokens (cognitive 20): ANETextBackend.fillTokens has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9b060b5e5d4334062cad83a5d7e6543f4f072ccba038666cdbdc34c071ce24"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.pieceTurn (cognitive 20): Indexer.pieceTurn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 2, match/switch 1 (2 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c389cdb8ea4f79e89fadd021a43e92f6518de3b11d18b9217e71ec10af0e79b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelDownloader.downloadRelease (cognitive 20): ModelDownloader.downloadRelease has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"055dae24a09a6f986f2a926125dbf0ed1a4b729de49d94959762111af2a22d32"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.run (cognitive 20): OmniEngine.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec53edf6e9e3f7bb42e270b728a084d13af3301fa6d1ad41ed7d4c6d0e4c70d"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.init (cognitive 20): OmniIgnore.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a154ac6f5b906fc296518c853c5ade76fbd322fc8e0bee057f0fa520d34c48ce"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.matchSegments::go (cognitive 20): OmniIgnore.matchSegments::go has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (3 pts), 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":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39051aff5fae7a48ca0d246a9037bb53ab9c625420d9e1041e6913fe19ac3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniTagger.seedImages (cognitive 20): OmniTagger.seedImages has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 3 (5 pts), ternaries 1 (5 pts), match/switch 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae29654cab735fbf74cd0539108a3a0822ecd765fb75cb238a785623b9907a7"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniVisionTower.rotPosEmb (cognitive 20): OmniVisionTower.rotPosEmb has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniVisionTower.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f749ef40ae196dabe0483b27f6ada6c6bf75da216b3b0571a297514dc22d6671"}},{"ruleId":"D2","level":"warning","message":{"text":"PassageRecovery.passages (cognitive 20): PassageRecovery.passages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"496e4cc516567f3928543946e5e9896c432d2c9cbb2b0b95eeac2c42a651729e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenSignature.init (cognitive 20): ScreenSignature.init has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenChange.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"84731c786b182a518301f9312092341e55a61b69e695874ecede418d19d8d440"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.readCatalog (cognitive 20): ScreenHistory.readCatalog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68837a7be066b1e932ee855215edcbb616d906026914452ef2d28df74d4dc93"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.streamedVectorsUnderFolder::walk::stepLocked (cognitive 20): VectorStore.streamedVectorsUnderFolder::walk::stepLocked has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VectorStore.streamedVectorsUnderFolder) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6395}}}],"partialFingerprints":{"codehealthFindingId/v1":"638971c64c85d51059b66f7f3b820f4c6ab872d33e9ecfab8aac7d2a92597958"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.commitReclaimLocked (cognitive 20): VectorStore.commitReclaimLocked has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12842}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cef42e408a36f2bb6b42128933d434132b0fd6bfa7f7db67c46c0cb2b17813"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.removeRowsByPathsLocked (cognitive 20): VectorStore.removeRowsByPathsLocked has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15345}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9478466d24f3d1ce03ce18ec273ba46b4cba9e6ec0ddc270ac5cf41dacbac"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRResize.bicubicAntialiasCHW (cognitive 20): OCRResize.bicubicAntialiasCHW has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (20 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRResize.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"51002cd0301196c186c3d14d428ccf58d073d47ca04dc46eee22160155143f64"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperCasesStore.exactReference (cognitive 20): PaperCasesStore.exactReference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCasesStore.swift"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b774255592f75b085fa83259db431d717132095f66bf446ffda294d1b9cfee44"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.reloadFolderPolicies (cognitive 20): AppModel.reloadFolderPolicies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, 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":"App/AppModel.swift"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d928c52571d1936bfb0168a3ec6d7957e929268e548c3b30b9c291aad73144"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyResults.body (cognitive 20): EmptyResults.body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d9c4a20a37b8b90fe4a12b417742071974a2489813fdefdac82938c38d200"}},{"ruleId":"D2","level":"warning","message":{"text":"DropIntake.read (cognitive 20): DropIntake.read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"App/DropIntake.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50b926b422393ece78e1e42d3d18792b8a5e3215f6db9eee2223b5cd0877d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenRecorder.frontWindows (cognitive 20): ScreenRecorder.frontWindows has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (7 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenRecorder.swift"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f80ea3672e0e0ba0ce5445e9ee20b68b76dd4629acb591ed6b74360b9112c6"}},{"ruleId":"D2","level":"warning","message":{"text":"HTTPParse.parseHead (cognitive 20): HTTPParse.parseHead has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/HTTPMessage.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ccc6d10e9f2b3cd869b183c00b274bc9ae89aea5f8b07ef42a69c8500a3ed"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callOCR (cognitive 20): MCPAdapter.callOCR has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4, ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb7cf243e416db39ff7fa6c7a8b437531ec70ddb250e46ad9f99bcd24200efa"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingController.startServer (cognitive 20): ServingController.startServer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7, boolean chains 6, ternaries 5, error handling 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/ServingController.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9186913cc6f15e3e609d988fc27c3f80d32b736d45c421adc7bbd3284a334"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.unixExchange (cognitive 19): main.swift.unixExchange has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a117a5e0e8dca4ae81b03b7471d14d8231c12b7e4ec890b5224e730c248a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEVisionBackend.init (cognitive 19): ANEVisionBackend.init has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 3, boolean chains 1 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"Sources/OmniKit/ANEVisionBackend.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64789d14b0fb5960fe8da07e6d8a996b3ba0a6710b7249e8b423772395d6ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFPagePictures.imageShare (cognitive 19): PDFPagePictures.imageShare has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (6 pts), loops 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":"Sources/OmniKit/DocumentPictures.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad97957c303b993a7638baf814bcd25daf7fc01c49134c069d3a5a612f7afdff"}},{"ruleId":"D2","level":"warning","message":{"text":"Half.bits (cognitive 19): Half.bits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Half.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"80304259a228a300c032e0e2d3880fb9956661d32b57ad593de2a07f0c162b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"IDIndex.lookup (cognitive 19): IDIndex.lookup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), boolean chains 3, 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":"Sources/OmniKit/IDIndex.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2074722707230714a160c7eaa098a54b5fa9b924cce0a2b9348b896d01c953ca"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexRelocation.copy (cognitive 19): IndexRelocation.copy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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":"Sources/OmniKit/IndexRelocation.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd96d5a97c2dff9597ab457949069c5bba79ac03488da20e6752b18a5b082bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.index::takeWave (cognitive 19): Indexer.index::takeWave has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (Indexer.index, Indexer.index::updateTimeLeft, Indexer.index::handleStream, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dfa17a0b1bb54eac28d0082e5ddd4e83fd2602c3fd902f317442acd9c6627e"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniTagger.buildCache (cognitive 19): OmniTagger.buildCache has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0ae7f38da8ae79b828a92b4706f256e82fb22af3ac0157c6ffd742f72ef0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFPagePick.page (cognitive 19): PDFPagePick.page has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PDFPagePick.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0be9b8197aeafc01cc0ff378098c9dec7a314a53f189ecb1fd44d629f8cb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.copies (cognitive 19): VectorStore.copies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7631e7de13f676f4406bfb8ff37905192dc1b1b8c088124d074faf43d564d64c"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.finishTailReclaimLocked (cognitive 19): VectorStore.finishTailReclaimLocked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12670}}}],"partialFingerprints":{"codehealthFindingId/v1":"836d6a77ae232621a41f5d811240a6563160b2df1067944165d3d4b8fb8e60d1"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRVerifyAttention.plan (cognitive 19): OCRVerifyAttention.plan has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 5 (6 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf13beff02091f7852c1efda8c38515aa85bec15781e053accfcf7f724b3a2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperCasesCompute.textLever (cognitive 19): PaperCasesCompute.textLever has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCasesCompute.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acf1e4725786122d5201b167a47f9c7de3a7ea06349a63d91c793a8efd43d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.fillPassages (cognitive 19): AppModel.fillPassages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86406f531108078ffc8fcf52a04e3929efb481f28800ccaf2581d9005fb6c89"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.finishPass (cognitive 19): AppModel.finishPass has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8998}}}],"partialFingerprints":{"codehealthFindingId/v1":"004298e707ad7e790488d0ed739d87fef97db8d07ed41941f72447b605671858"}},{"ruleId":"D2","level":"warning","message":{"text":"PerfScript.ocrStep (cognitive 19): PerfScript.ocrStep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"9830aa046aab66b18a4a202aa4702b0d16cc0609026062cc604082d3b105eb20"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.sourcesResult (cognitive 19): MCPAdapter.sourcesResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d75abb2d3af88fc7e6e3e21048eca15de30ce07f7863ceb3b9dec6e24ff5e47"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEBatchAB.run (cognitive 19): ANEBatchAB.run has cognitive complexity 19 (threshold 15). Drivers by points: loops 8 (11 pts), boolean chains 3, ternaries 1 (3 pts), if/else 2 (nesting depth added 5). Of this number, 16 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c02ec9f203bcd5885baa6966a5ed6fe68f4e12fad18db71755d894052458b1"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCommand.stateCompare (cognitive 19): EvalCommand.stateCompare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/Eval.swift"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbc2667feb3cac681a3bfd712e767e23d192e9490b281d15d6b9197ddb8158"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundCost.run (cognitive 19): SoundCost.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":4399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5faa62dfb34d4022ed45cd3348a8437661a4a56359a1ed3d0b749f97629f5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::appendToFiles (cognitive 19): main.swift.top-level code::appendToFiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::digest, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cda7e88c3200737ff2d8a10f53cd2d87eee700bed3bb0310546304beec7530"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniEngine.embedImagesTagged (cognitive 18): OmniEngine.embedImagesTagged has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccf3254659e8f376cb5b8887028b156e0bc2e0bb7c26ee7be9a24124eb2fc21"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniTagger.topIndices (cognitive 18): OmniTagger.topIndices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4, ternaries 3 (4 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (siftDown, worse). 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":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857c23b685d4af51af48a942873eb9f1a14d6bf6ddec4af20c4de2d33e4088d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSlice.largeTextLines (cognitive 18): TextSlice.largeTextLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 3, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Passages.swift"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e567ddb48a3e695bde0719c88f8e102a3c09d3a443e08373fcb524d52380f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.read (cognitive 18): ScreenHistory.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77eb746c39a7b73330c3d4b0db4429e879f209bdaa91e61815d44f31210dd8f"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchFilter.accepts (cognitive 18): SearchFilter.accepts has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5545ed0a7873567e5cf71a1bc9c13279a867d623533694e090396843595ef042"}},{"ruleId":"D2","level":"warning","message":{"text":"Vec16Buffer.mapPersistent (cognitive 18): Vec16Buffer.mapPersistent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f98e21bb438ef757632613a184b1f9899a3a2c39a6cee3da59c3ed16b2732ad"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.ensureSlotRowsLocked (cognitive 18): VectorStore.ensureSlotRowsLocked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (6 pts), boolean chains 5, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e7595f1c012b496ec651c763921968090c3bac2eafb614657e8fc0604ab7d2"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.searchDense::coarseFastPathLocked (cognitive 18): VectorStore.searchDense::coarseFastPathLocked has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (VectorStore.searchDense) 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05874ed1551d078c94c3d43cbbb72f1420dc945bbcbc0eaaac181c59013d668"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.selectLargest (cognitive 18): VectorStore.selectLargest has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"906770e32dc0a987b69fcb293d7634cf9e065f2c305921791c034f6735fd9aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.deriveUnownedPositionsAsHolesLocked (cognitive 18): VectorStore.deriveUnownedPositionsAsHolesLocked has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11762}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f48484c775e73eee9ae7847f2228a2199c73d558b8c019577f325485f768b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.transcribeBatched (cognitive 18): OCRModel.transcribeBatched has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12b6d759c7cc9491a8907a1a6597fba63fb8a410057daa43a2c2c789664b298"}},{"ruleId":"D2","level":"warning","message":{"text":"SAMAttention.relTable (cognitive 18): SAMAttention.relTable has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRVision.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b787ecc857675de5c523a958bafba0e897d9c2f46148e46b8feb6aef98f28d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.applyKind (cognitive 18): AppModel.applyKind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, ternaries 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d028e365544c089313a6104ed41d317c4f500da4442abbd08a8f9d9e2906617e"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.loadPerf (cognitive 18): AppModel.loadPerf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 1 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":4970}}}],"partialFingerprints":{"codehealthFindingId/v1":"e923897a44e5fe93e6c68a08d925ce737046f0450ffc8cc294593b5cb1f96796"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.vectorSpaceDiffers (cognitive 18): AppModel.vectorSpaceDiffers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7343cb5b48d193abb212c443cc1675a617c969e2154e10ea63bda7509a906d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.restartWatcher (cognitive 18): AppModel.restartWatcher has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8540}}}],"partialFingerprints":{"codehealthFindingId/v1":"450849b14e50e6200d745b15905f3a1ebc5d8cf8db94cfc5b898b44c96cf19a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkPreview.load (cognitive 18): ChunkPreview.load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6 (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":"App/ChunkPreview.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bfe75b31a290b06a5709064b3acbbeaf870b3b90bc00a672c349032040fc9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.move (cognitive 18): Coordinator.move has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentKeys.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"57552ea3d6a13415b50feff1d8722f5326a74587a238e85cd9563db39a680582"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderBrowser.followProgress (cognitive 18): FolderBrowser.followProgress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a7cdfb6309f4627aa3d67c83677d6d2be2fe4440c6ca36bdaaaace6510c881"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownBlock.parseHTMLTable (cognitive 18): MarkdownBlock.parseHTMLTable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/MarkdownBlock.swift"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a623e5bb6ff086927ddfd4fc858ea71fc22f50a7cc9e18f3a1708e9799842b"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRView.content (cognitive 18): OCRView.content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRView.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ef9ae64a5885af1e818b12e095326021e605caa8ffd41c5519ba68c4d492b9"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDelegate.dumpUIDebug (cognitive 18): AppDelegate.dumpUIDebug has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OmniApp.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07d064a8322e529e81634aeb82be9c9cc79d4b0d8ed9e8e3f2335f16aadf471"}},{"ruleId":"D2","level":"warning","message":{"text":"PassagesView.body (cognitive 18): PassagesView.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, ternaries 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":"App/ResultsList.swift"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17806d3b0149b71c67333c98f8428f6dba519dd50647536a00465b2adde6915"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultGridItem.body (cognitive 18): ResultGridItem.body has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 4, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48ceb47bf82dde786b21183222078858f99eeb798c3b37c4e7909cfa3c44f11"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenTimelineState.apply (cognitive 18): ScreenTimelineState.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, 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":"App/ScreenTimeline.swift"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5030bb20ecccc610374e65216a85ecb8de90cee3b4364f1f52f439aa1852249a"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.handleModern (cognitive 18): MCPAdapter.handleModern has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"078f090d6680450b823c53e5ff6002ec74b2a4257f81ad9d12a45a867701067c"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPAdapter.callSources (cognitive 18): MCPAdapter.callSources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2da855b6d9f305150419852e5aa5371b3c10d5a8f48a4d5bb194a622e6f41"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentOCRAdapter.handle (cognitive 18): DocumentOCRAdapter.handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, match/switch 5 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/OCRAdapters.swift"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eaf53a7bc6ec8637b85949f222020eb87608066726955c81d69d24e2ed3a38"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEQuery.textBackend (cognitive 18): ANEQuery.textBackend has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b13c54b82960164fc0a2432dc087cf4bb9e57b743a1c8bc329f39251007d0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"IDIndex.sweep (cognitive 17): IDIndex.sweep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/IDIndex.swift"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcfe4240f434f5078b64b642b44604044fe265505141edb5ea2537bffd6c8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.withExtras (cognitive 17): Indexer.withExtras has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"604687aa13185d25254bb3cd03c32e08733589974fde634160bff265d40d8cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.embedDocument (cognitive 17): Indexer.embedDocument has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), boolean chains 4, loops 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef6f75e180086433900af72d6644892300d71cf22d828f4dbf5ecbaba7838bf"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrationV5Runner.backfillInPlace (cognitive 17): MigrationV5Runner.backfillInPlace has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/MigrationV5Runner.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"876b0965ff7f34ee818f271e9e73c962a7e36b04a2a5d9448804683233344421"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.parseLine (cognitive 17): OmniIgnore.parseLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bbf5827cc1ef0d088e41eb55fd4f1db4503770776e8748f0db97abdac7bfbe"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.scoped (cognitive 17): OmniIgnore.scoped has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), loops 4 (5 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":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"055811b25c149e53f77d8ee07b608ecdf9f0fdb30fe9c181ab4ba329724a4cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniIgnore.matches (cognitive 17): OmniIgnore.matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6cd131e8bb2eaa741a16f2fefadf27ef4aab5b63fae629c5a9c2906bd5a4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"OmniImageEncoder.encode (cognitive 17): OmniImageEncoder.encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniImageEncoder.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad43d2d9385ce501edde55f88c8ad615e63e048dabad51ca99d0425852a9146"}},{"ruleId":"D2","level":"warning","message":{"text":"PagePhrase.span (cognitive 17): PagePhrase.span has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PagePhrase.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f7ce0ea1de02b5b8a601886af1154559c7907513dbde4f38aaed692784547a"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoLibrary.enumerate (cognitive 17): PhotoLibrary.enumerate has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 4 (5 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/PhotosSource.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a70de4c1f601cc97d97ee4ca2f0a132c355b186a219c3b8a8cf90db9f87243"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenSignature.share (cognitive 17): ScreenSignature.share has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenChange.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b373eb0683958d4cfb4b6d3b6fe1d3f240b62bcd8630bc9b4be836dbd745e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenHistory.delete (cognitive 17): ScreenHistory.delete has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d36aeb5a4803232a22a53926fa904769f784ad88f2c8adfd07771b576e368e"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.foldOrphanLiveLocked (cognitive 17): VectorStore.foldOrphanLiveLocked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 2 (nesting depth added 3). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e198bff7fb8b13d631c501046636dfed23dc0d300e99110c7566bbba834fef9"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.fileChunkDec (cognitive 17): VectorStore.fileChunkDec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df58ea907a802511b3ac78a75e5d853cba086ec49d38bd5b55fcbfbacd0ea21"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.knownFiles (cognitive 17): VectorStore.knownFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4380}}}],"partialFingerprints":{"codehealthFindingId/v1":"191a5e4b289ee8085d71cc0e7d24702940e286dcd33fe16f9ce1cd19476ab687"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.hitsForPaths (cognitive 17): VectorStore.hitsForPaths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4939}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e11d0e5da2780336307b877bee2c32fc5fcb5eb5fdaf2bfb3d8006d137b4452"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.releaseHolesOwnedByLiveContentsLocked (cognitive 17): VectorStore.releaseHolesOwnedByLiveContentsLocked has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), loops 2 (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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11826}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf2148a1bee0f6fbcfbfc62a615328a11b88646f41ce0227993445f1394a99"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRPreprocess.closestAspectRatio (cognitive 17): OCRPreprocess.closestAspectRatio has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 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":"Sources/OmniKit/OCR/OCRPreprocess.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4957cd9b8f767b6c851d9c1d19a90d2d014b2bb31c0adcc815ddb8c39e3a1d"}},{"ruleId":"D2","level":"warning","message":{"text":"BenchTable.renderText (cognitive 17): BenchTable.renderText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts) (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/BenchTable.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"96214c0cbfc54889ddae3bf51c885e04fa592782e74dbd034f3d4d4631a3e21e"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemProbe.gpuClientTimes (cognitive 17): SystemProbe.gpuClientTimes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/SystemProbe.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d86e70dd003fb9d5807dd473dd79f9601fe3425a65ec65bcad62dc1be61c2"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkNode.accept (cognitive 17): LinkNode.accept has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 1 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a6377591539a169eda516adb86d3890d7121cdb7e42206569a1c81cc6e345"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.drainIdleUpkeep (cognitive 17): AppModel.drainIdleUpkeep has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":7563}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d788270870fb1f4053bce644659620144de2f0beb84a79847e01bd14880185"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.show (cognitive 17): Coordinator.show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 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":"App/OCRView.swift"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36f03eb1ac1d0ecd950325b37399635bbc9f8d984085c09a71152ff602b1783"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenshotsRow.body (cognitive 17): ScreenshotsRow.body has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"007691d7ce14777bde1b4f21a437b2d5f129a054104ee90bafb25f40f13c9746"}},{"ruleId":"D2","level":"warning","message":{"text":"ANEQuery.onDevice (cognitive 17): ANEQuery.onDevice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 3 (4 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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"237ce4e33017034aeaaa39b9fea6279c01ec56ea5e82ac32bf85fd80a0db7b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::digest (cognitive 17): main.swift.top-level code::digest has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (6 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::compare, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b6d8ac8db504b3d1f993aa8fecedcf80f5bb1e9161fdd1a6be17eb23043755"}},{"ruleId":"D2","level":"warning","message":{"text":"Examples.commands (cognitive 16): Examples.commands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/AgentSkill.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b4b8d34ac1a6e544f2496d9b74523e28ebee2902d04cd0636c6a92165249b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ClipboardHistory.title (cognitive 16): ClipboardHistory.title has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ClipboardHistory.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbf1284b3b5a342f6997894009be836771c14ee0ba9a1a68ff099002bceef4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.anchorStarts::matches (cognitive 16): Indexer.anchorStarts::matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Indexer.anchorStarts) 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c92c4932d00456fbed8d25e6cffca07208da0d0cf2339b439da5b5265ba3cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Indexer.streamedVideo (cognitive 16): Indexer.streamedVideo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4994}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3694b2af372cd1b90634bf3d0429925b86561eec62f1984a0a80cbc40777d1"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalIndex.indexedText (cognitive 16): LexicalIndex.indexedText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/LexicalIndex.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec7e2e06aca26aff1fa183e652d2b94f97899610fb34336ec6611e605429fee"}},{"ruleId":"D2","level":"warning","message":{"text":"MigrationV5Runner.v5CreateStatements (cognitive 16): MigrationV5Runner.v5CreateStatements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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":"Sources/OmniKit/MigrationV5Runner.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d134714e6f8395c8c7ea938d24a7469477297b845196431ec9b549a2e2b140"}},{"ruleId":"D2","level":"warning","message":{"text":"DateStyles.isDateFormat (cognitive 16): DateStyles.isDateFormat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OfficeDocument.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f76f75c184d9fe6b53503fd9e09abee76b71672aab8f8f7fb446229f4d73337"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionEngine.layout (cognitive 16): ProjectionEngine.layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 2 (4 pts), boolean chains 3, ternaries 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d7384affe4c54689173eb522da317a8fb17f31a3d6c78c2601c341c760cef1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectionEngine.selectNth (cognitive 16): ProjectionEngine.selectNth has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e13833d3147169f3d0c5e20afd56cd0d0a177bfade94e974be59a51b5f1681"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchQueryParser.hasFinishedQualifier (cognitive 16): SearchQueryParser.hasFinishedQualifier has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, loops 4 (6 pts), if/else 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/SearchQueryParser.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bc03a6a151ede66b97456e83da2dd11fffcc310201d7a8547f63ba15ba44cd"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.shrinkFileInSlices (cognitive 16): VectorStore.shrinkFileInSlices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3818}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eefe507dc364f571c95f2c6c1665cee6e57f41e5d9373a8d950b87de3deaf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.allIndexedPaths (cognitive 16): VectorStore.allIndexedPaths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4810}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f37c2d1019b24f9b68a0e5b382e3d93326d0725a41d6d972461bdf703440c06"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.fillSnippetsLocked (cognitive 16): VectorStore.fillSnippetsLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7951}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeb5ffe0e841dcc6e608f5c45b68b5524bf9982a15bc493d7e8618d659094e7"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.resolveTagFilterLocked (cognitive 16): VectorStore.resolveTagFilterLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1911de71d3a82617beb960e2e171ad86f2595a48cd0c90ab3067a5734d232d"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.retireContentsSharingAPositionOnceLocked (cognitive 16): VectorStore.retireContentsSharingAPositionOnceLocked has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 4, loops 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11880}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f0e73e549b57a39ea658490e7d4b0f73f3a64b602e9b4d1ef622fcb312adc"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.reclaimByTail (cognitive 16): VectorStore.reclaimByTail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12515}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b76200bf751503d582182b1537d2b1d0a4a09ae82adf1d1397a7fdc254f010"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.scopeLocked (cognitive 16): VectorStore.scopeLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14554}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f130da83c560595d4b9f116bc6280178358cec33fe0f854c5e058592dab393"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.prepareChunkInsertLocked (cognitive 16): VectorStore.prepareChunkInsertLocked has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":16706}}}],"partialFingerprints":{"codehealthFindingId/v1":"823dbd8ce95f55274e59d36d0e51f9a034e132fa704fc81acfae7e6cbe8f2626"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorStore.appendChunksLocked (cognitive 16): VectorStore.appendChunksLocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18135}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f5d3ffaf89ad823f9eb4a0f57dcfbccc50facee77dc17d19c44bbc54ee1d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpointer.runOne (cognitive 16): Checkpointer.runOne has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":5385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2061b75088ad3aa97d0bc6c3b46b8a3d817196df1483b2203531b797927257"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.transcribe (cognitive 16): OCRModel.transcribe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRModel.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f07173c88edb9186157d89800db3dbfcd15b4fc7ca5f41a3ea64e043c221f8"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRModel.transcribe (cognitive 16): OCRModel.transcribe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). Of this number, 15 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":"Sources/OmniKit/OCR/OCRDocument.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad4f1b8126b5b0c15bebe96edf02d3d59b7e252101af696999463cc716aecc7"}},{"ruleId":"D2","level":"warning","message":{"text":"PaperLevers.applying (cognitive 16): PaperLevers.applying has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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":"Sources/OmniKit/Paper/PaperLevers.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac62d5f8a9f7a6846ba91284a4ca39b37efe2965dd363a8c725429419e50d4c"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkNode.dial (cognitive 16): LinkNode.dial has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c3e70ede81346229b3d227bb97f573daa6966d0d7a44ade29180c76a5c0de1"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.rawResults (cognitive 16): AppModel.rawResults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c09121d1f799d252c0fd252810cee68eccc596ddf592d263345afae5fce7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"AppModel.pickPage (cognitive 16): AppModel.pickPage has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 5, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"12132aaca4f489f7471ad3d92b4bb1baad74715aad8475109a44bb89e7369ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultRow.cell (cognitive 16): ResultRow.cell has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"e855a103f6d9cda2c81a2efe2df4b816c89c64ccb804344b5d8cf40b3efd1fac"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkController.refresh (cognitive 16): LinkController.refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, loops 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":"App/Link/LinkController.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"26378cc3b3fdc61f9cfc65c6b94bf0448e77660411792e2a573e1a6bc1746d68"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchAdapter.rows (cognitive 16): SearchAdapter.rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, ternaries 4 (5 pts), boolean chains 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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c138028d2a9266f7292f87b92108c22a0000167c2c013cfe3332db49da6b89"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingController.lanAddress (cognitive 16): ServingController.lanAddress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/ServingController.swift"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad1bc0b24560c4fc9943396acbf771274f4420ff64922a4594f9860655a3289"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCommand.generate (cognitive 16): EvalCommand.generate has cognitive complexity 16 (threshold 15). Drivers by points: loops 9, if/else 4 (6 pts), ternaries 1 (nesting depth added 2). 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d2f07f1d84d4bc66e6de9dbf3ddfbab23a931a437c1f193d5bf3283b52effa"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.hints (cognitive 16): ShotBench.hints has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46687953f48500b5d287e48da6b915e9a067655ba0e13f316527bc644516b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShotBench.listRange (cognitive 16): ShotBench.listRange has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (6 pts), ternaries 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (time). 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac7396941995b7c289829326851bd661d26e0f24dbfea22035ad91d4b0a954b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.storeauditRun (cognitive 16): main.swift.storeauditRun has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, if/else 4 (6 pts), boolean chains 2, loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"910194a13e17f73f8c12dec2cfafe4aa5a67d7ece83f4770b3d55719c20036b4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::vec (cognitive 16): main.swift.top-level code::vec has cognitive complexity 16 (threshold 15). Drivers by points: loops 11 (12 pts), ternaries 3, if/else 1 (nesting depth added 1). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::digest, main.swift.top-level code::compare, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d41524c100c8840866d11c40f915032f48d5a4f200e1e258a9bb857924fdc7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code::compare (cognitive 16): main.swift.top-level code::compare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 7 other methods here (main.swift.top-level code, main.swift.top-level code::vec, main.swift.top-level code::digest, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 8 times rather than 8 independent problems. Splitting this body alone leaves the other 7 exactly as they are. Where these are variations on one operation, the change that clears all 8 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: Sources/omni-verify/main.swift holds 17 of the 406 methods over the threshold \u2014 including the worst \u2014 and 3999 of the 12075 points over it (33%), 2.1\u00D7 the next-largest file (Sources/OmniKit/VectorStore.swift at 1883). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"500cbb090ee6a76a791e855250e5a3c580ac55303ecdb29bc6f1b1702b3204c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.top-level code: FunctionTooLong \u2014 top-level code runs 5961 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5861 over it, 59.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78634fb5045b5c9973df900209d5328ff8817bea974a502b96692606bac67ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OmniKit/VectorStore.swift: FileTooLong \u2014 9513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9013 over it, 19.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4faeab808c23738c7cc78e7037bb21579a61f490e3abb813d0f9f9bac527dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VectorStore: TooManyMethods \u2014 450 methods. The bar is 30 methods; this is 420 over it, 15.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"660260d03c1f58ff88a0a517f8df428bb35aa79386d9a4792847a5ae78aa03a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: omni-verify/main.swift: FileTooLong \u2014 7383 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6883 over it, 14.77\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":"Sources/omni-verify/main.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77512f490529ebe34dbbae2e33d5912dd100957ef4001d45836a9abf9552374c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppModel: TooManyMethods \u2014 396 methods, declared across 3 files: App/AppModel.swift (376), Link/AppModel\u002BLink.swift (16), App/PaperBenchmark.swift (4). The bar is 30 methods; this is 366 over it, 13.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5df5bcb771bcfe236597d69c545953253ebc51459225e6635969c770ee9a64"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppModel: ClassTooLong \u2014 4997 significant lines (blank, comment-only and punctuation-only lines excluded), 396 methods. The bar is 400 significant lines; this is 4597 over it, 12.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a737576955ca58cfcb7dab2b81da70fe83201a09aa829608fa62fa8f73e1248d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/AppModel.swift: FileTooLong \u2014 5231 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: AppModel (254-9656). The bar is 500 significant lines; this is 4731 over it, 10.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51045cb8454d949827acfab29ca14b165b4225be043d71f7c3eee2c52da23d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Indexer.index: MethodTooLong \u2014 index runs 754 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 654 over it, 7.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedf9b114f1dbf36c22534f9a0aa64fc72c278f397fec2c73105bdd20e38552a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Indexer: ClassTooLong \u2014 2949 significant lines (blank, comment-only and punctuation-only lines excluded), 109 methods. The bar is 400 significant lines; this is 2549 over it, 7.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b7cc332463b212bbf132b9314b949cfda826597274f101bfbcfe3c2a98a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OmniKit/Indexer.swift: FileTooLong \u2014 3112 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Indexer (299-5456). The bar is 500 significant lines; this is 2612 over it, 6.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053ff2d5d35ffc88d8b9f7afdc65217bac8e15c2cf391e22b14611f8cbbc59b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.top-level code: FunctionTooLong \u2014 top-level code runs 565 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 465 over it, 5.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80636fe65af7134de24d6cd67d88b06176867c338f91e14a1662a6c14b5389f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.top-level code: FunctionTooLong \u2014 top-level code runs 428 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 328 over it, 4.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/mutbench/main.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9b1623a870e56827626ddca784b7b7dd4e361c10db7be3ce528b42da9087a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PerfScript.perform: MethodTooLong \u2014 perform runs 423 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 323 over it, 4.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"503c4f6e7fc173168be27841683dc1366810942adccfca967771e11443f67a8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Indexer: TooManyMethods \u2014 109 methods. The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0bed6bc20b666e8325ed5ab4bc6ba5a2bc700376d2bb6485bd89487d7c0b90"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OCRSession: ClassTooLong \u2014 1201 significant lines (blank, comment-only and punctuation-only lines excluded), 82 methods. The bar is 400 significant lines; this is 801 over it, 3.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6045e4cc626bc5fec6272098c1ac53344bc690f711142129a5b8d5f513522c24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MCPAdapter: ClassTooLong \u2014 1158 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 758 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce156e4cda612cba3beb26fc7f198fd2141ed750b99fdba151290c6360693b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OCRSession: TooManyMethods \u2014 82 methods. The bar is 30 methods; this is 52 over it, 2.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebcdd95e49c1077fb08648f6408c1fb66c62dd844db75b762e97c3d6295ea3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/OCRSession.swift: FileTooLong \u2014 1251 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: OCRSession (26-2246). The bar is 500 significant lines; this is 751 over it, 2.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8499edc9ac41aa079d584a82abc05453b60dcacbc5244302c46cfa07dacd2b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OCRModel.decodeContinuous: MethodTooLong \u2014 decodeContinuous runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa014971646691d4b3c397033535720db80d45abbe9f87e74e7a00c8f76db89"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScreenHistory: ClassTooLong \u2014 936 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods. The bar is 400 significant lines; this is 536 over it, 2.34\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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9788bcd6320b1f7392a449d48efa893cf9b65ba0facde6de0507b1fa380bb668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Serving/MCPAdapter.swift: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: MCPAdapter (21-1786). The bar is 500 significant lines; this is 664 over it, 2.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c4712a8bd5d21393315b77c4964db059e45d4ffa1381b8c137386234f4ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OmniEngine: ClassTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 492 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fde113ee1c5202b2a47c3fbf555187bd78dcff3010362e0ff24164501b553b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScreenHistory: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c2c4e73dfea9f0c4928a32eeb7b066dc4ba54a9d3d1aeb8cd5c41e94ffa72e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Indexer.update: MethodTooLong \u2014 update runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a8fb0dcafd1e94d3a29a4a5e0278ddfa1f046b7810e535ffccd0eaeb93a131"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/SettingsView.swift: FileTooLong \u2014 1050 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 550 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"843f0e67c81b912b186c6f6b90c289fbf515f2c8df289c8fdbd60cab1a244ba7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OmniEngine: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03e65fd060b758c929ca7544a305cdc7d7a6a28f29c275c345703b4bd28aaa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OmniKit/OmniEngine.swift: FileTooLong \u2014 999 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: OmniEngine (297-1959). The bar is 500 significant lines; this is 499 over it, 2.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0058a963dcd9288f2ddaf5489f9029b894aa3886fd38f71f6ff97aa75b6292"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BenchCases: ClassTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 385 over it, 1.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/BenchCases.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de5bf23d2352391cf95e0a5d973f2b248030aa76699ce443a6f52a5d294b63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShotBench: ClassTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 384 over it, 1.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c299628692431e3090778a0de1d4b61a1a1ea5500a79b5a7c1bd8f53d99eec32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OmniKit/ScreenHistory.swift: FileTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ScreenHistory (28-1489). The bar is 500 significant lines; this is 449 over it, 1.90\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fbc589f293e22db268d708af755a3680cc91c4413f68cc9673796acc7b89c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppModel.bootstrap: MethodTooLong \u2014 bootstrap runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":5838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd1138267310f42e2a898e834507b48ac0db9e0150615694bbc0a6d4a0ea5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/OCRView.swift: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9030306a7f57e903bd73b4f02eb0ea915dda853ec318a0e3d11a6e7263b83dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Paper/BenchCases.swift: FileTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: BenchCases (103-1169). The bar is 500 significant lines; this is 367 over it, 1.73\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":"Sources/OmniKit/Paper/BenchCases.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08483d4369ec820544648d32ea8e309462d155349f7b5ad230468b2e6bd3fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PaperCasesStore: ClassTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 249 over it, 1.62\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":"Sources/OmniKit/Paper/PaperCasesStore.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedc7a9f080f690a17028ee74c7084cca8c96bd9e081f1f63d7945e2e231d258"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: omni-verify/ShotBench.swift: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ShotBench (20-1045). The bar is 500 significant lines; this is 294 over it, 1.59\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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee487fcc7060835de9136b965b873441c82f821b2366161780876b535ac7075"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OCRSession.run: MethodTooLong \u2014 run runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OCRSession.swift"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652a62fb15b317fd226c6b3c1e7ff72c6fa81ec7e518d9c77302d313240ccbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OmniCommands.body: MethodTooLong \u2014 body runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OmniApp.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4338ac3adfc932e498cd57953fe7ce56252c0c74f4d8706c993a564f75f6026"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/Sidebar.swift: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 280 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38acfb5ad595473f6461ace93d35c1dfff776f82956d1f4458c75b81d29a665c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/ResultsList.swift: FileTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 267 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74bdfa31e96d3a4604e0d42735cb08d7059fdfe456d4cd83a82027e35feaf1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MCPAdapter.callSearch: MethodTooLong \u2014 callSearch runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb15e527a1269d03aee12b7b2c1e8835475490b77017e1adebe4c0633634aba8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Paper/PaperCasesStore.swift: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: PaperCasesStore (37-1052). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCasesStore.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf295cc4b620ef713e19231bd78475079de940a9d48bd7af2d673dd210a435f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkNode: ClassTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 179 over it, 1.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"57843bd48bdc48eeec8119e5a91866d69db881c91c54fdb5d5dda9444bb365a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EvalCommand.evaluate: MethodTooLong \u2014 evaluate 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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"74786b17fe15ffec1d5e3423b1b478abe5e493fd4fb486b6b3394014d4ea9fea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Indexer.decodeContent: MethodTooLong \u2014 decodeContent runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2afac1fd167c7a45fffa8921ab9ccf22cd34cb191927cc80e2e3e19a78a7618"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/OmniApp.swift: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/OmniApp.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c1c9107c2fa0544fd0c93856e9cf986a292800d47f5c3f5cea84c717fa850e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/ScreenTimeline.swift: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ScreenTimeline.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab7eef07d45eeb6206865af705b0a54c93a98aaa92e241fb222b5d844c8b6b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkNode: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b0afd3a514107a92c96848b22324fa7d1418de37b5bc4bd7cd890f236314ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr-verify/main.swift: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34715252fba925eaabe1e4afbb4a06d0a612b8086fb88691d9cdb94584414604"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PerfScript: ClassTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 126 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"395cd1317182a559b00b1c37a651465bcbee60ca0ed452401f3a3c6c402cee19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OmniLink/LinkNode.swift: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: LinkNode (27-863). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19eeef263718063da0e3cf57255d9f8c07c61d5296d723a9ff306afb1c6e689"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EvalCommand: ClassTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 125 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/Eval.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa14436eba983b56a7cd217ec0f69e7b962f04c43d95681f2c530d7fd0e0580"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkController: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Link/LinkController.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb8447fccbfa83b42ef4073395711c91734ef6a16925dc0e0269c15b4fa6946"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppModel.search: MethodTooLong \u2014 search runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9e19919d9663b6c4dca009ef24622184bddbed66f33aef833e1bdfb2904567"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/PerfScript.swift: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PerfScript (21-634). The bar is 500 significant lines; this is 129 over it, 1.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PerfScript.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ddbaf3eff3ca73a5b6fced5a5c88fe1e2b00d75233c3eec2a54b6354847033"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: App/ContentView.swift: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4c05cef96d0cc3bcad34d4a37b470456ff5399a8f628b3dfe275daf3d5a528"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShotBench.run: MethodTooLong \u2014 run runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"393da11ced7939820db750f0ab28db3e954ea732c8413349da098dc75a62e5c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.rowwindowcheckRun: FunctionTooLong \u2014 rowwindowcheckRun runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cec7d17bcd045770bdc40da129b6d4c190f5112c2d3997ef057440bf2122f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PaperCorpus: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCorpus.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb1628bd9a1018afd0a0aaa7e9b13c982120060f884a7117103d9a6d1058c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.top-level code: FunctionTooLong \u2014 top-level code runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/crawlbench/main.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"161671c98e79ced1575dfdd177a69f764b3d24b7d0f28b56ae3af20a1c85b201"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: omni-verify/Eval.swift: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: EvalCommand (82-776). The bar is 500 significant lines; this is 70 over it, 1.14\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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"717386d7bae6e17ae06ef7d6bbfc4c1d8defe6abd85873df274e38c8834351c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActivityTab.body: MethodTooLong \u2014 body runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d422e9ab57148bc9417d414db47274b1eba19b6b11832bcb663adad7711ea104"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PerformanceTab.body: MethodTooLong \u2014 body runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e8cd3b6c96916a42d389975a26c400ba88c0ae04543b11d0554cb4400c228d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OCRModel.decodePrepared: MethodTooLong \u2014 decodePrepared runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRSpeculative.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"535051b9996e3f4a801fb19793e33631a1f2e21cf8b9b07ec5c5b4526a42b27e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.churnbenchRun: FunctionTooLong \u2014 churnbenchRun runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1c0ed0c6e380f7319382f7f642edadf3d8605923a5071a484bcae57baf7b8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OCR/OCRBatched.swift: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749d7f6cad2ad1f09e69b29596684e06fc28512d6eb357aab9b88b3e42ddbaf4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PaperReport: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperReport.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b8e7f973003f8382f9809fbde0a4e9913fda34347b78e8fcc0845ec4a264b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: OCR/OCRLanguage.swift: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a998c2b828a97662524fe332a32b3b2826a5ce5ab0abdc6023c0325c0cb05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScreenHistory.takeInStills: MethodTooLong \u2014 takeInStills runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a903c4bfd02c4659da6ce9a74f34a5e1aaddbcb4ededf0a64272b06660a850"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OCRModel.decodeGroup: MethodTooLong \u2014 decodeGroup runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d38ce93b8140a51b66bbb0495544c2aca796ae73f07bec3a5c72aaaa029d614"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IndexTab.body: MethodTooLong \u2014 body runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d55f55c7d0b00e1e2f3cfe5a29af84946aa3461161b1221707aa024d677dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Indexer.recoverChunkTexts: MethodTooLong \u2014 recoverChunkTexts runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc4ca1aad63f8640eb86dee137c2cff1a6d115865029ad6e148b019d63a54a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProjectionEngine.project: MethodTooLong \u2014 project runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c390da090f3d7295d5738dce0337a9d8e5d788042d4496adc23a78dd6c45e743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BitScanBench.run: MethodTooLong \u2014 run runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/BitScanBench.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc464655838fa99b14a34c58ae5e36839521e222837799c60f3878c4d401a7ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.swift.tombstonecheckRun: FunctionTooLong \u2014 tombstonecheckRun runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"d411bc3de8dab1fee868de8ff8545ce0555b04baead4e5b107c2f84665c2fb50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Serving/SchemaAdapters.swift: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9898be95078ddcca94740e4dcb6b775aee97913c8bb10abbf3c5ce990ada8d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Paper/PaperReport.swift: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: PaperReport (142-697). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperReport.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc43d0ca6c858001efb6408c03b3ad3a7c7ab4c336026117e977ff1146f43e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatOCRAdapter.handle: MethodTooLong \u2014 handle 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":"App/Serving/OCRAdapters.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8c2e3808c2d28d92621adbe76ad25cfaa4de2729973c8af7cc5d1dea4c4a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): App/FolderBrowser.swift:184-306 | App/Link/LinkViews.swift:323-368 | App/PhotoSourceBrowser.swift:132-177 | App/RecentsBrowser.swift:142-184 \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":"App/FolderBrowser.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e2af2a0a57377336d88ccdb03251653e2225328e61f28f60882235dda3f673"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Sources/OmniKit/OCR/OCRBatched.swift:133-170 | Sources/OmniKit/OCR/OCRBatched.swift:189-555 | Sources/OmniKit/OCR/OCRBatched.swift:801-832 | Sources/OmniKit/OCR/OCRBatched.swift:842-896 \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":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cc772b596ae72ba5ab95dc6bc679530c1aacae9e0cb6a686ea1d65e4da2c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): Sources/omni-verify/ANEQuery.swift:31-66 | Sources/omni-verify/ANEQuery.swift:99-129 \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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d124928d470dd8aa252b4107da992734a90ee724e8c043d422521c5c946c668"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): Sources/OmniKit/BulkDirWalker.swift:60-135 | Sources/crawlbench/main.swift:26-89 \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":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6927a13376441943afad1dbdc603c7abee790ee4f7bd173f46db66c09683a4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): App/PhotoSourceBrowser.swift:87-119 | App/RecentsBrowser.swift:99-132 \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":"App/PhotoSourceBrowser.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd9f8f825aecd6c2ed0110d86ddeb859af018e5548dc09231caceca579d29b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): App/Sidebar.swift:930-968 | App/Sidebar.swift:985-1031 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2e513b7e05e0466f2a32b33edea53c5fe89f32f4d00e24293c9f81c6578990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/OmniKit/Paper/PaperCorpus.swift:538-553 | Sources/OmniKit/Paper/PaperCorpus.swift:559-585 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCorpus.swift"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"240191a1831199d1b8f1d1955f3a6a91790b29e17d4984fe311bf352ab28be47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): App/Serving/MCPAdapter.swift:1314-1331 | App/Thumbnail.swift:325-339 \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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef18f6a4d5f8c2372d11c19eb480d9500cbfe80599760ae82d8446d29d22a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): Sources/OmniKit/OCR/OCRPreprocess.swift:118-145 | Sources/OmniKit/OCR/OCRPreprocess.swift:147-173 \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":"Sources/OmniKit/OCR/OCRPreprocess.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c399712295a2fdb63f48777323b8b8421e0b5854118ebd05d3e236a63fa3e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): Sources/OmniKit/OmniVideoPreprocess.swift:154-183 | Sources/OmniKit/OmniVisionPreprocess.swift:127-151 \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":"Sources/OmniKit/OmniVideoPreprocess.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3207e93fbb54292e508337db6c090ca465b378d25386597cfa74b195fffcf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/OmniKit/VectorStore.swift:6657-6675 | Sources/OmniKit/VectorStore.swift:6751-6767 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6657}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd59a7e225182793d68979aacbcd9d07df6407155bd37dbc24688a190c8e202"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/OmniKit/OmniVideoPreprocess.swift:196-214 | Sources/OmniKit/OmniVisionPreprocess.swift:158-183 \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":"Sources/OmniKit/OmniVideoPreprocess.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afe897803b870286f57285712dcfbd128bf2d698b1c49d9a8eab17cf2a91295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): Sources/OmniKit/OCR/OCRVision.swift:116-148 | Sources/OmniKit/OCR/OCRVision.swift:378-402 \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":"Sources/OmniKit/OCR/OCRVision.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"952cd7b7ec1f475be959fbdac347ec13261c21ba6780bc51a9ce377e1f2a4eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/OmniKit/Paper/PaperCaseCatalog.swift:596-615 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:639-658 \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":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad27cd6096d59ff4c9b188e062b8fa2bb9005a6058a1ebd182949f485279ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): Sources/OmniKit/Paper/PaperCaseCatalog.swift:329-352 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:446-464 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:660-685 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1256fcb49df59288feee92e5069f65abcf9e45cfd8156c0e85d5b0b2b7529fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/OmniKit/FileExtractor.swift:260-275 | Sources/OmniPages/main.swift:60-72 \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":"Sources/OmniKit/FileExtractor.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f66709817929c7773184953f287ad915de47d67ff61687ac4ab4316624dd7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/OmniKit/OmniImageEncoder.swift:261-275 | Sources/OmniKit/OmniTextEncoder.swift:46-58 \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":"Sources/OmniKit/OmniImageEncoder.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0858e4df79518189bf824c69a3962d0259de6c4257c89e8d1d9bd9b7bd8c046f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/OmniKit/ANETextBackend.swift:324-335 | Sources/OmniKit/ANETextBackend.swift:369-380 \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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0585a65035114e6dab08abbf55535ac7b6e7e006f3b5dd36e01d7014fd0504d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): App/Serving/MCPAdapter.swift:890-900 | App/Thumbnail.swift:292-303 | Sources/OmniKit/ScreenText.swift:84-95 | Sources/omni-verify/ShotBench.swift:207-218 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"9609c68f314764ece71be59bb952432b5f036bd1b4e271a8b06876b04ae6cd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/OmniKit/OCR/OCRLanguage.swift:888-900 | Sources/OmniKit/OCR/OCRLanguage.swift:906-920 \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":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"078b925b2f6bb552fcabbe5bc441532cef8d120809fec27377cc60b2f6b42829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): Sources/OmniKit/VectorStore.swift:4412-4435 | Sources/OmniKit/VectorStore.swift:4759-4783 | Sources/OmniKit/VectorStore.swift:6908-6929 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e974e16bd4b40080f04ccf38e10c5a4363a626f38d94504aaf4a240d5dfa3148"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): Sources/OmniKit/Paper/PaperCorpus.swift:396-414 | Sources/OmniKit/Paper/PaperCorpus.swift:416-434 | Sources/OmniKit/Paper/PaperCorpus.swift:436-451 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCorpus.swift"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5bb912c2cc96810146728d78f033b6da2d374fb2b2fe411bb8521572012eec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): Sources/OmniKit/Paper/PaperCaseCatalog.swift:310-327 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:490-508 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:510-529 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:577-594 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:689-703 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:707-723 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd227043b9356f83bad74c5990d392754442083d9d1ad2ba4062378476242162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): Sources/OmniKit/Paper/PaperCaseCatalog.swift:264-289 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:291-308 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:400-414 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:466-488 \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":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3663b501988c01ead5f4b04ac96b9fb21d06a3eee8cd88436c67387ced35a271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/OmniKit/Indexer.swift:4789-4795 | Sources/OmniKit/Indexer.swift:5275-5281 \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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4a75140a4dedb5b09b7663316ad8dbbd2f44b511ba7abb1c0bad500e2dc57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/OmniKit/OCR/OCRWeights.swift:114-129 | Sources/OmniKit/OCR/OCRWeights.swift:133-146 \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":"Sources/OmniKit/OCR/OCRWeights.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b26b418e2b576796ce0dc4e5ec41ff9ef015b370cd7f81ead6e7d03d429e240"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): App/Serving/MCPAdapter.swift:914-933 | App/Serving/MCPAdapter.swift:1139-1161 | App/Serving/MCPAdapter.swift:1601-1616 | App/Serving/MCPAdapter.swift:1618-1634 | App/Serving/MCPAdapter.swift:1636-1651 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8897b882bf1e6ade840d1d2b273a0ef6a703087fbbd366fa2527400d48ff8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/OmniKit/HardwareProfiler.swift:31-37 | Sources/OmniKit/Paper/SystemProbe.swift:230-236 \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":"Sources/OmniKit/HardwareProfiler.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a26ea3829b43808fac54653023194a1bf674eabbe86de1aec6dc753f202fb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): App/Link/LinkViews.swift:227-240 | App/PhotoSourceBrowser.swift:36-48 \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":"App/Link/LinkViews.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf208a5f8f0870c8e6c968e017951cbbb88c1b52755629fc5d26119520d9dcd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): Sources/OmniKit/EnrichLedger.swift:122-135 | Sources/OmniKit/IDIndex.swift:164-179 | Sources/OmniKit/VectorStore.swift:6888-6904 \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":"Sources/OmniKit/EnrichLedger.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0493cdb9eb1452b7f2c0d52b07740f46d0cb64255df988f825cb0e715f200df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/OmniKit/VectorStore.swift:17801-17816 | Sources/OmniKit/VectorStore.swift:17824-17837 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17801}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a38e336ce4a96c8be84854f44a6ea998e78715b27ed80d76ca29c93f5b9720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OmniKit/Qwen3Backbone.swift:465-470 | Sources/OmniKit/Qwen3Backbone.swift:490-495 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Qwen3Backbone.swift"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"885e930f1d7e769df4bec7147e1f5a6a43951d804f3de5a647779c71eb730bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): App/AppModel.swift:4640-4649 | App/AppModel.swift:4664-4673 \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":"App/AppModel.swift"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cf3a0811cad49cf06639d5c70f00425e99b4ee4b29dd954cb7aab0e540848f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/OmniKit/PathTable.swift:262-274 | Sources/OmniKit/PathTable.swift:299-310 \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":"Sources/OmniKit/PathTable.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885302496dcd3329299b6f5d3496781cf2b994773885ace836b20659443562e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/OmniKit/Paper/SystemProbe.swift:377-392 | Sources/OmniKit/Paper/SystemProbe.swift:401-416 \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":"Sources/OmniKit/Paper/SystemProbe.swift"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c227d3a50d18522d0b7e5815f052e6f1849427326c071b9d4c0addf9ec9781e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): App/AppModel.swift:5753-5765 | App/AppModel.swift:5770-5782 \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":"App/AppModel.swift"},"region":{"startLine":5753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19c39be793f6ea094a5a060a03c3e5f6a80464b83f2ecb7b6c9cadd6191eea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OmniKit/ChunkKey.swift:86-93 | Sources/OmniKit/ChunkKey.swift:97-102 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ChunkKey.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a017cb5907991f1082ba0e96a1ee47df716d34bbc189f71d818e2f6be8b7bd53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/OmniKit/OCR/OCRCache.swift:146-152 | Sources/OmniKit/OCR/OCRCache.swift:155-162 \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":"Sources/OmniKit/OCR/OCRCache.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cdcd06000bf0b7d8d26d7540b4071ec810685387e5d0f16dbf908ebe3150d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/OmniKit/VectorStore.swift:11340-11348 | Sources/OmniKit/VectorStore.swift:18730-18738 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e08dfef75c6be6b071e41257b3fe8a8cc3d686d74ed80d66880f7d9452030f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/OmniKit/VectorStore.swift:14723-14730 | Sources/OmniKit/VectorStore.swift:14732-14741 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abe7471d167227dfee26b33dbc801e8628578f4fe6ba734fb8a5979edeb767a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/OmniKit/OmniEngine.swift:1370-1378 | Sources/OmniKit/OmniEngine.swift:1380-1388 \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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d635d75e1d0862c62682998ae44063140643e3462b1b9152acf3e4e8920dc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/OmniKit/VectorStore.swift:15798-15808 | Sources/OmniKit/VectorStore.swift:15812-15826 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15798}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf08436088708b771775bab1c319d55633c7c64183b7bd9b5cf22d8b0423e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): App/OCRSession.swift:2013-2026 | App/OCRSession.swift:2179-2189 \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":"App/OCRSession.swift"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"2313235a32042ec2da20d2ca9402d8eaf7d16ae36e417c05714e4c164ee829fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OmniKit/OmniEngine.swift:1881-1886 | Sources/OmniKit/OmniEngine.swift:1888-1894 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"8446b42d69a33ea74f53fa2411bb188fdd88f093a6d89028b1c8e24b0308e658"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/OmniKit/Paper/SystemProbe.swift:196-205 | Sources/OmniKit/Paper/SystemProbe.swift:253-262 | Sources/omni-verify/main.swift:112-118 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"Sources/OmniKit/Paper/SystemProbe.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbfff634c010b71eef5fd45178a95a75c02506bc8da30f6853baf2c128c327b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): App/Link/LinkController.swift:112-119 | App/Serving/ServingController.swift:196-203 \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":"App/Link/LinkController.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"780660d4d5bd2e27535d2eb1559134106a6889263fa21a0ef1605409ca915216"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/OmniKit/Paper/PaperCasesCompute.swift:646-655 | Sources/OmniKit/Paper/PaperCasesCompute.swift:659-668 \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":"Sources/OmniKit/Paper/PaperCasesCompute.swift"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82253af46b0d749d7f36dbcb2ba0269b4fb846539c1bcd0ce65121e3b3386df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): App/PhotoActions.swift:28-33 | App/PhotoActions.swift:36-41 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PhotoActions.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1484eb5424db64bda9dc23f65d9491fdd6f523fcb647375343eb5572e22c030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OmniKit/OCR/OCRLanguage.swift:742-747 | Sources/OmniKit/OCR/OCRLanguage.swift:752-757 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"287e130dd26907e0c1539eed17fb14d661afd4839398c357a476c4d69f91b5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/OmniKit/VectorStore.swift:8024-8035 | Sources/OmniKit/VectorStore.swift:8056-8067 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2254c702528b89bdc5d30d4b4692612551db9669294f2df06348d7891d0bdb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OmniKit/OCR/OCRLanguage.swift:647-653 | Sources/OmniKit/OCR/OCRLanguage.swift:679-684 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7eff5617c17971d914309c7212384e4bf94ed68341b05208e9c557f73635f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/OmniKit/OmniEngine.swift:1576-1580 | Sources/OmniKit/OmniEngine.swift:1822-1826 | Sources/OmniKit/OmniEngine.swift:1828-1832 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e9e30fcf2c87fc234f578f7b5f90707d9d2994f6034cab63a4f94674a780ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): App/Link/LinkResponder.swift:288-293 | App/Serving/MCPAdapter.swift:1333-1340 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Link/LinkResponder.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd56bbcda3844bb3cd64c0036466fcd18c7d113a04f937dff5105767fc193b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/OmniKit/OmniAudioEncoder.swift:14-20 | Sources/OmniKit/OmniImageEncoder.swift:41-47 \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":"Sources/OmniKit/OmniAudioEncoder.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6730909bf815c0c35816d2e65cfa92716a2c49b5f84bf41fbaf464fe05779b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/ResultsList.swift:654-658 | App/ResultsList.swift:662-665 \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":"App/ResultsList.swift"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d0d9b75eb827cae1dc7c8ad6a66f6ffa621cb28e127d7799a129e6c53059fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/OmniKit/VectorStore.swift:11332-11338 | Sources/OmniKit/VectorStore.swift:18740-18746 | Sources/OmniKit/VectorStore.swift:18750-18756 \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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11332}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b68babef6ece875e0b8d64bbb24cb75632f23d6b257ac0446e69542a19c0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): App/AppModel.swift:4394-4398 | App/AppModel.swift:8780-8784 \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":"App/AppModel.swift"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f29bc4914da5d10f33d634734ba973fad86138ee553f80029a4b2eafa46f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/Paper/BenchTable.swift:33-36 | Sources/OmniKit/Paper/BenchTable.swift:37-40 \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":"Sources/OmniKit/Paper/BenchTable.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4bc7743ca339e0fc41c5efa3cde28a6b6e11824bf56ee6210ff4c153de10da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/PathTable.swift:82-85 | Sources/OmniKit/PathTable.swift:131-134 \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":"Sources/OmniKit/PathTable.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea80d95523247dfed04c21db07b836703fe715cf06266446a16f6eae1b89fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/OmniKit/ModelDownloader.swift:36-40 | Sources/OmniKit/OCR/OCRModelCatalog.swift:99-107 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"84622434836592195bd5bae0a64d5d3d4b3bd633f90d76c3c34b5fc32a0c7dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/OmniAudioEncoder.swift:24-27 | Sources/OmniKit/OmniImageEncoder.swift:51-54 \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":"Sources/OmniKit/OmniAudioEncoder.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1383758a8bad52caedf06eb628c52d9e5b27af20b91b58184921caa221fa8c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): App/MarkdownBlock.swift:155-166 | App/MarkdownSource.swift:114-122 \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":"App/MarkdownBlock.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5897f339f18cd01885a0c89ecb3a7e7c63bcdb5a3bdaa1d86e8396ddb823a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): App/Serving/SchemaAdapters.swift:15-20 | App/Serving/SourcesAdapter.swift:214-219 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54975e68db64c1d06c51ad7af8ef898cd7415bf00ee03d75d134469726c5e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/OmniKit/BulkDirWalker.swift:275-283 | Sources/OmniKit/Indexer.swift:2638-2646 \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":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"04570fca3ae41536d1b037c8f0e68d87514b8a3e93eb3e2edd1f567109b61ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): App/ContentView.swift:1190-1197 | App/PerfScript.swift:628-633 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ContentView.swift"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"09299f3174e4b572d642c4f2505f463416018a39ed5a255e9cbd49b2d9060f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/OCRSession.swift:489-492 | App/OCRSession.swift:494-497 \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":"App/OCRSession.swift"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3977f0fa5a31d7565b2b5bc420ffa2c7d8217bd97c7a09cd4a7409c0dd8ba5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/OmniKit/OCR/OCRModel.swift:352-357 | Sources/OmniKit/OCR/OCRSpeculative.swift:82-86 \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":"Sources/OmniKit/OCR/OCRModel.swift"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b3048243bfd290954e7adfc15080238db3e3b9df515d630de7ccee103969c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/OmniKit/OmniAudioPreprocess.swift:409-418 | Sources/OmniKit/OmniAudioPreprocess.swift:420-429 \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":"Sources/OmniKit/OmniAudioPreprocess.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e280f7b1ec23a018a4a199d8929aa94e3dc2f7f35a7acf7005f2171d37dcd602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/OmniKit/ContentChunker.swift:199-203 | Sources/OmniKit/Indexer.swift:775-779 \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":"Sources/OmniKit/ContentChunker.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa71c30fadccf20fcb411eb184c3a0b7cb71ccec596d2b5125efbc7068062944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/ExtractionQuarantine.swift:133-136 | Sources/OmniKit/StreamCursors.swift:70-73 \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":"Sources/OmniKit/ExtractionQuarantine.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d3b25737b6193c8da1cbb29c2e848dc84b97bbdd541bf37389f83104c094c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/PaperResultSheet.swift:192-195 | Sources/OmniKit/Paper/PaperReport.swift:679-682 \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":"App/PaperResultSheet.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f35cbdf805e81c1346b0584c49835bad6d7cc2e7c68e7ffb39ab3e8546bc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/OmniKit/VectorStore.swift:15322-15327 | Sources/OmniKit/VectorStore.swift:15330-15335 | Sources/OmniKit/VectorStore.swift:16147-16152 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":15322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6165685804bd845d796a627ffcb545dad09ef534abbab5d1a3cb8c472bc65e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): App/AppModel.swift:1348-1358 | App/AppModel.swift:1584-1595 | App/Serving/ServingTab.swift:409-417 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8098fa3866bc1a1d129368969cae9d4184e7fdd9f884e5dd0813e551e4abd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/Sidebar.swift:738-741 | App/Sidebar.swift:744-748 \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":"App/Sidebar.swift"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"74386e5ad01b0232896d280dc6c421cc5279953af8f624ab5635e1601f095083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): App/SettingsView.swift:710-717 | App/AppModel.swift:2110-2117 \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":"App/SettingsView.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"733901264efcf4737291d05ac022bf2c87030001519b3a2f0469ae4ffda073a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): App/OCRView.swift:1550-1558 | App/OCRView.swift:1628-1637 \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":"App/OCRView.swift"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"51640c8c7a8e6e2d8f066218658f65a73a293c2f2118b619523a3bfe7dd324f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/OmniKit/Gzip.swift:67-75 | Sources/OmniKit/Paper/PaperCorpus.swift:767-771 \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":"Sources/OmniKit/Gzip.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39347b376a6e913dfc086e7c6a77a25d3942704818186ef6c6c61bb2d90a726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/FolderBrowser.swift:310-313 | App/RecentsBrowser.swift:206-209 \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":"App/FolderBrowser.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"631755a0e3b55f290180690e6c3a3dc23db0d0d6853c4d2dfd2eaace90e3806e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): App/PaperBenchmark.swift:245-251 | App/Updater.swift:420-426 \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":"App/PaperBenchmark.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1495f6213f857402a939585201a22d2ed78beb1df9945297e258abbabdb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): App/ChunkPreview.swift:23-26 | App/OpenAtHit.swift:114-117 | Sources/OmniKit/PDFPagePick.swift:51-54 \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":"App/ChunkPreview.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"68810606462b5d24331a93fce0d7e33afd556f45d4f8766f0d2e5c9e19eb8fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/ProfilingService.swift:153-156 | App/OCRSession.swift:764-767 \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":"App/ProfilingService.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cca73afadcc06cdd68a4a838649cb9d20a684a984a26384b16bbf5eb661dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/OmniKit/Paper/PaperCasesStore.swift:1126-1129 | Sources/omni-verify/main.swift:34-36 \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":"Sources/OmniKit/Paper/PaperCasesStore.swift"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e9bc044f3d475927a62e05e15fb82f86fe44b3d1430763e52dd0d43f3b4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/OmniKit/ClipboardHistory.swift:208-210 | Sources/OmniLink/LinkIdentity.swift:46-48 \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":"Sources/OmniKit/ClipboardHistory.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"81080b370a0be991b093187aefd8a2ce42629c041c4058545aa5d6ade0503f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): App/AppModel.swift:6737-6740 | Sources/OmniKit/RootScope.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":"App/AppModel.swift"},"region":{"startLine":6737}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f9c8249bb1df8c066d7038d5bcb2a9d987c1fcea6fd0065b81c07ea3565c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/HardwareProfiler.swift:58-61 | Sources/OmniKit/Paper/SystemProbe.swift:442-445 \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":"Sources/OmniKit/HardwareProfiler.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9466e07b47c604f5461a08fef584b4d0ee5399c3d56752c2307bcf94aed53801"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): App/AppModel.swift:684-686 | App/Serving/MCPAdapter.swift:170-172 | Sources/OmniKit/Indexer.swift:5452-5455 \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":"App/AppModel.swift"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5484623b16e86638ed939237bde28c45065c0a70a6bffa385a3a6ba79436206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): App/PaperResultSheet.swift:113-115 | App/SettingsView.swift:150-152 \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":"App/PaperResultSheet.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86d1d34e2de3995f1721a89bbc79023c633f4e42ee7e5b45b4eef27d5aeb568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/OmniKit/ModelDownloader.swift:271-273 | Sources/OmniKit/OCR/OCRModelDownloader.swift:161-163 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba9d7c9ab0f1b764bd77fa090877bfe65e87d0a888b69e19b35ded502249b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/OmniKit/OmniIgnore.swift:62-66 | Sources/OmniKit/PathTable.swift:536-540 | Sources/OmniKit/ScreenHistory.swift:1060-1064 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniIgnore.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e6dbf85fe11380da20fb4b81b34a84d15db515f85fb62e5c0c4ba9e4d700f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Sources/OmniCLI/main.swift:24-27 | Sources/linktool/main.swift:24-24 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniCLI/main.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"065a0abc6f1825856f7abc9ee4a4c48b4b16cb8599af7229fb6717fa6c83ee5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): App/ResultsList.swift:1355-1361 | App/Sidebar.swift:22-28 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63f52bb13e77b70e8b018e6425d05773f944f0fc56094cb2fd7434ca699a2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/ModelDownloader.swift:250-253 | Sources/OmniKit/OCR/OCRModelDownloader.swift:135-140 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccb6b01aefde48f637681d4fafbcf4bcb0e55b1c5758a33e1a2b42523ff8fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/OmniKit/OCR/OCRModel.swift:442-444 | Sources/ocr-verify/main.swift:76-79 \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":"Sources/OmniKit/OCR/OCRModel.swift"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f37f0d868b23a7c9f980caa573d2deea05d053ff38d8e55e0dd7401caa7e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): App/AppModel.swift:7809-7811 | Sources/OmniKit/StoreSchema.swift:79-81 \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":"App/AppModel.swift"},"region":{"startLine":7809}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ca4f2ec8d54282fe8fc1703ba7a33240e8cc23b8ea8841174d133926c46aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/OmniKit/ModelDownloader.swift:71-73 | Sources/OmniKit/OCR/OCRModelDownloader.swift:129-131 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85f1a89be5ee81c289008364211b5e7cf37e5a6f0cd54cc0063628dcac01148"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OmniKit/ModelDownloader.swift:76-79 | Sources/OmniKit/OCR/OCRModelDownloader.swift:38-41 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae4c83978bf19d9fb5c74086aa41b62c12b4fd754684b9634d831f6c1264098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201336 lines \u00D7 3): App/FolderBrowser.swift:271-306 | App/PhotoSourceBrowser.swift:162-177 | App/RecentsBrowser.swift:170-184 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/FolderBrowser.swift:271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1116108169705f13e240528d62844eb3a15084d28253965e129019db4827af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): Sources/omni-verify/main.swift:3637-3664 | Sources/omni-verify/main.swift:3763-3789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fb57544fbb1c9067d22a5c979aa43e8fa630e1e402fce20540de3c07623f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201326 lines \u00D7 3): Sources/OmniKit/Indexer.swift:1287-1312 | Sources/OmniKit/Indexer.swift:1345-1355 | Sources/OmniKit/Indexer.swift:1402-1412 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:1287\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"748345a1865ddda024f2c41d1e7db5b52bcd48780bbd7a7f1f99f81896925ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 2): App/Serving/SchemaAdapters.swift:532-552 | App/Serving/SchemaAdapters.swift:724-740 \u2014 both copies are in the same file, so extract the block 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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59b22278a751fbef97d7ad86c30bba50d501863e0e0c1ecec2c817608f1a6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): Sources/OmniKit/Indexer.swift:2011-2025 | Sources/OmniKit/Indexer.swift:4162-4180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:2011\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e5305360c2ffc90abe4b96fa166a573fa16d509f453c06a17516ab8d61f29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/omni-verify/main.swift:5088-5110 | Sources/omni-verify/main.swift:5293-5311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:5088\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":5088}}}],"partialFingerprints":{"codehealthFindingId/v1":"38339087c201143c954d98fde8b25c9d01362a94ac5c42673578d3635d1b1cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): Sources/OmniKit/ModelDownloader.swift:255-269 | Sources/OmniKit/OCR/OCRModelDownloader.swift:142-159 \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":"Sources/OmniKit/ModelDownloader.swift"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2efb18586a32010979c8c0d4769cfb70e1f4f7e863654757589242640222d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): Sources/omni-verify/main.swift:4529-4545 | Sources/omni-verify/main.swift:4552-4567 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d180877a1d4e4e5d7b7aa82cfeacd16ab51cc067b96084ce036c2d9c22edf4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): App/PhotoSourceBrowser.swift:132-147 | App/RecentsBrowser.swift:142-154 \u2014 before extracting anything, compare \u0060App/PhotoSourceBrowser.swift\u0060 and \u0060App/RecentsBrowser.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/PhotoSourceBrowser.swift:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PhotoSourceBrowser.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0286a0ea5c7f7da786bb7652996ca0158de9e5bbc2e519616aac3c1b59101ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): Sources/OmniKit/OmniVideoPreprocess.swift:197-206 | Sources/OmniKit/OmniVisionPreprocess.swift:159-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniVideoPreprocess.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"493ba2e099e895e696e875981e0e3cf5637aeb79658305f5df76d328fa5c78af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): App/Link/LinkViews.swift:338-352 | App/PhotoSourceBrowser.swift:143-157 | App/RecentsBrowser.swift:150-164 \u2014 before extracting anything, compare \u0060App/PhotoSourceBrowser.swift\u0060 and \u0060App/RecentsBrowser.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Link/LinkViews.swift:338\u0060 it begins part-way through the construct above it, so those exact 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, \u0060App/RecentsBrowser.swift:165\u0060 calls \u0060help\u0060 and \u0060App/PhotoSourceBrowser.swift:158\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":"App/Link/LinkViews.swift"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c80f7b994dbd313a9f0d77e79832d4d52ce0fff55fd5b64fc99ef4e834ca02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): App/FolderBrowser.swift:137-151 | App/RecentsBrowser.swift:32-42 \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 \u0060App/FolderBrowser.swift:137\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":"App/FolderBrowser.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"619f4f553e35efa7ca970a5ad81f073e411d63100dba9655f9dd77fd5eee7063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201315 lines \u00D7 4): App/ResultsList.swift:176-178 | App/ResultsList.swift:217-220 | App/ResultsList.swift:381-395 | App/ResultsList.swift:413-423 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/ResultsList.swift:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"App/ResultsList.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4585875ed02a976d0d1e2d05c6ef9da1dfa2324c458e25515643cb3b636a2416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): Sources/OmniKit/OmniVideoPreprocess.swift:87-101 | Sources/OmniKit/OmniVisionPreprocess.swift:67-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniVideoPreprocess.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"88194f2cdcb694fbc775cc57ba3af03bbe8fe7b3337cf7e2b4ea86e8a2442f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): App/PhotoSourceBrowser.swift:87-97 | App/RecentsBrowser.swift:99-109 \u2014 before extracting anything, compare \u0060App/PhotoSourceBrowser.swift\u0060 and \u0060App/RecentsBrowser.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/PhotoSourceBrowser.swift:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PhotoSourceBrowser.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7a4921c5bd8f07cf139505734c878c12d9cf269277ae0cb48a9dec84837c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): Sources/OmniKit/Indexer.swift:1365-1372 | Sources/OmniKit/Indexer.swift:1411-1421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:1365\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7c12efd1bed93391183cab71325dac4edf50eec371e8499c8c26d30b41bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Sources/OmniKit/OCR/OCRBatched.swift:439-455 | Sources/OmniKit/OCR/OCRBatched.swift:631-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/OCR/OCRBatched.swift:439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"645078ebf5e67e79acfcb3aa7f14f39a8192fd8142c612cd17da18a3c7637be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OmniKit/OCR/OCRWeights.swift:119-129 | Sources/OmniKit/OCR/OCRWeights.swift:136-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/OCR/OCRWeights.swift:119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"Sources/OmniKit/OCR/OCRWeights.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ff5b1bbbfc3f0db432efdafa3f1411bf6c5f00f29d6f66f2b7b75cab3af76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:4907-4925 | Sources/OmniKit/VectorStore.swift:14644-14662 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":4907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c907536725af3be32cdf02cc379ee0bcb1c701cea235de3c80515d501815eede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:6289-6299 | Sources/OmniKit/VectorStore.swift:6466-6476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:6289\u0060 it begins part-way through the construct above it, so those exact 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6289}}}],"partialFingerprints":{"codehealthFindingId/v1":"573d95a488954b3c9461778dce23fd39852b6d116b80d784f73f525e55c8414e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): Sources/omni-verify/main.swift:5911-5914 | Sources/omni-verify/main.swift:6251-6263 | Sources/omni-verify/main.swift:6496-6506 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:5911\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/omni-verify/main.swift:6263\u0060 calls \u0060Int\u0060 and \u0060Sources/omni-verify/main.swift:5914\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":5911}}}],"partialFingerprints":{"codehealthFindingId/v1":"612a682a05195aca2f7c47ff73a10583540254e23109ac8f7985075ef5e0c29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): Sources/omni-verify/main.swift:7597-7608 | Sources/omni-verify/main.swift:7897-7899 | Sources/omni-verify/main.swift:8266-8276 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:7597\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e67826c07e13fbfdd1bec6e21580c925508fd6ffc3d3a92855f503f37e7402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): App/FolderBrowser.swift:414-423 | App/PhotoSourceBrowser.swift:110-119 | App/RecentsBrowser.swift:123-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/FolderBrowser.swift:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"34552352073071a68d4f367bfbfc7b2ae3fa8f34f6782aa1938d6e15a1adb161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): App/ResultsList.swift:187-196 | App/ResultsList.swift:226-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/ResultsList.swift:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ResultsList.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbc41f3f741f9c0be1471242ad19ec2eae445f07907d19c03acf2d60baaeee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OmniKit/MigrationV5Runner.swift:71-80 | Sources/OmniKit/MigrationV5Runner.swift:203-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/MigrationV5Runner.swift:71\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/MigrationV5Runner.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e08301869a017e7073720393812453eb7b94f635167ff04e762a6b42e106ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OmniKit/OCR/OCRModel.swift:398-408 | Sources/OmniKit/OCR/OCRSpeculative.swift:262-272 \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 \u0060Sources/OmniKit/OCR/OCRSpeculative.swift:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRModel.swift"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43db5c5a6bcf344b7b54a8c91b689a7aa305dba3f07150c4e471dd90573cfba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OmniKit/OCR/OCRPreprocess.swift:134-143 | Sources/OmniKit/OCR/OCRPreprocess.swift:162-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/OCR/OCRPreprocess.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":"Sources/OmniKit/OCR/OCRPreprocess.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"db84cc85af4464de757c0a74779235bfb6d12aa9fa113e9f685a9710939e98e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:9125-9134 | Sources/OmniKit/VectorStore.swift:9189-9198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:9125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2633dc106730ad473fea19673b0b62fe4ae3e1d74481e3306823deb48388028b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:17325-17335 | Sources/OmniKit/VectorStore.swift:17599-17609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:17325\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27839221a5830020ecc6663ae1744ddbb958a66f0823b6da8d824b3a894db78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/mutbench/main.swift:34-43 | Sources/opentime/main.swift:48-57 \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":"Sources/mutbench/main.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c174c44fa9da6e11defcccd453c05285a323a4b53516cc1b3b238b56b3454c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/omni-verify/main.swift:3457-3466 | Sources/omni-verify/main.swift:6602-6617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:3457\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"383fb8c417bbb994ab5a429694de34fd96a03a4fe23dce6925ae6d39d537f08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/omni-verify/main.swift:5483-5492 | Sources/omni-verify/main.swift:7161-7172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:5483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":5483}}}],"partialFingerprints":{"codehealthFindingId/v1":"045ed3dc6ea8986e7a029e29b45255c47be7653040e268bd3d1e0f96e278b3f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): Sources/omni-verify/main.swift:2578-2589 | Sources/omni-verify/main.swift:3899-3909 | Sources/omni-verify/main.swift:4044-4052 | Sources/omni-verify/main.swift:4121-4132 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:2578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9fa98119d5a9c68abd65b596a4b5b58d5019662f8af44fc7672d0943563315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): Sources/OmniKit/Indexer.swift:1748-1754 | Sources/OmniKit/Indexer.swift:1944-1950 | Sources/OmniKit/Indexer.swift:4064-4072 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:1748\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"614184e672fd9f1d1d66c438cf9569c7d8a83c49034945bc5150ff78843237a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/OmniKit/VectorStore.swift:9130-9138 | Sources/OmniKit/VectorStore.swift:9194-9202 | Sources/OmniKit/VectorStore.swift:13339-13347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:9130\u0060 it does not close everything it opens, so those exact 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, \u0060Sources/OmniKit/VectorStore.swift:9203\u0060 calls \u0060write\u0060 and \u0060Sources/OmniKit/VectorStore.swift:9139\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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":9130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcf448a95df9423841a35238c5d4549b9585241223d5c72dfdfc014924cf909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/omni-verify/main.swift:2668-2683 | Sources/omni-verify/main.swift:5361-5369 | Sources/omni-verify/main.swift:9024-9035 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:2668\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c7be01705ff291488ae811ba80ac6b1629254221b20d8f463398d95269a56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/omni-verify/main.swift:7923-7931 | Sources/omni-verify/main.swift:8534-8543 | Sources/omni-verify/main.swift:10159-10178 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:7923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/omni-verify/main.swift:7920\u0060 calls \u0060String\u0060, \u0060close\u0060 and \u0060Sources/omni-verify/main.swift:10158\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":"Sources/omni-verify/main.swift"},"region":{"startLine":7923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ef9d9a89782f681bd78d2910a2ea8e2623bd6053acab2174d632e46c048916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): App/Design.swift:197-209 | Sources/omni-verify/main.swift:8767-8779 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Design.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51c9375231f2f02f8221f56ffcb00792f69dd528eb854d8f8b1c6f5d099c255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): App/Serving/MCPAdapter.swift:925-933 | App/Serving/MCPAdapter.swift:1072-1080 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Serving/MCPAdapter.swift:925\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Serving/MCPAdapter.swift"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e56443bf80cccca8aab7729fb1f932593ed1df592a7bc6b5ee09dd9acb372d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OmniKit/Indexer.swift:2123-2131 | Sources/OmniKit/Indexer.swift:2207-2215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:2123\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. 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c7c88c67ab3d8e61144f201bb09cc7be9b6ff1f88358acf0d3d719cdcf36db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OmniKit/OmniAudioTower.swift:245-253 | Sources/OmniKit/OmniVisionTower.swift:377-385 \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 \u0060Sources/OmniKit/OmniAudioTower.swift:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioTower.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4712ad189e72b0ea6d342d3affcc9d08b69132ac74292549095e5c4d515ab22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:11030-11038 | Sources/OmniKit/VectorStore.swift:11224-11232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:11030\u0060 it begins part-way through the construct above it, so those exact 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11030}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d22f74ff83b87bb3ebf4c77ea9d0fd5254a1895b5d0aeb668c42629b4ec1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/mutbench/main.swift:139-147 | Sources/mutbench/main.swift:493-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/mutbench/main.swift:139\u0060 it begins part-way through the construct above it, so those exact 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":"Sources/mutbench/main.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc641631c3780ffa99caa410a4f409cee634ea03e50fcde85abdf1e2d2d81293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/omni-verify/main.swift:4716-4726 | Sources/omni-verify/main.swift:5349-5359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:4716\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":4716}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1ef50d09e1bc5ca296ccdd41926f8e044084f99a00828d6e05dbc19c84859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Sources/omni-verify/main.swift:2669-2683 | Sources/omni-verify/main.swift:5362-5369 | Sources/omni-verify/main.swift:8724-8732 | Sources/omni-verify/main.swift:9025-9035 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:2669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c065cb67752495c23c00fa8963b07fb2a54a53ed04922193698a1349dd1dcb96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Sources/omni-verify/main.swift:6871-6878 | Sources/omni-verify/main.swift:7101-7109 | Sources/omni-verify/main.swift:9795-9810 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:6871\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":6871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18e4973e0b32ee7dbec55c91c71c94c44d4314d66a7869edd14a86c0641cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): App/Serving/MCPAdapter.swift:919-926 | App/Serving/MCPAdapter.swift:1058-1064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Serving/MCPAdapter.swift:919\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c15344c32b8f20fbc3b008336893546b869dbd0db7d56d68ba8d8aaa0c0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/OCR/OCRResize.swift:71-78 | Sources/OmniKit/OCR/OCRResize.swift:90-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/OCR/OCRResize.swift:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRResize.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9984c11b0224c6d0cce7b6b160e33bfc66e062cdb6e56f245efce8e61fa0716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OmniKit/OmniAudioTower.swift:258-267 | Sources/OmniKit/OmniVisionTower.swift:410-419 \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 \u0060Sources/OmniKit/OmniAudioTower.swift:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioTower.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04cfb3fe73b4831153c5ae8e5c1d9df2884f6ea813bb350823b7d88f024b382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/Paper/SystemProbe.swift:378-385 | Sources/OmniKit/Paper/SystemProbe.swift:402-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Paper/SystemProbe.swift:378\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/Paper/SystemProbe.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aaaf82cead07472d6bc11297c8ada551a87c69a5d002a689c1ed8a49c82eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/Passages.swift:432-439 | Sources/OmniKit/Passages.swift:477-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Passages.swift:432\u0060 it begins part-way through the construct above it, so those exact 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":"Sources/OmniKit/Passages.swift"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4986587850f8a9319ca6c7e7f254547d0e8cebdd3ef5a84cbe0b382b673eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:17809-17816 | Sources/OmniKit/VectorStore.swift:17830-17837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:17809\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":17809}}}],"partialFingerprints":{"codehealthFindingId/v1":"91340f0d5592e13eecbf41a066c734b8e01082185d5fda58bafb22fc936b8545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/omni-verify/main.swift:3818-3827 | Sources/omni-verify/main.swift:7042-7049 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:3818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3818}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a35eccb862c5f33b0eaf2fbdb4cc938345267025bcae2e97f3b3503fc768a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/OmniKit/MigrationV5Runner.swift:76-82 | Sources/OmniKit/MigrationV5Runner.swift:208-214 | Sources/OmniKit/VectorStore.swift:17336-17342 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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":"Sources/OmniKit/MigrationV5Runner.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a77a974d268577c1c340350fe4e658f0f258c4e4a78cd428e5127d288f82a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): App/FolderBrowser.swift:245-255 | App/PhotoSourceBrowser.swift:151-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/FolderBrowser.swift:245\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53504ceb556e6aa0eb604b7a09e312d285b6d25abeccd6295e1ac1a7a31f4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): App/PaperResultSheet.swift:121-127 | App/Serving/ServingTab.swift:478-484 \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 \u0060App/PaperResultSheet.swift:121\u0060 it begins part-way through the construct above it, so those exact 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, \u0060App/PaperResultSheet.swift:130\u0060 calls \u0060footer\u0060 and \u0060App/Serving/ServingTab.swift:485\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":"App/PaperResultSheet.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b1351a302ea1b79f6bc9c50761ce74eb68990f78ba5cfd5fd593950ff9d301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): App/PhotoSourceBrowser.swift:194-206 | App/RecentsBrowser.swift:225-237 \u2014 before extracting anything, compare \u0060App/PhotoSourceBrowser.swift\u0060 and \u0060App/RecentsBrowser.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/PhotoSourceBrowser.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c2bcc772c7891f9510fe2e83aac2ae30e1a28563494f5780c64e945c94a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OmniKit/ANETextBackend.swift:329-335 | Sources/OmniKit/ANETextBackend.swift:374-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/ANETextBackend.swift:329\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c565629406fc3fab9db337ad227bc139ccca5f6b097aeb7a34d0670747703a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/OmniKit/BulkDirWalker.swift:115-126 | Sources/crawlbench/main.swift:70-81 \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 \u0060Sources/OmniKit/BulkDirWalker.swift:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"59009c14944a23657fa8b4bc4130d4d8feaeff170ca3413d8d3560260717409e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:11510-11516 | Sources/OmniKit/VectorStore.swift:11569-11575 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11510}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe11b3df8e2b86727baa87efe021f5a59179c58f984537f9f684f34ddf3ff64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/omni-verify/ANEQuery.swift:57-66 | Sources/omni-verify/ANEQuery.swift:120-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/ANEQuery.swift:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f2e00075357eeb543a9abdbe179988b4c029c1b3ce4e8f594a895fe84061af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/omni-verify/ShotBench.swift:325-334 | Sources/omni-verify/ShotBench.swift:732-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. 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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f683ba15ecdbe86580cb3cb45bdae78e8feeb84a073ce8c6f55ae727dcee92f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/omni-verify/main.swift:3900-3910 | Sources/omni-verify/main.swift:4484-4490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:3900\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3900}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03f8de104783592daeffa7ebfea94aa2f0b6261fbddca1c8fc74ec144d10d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/omni-verify/main.swift:6105-6112 | Sources/omni-verify/main.swift:6209-6216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:6105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":6105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d9c622f51466be942d7a5f882ab5afe4fc01978b61d8666ffdba57893efd17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): Sources/omni-verify/main.swift:1810-1821 | Sources/omni-verify/main.swift:1892-1907 | Sources/omni-verify/main.swift:3275-3284 | Sources/omni-verify/main.swift:4093-4098 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:1810\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ef0c1b2eb7c54574446183da501ebd44f09ff1ce5b9283c28b5bcb1206c3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 3): Sources/OmniKit/EnrichLedger.swift:125-129 | Sources/OmniKit/IDIndex.swift:168-173 | Sources/OmniKit/VectorStore.swift:6892-6896 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/EnrichLedger.swift:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/EnrichLedger.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d028a13bf4d14a5b683304853ab5d39d30c1bb64300ac6158bc0edd6eec47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/omni-verify/main.swift:621-627 | Sources/omni-verify/main.swift:672-678 | Sources/omni-verify/main.swift:817-823 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:621\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7cd23837e9486e77a21e23742fcf4e5f287b7ac967f661b16125d9454b277e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): App/Serving/MCPAdapter.swift:937-943 | App/Serving/MCPAdapter.swift:1087-1093 \u2014 both copies are in the same file, so extract the block 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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21207f8e3a9110eec1c1de7627288cc24d0cf637354b55eac437612e25aee8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): App/Sidebar.swift:1161-1168 | App/Sidebar.swift:1336-1343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Sidebar.swift:1336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a253894c02560d35161fe19b5536dcee7be4958339b5d525d00b0681d10ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/ANEAudioBackend.swift:25-32 | Sources/OmniKit/ANEVisionBackend.swift:28-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ANEAudioBackend.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cc9ce519af2baf84f27f395895c6df461b274656aa7d12b0885c7e697c5589"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/Indexer.swift:1983-1988 | Sources/OmniKit/Indexer.swift:4090-4095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:1983\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9913739aeb0890dd0bd31b9d8a9dd58102075d4519a2a662c9f53ca0398fad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/OCR/OCRLanguage.swift:895-900 | Sources/OmniKit/OCR/OCRLanguage.swift:912-920 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/OCR/OCRLanguage.swift:895\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3f949330386ecc26afea539b6bf7712d7107e2dcdd104b58b970450b75e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/Paper/PaperCaseCatalog.swift:408-414 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:589-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Paper/PaperCaseCatalog.swift:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00dd447daaf607edf1be13d18ac78fab844f1f8236881e8c2e810c989d9f8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): Sources/OmniKit/VectorStore.swift:6716-6721 | Sources/OmniKit/VectorStore.swift:7246-7251 | Sources/OmniKit/VectorStore.swift:7279-7280 | Sources/OmniKit/VectorStore.swift:7630-7631 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:6716\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6716}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac0a5cd0abf5ad4425859494df028052fb863a8a3180e85e811f27f78929552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:8782-8787 | Sources/OmniKit/VectorStore.swift:8800-8805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:8782\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":8782}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ac0a91855652364f2bb930bd86ef1a8bfe776008709130e48fcded8a4ce9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:12891-12896 | Sources/OmniKit/VectorStore.swift:13051-13056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:12891\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":12891}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ada47d7f9d66a3508c0c2b9ef73b7575c6bb46fe2c3f324057102aa2b3c1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:18741-18746 | Sources/OmniKit/VectorStore.swift:18751-18756 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":18741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1069ade9931ea4b5f41d66ad0cc65b4bcffd2e5db9188aac4e49ce596cb8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:3720-3730 | Sources/omni-verify/main.swift:5404-5409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:3720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd3ab6a33e6116cc896901fa62bc717d9a0f37fd2cf0d09938735618f02c0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:7937-7942 | Sources/omni-verify/main.swift:8208-8213 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":7937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e123b2e3222374bf23d39461868e8122031972ff3cc976135e080ef321fcf1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:9247-9252 | Sources/omni-verify/main.swift:9261-9266 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":9247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92954092c868053d6cb0ff8bba85766fba8db23d86f3c0cc612eeee01664558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/opentime/main.swift:90-100 | Sources/opentime/main.swift:115-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/opentime/main.swift:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/opentime/main.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf29951ee1d47c433ba15f735baea1363dccfd7c0b5ff369e541269ab217437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): Sources/omni-verify/main.swift:1811-1821 | Sources/omni-verify/main.swift:1893-1907 | Sources/omni-verify/main.swift:3276-3284 | Sources/omni-verify/main.swift:3457-3466 | Sources/omni-verify/main.swift:3818-3827 | Sources/omni-verify/main.swift:4094-4098 | Sources/omni-verify/main.swift:6602-6617 | Sources/omni-verify/main.swift:6871-6878 | Sources/omni-verify/main.swift:7042-7049 | Sources/omni-verify/main.swift:7101-7109 | Sources/omni-verify/main.swift:9356-9366 | Sources/omni-verify/main.swift:9795-9810 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:1811\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b780bd281ddc7a2fb537559845f2ec4fd8e605592eda651bcf68ae4c83d077b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 6): Sources/filterbench/main.swift:32-36 | Sources/omni-verify/main.swift:1737-1741 | Sources/omni-verify/main.swift:1831-1832 | Sources/omni-verify/main.swift:1917-1918 | Sources/omni-verify/main.swift:2620-2621 | Sources/omni-verify/main.swift:2693-2697 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/filterbench/main.swift:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note 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":"Sources/filterbench/main.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3450577ea251e14e63aa7357cafa44a8f595aee4fb9ef13dd0d1029dd1682b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Sources/omni-verify/main.swift:765-769 | Sources/omni-verify/main.swift:864-868 | Sources/omni-verify/main.swift:1481-1485 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b563f3ca2683b2ddc8b179d5cb17b13f0af85f364520dbab21d10cf5797c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): App/AppModel.swift:4643-4649 | App/AppModel.swift:4667-4673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/AppModel.swift:4643\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"App/AppModel.swift"},"region":{"startLine":4643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a67d15a2dda10a9d2efabea322002b597c0d76c6eee641e5a429909d97d282a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): App/Design.swift:183-188 | Sources/omni-verify/main.swift:8782-8787 \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 \u0060App/Design.swift:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Design.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5348871b60ce98e44e41ee7685d8cb718fbd80de118da3043d1190d4e642c7bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): App/OCRSession.swift:1995-1999 | App/OCRSession.swift:2180-2184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/OCRSession.swift:1995\u0060 it does not close everything it opens, so those exact 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":"App/OCRSession.swift"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a49344ca79f1ee4378aa0c98070261167109e135818ad4962cd8766903a9f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): App/Serving/SchemaAdapters.swift:781-787 | App/Serving/SchemaAdapters.swift:788-794 \u2014 both copies are in the same file, so extract the block 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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1db0d67045512fead74d0f61a06ce916f59954d0447ea815fbac7bebe51f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): App/Sidebar.swift:936-940 | App/Sidebar.swift:993-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Sidebar.swift:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Sidebar.swift"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"811a91fda3ae553b5fd89935bb3486e7e3325322e24f65cfd25cf4d64ece4560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): App/Serving/MCPAdapter.swift:1323-1325 | Sources/OmniKit/FileExtractor.swift:271-275 | Sources/OmniPages/main.swift:68-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/Serving/MCPAdapter.swift:1323\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/OmniPages/main.swift:67\u0060 calls \u0060setFillColor\u0060, \u0060CGColor\u0060, \u0060fill\u0060 and \u0060App/Serving/MCPAdapter.swift:1323\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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b0969db4f95f07170fa2c553a9a50293dcfec5d750fef0967e4dda89ebfbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/HardwareProfiler.swift:63-70 | Sources/OmniKit/Paper/SystemProbe.swift:447-454 \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":"Sources/OmniKit/HardwareProfiler.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5948aed8913b75cecd1d4086dc920b2ff0effdde98611b49d012377ba11b0dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OmniKit/LexicalIndex.swift:278-284 | Sources/OmniKit/LexicalIndex.swift:293-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/LexicalIndex.swift:278\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/LexicalIndex.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0d35406bb0a19d38cb7e948d8fbb12fb5cec2d98568e2eb6971bf6b7f220d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/OCR/OCRBatched.swift:715-719 | Sources/OmniKit/OCR/OCRDocument.swift:153-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd49da384a030acadc5924a22fc9d956cf18c28b2631f6644d0eb60dc0e50019"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/OCR/OCRLanguage.swift:450-454 | Sources/OmniKit/OCR/OCRLanguage.swift:490-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OCR/OCRLanguage.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7161dd384f5fd5ba8ca6abef487d567898f8a07f053edf98cba13b1a354b5101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/Paper/PaperCorpus.swift:499-503 | Sources/omni-verify/main.swift:7425-7429 \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 \u0060Sources/OmniKit/Paper/PaperCorpus.swift:499\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCorpus.swift"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a9a21a9c3a9ed5ec74bc9741757ab1c66c6ff8b5ae9723acb55869ded80497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:3931-3935 | Sources/OmniKit/VectorStore.swift:3964-3968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:3931\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eea8dd92943d90dc8ae005d6fc8907b596d36965799b9d813fcfd887f9395a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:6717-6726 | Sources/OmniKit/VectorStore.swift:7247-7256 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6717}}}],"partialFingerprints":{"codehealthFindingId/v1":"524ff50198cb05aaf0e721ddcd2e6ab50d0154d10140c5b0e136a58efc257fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:11344-11348 | Sources/OmniKit/VectorStore.swift:18734-18738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:11344\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b08e4b911f137d8c7a1bb53bcba1d92f150c0b782cae6080bd1cdaa5f9d2455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:14011-14015 | Sources/OmniKit/VectorStore.swift:14032-14036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:14011\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14011}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1754d57b7b3cc34bc959468135a5dccc13b4811ccddef026b3eb64af059f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:14724-14730 | Sources/OmniKit/VectorStore.swift:14734-14740 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":14724}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45e9425ecbb575602cb410d6c1622088e326407cc2cb93ff8fc5c46e2a1dda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:1031-1035 | Sources/omni-verify/main.swift:1380-1384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0249d0dec0596620e14405c3a8ab0c0fb4abe97d8ca836b5f039657c1a5bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/omni-verify/main.swift:2829-2836 | Sources/omni-verify/main.swift:2879-2886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e4ab73addd4108cdf228bceeffec795c530a759227789f9c4f9ab9d186c021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20135 lines \u00D7 8): Sources/omni-verify/main.swift:3849-3853 | Sources/omni-verify/main.swift:3947-3949 | Sources/omni-verify/main.swift:3950-3950 | Sources/omni-verify/main.swift:3951-3951 | Sources/omni-verify/main.swift:4105-4105 | Sources/omni-verify/main.swift:4106-4106 | Sources/omni-verify/main.swift:7076-7077 | Sources/omni-verify/main.swift:9835-9839 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:3849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/omni-verify/main.swift:3849\u0060 calls \u0060VectorStore\u0060 and \u0060Sources/omni-verify/main.swift:3947\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":"Sources/omni-verify/main.swift"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a770c20f72b2b840bb3805b8c885fb161cc38caf8f41f6acc2a820c423ba74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:8859-8864 | Sources/omni-verify/main.swift:8878-8883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:8859\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":8859}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aefdfa0ef1e9d37434ce63e15e3f6d00c034020011d9804f20bb851654d74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): App/FolderBrowser.swift:317-327 | App/ResultsList.swift:306-310 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/FolderBrowser.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a8b3390c81ae0546150e594b72b36ad9c0bbeb4c35c01b2fc34d500dc8a417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/OmniAudioTower.swift:316-320 | Sources/OmniKit/OmniVisionTower.swift:573-577 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/OmniAudioTower.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8035345964e823ce4ad43e1458cd026614108879810261d226d82e6fafe9948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): App/PerfScript.swift:199-204 | App/PerfScript.swift:229-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/PerfScript.swift:199\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":"App/PerfScript.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970e419077d76d44419976cba48ac6eec0c1696eb4dfbd164b7ddb2e387baaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): App/RecentsBrowser.swift:115-119 | App/RecentsBrowser.swift:165-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060App/RecentsBrowser.swift:115\u0060 it begins part-way through the construct above it, so those exact 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":"App/RecentsBrowser.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f245c730cad9913f9874038e977e72ada9ca0bd4f2c6a1c0f8ef75d0d3737a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/ANETextBackend.swift:235-239 | Sources/OmniKit/ANETextBackend.swift:264-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/ANETextBackend.swift:235\u0060 it does not close everything it opens, so those exact 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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3089bbf6577223a7e9d4c0506922cdd4d1737dd3632e71b5828a79c9d7700a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/OmniKit/EnrichLedger.swift:84-91 | Sources/OmniKit/IDIndex.swift:74-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"Sources/OmniKit/EnrichLedger.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425c05f1b91fae91b131309ea04aa3edfad8e36740e4d4367ae9d5fe477c8d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/OmniKit/Indexer.swift:2197-2203 | Sources/OmniKit/Indexer.swift:4145-4151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Indexer.swift:2197\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf083bb6bb0533a4dbf3d2dc695308a34a2fd50f716b8108d252d28775f1ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Sources/OmniKit/OCR/OCRBatched.swift:135-139 | Sources/OmniKit/OCR/OCRBatched.swift:191-195 | Sources/OmniKit/OCR/OCRBatched.swift:804-808 | Sources/OmniKit/OCR/OCRBatched.swift:845-849 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/OmniKit/OCR/OCRBatched.swift:850\u0060 calls \u0060Sendable\u0060 and \u0060Sources/OmniKit/OCR/OCRBatched.swift:809\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":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a89f669ace4d75250a5315df6b93f77dfae1baa390498ed5ef66bb0d277ff04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/Paper/PaperCaseCatalog.swift:644-649 | Sources/OmniKit/Paper/PaperCaseCatalog.swift:691-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/Paper/PaperCaseCatalog.swift:644\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperCaseCatalog.swift"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad75822f47e289fc4ed1e224b7c6fed674ee92276690defc7d88b236adf6165d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Sources/OmniKit/ProjectionEngine.swift:356-360 | Sources/OmniKit/ProjectionEngine.swift:361-365 | Sources/OmniKit/ProjectionEngine.swift:366-370 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/ProjectionEngine.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ec644e5347f86c2685c8c8a229bc931c8369fe5dde3eb0d2a944f6c171c254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/Qwen3Backbone.swift:159-163 | Sources/OmniKit/Qwen3Backbone.swift:416-420 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/Qwen3Backbone.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eed176a1730a604acfbf7c64e47ad9dfcf731443246de9380fe0ed9aa1b8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/Qwen3Backbone.swift:466-470 | Sources/OmniKit/Qwen3Backbone.swift:491-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"Sources/OmniKit/Qwen3Backbone.swift"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d5ef06971c29ad0b12744a3e21d0af199a28128070307985e9046a7ee609ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:6207-6212 | Sources/OmniKit/VectorStore.swift:6380-6385 \u2014 both copies are in the same file, so extract the block 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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":6207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4446b423acd8a37f1b412a9c6f6d74704cf5db2262b625551a3869e24900c100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:7863-7867 | Sources/OmniKit/VectorStore.swift:8829-8833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:7863\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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":7863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb664fe985dadf9c315b69f4188b946fb83419d59b00add11012afa46e2e041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/OmniKit/VectorStore.swift:11160-11164 | Sources/OmniKit/VectorStore.swift:11178-11182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/OmniKit/VectorStore.swift:11160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":11160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2611879d92ca03aa97b96a549ad8868afa692beb5098f9350feacebc35cfad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/mutbench/main.swift:353-357 | Sources/mutbench/main.swift:407-411 \u2014 both copies are in the same file, so extract the block 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":"Sources/mutbench/main.swift"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d3e6c5894eb10797edc4f8efe61b59bd8d1096eb07e6579d633a9381bd75e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/ocr-verify/main.swift:272-276 | Sources/ocr-verify/main.swift:285-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/ocr-verify/main.swift:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"edec53141adaa49e9cc888e1d34132d81a3c3d198a7a777d1891085233707183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/ocr-verify/main.swift:296-301 | Sources/ocr-verify/main.swift:328-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/ocr-verify/main.swift:296\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ocr-verify/main.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff248ec7beb494e7746eed043718d153d5ea4927555aa4875682390b5c0b8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/ANEQuery.swift:484-489 | Sources/omni-verify/ANEQuery.swift:552-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/ANEQuery.swift:484\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/omni-verify/ANEQuery.swift:490\u0060 calls \u0060random\u0060 and \u0060Sources/omni-verify/ANEQuery.swift:559\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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2690b27682d8ba75b2dee0ce016f3916acf82a1c963c1581645d370b9a507f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/omni-verify/ANEQuery.swift:146-152 | Sources/omni-verify/ANEQuery.swift:299-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/ANEQuery.swift:146\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b193c6ec0eff79dcebedbf2cc24388156b39fd6ed032a3f01a0350acd1f5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/omni-verify/ShotBench.swift:281-288 | Sources/omni-verify/ShotBench.swift:721-728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/ShotBench.swift:281\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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cd9f77f3118357ef28335a35f0af6ae48bdedb680fdec2488ca92b51f75cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:1729-1733 | Sources/omni-verify/main.swift:1824-1828 \u2014 both copies are in the same file, so extract the block 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/omni-verify/main.swift:1821\u0060 calls \u0060Int\u0060 and \u0060Sources/omni-verify/main.swift:1727\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":"Sources/omni-verify/main.swift"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4193dfd4b8d4c0fdbdb40040f8123991fac35d720a51bc37cd449f1eb558e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:2610-2614 | Sources/omni-verify/main.swift:2685-2689 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a691d27e69c276bdec8b09817449f0ea483105ee3cbcc1f2dbf38ce820a95285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:2847-2851 | Sources/omni-verify/main.swift:3289-3293 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"56be376b5addbac5a2f6bbf500d32dc0c4e934a6d4685dedd99252237f054462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:2853-2857 | Sources/omni-verify/main.swift:3294-3298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:2853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880d09b484d766d5f79575b39cf119b634e83ee6646076668a5b1e1fba7ca8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Sources/omni-verify/main.swift:2914-2919 | Sources/omni-verify/main.swift:2932-2937 | Sources/omni-verify/main.swift:2967-2972 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":2914}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03e55ace7fc25873cf0a1c2eca60ad03ba6fb525a02e9739b2d03135d01d3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:4674-4678 | Sources/omni-verify/main.swift:4857-4861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/omni-verify/main.swift:4680\u0060 calls \u0060mix\u0060, \u0060UInt64\u0060 and \u0060Sources/omni-verify/main.swift:4862\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":"Sources/omni-verify/main.swift"},"region":{"startLine":4674}}}],"partialFingerprints":{"codehealthFindingId/v1":"277c192bd988230490ef21e3015ac7f17b89520744e5fb8fbf25b0313e52095a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/omni-verify/main.swift:6123-6132 | Sources/omni-verify/main.swift:6181-6190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:6123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":6123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9eae1fa2d3afd25878347ddfc7c2958acedc3b7a3b0a96bde59bfdf4fcffa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:6323-6327 | Sources/omni-verify/main.swift:6481-6485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:6323\u0060 it begins part-way through the construct above it, so those exact 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":"Sources/omni-verify/main.swift"},"region":{"startLine":6323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efed9bac9337a4b068d45e796f01c1030a8cfbaf5edc8e1b629d3905daa5be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:6545-6549 | Sources/omni-verify/main.swift:6557-6561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/omni-verify/main.swift:6545\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":6545}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c774c0b13495619d8641a1144b705ceec1bc35a5ae99187b869e4e01630c4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/omni-verify/main.swift:7661-7669 | Sources/omni-verify/main.swift:7677-7685 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":7661}}}],"partialFingerprints":{"codehealthFindingId/v1":"801189081b3badf10a6c209386bbeb6525a91c4b5cadb4a507dab2fd8ec0868f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:8931-8936 | Sources/omni-verify/main.swift:9452-9457 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":8931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ca6581cd9c87e7ba6cabe043a1bc99271f4f0505a70d7a25ebe3b377dde6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/omni-verify/main.swift:113-118 | Sources/omni-verify/main.swift:10329-10334 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea351030e9e78bbf384e2b4adda0d16682a3e4887e484bc7d777073d1e45e5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/omni-verify/main.swift:928-932 | Sources/omni-verify/main.swift:938-942 \u2014 both copies are in the same file, so extract the block 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":"Sources/omni-verify/main.swift"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfebb22e961c716633441106fe8e6cd7d206e7bfa5d202b47849dcad7b0c4f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Tools/gen_audio_fixtures.py:176-183 | Tools/gen_fixtures.py:43-48 | Tools/gen_image_fixtures.py:221-228 | Tools/gen_video_fixtures.py:236-243 \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":"Tools/gen_audio_fixtures.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"24305a48be2eee9ae35e21b8d56c838afb7d95facf463fcddfbc8568c09fb2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): Tools/video/launch/render.py:66-96 | Tools/video/linked/render.py:68-98 \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":"Tools/video/launch/render.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af11ae5d58d65cfdd7b23f5ea4124188d1950f0a60fa58164340b62890b644f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): Tools/gen_image_fixtures.py:232-304 | Tools/gen_video_fixtures.py:247-328 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/gen_image_fixtures.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8674ef207c744a6c40010726850065ec6e469b59df399c8977912b2380bd8d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): Tools/gen_image_fixtures.py:127-176 | Tools/gen_video_fixtures.py:159-215 \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":"Tools/gen_image_fixtures.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2ef8471889ec9e23fb66c3ff71572d0c7c5893ecf53278dbfe73304c74ab66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Tools/video/launch/film.py:702-713 | Tools/video/linked/film.py:471-481 \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":"Tools/video/launch/film.py"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee164ab5a0e5d07a9084da050492f438fc6e452d6bfc7ff6bbda7485e39f64c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Tools/video/launch/vo.py:29-41 | Tools/video/linked/vo.py:23-40 \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":"Tools/video/launch/vo.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8651bcaaf89a2b28007eda2fba6a0d9690059f4f53a4deed74d556a1f7fc01fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Tools/video/launch/music.py:22-33 | Tools/video/linked/music.py:22-33 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/music.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b7fb1daa2a3f21ed5c1d481cacb8498c293e99d25f7bc97d075fd955a39d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Tools/gen_image_fixtures.py:110-123 | Tools/gen_video_fixtures.py:139-155 \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":"Tools/gen_image_fixtures.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4857a80d3a6affbe3b8577b7571f54096623acc1f4ee290e9acac0b0c193f4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Tools/video/launch/core.py:52-57 | Tools/video/launch/core.py:61-68 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/core.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca6e45db21ffe55418e89bc93505e8f0cbe6631f740b1b6d9139cdaaed304f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): Tools/video/launch/core.py:91-95 | Tools/video/launch/film.py:48-54 | Tools/video/launch/film.py:63-65 \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":"Tools/video/launch/core.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f521208cb760381bad7c92f2c7e82a962c83b30409d7aa5fd698d6b497c2663e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Tools/ane/build_nano_text.py:34-41 | Tools/ane/build_small_text.py:35-41 \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":"Tools/ane/build_nano_text.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b570049aa31198d63f40cee4dabe2df3bd17b3200057b666840a7b87a6ba01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Tools/video/launch/render.py:60-63 | Tools/video/linked/render.py:62-65 \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":"Tools/video/launch/render.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f80966a59f941d6ff6964a0e0b750374c6616670911ece8fcfef9342863adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Tools/video/launch/render.py:99-102 | Tools/video/linked/render.py:101-104 \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":"Tools/video/launch/render.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f4c1bac000ddeb16d1d1e2b74926b6877d236ab8604bf636a293879211fdea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Tools/ane/build_small_text.py:55-57 | Tools/ane/extract_recipe.py:39-41 \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":"Tools/ane/build_small_text.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0e89e251bcc1e0709aecab1ac1faf99f7bda1d20d44ee424e566eee2048724"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): Tools/video/launch/film.py:12-13 | Tools/video/linked/film.py:22-23 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/film.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"262b6dd1aa7aaaf54c96afe84fd1078da6066574d1c479a51794137efbf9d3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): Tools/video/launch/film.py:748-749 | Tools/video/linked/film.py:520-521 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/film.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d499e681e7dd172869eb083e41ec979e78d9a67fed8e78ebb42b4eb98edcba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Tools/video/launch/core.py:23-23 | Tools/video/render.py:24-24 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/core.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c545e02a74652365d015d271c7af515d3207af524e4d31fe963c06ad758d035"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): Tools/video/launch/timeline.py:34-35 | Tools/video/linked/clock.py:19-20 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/timeline.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d74eed7ad4e6b97dd36cbe05ac18347cd256b6a5f6dc9e16c2fffcea3d8344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Tools/video/launch/core.py:27-27 | Tools/video/render.py:25-25 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/core.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"491ee0ab5107bf75908f43d36312fa3144fdbf0bfa35f0ea4a6543b5790c4cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201328 lines \u00D7 2): Tools/gen_image_fixtures.py:280-302 | Tools/gen_video_fixtures.py:298-325 \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 \u0060Tools/gen_video_fixtures.py:298\u0060 it does not close everything it opens, so those exact 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":"Tools/gen_image_fixtures.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"89184d3df34b0dee71c27441f0b4107552893a3c3ba6ed3f26b1fcee2a14b9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): Tools/gen_audio_fixtures.py:232-253 | Tools/gen_image_fixtures.py:274-295 | Tools/gen_video_fixtures.py:292-313 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Tools/gen_audio_fixtures.py:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/gen_audio_fixtures.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5b44b8d5f6d905800c10b965e3acd9b921a2cadfee0901c8281cc52b9a6ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Tools/video/launch/render.py:15-31 | Tools/video/linked/render.py:17-33 \u2014 \u0060Tools/video/launch/render.py\u0060 and \u0060Tools/video/linked/render.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 65 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":"Tools/video/launch/render.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb84b1a0b1a0f75b7491f9f290bbe90d278be8d799eaddee4b915df2eec516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): Tools/video/launch/music.py:25-33 | Tools/video/launch/vo.py:32-35 | Tools/video/linked/music.py:25-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Tools/video/launch/music.py:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/music.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e7db9fa1909a045c0ab250eb3ccf1354763ca3927f52fcc1b6d2a834489f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Tools/video/launch/render.py:35-47 | Tools/video/linked/render.py:37-49 \u2014 \u0060Tools/video/launch/render.py\u0060 and \u0060Tools/video/linked/render.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 65 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 \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":"Tools/video/launch/render.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"587c752f71e8ee7e330773aab29b01cd154f1d2e6f6b0b6915da557d50bb89f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): Tools/gen_audio_fixtures.py:176-183 | Tools/gen_fixtures.py:43-48 | Tools/gen_image_fixtures.py:221-228 | Tools/gen_video_fixtures.py:236-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. 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":"Tools/gen_audio_fixtures.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"26597e4e1c93957f52533ca5d6c494689ca944441785851cf378fdf8a2437662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Tools/gen_image_fixtures.py:170-176 | Tools/gen_video_fixtures.py:209-215 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/gen_image_fixtures.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"246e600ce8e444c59b6711184ae75d52dd0ad3393191c7253c0df51f1f30e978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): Tools/video/launch/render.py:66-92 | Tools/video/linked/render.py:68-94 \u2014 \u0060Tools/video/launch/render.py\u0060 and \u0060Tools/video/linked/render.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 65 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 \u0060Tools/video/launch/render.py:66\u0060 it does not close everything it opens, so those exact 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":"Tools/video/launch/render.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9fec6961c42d0b0cff8a8143aa40db0efc8b4ed500eaa2d481e87cc66c6fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Tools/ane/build_text_blocks.py:30-36 | Tools/ane/build_vision.py:36-42 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/ane/build_text_blocks.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8783a057fa6715e6ac29893237ecd1d5ef3a99a50fbda7bf0335635d20dc371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Tools/video/launch/film.py:703-707 | Tools/video/linked/film.py:472-476 \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":"Tools/video/launch/film.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e47e59f4dcd7b6e43854dce6ede81665d54f0796dbc50605eb2a70c7116b057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Tools/video/launch/gen.py:24-28 | Tools/video/linked/vo.py:26-30 \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":"Tools/video/launch/gen.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d13b97f070144212124d6a54de51533fb1e776444ea9bd1a76c093661ac3adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Tools/video/launch/mix.py:9-18 | Tools/video/linked/mix.py:9-17 \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":"Tools/video/launch/mix.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9e7c2f6e3ddd75ef09cbb308f11935e553cdaefd6756257892994264040f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Tools/gen_image_fixtures.py:77-81 | Tools/gen_video_fixtures.py:104-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060height\u0060 to \u0060int = 440\u0060 in one and \u0060int = FRAME_H\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":"Tools/gen_image_fixtures.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccea386198d1de3b051895cc6330af94a408ab28a075ee2b08ea6ef37033d4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Tools/video/launch/render.py:50-57 | Tools/video/linked/render.py:52-59 \u2014 \u0060Tools/video/launch/render.py\u0060 and \u0060Tools/video/linked/render.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 65 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 \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":"Tools/video/launch/render.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c7e3a196d63dca731def8d5faa510596b6348080887f1de1186b7842cda1ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: OmniKit: OmniKit: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"063675c02f8285cc78fb4ad5b1aa10babcbe239f6fe2118b181154899b8e2fff"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: OmniLink: OmniLink: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3b0150456aa46d6f040b62888e819cce2b53afb7ea19d33e14c1188d85dcc06f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppModel (LCOM4 13): AppModel\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe9c6767b1bce92d1629a13f7e7799b13f12d713d3b9c675267def28191fd89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppDelegate (LCOM4 6): AppDelegate\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":"App/OmniApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"934322b32ebbf6e3e8ce548296b48e46a30fa3091e0ab7aa1af0b63be7cc36e3"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testHoldsAutomationModeOpen: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/AutomationWindowUITests.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e125ba76a68e76b0c11836271bbbc5dd98e05f372556b27c99cf36f39f1a78a4"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testDraggingAResultDeliversTheFileAndNeverOffersMove: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824aa74f7b63c7d2ad81896eb31512b2c862bc12f49ea35cf083c01f81ef70d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testDraggingAGalleryCellDeliversTheFile: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"20396544aab556919064eb0cd75beccc35c538956e8aabeb9fd411bde8d6154d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testGrabbingASelectedResultDragsTheWholeSelection: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787a3bf6d139c5b04f757a63250eadf068745b98be4f085490a59ac7a3c5d7d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testOmniRefusesItsOwnDrag: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8659311c63e94cf896a729ff44a4c1747195e69b4882fd6ada6fa762d5cc7e87"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testADragFromARowsBlankAreaIsAMarquee: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82b5a17257d6fde06c458323c46338e954198939862db0dec71dc54afd1d87a"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCommandCCopiesTheFilesWithTheirPathsAsText: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/FileDragUITests.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b63daabb303b1f42e5e343d3aaa01a36c08a60f002b795b9bb83843cc5f3ec2"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testOCRRunsWhileAnOldIndexMigrates: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/MigrationChaosUITests.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8099e0fe748b8e789e97acb83a79d3f446428dcd96535a16a5e05ee64836c25"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAClickThatDriftsAFewPointsStillSelects: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/ResultSelectionUITests.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8502ac88d08225fd5f04c3b33b1bcda55284113acff3ad1424308a457f2003"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTheFirstClickIntoAnInactiveWindowStillSelects: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/ResultSelectionUITests.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbbf8b2e4c9541bbea41341fd2b1ee3330415fe8deb49f67246f42c33e6676d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testClickingAResultSelectsIt: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/ResultSelectionUITests.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe3e865f111c6eccf26ec31b4190f5c91adea05faf6423cac71e190dd9d2a84"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testSelectionSurvivesLiveResultRefreshes: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/ResultSelectionUITests.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d6d92d6d81ff12b0fbc0e50f27b4563b3fb068209c6cd36285859a2038edf3"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTranscriptSelectionBecomesTheNextQuery: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UITests/TranscribeHandoffUITests.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07f77894ac96ecb5344338daf2157a285a80cf3ac62b703c7d3de1bf8aef9f7"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNeuralEngineModeReleasesTheGPUTowersAndKeepsTheSpace: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ANEModeTests.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"876462c937ef47899a4466612aa52fc90a7ffe6cbc1b3502144554ef3db29f44"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testEveryTextRouteInOneBatch: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ANEModeTests.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3456ff299b73c1ddfd1f876330a1291405154b3225e2fb4ee13146777ef7b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testSwitchingUnderLoadNeverDropsAVector: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ANEModeTests.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b203cf8a90350f440ef4cb00e5cd9fb1ccd732f5ce8f34f523ede4cd36db85"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testVideoTowerParity: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/AVEncoderTests.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d1a24038b4e6bc2a066695666a028c5d85b9d5af51c2feafbc4efe75e10860"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testVideoEndToEnd: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/AVEncoderTests.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e22425ae7110df56bb76299883f355e2ed1c8488bdbc3d08cc60a049df47aa"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAudioEndToEnd: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/AVEncoderTests.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"60732c8879adc611ed72928dedf1404b5b8a2c855ba4ef1fc977678564a1ddc2"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAudioTowerParity: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/AVEncoderTests.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a651805ac7ba8c61a752edd61f6cdc8b4b0d66e489ce4eea6a62b600a1c53d4d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAudioBatchParity: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/AVEncoderTests.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa154352fdb0d059b58d664d3f5506c504269fff0203969b9b8c4b08b8a954c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testFolderSwitchUnderContention: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/BrowseReaderBenchTests.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6061ffd6c248d8d156b13b85086083b10533d6b67479092291eb9f5342187a03"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testASwitchToTheGPUDuringTheTowerReleaseLeavesTowers: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/EngineStateTests.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4fc526a6e437b5683b0229f0d9d1957e4bfdcaef641ccea11fdf076f9ffd21"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testASwitchRightAfterTheTextPhaseDoesNotStrandTheStoreOnTheCPU: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/EngineStateTests.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219c2c68d56a32f19c78b82e80443a988aa5dbc5cd7abbbca7274cb30723147"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testARebuildThatDoesNotFinishLeavesNoStamp: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/EngineStateTests.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6475d2ff67714dee7bbb7c636b9919cf7fabf12b8156f0bf465bab64930145"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testABatchWaitsOnQueriesButNotForeverNorPastAStop: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/EngineStateTests.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e115a70006de0c17d7e7689493f834f7d281175226c7348fe179f61d21d26bfc"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testProbeBatchesBesideQueries: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/EngineStateTests.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7973b5004811381c480e39ec273389c37970f2bcacb3ceb09f9ec89cef2aa0da"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testRealPolicyOverRealPaths: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/IgnoreBenchTests.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f14eb1a7bd15a9dab9aa50dd21425354ec9494931d6f91cf913c4f975ec0c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testProbeCursorWrite: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/IndexerStateTests.swift"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba3de8c411b8583efdd73216262a495891af97d9a5ea9ec1cbb33eac04471c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testEndToEndSemanticSearch: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/IndexerTests.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ac890a3f9332f7df7cc0cc55a0f0877441f00dc6684c39ed812f97547a8cf3"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNanoImageEmbed: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/NanoMediaSmokeTests.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c62fec6a514093120ad97694d93dffa09a4619bce8f47e70f7102b193d7d7"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNanoAudioEmbed: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/NanoMediaSmokeTests.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32bb7ab7c193db7e8c2bf4256fd460f9e646bec453f2f845311c00521f8a7ef"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testPagesAreNotLostWhenEveryRowEndsWhileASearchIsOnTheGPU: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/OCRAdmissionTests.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"695324f4079d0bd6059d7b0ceda853589fff909e69a5956c8efb92c120646be1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTheBatchGetsItsWidthBackAfterASearch: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/OCRAdmissionTests.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a57274ac3090a80b89ac484268b0a4cb5205b74eaf49e07b4a447ebc4666dbf"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testADroppedPagesPrefetchIsLetGo: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/OCRAdmissionTests.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"59edbed17cd3e7db277aca08bc1b9d8e5bcaeb12e760d542ea3b8c8f2abde11c"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testImageCallHandsOverAndStaysBitIdentical: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/QueryHandOverTests.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4be3518f628daf1d04391938ff21a53e7196a58b48c0366cf9bd50099c987aa"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testEveryPageOfALongScanIsIndexed: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ScannedPDFStreamTests.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"276f3690fcfb8a1dd1e2a3aff8ce86aae693ff72e252ac2bc3c70605741b8211"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNanoUsesItsOwnTokensAndNoVisionWrappers: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SpecialTokenTests.swift"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca96261b025c4340a7af27bd7423534d3590a514ba9432c8efeec49a5c3485ae"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testSmallKeepsItsWrappers: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SpecialTokenTests.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadd00a7e9bbb19ecb70e6241c1dd39500d948652c3257d4c499605142c0eed0"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCaughtUpStampCost: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/StampBenchTests.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb96a61e991f63af52afeb2d7af9d0bdef66a16833150bac8f8e27ba427e1e3"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAFailedNeuralEngineBuildDefersNothing: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SweepProofTests.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a9230e31bdf6018d481946133d9a0a2bbb17d6bb0bfe184b55e9cddbb8b206"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTextEmbeddingsMatchReference: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/TextEncoderTests.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"43795597a34230cea5e5b39f0d0ef6c2719bd29c151b80a8cbbecc0425afd554"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNanoEmbeddingsMatchReference: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/TextEncoderTests.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"437dce178ee7828444b3c4ea25ee28b6aee9410705869eba001aaa0cde974a6b"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testBatchedMatchesSingle: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/TextEncoderTests.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d5c0798f239ac3159b63693c5fa48d668fe53b7310ab0ad62b27c7b37ce3da"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testASearchDuringCompactionDoesNotWaitForIt: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/VacuumYieldsToSearchTests.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6358bbbabfd62eb80a3e186fa93ac2ee22396b2bd21e9a82fe9a46602bc184f5"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testCarvedChunksMatchPackedChunks: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/VisionEncoderTests.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd24fb311bfd3cadf87bee1213a5e9479742949ec56809a2704394464cf622"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testEndToEndImageEmbedding: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/VisionEncoderTests.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fe93e5e47d561c06e634d827bad24c77e7ca166ab6fd09c9d9d3342f6aaf7e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAFullDiskLeavesTheOldFile: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniLinkTests/LinkStateTests.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a881d6d97a5eab6cd9fa0b444dd44bc6b9d5ccc29ea36e53ca7ba94392f46a6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNanoWeightsAreTheOnesBuilt: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ANEProgramTests.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f86e7a16bc7bbd3490ad0d25c13329a51c64eb0594e199d5a2960a6be6d22c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSmallWeightsAreTheOnesBuilt: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ANEProgramTests.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3cde819b64f2bd179042fc2d489d027d19bf4457d97052454095110212f1c2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheWalkTerminatesOnAFolderWithNoChildren: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/BrowseReaderTests.swift"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e137d6900d1db8b78efd8a8246399987c95edebea496d9a25d89d214009fadd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEveryMutationShapeKeepsCoverageConsistent: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/CoverageCRUDTests.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aad1ab39fbc8b82cf71a8a33e9610bdb9fb19ad80e1f12d87c01f9907e7e3d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFolderDeleteAgreesWithSQLOnCombiningMarks: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/CoverageCRUDTests.swift"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"208615ce98a9ba809b3eed52079270f000187e821b36daaa0c69e9c02e245e4d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSymlinksAreNotFollowed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/CrawlerParityTests.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e713f98ea2135cb0255c3cb607b164753877d95530c2119989d65261e5299"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRangeOnTheFullBase: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/DateRangeFilterTests.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5310a938c1d9af36179446f0c25bcfb8088a6a23a1f52bc4dd0f978acff876f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRangeOnTheQuantizedReplica: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/DateRangeFilterTests.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02dea95e678105eeb8d896fec86fd20590a0dda6bd293ace57ce292b957c3a4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDeadDeltaRowIsUnreachableInFullMode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/DeltaTombstoneTests.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd04d485d249c6dfcf05674e780c533af9fdb3c08cf3c9363629ad278065392"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDeadDeltaRowIsUnreachableInQuantMode: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/DeltaTombstoneTests.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d1435ce6fa397699a87b3b405677b7c08c435db87e94f62b8c99ebcd8f5617"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFolderExclusionSmall: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ExclusionFilterTests.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7438817cccc05a3e08a353282a724868e6fc9e279026a048175b1ee0bd0450"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFolderExclusionLarge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ExclusionFilterTests.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f7828c3b31609dfa9f8bcc8793dde15be8a77aa7a381dc4c744f200bb97069"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtensionExclusionLarge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ExclusionFilterTests.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"46fddf939bce8ff89f2e865a0e2b87af59ca47ebc38c910a3aad10bed4776a68"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBothOnTheOneBitTier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ExclusionFilterTests.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b3752e63e34e8a16d07b3cf7cba13634c1a4ea276056d0d1c7607f39fe8a63"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExclusionInsideAScope: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ExclusionFilterTests.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfea11ea703a6a6e8cedf9f4bc4a70431fa51d757fcfa3f6700d9e2c59e4a22"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKindFilterOnASmallSharedIndex: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af7a0c0b63f03846feae6f939b4ae01c01cbf89af2262ebe70d4252a82c6c7b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKindFilterOnALargeSharedIndex: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f80d495b0999e66ef63a4104525c1e0dd98690646d47e86b0bfad3759b6281b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDateFilterOnASmallSharedIndex: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6f2b19f391c8a0d219abe83ece012f1fcbe6d3defea16fffed3cb060005e56"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDateFilterOnALargeSharedIndex: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b4cdcc4eac563fa876ffbd1eed0984e21e917756d1654210ce44ce2f9e6df8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKindFilterOnTheOneBitTier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0722f06b9b091c7ee0c93bc32eb73f3a84cdc1bc1ec0394b84a4352d8ceed5cd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDateFilterOnTheOneBitTier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f12f3ec17af135cc72c42afc28b599be2b69fc4301c45b569433100c26d3e58"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDateFilterOnTheFourBitTier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1602038bd439014aa147425c822d291fda842433c0dd1b71fc584099a3196e8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKindAndDateTogetherOnTheOneBitTier: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FilteredSharedSearchTests.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af0bec512681df26061488337310eac66a3773d33bed95d69f927b0486c899"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomWritesContentKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FolderCountTests.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"50133aadbc9ac137a4d68077cdbed9c7024abb0ece37f606e1e9b7d6ce2a9206"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomWritesRowKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FolderCountTests.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c8fdc16cf52bb088c95939cf0ae74c21683ddaeec8fbf5459418bc068514fa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAReuseNeverSettledBeforeAKillIsSettledAfterTheReopen: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FreeListTests.swift"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5113a348373d83d77782977309438f7987b5bc77066dcb0a8e5e2abc2e3aba"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAReuseNeverSettledIsSettledWhenTheSidecarIsAdopted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FreeListTests.swift"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"51596eb88bd1013092278a9f79e883f1249fe9470bccd3aa9224d8fccdb40d5a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAReuseThePowerLossTookIsWrittenBackFromItsBlob: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FreeListTests.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b672e7c67b2bde2826c082e4058cb335fc0507b794d88721d44eb096d1f21cd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAReuseThePowerLossTookIsWrittenBackWhenTheSidecarIsAdopted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/FreeListTests.swift"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1733891f9aa18726f3be6b56c3cb4c8407c1185bcce1384bbc332c7f53555be2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAddEditRenameMoveDeleteAtFileAndFolderLevel: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/MutationLifecycleTests.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652ea9e198bf84b7d75c60a91e15655c0f02ea4a334f60061aac7d0d3c577e6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLifecycleWithNFDAndNonASCIINames: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/MutationLifecycleTests.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9bd8662e1a0cbf8b11a523574c234ca02a9c2eb3cf847e882d64775ad3b74b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIncrementalEqualsRebuildUnderRandomWrites: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/OrphanCacheTests.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4398bf3cda9559fdb1b3b3d898a6a9fd1803f801c868fb8c036b9047f0ae5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIncrementalEqualsRebuildWhenThePendingListOverflows: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/OrphanCacheTests.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f2fe0b0dd626fd82cdc42238c3a7f569ef25cfb1965eac9ef16c0014fb2f57"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSharedContentPastTheClaimContentKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/PendingVectorCountTests.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d690f2cb4a5bf9ba1b1f1b492c466b7a3b210323d7e8f878b2a62e4ee4e8203"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSharedContentPastTheClaimRowKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/PendingVectorCountTests.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8e91d518c4e0580c2bcbf8a483057b6e7f1a7c875d589f084e187b971963c5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomWritesContentKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/PendingVectorCountTests.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e74dd0701242172ef73d84161b9e5f8806a5843477c55fac2fc7ac588f08f20"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomWritesRowKeyed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/PendingVectorCountTests.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5543f4e43b5bac4d40397ef949bd736d612c4020ddc0616af641b6885f443f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheFirstBrowsesOnAFreshStoreMayRace: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReadLaneRaceTests.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4aad7286c71ba63527679e02a008c207d351bc6aa6b2633878148bf2102397"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPlainQueryAgrees: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e07581084398161e4836fead5a93867d5f2d0db6d80d5517360d189ee6c277"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExactTiesResolveTheSameWay: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1009d7867107d820763044e0db83ef717f0423a86633723d82ecd84883afa4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAgreesAfterDeletesLeaveTombstones: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ed12608aa70c63f0b2bf5f9612093983e95e2fe3ac5e24ac6a904f9948d8d5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAgreesAfterAnUpdateSplitsBaseAndDelta: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e8be41943e9cee47081ff3eca4c92b379451f214f30f1fdcb1c4ad9a7c018"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAgreesOnASingleRowStore: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4593459a3637aa1169af258a86cb06bebb3f98ac87157c882a98442a969238"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAgreesWhenTopKExceedsTheCorpus: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ReduceEquivalenceTests.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb0731a56d372875d75aa947bca0146984291102f175f760460fd2329df7ef1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEverySpellingOfSeventyPercentAgrees: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ScoreQualifierTests.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f63d0df0de5238bbc1ab0b455f098b880af81eec5c60635bd917226d0bcdaba"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testABareIntegerIsAPercentageNotAClampedFraction: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ScoreQualifierTests.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"541c3a9df3449977f8cd357a6869aa4f1adbff225d604f200f787239b5f33b03"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFractionsAndSpacingSurvive: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ScoreQualifierTests.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"549791554a2ab279a1e069c9d9e71beb162f06026d96c4612c0040faebcd6705"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testOutOfRangeClamps: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/ScoreQualifierTests.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ac89ee0cc0b7b579f435e462c47ac9c89abc3fa2201e5c6e6f8c06b3ac7a2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAPassageThatMovedBetweenFilesKeepsItsVector: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SharedPositionWriteTests.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e564c02e53f50ec070a1c5799c3f34fcb523c62a9b3d4fa5f2c6bcc9fe41e4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAnEditThatGrowsAheadOfAnUnchangedChunkKeepsItsVector: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SharedPositionWriteTests.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c2bdb7569919340d79465dd211fc2f6cfc881b9a4b3cabb0a8f4d59470d67e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAReplaceThatGrowsAheadOfAnUnchangedChunkKeepsItsVector: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SharedPositionWriteTests.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5b51fd8521d5185498a3cf4fe4f348b4a4fa7c34b91b04b0d0f05349aac0c9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAnEditAsTheFirstWriteAfterAnOpenKeepsItsVector: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SharedPositionWriteTests.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f2d8f5fdf6784cab5ff75945abc92bfa9678d70f2e9f9ba49d5f0deea581c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomEditsAndMovesNeverSeatAContentOnAnotherVector: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/SharedPositionWriteTests.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f531d3514555400463cedd68616e927e45595f064f9583cba78334fd9c137823"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIncrementalFoldBitIdenticalToFullRebuild: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/VectorStoreFoldPersistTests.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad1528aa94d6357e2794a66258abf52520ef85c3b1180b144985c2347547bb1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRowSidecarSecondStoreFlockFallback: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniKitTests/VectorStoreFoldPersistTests.swift"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"953caf651a9e8a1641dc95164c74879e6f95fa1913a7f12f2440da96a7d8413d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPairingAgainClearsUnlinked: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniLinkTests/LinkNodeTests.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32b17500e2758b0dea5ad9f3573ea2084d91273aba262089754fbb79f9fffb0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAStrangerWithNothingToSayIsClosed: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniLinkTests/LinkStateTests.swift"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7666cf3a68eee32f905beea22b45923be94cc46f28c4c8f42fda6c0ebcf4d239"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAGrantsPushThatNeverArrivedIsRepairedByThePing: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniLinkTests/LinkStateTests.swift"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59552d8377f717bd3147cf5b9967327653c4dcbee47261c62be5e9949a650e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnknownClientRefused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/OmniLinkTests/TLSTests.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c00a3234220e7f92e1082b05d1eb3a176d2b6c811d9e0af056cb21ce243229b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/omni-verify/main.swift: Sources/omni-verify/main.swift changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 2085 in main.swift.top-level code at line 61. 5 of those changes were fix/bug commits, and the other 78 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/omni-verify/main.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":"Sources/omni-verify/main.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"492333c1643ab3077611900f496dc045c16acb9f5483f940059ccee14cec9477"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/Indexer.swift: Sources/OmniKit/Indexer.swift changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 326 in Indexer.index at line 1118. 6 of those changes were fix/bug commits, and the other 62 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/Indexer.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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a0381177705941f84d93ef5e9982d13c7697cadba3b45119028112dec6e9cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/VectorStore.swift: Sources/OmniKit/VectorStore.swift changed 167 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in VectorStore.tryAdoptRowSidecarLocked at line 13384. 13 of those changes were fix/bug commits, and the other 154 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/VectorStore.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":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":13384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8746f903dc038eae6ba892e52da70a4675692735f15018f677b907940c8726e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/PerfScript.swift: App/PerfScript.swift changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 252 in PerfScript.perform at line 83. 4 of those changes were fix/bug commits, and the other 37 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/PerfScript.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":"App/PerfScript.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf98909084318f04626ad140534fd22ce60c84019fd1fd3ca8f4c5176abe0d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/AppModel.swift: App/AppModel.swift changed 140 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in AppModel.search at line 8183. 9 of those changes were fix/bug commits, and the other 131 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/AppModel.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":"App/AppModel.swift"},"region":{"startLine":8183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ee6e0612e6d7026578e3109a248bf38e34325a3a48addae4dd370f3dc5d795"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Serving/MCPAdapter.swift: App/Serving/MCPAdapter.swift changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in MCPAdapter.callSearch at line 349. 4 of those changes were fix/bug commits, and the other 40 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Serving/MCPAdapter.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":"App/Serving/MCPAdapter.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1781238fa3c817c60d5aa814d0bcd57e91f9062c8189ba42cb4ba878008c93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/ocr-verify/main.swift: Sources/ocr-verify/main.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 176 in main.swift.top-level code at line 83. 4 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/ocr-verify/main.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":"Sources/ocr-verify/main.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1428637b2a5a45e8ac5c8ec5e470416c3ff6cf4a86943b636ee1669d7fc68d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/SettingsView.swift: App/SettingsView.swift changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ActivityTab.body at line 308. 3 of those changes were fix/bug commits, and the other 59 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/SettingsView.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":"App/SettingsView.swift"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf630a519e38ad3ff6979101e8bc6d6838770f4125ac3d520fc11aa7d20585"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/OCRSession.swift: App/OCRSession.swift changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in OCRSession.run at line 1494. 5 of those changes were fix/bug commits, and the other 43 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/OCRSession.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":"App/OCRSession.swift"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a1a42068c9ce7d6b96d3eb98fccbc21a97d4b92339e22a37d60fe90fa08729"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/ContentView.swift: App/ContentView.swift changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ContentView.body at line 64. 5 of those changes were fix/bug commits, and the other 65 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/ContentView.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":"App/ContentView.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"01264bd320731352eae670e41d19f784573346511b59a8b9fd9891f10e1b0110"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Sidebar.swift: App/Sidebar.swift changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Sidebar.body at line 271. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Sidebar.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":"App/Sidebar.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5fc8fd2d0095ea280d27711a9de066edd5147cdd6b68dad0c707560af601c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OCR/OCRBatched.swift: Sources/OmniKit/OCR/OCRBatched.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in OCRModel.decodeContinuous at line 189. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OCR/OCRBatched.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":"Sources/OmniKit/OCR/OCRBatched.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e48ffb79b4f5dda38ed45673a1b95b3e57a10b6c505d473e15529b1cdbb86f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OmniEngine.swift: Sources/OmniKit/OmniEngine.swift changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in OmniEngine.setComputeUnit at line 873. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OmniEngine.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":"Sources/OmniKit/OmniEngine.swift"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"f345945557d9a87ce2b595c03568df02fc2824f29f1ad9f9266beb81e234eb1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/OmniApp.swift: App/OmniApp.swift changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in OmniCommands.body at line 400. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/OmniApp.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":"App/OmniApp.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fc2ef4b0f9ba41ba12f4980df3b0fa53e9aac4ce03a7d30f74f333cc3f46d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/OCRView.swift: App/OCRView.swift changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DocumentScroll.scroller at line 1133. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/OCRView.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":"App/OCRView.swift"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b3865349c1f9d76fed1f7b077a77c6dd2935ef9e2db7b62aa95ffd8dd36bf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/ResultsList.swift: App/ResultsList.swift changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ResultRow.cell at line 784. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/ResultsList.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":"App/ResultsList.swift"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab424daa7ddeb3d36e4d92d6e4f295213f53cff1ac0249fd1cdd8e382a4ff519"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/FolderBrowser.swift: App/FolderBrowser.swift changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in FolderBrowser.reload at line 566. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/FolderBrowser.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":"App/FolderBrowser.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e73270a608fb72e45a11333f071a6320549e1289e7911baafd7077798ea632"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Serving/SchemaAdapters.swift: App/Serving/SchemaAdapters.swift changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in TagAdapter.handle at line 778. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Serving/SchemaAdapters.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":"App/Serving/SchemaAdapters.swift"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f1e473590db77c7f45f70308fa83ad83ae1718c53db3baf68785c2501893a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/omni-verify/Eval.swift: Sources/omni-verify/Eval.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in EvalCommand.evaluate at line 544. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/omni-verify/Eval.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":"Sources/omni-verify/Eval.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50d325c553bb0030ff2a8b050c8af81a0ce4557bd7ea5badeb091edfa3fe3c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/mutbench/main.swift: Sources/mutbench/main.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in main.swift.top-level code at line 9. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/mutbench/main.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":"Sources/mutbench/main.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa97ab8918ee50989bc6ea94e35e6070ce75d7c244ea990ce9344facd97581f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/Passages.swift: Sources/OmniKit/Passages.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in TextSlice.read at line 418. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/Passages.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":"Sources/OmniKit/Passages.swift"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c993dd9442bcb3d2afbe01213ad916b1a30cbd161fa66fdeb9643ee84cd84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/omni/index.html: site/omni/index.html changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in index.html.renderTable at line 830. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- site/omni/index.html\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":"site/omni/index.html"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e291a81b7dd6b4890fe588f6fd65f174df3d80b88d39d8e6a5fb1a1c2c4830d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Serving/ServingController.swift: App/Serving/ServingController.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ServingController.startServer at line 307. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Serving/ServingController.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":"App/Serving/ServingController.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"93440cfc670b25574366a06b625f12c951d8ab1d566576f52577bdeddaf9f2b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/FileCrawler.swift: Sources/OmniKit/FileCrawler.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FileCrawler.walkBulk at line 173. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/FileCrawler.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":"Sources/OmniKit/FileCrawler.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c070c3212fde16c763353f37aab5caa4939f9879fcebff15d99fce1748af75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/Paper/PaperSuite.swift: Sources/OmniKit/Paper/PaperSuite.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in PaperSuite.run at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/Paper/PaperSuite.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":"Sources/OmniKit/Paper/PaperSuite.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaef870c74c50fa640fdcc63fce8ba12a359d8252c868dbc1498131eac814264"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/FileMenu.swift: App/FileMenu.swift changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FileMenuItems.body at line 123. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/FileMenu.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":"App/FileMenu.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c87f1b4ddb9935569632af094c613006a44b673c707b65e1ccc958388801e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/SearchToolbar.swift: App/SearchToolbar.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SearchToolbar.toolbar at line 103. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/SearchToolbar.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":"App/SearchToolbar.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af3de1f854622a252db8daaef684493b79f35b1f55b05c8cd8931dc2ef1b0c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/omni-verify/ANEQuery.swift: Sources/omni-verify/ANEQuery.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ANEQuery.engine at line 207. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/omni-verify/ANEQuery.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":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d91f8d8116b0451ce0baa3ae7061a852bf26fa4a8ebdb5ff4c3a829bf08ed0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Serving/SearchArgs.swift: App/Serving/SearchArgs.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in SearchArgs.filter at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Serving/SearchArgs.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":"App/Serving/SearchArgs.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"46495be96a61a3235d0d1d8c4abdc69335f68d7f7f61ac5abde4a5baac7f768d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: worker/src/index.ts: worker/src/index.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in index.validate at line 237. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- worker/src/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba161b52c4bbacdd0d65a9966c5a9f92ec955ae8a32b08aa0b9a436629034be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/opentime/main.swift: Sources/opentime/main.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in main.swift.top-level code at line 7. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/opentime/main.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":"Sources/opentime/main.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0832d9ded6fb7a89729221d4b5f972a72f4d891f4cd3898f682fc73b09619351"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/PaperBenchmark.swift: App/PaperBenchmark.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AppModel.runPaperBenchmark at line 33. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/PaperBenchmark.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":"App/PaperBenchmark.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c4208899e51db4b3eee6ba3d14a0a1c9f6845f3efbd9ac1b184c4af676c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/ANETextBackend.swift: Sources/OmniKit/ANETextBackend.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ANETextBackend.encode at line 214. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/ANETextBackend.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":"Sources/OmniKit/ANETextBackend.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af14597fbce131ae46fcd7009c760f79239a7f6838e998abcd1becd9fe5c3c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/Serving/Router.swift: App/Serving/Router.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Router.handle at line 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/Serving/Router.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":"App/Serving/Router.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f467a5ba0f35ba1a5a4fdc3cb7aebf2d1e70d1caea088a0b56517791dbe0c84d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniCLI/main.swift: Sources/OmniCLI/main.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in main.swift.arguments at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniCLI/main.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":"Sources/OmniCLI/main.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9963fd5f02be42291447d32b1f6deb1340d5d5e9aa7d6d10eaafacf77e5119"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OmniImageEncoder.swift: Sources/OmniKit/OmniImageEncoder.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in OmniImageEncoder.encodeChunk at line 125. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OmniImageEncoder.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":"Sources/OmniKit/OmniImageEncoder.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"835c7264c97efc176085fe1ec296a72b3899925bd38effa8f87a42ea5b4b51cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OCR/OCRSpeculative.swift: Sources/OmniKit/OCR/OCRSpeculative.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in OCRModel.decodePrepared at line 118. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OCR/OCRSpeculative.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":"Sources/OmniKit/OCR/OCRSpeculative.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dd3ba4597bcc736736bf21e8bbdd22398a23dd54290ee6fe920494b38d7b64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/omni-verify/ShotBench.swift: Sources/omni-verify/ShotBench.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ShotBench.run at line 895. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/omni-verify/ShotBench.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":"Sources/omni-verify/ShotBench.swift"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c095c85b124751cd6d1e0d96dda9507716d84281f9c58758f0b36da67c7a8ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/WeightStore.swift: Sources/OmniKit/WeightStore.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WeightStore.init at line 24. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/WeightStore.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":"Sources/OmniKit/WeightStore.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ac3682b26d18807ce85f540ca7da7fe1109935099a41ab8e856c5b1896928c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/FolderEmbeddingVisualization.swift: App/FolderEmbeddingVisualization.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in FolderEmbeddingVisualization.rebuildPoints at line 393. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/FolderEmbeddingVisualization.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":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35754bb7ffce0a9b37ff25c894aef3dd2401e4394dd366618047aade654a7cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/Paper/BenchTable.swift: Sources/OmniKit/Paper/BenchTable.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BenchTable.rows at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/Paper/BenchTable.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":"Sources/OmniKit/Paper/BenchTable.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9798fb94382c79914c4a7acf416077f031b8fcf17f242ef219d8dd9d1d2024"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OCR/OCRWeights.swift: Sources/OmniKit/OCR/OCRWeights.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in OCRWeights.init at line 170. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OCR/OCRWeights.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":"Sources/OmniKit/OCR/OCRWeights.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"faca24185a0d59a010a6a37e0012dc6463f1525d117a797149fbef7bdac09239"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/Paper/PaperReport.swift: Sources/OmniKit/Paper/PaperReport.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PaperReport.appendCases at line 384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/Paper/PaperReport.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":"Sources/OmniKit/Paper/PaperReport.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6078ee635aa3487b8c4be0535c5788b26c96d0c3a90efe8dae82ccd4eee90ef4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/ScreenRecorder.swift: App/ScreenRecorder.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ScreenRecorder.capture at line 299. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/ScreenRecorder.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":"App/ScreenRecorder.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3929be4406dd93bc62df49aebfb9ff2ef9cd90ea5b6fd5b519003b5ea3f62e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: App/ScreenTimeline.swift: App/ScreenTimeline.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScreenTimeline.body at line 515. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- App/ScreenTimeline.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":"App/ScreenTimeline.swift"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d1d05a784029375491c484e589c85620b450eadf718459457167b9c9d77c33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/BulkDirWalker.swift: Sources/OmniKit/BulkDirWalker.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BulkDirWalker.walk at line 190. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/BulkDirWalker.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":"Sources/OmniKit/BulkDirWalker.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8479be7afd829060e79531df9bd5b7b9a35a16845c7b1f9f904bf2bfd08fc4e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/ScreenHistory.swift: Sources/OmniKit/ScreenHistory.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ScreenHistory.record at line 170. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/ScreenHistory.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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60644693cd0e9d7ba06433c63c8cd7021c88fde8d26117c34372b58d2907650"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniKit/OmniAudioPreprocess.swift: Sources/OmniKit/OmniAudioPreprocess.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AudioSegmentReader.nextSegment at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniKit/OmniAudioPreprocess.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":"Sources/OmniKit/OmniAudioPreprocess.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d796d16f615eecfe65a4601ca283ff12d1f693e8066d2bf02d832039708a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OmniLink/LinkNode.swift: Sources/OmniLink/LinkNode.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LinkNode.pairingHandler at line 776. 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 22:09:49 -08:00\u0027 --until=\u00272026-11-13 22:09:49 -08:00\u0027 --full-history --no-merges -- Sources/OmniLink/LinkNode.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":"Sources/OmniLink/LinkNode.swift"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf13a70545766097035a03e8da97d67a35b039166868055457f74508f50b8ef"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Package.swift\u0060 makes this repository a deployable product (line 10)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Package.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cb68a1ee6c4cb93e1c9ac7b48b28011c2bc672548de5c6ade44fdf2c34c979"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060othersGPUNs\u0060 spells \u0060Ns\u0060 where 34 names in the project spell it \u0060NS\u0060: 34 of 35 names in project OmniCLI spell the token \u0060NS\u0060 (34 of 35; unit: names in project OmniCLI containing \u0060NS\u0060). Peers: ContentKeyMonitor.makeNSView (App/ContentKeys.swift:44); ContentKeyMonitor.updateNSView (App/ContentKeys.swift:50); ContentKeyMonitor.dismantleNSView (App/ContentKeys.swift:54); WindowTitleHider.makeNSView (App/ContentView.swift:1201); WindowTitleHider.updateNSView (App/ContentView.swift:1206). Rename to \u0060othersGPUNS\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/Paper/PaperSuite.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9b039595feda36227db0b06d6c1a6ea33e524cdbc19f0c35139c0770688029"}},{"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":"d40968f822f86e9be8bf5ea73d54dfef226628d1a066cd8ec605efb9b4706434"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6ef2f316ca631b692d03c475bed7e473e93f3db6fa35d9ef86248c50808e234"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b045f06583c9b465f808666ab807bb301b75e163408a0670ffe050a381f461f6"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e231071c41a07da532ff8797b1e5a0d162350306955e8cfab0d8da563913a73d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0374c1be61e9b649e928241ed8bbcd2e461382d0bbbc6e7683b5051b7bef9d74"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5d4a365c796fdfd76642e3669def1eba85dac13a079525d2b44460aa9d5246d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60cb44687270c00144d03f37666c1b6e07b8f004d3a25096b8a3822ed2fa8640"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"71697d14a4299da45141e08579f118cba6c19d0e32171ffb1a75bc9aba97818a"},"taxa":[{"id":"CWE-134","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-943","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SettingsView.swift \u2194 IndexSettings.swift: \u0060App/SettingsView.swift\u0060 and \u0060Sources/OmniKit/IndexSettings.swift\u0060 change together 61% of the time (11 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00600d244ea3\u0060 Search results in columns; kind from the query vector; one ignore policy; \u006067b5ac58\u0060 Skip training-data folders, list them in Settings; \u0060660a59ce\u0060 iCloud: index then remove download; full shortcuts list; Finder folde\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/SettingsView.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8198c9197e88b8911d37c62d18819bdf456d62b7b9b195537657ee17016ab6e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: ProfilingService.swift \u2192 OmniApp.swift, SettingsView.swift, Sidebar.swift: \u0060App/ProfilingService.swift\u0060 changes together with 3 other files \u2014 \u0060App/OmniApp.swift\u0060, \u0060App/SettingsView.swift\u0060, \u0060App/Sidebar.swift\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/ProfilingService.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b24c4601678be95bd7afe8d4dd46838533865fa6d197f2fab79fc53238c313"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppModel.swift \u2194 OmniImageEncoder.swift: \u0060App/AppModel.swift\u0060 and \u0060Sources/OmniKit/OmniImageEncoder.swift\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006058456920\u0060 History without a cap, fewer renders, and searches that wait less; \u00609186f7c7\u0060 A query no longer waits out the indexing hold; the engine keeps query\u2026; \u0060b8881357\u0060 feat(tags): on-device open-vocabulary tags for images, video, and scans \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af35262b4630eeb6ba3eb2b29189d52ba06ab0f3db8242ac596b7fcce8f74bc3"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"a4029afb432d74c920960feef64bffe08a260a7c0883fd501d720c2955db54d5"}},{"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":"ED1","level":"error","message":{"text":"Blocking wait inside a handler: VectorStore.onReader: \u0060VectorStore.onReader\u0060 is an event/message handler that blocks on a synchronous wait (a semaphore/queue \u0060.wait\u0060/\u0060.sync\u0060) \u2014 it stalls the handler on a peer or resource and serialises throughput, and can deadlock under load. Await the work asynchronously (\u0060async\u0060/\u0060await\u0060) instead of blocking the handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OmniKit/VectorStore.swift"},"region":{"startLine":5459}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee40b1620956f92c741980ccf8e039e2c291e323c2b6e37be437e367e01319"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add 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 3 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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060moveDatabaseDir\u0060 is async and calls usleep \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":6498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7563d68459aa324ac63b3ae4c3fc6e8c6e15b8fec561b729be6a19e2cec698"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060top-level code\u0060 is async and calls .wait() \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/recwin.swift"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1883d1ae598fff68ff6a8fa0dacf19dbc8e3d558ef64fd513792412544f6bbe8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060top-level code\u0060 is async and calls usleep, .wait() \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/linktool/main.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa243f459d196908941a9a5e3daed3f27a3861333e9bcf0d05f8402c504f5e2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls usleep \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e507fc948af0a9a5b9684eeb8d93f81a4df354b6fccb051a3c6eb9b4dc667e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060videosegcheckRun\u0060 is async and calls usleep \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":7413}}}],"partialFingerprints":{"codehealthFindingId/v1":"217496be2894b52f764e173f9a3cc1e9934cdc0d8d375ccdc5267509bdc1987f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060top-level code\u0060 is async and calls usleep, Thread.sleep, .wait() \u2014 a blocking call inside async code stalls the cooperative pool\u0027s thread \u2014 one per core \u2014 and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/main.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1178b88e310b9f6da3a2b8986deb88cc26c9953dad7d2acb7ba4c49626cfeffb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prev is not None and (prev, shot) in film.DISSOLVE\u0060 appears character-identically in 2 files \u2014 Tools/video/launch/render.py, Tools/video/linked/render.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tools/video/launch/render.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8430d81fc54db70239dd8d56d4ed2d65ba09e8dc9023571a9fd7080a4ce4b4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060openLocked() \u0026\u0026 metaLocked(\u0022backfilled\u0022) == \u00221\u0022\u0060 appears character-identically in 2 files \u2014 Sources/OmniKit/EnrichLedger.swift, Sources/OmniKit/IDIndex.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":"Sources/OmniKit/EnrichLedger.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cf25091d725373ac4d10eb943bef5526afda883fdb186c8c131dd78f76ad70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page.state == .pending || page.state == .stopped || (page.state == .done \u0026\u0026 page.truncatedByStop)\u0060 appears character-identically in 2 files \u2014 App/OCRSession.swift, App/OCRView.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":"App/OCRSession.swift"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1191d7e8d4cbc33184f6ef8f0de616243c3fabfc308c5213ae743c7837ea35ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path == $0.path || path.hasPrefix($0.path \u002B \u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 App/AppModel.swift, Sources/OmniKit/FileCrawler.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":"App/AppModel.swift"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b14af498bc729675b1036cfbd4cb3d3b0e7e081c3907de0ca1740fe7d34ed7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prev == u.startIndex || u[u.index(before: prev)] == UInt8(ascii: \u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 App/FolderEmbeddingVisualization.swift, Sources/omni-verify/main.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":"App/FolderEmbeddingVisualization.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12e3c527cb2d705bc9f287b05823ad915160e09c1460b5ac65db42f44e6c81f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snippet == base || snippet == \u0022\\(base) - \\(base)\u0022\u0060 appears character-identically in 2 files \u2014 Sources/OmniKit/OmniTagger.swift, Sources/OmniKit/VectorStore.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":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5358ff37dfc3cf850764bbe834e44ebe1ffebed058d99ee548099532bd7111"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snippet.hasPrefix(pagePrefix) \u0026\u0026 Int(snippet.dropFirst(pagePrefix.count)) != nil\u0060 appears character-identically in 2 files \u2014 Sources/OmniKit/OmniTagger.swift, Sources/OmniKit/VectorStore.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":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65399ea6835b63c1331e3d72bf8b22f2a68db6ab27bd67afe3cb7184484bf59"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060textBackend\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060k\u0060 environment variable (set at line 39, cleared at line 39) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, so anything that leaves the body in between \u2014 an error, an early return, a crash \u2014 skips it: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or configuration read in ANY code resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory and the environment are per-process, so every concurrent thread or Swift process in it sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: give the child its own directory and environment (\u0060Process.currentDirectoryURL\u0060, \u0060Process.environment\u0060), or build absolute paths with \u0060URL.appendingPathComponent\u0060. Where the global genuinely must move, put the restore in a \u0060defer\u0060 right after the change, so it runs on every exit, thrown errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f093e6af96a986971f630866d80de46b762d26d0ac96245d1c844e5656cd0"}},{"ruleId":"X19","level":"warning","message":{"text":"Process-global state is restored only on the happy path: \u0060onDevice\u0060 changes state that belongs to the whole PROCESS and changes it back at the end of the same body \u2014 the \u0060k\u0060 environment variable (set at line 107, cleared at line 107) \u2014 which says the change was meant to last no longer than this call. But the restore is an ordinary statement on the straight-line path, so anything that leaves the body in between \u2014 an error, an early return, a crash \u2014 skips it: the process then keeps the overwritten value for the rest of its life, and every later relative path, child-process launch or configuration read in ANY code resolves against it. That failure is silent and remote from its cause \u2014 the function that breaks is not the function that moved the value. The window is not private while it is open either: the working directory and the environment are per-process, so every concurrent thread or Swift process in it sees the moved value too. The durable fix is not to widen the restore but to stop mutating the global: give the child its own directory and environment (\u0060Process.currentDirectoryURL\u0060, \u0060Process.environment\u0060), or build absolute paths with \u0060URL.appendingPathComponent\u0060. Where the global genuinely must move, put the restore in a \u0060defer\u0060 right after the change, so it runs on every exit, thrown errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/omni-verify/ANEQuery.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d5f57c6ef750c32291942db13e268ec85c8ccfbb22503bb1a30e984e76607"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"worker/src/index.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"47384ec7239f434512e98b684c55708a8caf1dc704d18554e2408d188e39b4e4"}},{"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":"Sources/omni-verify/main.swift"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2ba39e52e5916f7171d5e87aa2917b127b05c2b455c7fc3d7c279afae48a31"}},{"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":"Sources/omni-verify/main.swift"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8dc6fa6001dc0d4131f73e75bec92cfc4c8507ec81a0266a31801a86832c95"}},{"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":"Sources/omni-verify/main.swift"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd785b2f8801204151d4587cec6ecc353cf526a61dc1fde9eda1591ad26f914"}},{"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":"Sources/OmniLink/LinkIdentity.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c90432c28e1e714bd165cdbedacd1b3c3e039031fc9cc7b28c8f62519f1e2d5"}},{"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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b059adbc8b3b7eec7a806432af25f36d710720eeb63fc62b08de2a76d68fa8"}},{"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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"4355e8376d93a81bee384b9cc667931894badc7d5bfe67949c521d3c62882cdf"}},{"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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":3166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1421abdaa993c142b19af5b1d23211effe2b5fef5ef2ef3bc06db9b05400b64"}},{"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":"Sources/OmniKit/Indexer.swift"},"region":{"startLine":4767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2329612ad41b808fbc4c1c4cf7e5a4e0c583e6b04bd9d204fde32e7a09f9d318"}},{"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":"Sources/OmniKit/OmniTagger.swift"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c58f2c06b9a3529c79d9de108d9f100e13726e8d2a34dca4385580457d2292"}},{"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":"Sources/OmniKit/ScreenHistory.swift"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7da6db4d6e9c18f916e887693f2524d726f61cb87729a0d59767c2dfdf597bd"}},{"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":"Sources/OmniKit/ScreenText.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00370f38cb81ff4fd9c9ed6e20415687a189ca588a3fe2fdd52e721c791b3f2"}},{"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":"Sources/OmniCLI/main.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e168f3cce8a010806091b5642e4d611f2b63a646579a6812626304e45fed605"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/AppModel.swift"},"region":{"startLine":6608}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8a6a7f072ace99cb2cec0485735d4030bb8152e9197455ce164f8ad87d487f"}},{"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":"App/AppModel.swift"},"region":{"startLine":7785}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c02a96161d7ca432a5656df685da3fda60477597a3adec52ed13143a2d37bb"}},{"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":"App/Updater.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f209833f3a31ae8b3371c2dd844c410563b0f04ff2b19b45960f4607a5d9afcd"}},{"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":"App/Link/RemoteFiles.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee8ef9a173e9593793a315faee3aba7cd20fee0d174177c37e6cd07ab918c8"}},{"ruleId":"X5","level":"note","message":{"text":"Strict null checking is not enabled everywhere the repository type-checks: This repository commits no tsconfig, so whatever type-checks it uses tsc\u0027s own defaults, in which \u0060strict\u0060 and \u0060strictNullChecks\u0060 are OFF: \u0060string\u0060 admits \u0060null\u0060 and \u0060undefined\u0060, and a value that is null is compiled through to the property access that throws. If the build passes \u0060--strict\u0060 on a command line instead, put it in a committed tsconfig \u2014 this check reads configuration, and configuration is all it can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8870f9ff7b17c2e14c5ba3bc13137b94673aad0b9498438c572dabb049852943"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~2.9 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 2 assertion(s) across the 680 source line(s) of the 1 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: worker/src/index.ts (2). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Swift code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/MarkdownBlock.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5b20dd54d0610b77e5a3f087e71b9972e83a14bb5069b85acb61f8ce6eb935"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_frames_in\u0060 returns \u0060-1\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"Tools/video/launch/render.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c91dcd11366d57c36d8b747a2428ca9370e77a6d6bad1303539c5c31f00499"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_frames_in\u0060 returns \u0060-1\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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":"Tools/video/linked/render.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eb3d75675b35d8b5fc64f5ad10ba15864e417e9d23bfd75c10986eedcb3673"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060tokenIds\u0060 turns every thrown error into \u0060[]\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":"Sources/OmniKit/OmniTextEncoder.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"268488334e50aad2ef2f86828172fec7bc297abf7467a4424be20ce9225e9cdf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060prefixTokenIds\u0060 turns every thrown error into \u0060[]\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":"Sources/OmniKit/OmniTextEncoder.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72dc888cb46bcd35c656b91fee08cbdb2021d53badef4b2fc3dc26fac33ba88"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060lines\u0060 turns every thrown error into \u0060[]\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":"Sources/OmniKit/ScreenText.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cbedba5b22d8fc84bf931b30aaf6849136bf2c76a27d2d3b0217222f99adf4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060move\u0060 turns every thrown error into \u00600\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":"Sources/OmniKit/OCR/OCRCache.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96d55f2d3f368b3ad7fa72bafacdc6accb435a01985656a17d579bf0207b403"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060storedBytes\u0060 turns every thrown error into \u00600\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":"Sources/OmniKit/OCR/OCRCache.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9bfa67689a6c3a78b5923c2bf02777d8ebc9270bf084c213f19c824f95b43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fetchReleaseNotes\u0060 turns every thrown error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Updater.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef200301916d743cbc5defe2ea6503b2d0e332e7054b7b46ef7d2384add886e3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060md5Hex\u0060 turns every thrown error into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"App/Updater.swift"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88c33ff860edf4bf284742a3e68c1bf577c9a51aa567422182ef5c1e399a8b3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060passages\u0060 turns every thrown error into \u0060[]\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":"App/Link/LinkController.swift"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd4df16474eea8c69e28f0960f0d15042ee0a815c73ec8769c17124e477d2b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060tail\u0060 turns every thrown error into \u0060[]\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":"App/Serving/ServingLog.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c67f856ddea688d3d3499f1516d5c697370a5779fce35e8f1cb6a72c1e6f6d4"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-134","guid":"f92eb270-a113-5050-a4e8-7173e51af580","name":"CWE-134","shortDescription":{"text":"CWE-134"},"helpUri":"https://cwe.mitre.org/data/definitions/134.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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"},{"id":"CWE-943","guid":"da8ca609-5263-5d50-8f65-8e61b9587003","name":"CWE-943","shortDescription":{"text":"CWE-943"},"helpUri":"https://cwe.mitre.org/data/definitions/943.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":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":15,"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."]}]}